/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:07:37,551 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:07:37,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:07:37,565 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:07:37,565 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:07:37,566 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:07:37,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:07:37,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:07:37,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:07:37,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:07:37,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:07:37,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:07:37,573 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:07:37,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:07:37,575 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:07:37,576 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:07:37,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:07:37,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:07:37,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:07:37,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:07:37,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:07:37,584 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:07:37,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:07:37,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:07:37,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:07:37,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:07:37,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:07:37,589 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:07:37,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:07:37,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:07:37,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:07:37,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:07:37,592 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:07:37,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:07:37,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:07:37,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:07:37,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:07:37,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:07:37,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:07:37,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:07:37,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:07:37,597 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 13:07:37,611 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:07:37,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:07:37,612 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:07:37,613 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:07:37,613 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:07:37,613 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:07:37,613 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:07:37,613 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:07:37,613 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:07:37,614 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:07:37,614 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:07:37,614 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:07:37,614 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:07:37,614 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:07:37,614 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:07:37,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:07:37,615 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:07:37,615 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:07:37,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:07:37,615 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:07:37,615 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:07:37,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:07:37,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:07:37,616 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:07:37,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:07:37,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:07:37,617 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:07:37,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:07:37,617 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:07:37,782 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:07:37,796 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:07:37,799 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:07:37,800 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:07:37,801 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:07:37,802 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:07:37,898 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_m_097H/tmp/4c07d8bf87f549d1a2b2992c280813a7/FLAG6fd47a193 [2020-07-01 13:07:38,228 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:07:38,229 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:07:38,230 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:07:38,236 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_m_097H/tmp/4c07d8bf87f549d1a2b2992c280813a7/FLAG6fd47a193 [2020-07-01 13:07:38,816 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_m_097H/tmp/4c07d8bf87f549d1a2b2992c280813a7 [2020-07-01 13:07:38,827 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:07:38,829 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:07:38,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:07:38,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:07:38,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:07:38,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:07:38" (1/1) ... [2020-07-01 13:07:38,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b56e2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:38, skipping insertion in model container [2020-07-01 13:07:38,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:07:38" (1/1) ... [2020-07-01 13:07:38,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:07:38,865 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:07:39,102 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:07:39,114 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:07:39,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:07:39,150 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:07:39,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:39 WrapperNode [2020-07-01 13:07:39,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:07:39,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:07:39,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:07:39,152 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:07:39,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:39" (1/1) ... [2020-07-01 13:07:39,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:39" (1/1) ... [2020-07-01 13:07:39,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:07:39,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:07:39,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:07:39,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:07:39,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:39" (1/1) ... [2020-07-01 13:07:39,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:39" (1/1) ... [2020-07-01 13:07:39,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:39" (1/1) ... [2020-07-01 13:07:39,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:39" (1/1) ... [2020-07-01 13:07:39,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:39" (1/1) ... [2020-07-01 13:07:39,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:39" (1/1) ... [2020-07-01 13:07:39,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:39" (1/1) ... [2020-07-01 13:07:39,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:07:39,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:07:39,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:07:39,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:07:39,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:39" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:07:39,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:07:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:07:39,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:07:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:07:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:07:39,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:07:39,692 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:07:39,692 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 13:07:39,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:07:39 BoogieIcfgContainer [2020-07-01 13:07:39,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:07:39,698 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:07:39,698 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:07:39,700 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:07:39,700 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:07:39" (1/1) ... [2020-07-01 13:07:39,717 INFO L313 BlockEncoder]: Initial Icfg 76 locations, 81 edges [2020-07-01 13:07:39,719 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:07:39,720 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:07:39,720 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:07:39,720 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:07:39,723 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:07:39,724 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:07:39,724 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:07:39,754 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:07:39,796 INFO L200 BlockEncoder]: SBE split 42 edges [2020-07-01 13:07:39,801 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 13:07:39,803 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:07:39,831 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-07-01 13:07:39,834 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states [2020-07-01 13:07:39,835 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:07:39,836 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:07:39,836 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:07:39,837 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:07:39,837 INFO L313 BlockEncoder]: Encoded RCFG 66 locations, 116 edges [2020-07-01 13:07:39,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:07:39 BasicIcfg [2020-07-01 13:07:39,838 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:07:39,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:07:39,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:07:39,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:07:39,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:07:38" (1/4) ... [2020-07-01 13:07:39,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@120328f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:07:39, skipping insertion in model container [2020-07-01 13:07:39,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:39" (2/4) ... [2020-07-01 13:07:39,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@120328f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:07:39, skipping insertion in model container [2020-07-01 13:07:39,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:07:39" (3/4) ... [2020-07-01 13:07:39,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@120328f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:07:39, skipping insertion in model container [2020-07-01 13:07:39,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:07:39" (4/4) ... [2020-07-01 13:07:39,847 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:07:39,857 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:07:39,865 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2020-07-01 13:07:39,879 INFO L251 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2020-07-01 13:07:39,903 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:07:39,903 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:07:39,903 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:07:39,904 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:07:39,904 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:07:39,904 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:07:39,904 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:07:39,904 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:07:39,921 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2020-07-01 13:07:39,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:07:39,927 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:39,928 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:07:39,928 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:07:39,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:39,934 INFO L82 PathProgramCache]: Analyzing trace with hash 176568, now seen corresponding path program 1 times [2020-07-01 13:07:39,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:39,945 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925925082] [2020-07-01 13:07:39,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:40,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:40,104 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925925082] [2020-07-01 13:07:40,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:07:40,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:07:40,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162578427] [2020-07-01 13:07:40,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:07:40,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:40,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:07:40,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:40,129 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2020-07-01 13:07:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:40,326 INFO L93 Difference]: Finished difference Result 130 states and 223 transitions. [2020-07-01 13:07:40,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:07:40,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:07:40,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:40,340 INFO L225 Difference]: With dead ends: 130 [2020-07-01 13:07:40,341 INFO L226 Difference]: Without dead ends: 66 [2020-07-01 13:07:40,344 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:40,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-01 13:07:40,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-07-01 13:07:40,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-01 13:07:40,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 109 transitions. [2020-07-01 13:07:40,386 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 109 transitions. Word has length 3 [2020-07-01 13:07:40,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:40,386 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 109 transitions. [2020-07-01 13:07:40,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:07:40,386 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 109 transitions. [2020-07-01 13:07:40,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:07:40,387 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:40,387 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:07:40,388 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:07:40,389 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:07:40,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:40,389 INFO L82 PathProgramCache]: Analyzing trace with hash 176661, now seen corresponding path program 1 times [2020-07-01 13:07:40,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:40,390 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013948916] [2020-07-01 13:07:40,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:40,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013948916] [2020-07-01 13:07:40,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:07:40,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:07:40,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313221675] [2020-07-01 13:07:40,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:07:40,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:40,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:07:40,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:40,450 INFO L87 Difference]: Start difference. First operand 66 states and 109 transitions. Second operand 3 states. [2020-07-01 13:07:40,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:40,639 INFO L93 Difference]: Finished difference Result 66 states and 109 transitions. [2020-07-01 13:07:40,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:07:40,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:07:40,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:40,641 INFO L225 Difference]: With dead ends: 66 [2020-07-01 13:07:40,641 INFO L226 Difference]: Without dead ends: 56 [2020-07-01 13:07:40,642 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:40,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-01 13:07:40,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-07-01 13:07:40,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-01 13:07:40,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 89 transitions. [2020-07-01 13:07:40,649 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 89 transitions. Word has length 3 [2020-07-01 13:07:40,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:40,649 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 89 transitions. [2020-07-01 13:07:40,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:07:40,650 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 89 transitions. [2020-07-01 13:07:40,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:07:40,650 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:40,650 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:07:40,651 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:07:40,651 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:07:40,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:40,651 INFO L82 PathProgramCache]: Analyzing trace with hash 176663, now seen corresponding path program 1 times [2020-07-01 13:07:40,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:40,652 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614718197] [2020-07-01 13:07:40,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:40,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:40,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614718197] [2020-07-01 13:07:40,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:07:40,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:07:40,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48925920] [2020-07-01 13:07:40,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:07:40,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:40,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:07:40,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:40,680 INFO L87 Difference]: Start difference. First operand 56 states and 89 transitions. Second operand 3 states. [2020-07-01 13:07:40,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:40,820 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2020-07-01 13:07:40,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:07:40,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:07:40,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:40,822 INFO L225 Difference]: With dead ends: 66 [2020-07-01 13:07:40,822 INFO L226 Difference]: Without dead ends: 56 [2020-07-01 13:07:40,823 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:40,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-01 13:07:40,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-07-01 13:07:40,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-01 13:07:40,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2020-07-01 13:07:40,828 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 3 [2020-07-01 13:07:40,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:40,829 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2020-07-01 13:07:40,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:07:40,829 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2020-07-01 13:07:40,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:07:40,829 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:40,830 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:07:40,830 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:07:40,830 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:07:40,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:40,830 INFO L82 PathProgramCache]: Analyzing trace with hash 176664, now seen corresponding path program 1 times [2020-07-01 13:07:40,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:40,831 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764481991] [2020-07-01 13:07:40,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:40,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764481991] [2020-07-01 13:07:40,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:07:40,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:07:40,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986068887] [2020-07-01 13:07:40,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:07:40,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:40,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:07:40,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:40,880 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand 3 states. [2020-07-01 13:07:40,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:40,986 INFO L93 Difference]: Finished difference Result 56 states and 79 transitions. [2020-07-01 13:07:40,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:07:40,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:07:40,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:40,988 INFO L225 Difference]: With dead ends: 56 [2020-07-01 13:07:40,988 INFO L226 Difference]: Without dead ends: 45 [2020-07-01 13:07:40,988 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:40,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-01 13:07:40,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-01 13:07:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-01 13:07:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 68 transitions. [2020-07-01 13:07:40,993 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 68 transitions. Word has length 3 [2020-07-01 13:07:40,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:40,993 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 68 transitions. [2020-07-01 13:07:40,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:07:40,993 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 68 transitions. [2020-07-01 13:07:40,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:07:40,994 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:40,994 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:07:40,994 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:07:40,994 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:07:40,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:40,995 INFO L82 PathProgramCache]: Analyzing trace with hash 5472953, now seen corresponding path program 1 times [2020-07-01 13:07:40,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:40,995 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477163627] [2020-07-01 13:07:40,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:41,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:41,030 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477163627] [2020-07-01 13:07:41,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:07:41,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:07:41,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021375972] [2020-07-01 13:07:41,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:07:41,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:41,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:07:41,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:41,032 INFO L87 Difference]: Start difference. First operand 45 states and 68 transitions. Second operand 3 states. [2020-07-01 13:07:41,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:41,148 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2020-07-01 13:07:41,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:07:41,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:07:41,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:41,149 INFO L225 Difference]: With dead ends: 45 [2020-07-01 13:07:41,150 INFO L226 Difference]: Without dead ends: 40 [2020-07-01 13:07:41,150 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:41,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-01 13:07:41,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-01 13:07:41,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 13:07:41,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2020-07-01 13:07:41,154 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 4 [2020-07-01 13:07:41,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:41,155 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2020-07-01 13:07:41,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:07:41,155 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2020-07-01 13:07:41,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:07:41,155 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:41,155 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:07:41,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:07:41,156 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:07:41,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:41,156 INFO L82 PathProgramCache]: Analyzing trace with hash 5472955, now seen corresponding path program 1 times [2020-07-01 13:07:41,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:41,157 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432784380] [2020-07-01 13:07:41,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:41,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:41,201 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432784380] [2020-07-01 13:07:41,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:07:41,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:07:41,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192754433] [2020-07-01 13:07:41,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:07:41,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:41,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:07:41,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:41,203 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 3 states. [2020-07-01 13:07:41,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:41,273 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2020-07-01 13:07:41,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:07:41,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:07:41,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:41,275 INFO L225 Difference]: With dead ends: 40 [2020-07-01 13:07:41,275 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 13:07:41,275 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:41,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 13:07:41,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 13:07:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 13:07:41,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2020-07-01 13:07:41,279 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 4 [2020-07-01 13:07:41,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:41,279 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2020-07-01 13:07:41,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:07:41,279 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2020-07-01 13:07:41,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:07:41,279 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:41,280 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:07:41,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:07:41,280 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:07:41,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:41,280 INFO L82 PathProgramCache]: Analyzing trace with hash 169659497, now seen corresponding path program 1 times [2020-07-01 13:07:41,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:41,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977373699] [2020-07-01 13:07:41,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:41,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:41,312 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977373699] [2020-07-01 13:07:41,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:07:41,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:07:41,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631980532] [2020-07-01 13:07:41,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:07:41,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:41,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:07:41,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:41,314 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand 3 states. [2020-07-01 13:07:41,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:41,367 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2020-07-01 13:07:41,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:07:41,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:07:41,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:41,368 INFO L225 Difference]: With dead ends: 33 [2020-07-01 13:07:41,368 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 13:07:41,368 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:41,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 13:07:41,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-01 13:07:41,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 13:07:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2020-07-01 13:07:41,371 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 5 [2020-07-01 13:07:41,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:41,372 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2020-07-01 13:07:41,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:07:41,372 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2020-07-01 13:07:41,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:07:41,372 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:41,373 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:07:41,373 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:07:41,373 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:07:41,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:41,373 INFO L82 PathProgramCache]: Analyzing trace with hash 169659499, now seen corresponding path program 1 times [2020-07-01 13:07:41,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:41,374 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048071958] [2020-07-01 13:07:41,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:41,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:41,411 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048071958] [2020-07-01 13:07:41,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:07:41,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:07:41,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231315000] [2020-07-01 13:07:41,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:07:41,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:41,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:07:41,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:41,413 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 3 states. [2020-07-01 13:07:41,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:41,462 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2020-07-01 13:07:41,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:07:41,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:07:41,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:41,463 INFO L225 Difference]: With dead ends: 29 [2020-07-01 13:07:41,463 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:07:41,464 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:41,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:07:41,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:07:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:07:41,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:07:41,464 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-07-01 13:07:41,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:41,465 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:07:41,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:07:41,465 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:07:41,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:07:41,465 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:07:41,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:07:41,499 INFO L268 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2020-07-01 13:07:41,499 INFO L268 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2020-07-01 13:07:41,500 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-01 13:07:41,500 INFO L268 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-07-01 13:07:41,500 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 13:07:41,500 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 13:07:41,500 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr37REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-07-01 13:07:41,500 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 13:07:41,500 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. [2020-07-01 13:07:41,500 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. [2020-07-01 13:07:41,500 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:07:41,501 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:07:41,501 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 13:07:41,501 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:07:41,501 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:07:41,501 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:07:41,501 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:07:41,501 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:07:41,501 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:07:41,502 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:07:41,502 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:07:41,502 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:07:41,502 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:07:41,502 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:07:41,502 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 13:07:41,502 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:07:41,502 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:07:41,503 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:07:41,503 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:07:41,503 INFO L268 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2020-07-01 13:07:41,503 INFO L268 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2020-07-01 13:07:41,503 INFO L268 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-07-01 13:07:41,503 INFO L268 CegarLoopResult]: For program point L21-1(lines 21 24) no Hoare annotation was computed. [2020-07-01 13:07:41,503 INFO L268 CegarLoopResult]: For program point L17-1(lines 17 28) no Hoare annotation was computed. [2020-07-01 13:07:41,504 INFO L264 CegarLoopResult]: At program point L17-3(lines 17 28) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (<= 1 |#StackHeapBarrier|) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 13:07:41,504 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 13:07:41,504 INFO L268 CegarLoopResult]: For program point L17-4(lines 17 28) no Hoare annotation was computed. [2020-07-01 13:07:41,504 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-01 13:07:41,504 INFO L268 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2020-07-01 13:07:41,504 INFO L268 CegarLoopResult]: For program point L13-4(line 13) no Hoare annotation was computed. [2020-07-01 13:07:41,505 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. [2020-07-01 13:07:41,505 INFO L268 CegarLoopResult]: For program point L13-5(lines 13 16) no Hoare annotation was computed. [2020-07-01 13:07:41,505 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr36REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-07-01 13:07:41,505 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:07:41,505 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. [2020-07-01 13:07:41,505 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:07:41,505 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:07:41,505 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:07:41,506 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 13:07:41,506 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:07:41,506 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:07:41,506 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:07:41,506 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:07:41,506 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 13:07:41,506 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:07:41,506 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-01 13:07:41,506 INFO L268 CegarLoopResult]: For program point L18-2(lines 18 26) no Hoare annotation was computed. [2020-07-01 13:07:41,507 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:07:41,507 INFO L268 CegarLoopResult]: For program point L18-4(lines 18 26) no Hoare annotation was computed. [2020-07-01 13:07:41,507 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:07:41,507 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:07:41,507 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 13:07:41,507 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 13:07:41,507 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:07:41,507 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:07:41,508 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:07:41,511 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:07:41,519 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:41,520 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:41,521 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:07:41,521 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:41,527 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:41,527 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:41,527 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:07:41,528 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:41,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:07:41 BasicIcfg [2020-07-01 13:07:41,530 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:07:41,531 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:07:41,531 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:07:41,534 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:07:41,535 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:07:41,535 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:07:38" (1/5) ... [2020-07-01 13:07:41,535 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b2b5b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:07:41, skipping insertion in model container [2020-07-01 13:07:41,536 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:07:41,536 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:39" (2/5) ... [2020-07-01 13:07:41,536 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b2b5b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:07:41, skipping insertion in model container [2020-07-01 13:07:41,536 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:07:41,536 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:07:39" (3/5) ... [2020-07-01 13:07:41,537 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b2b5b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:07:41, skipping insertion in model container [2020-07-01 13:07:41,537 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:07:41,537 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:07:39" (4/5) ... [2020-07-01 13:07:41,537 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b2b5b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:07:41, skipping insertion in model container [2020-07-01 13:07:41,537 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:07:41,537 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:07:41" (5/5) ... [2020-07-01 13:07:41,539 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:07:41,560 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:07:41,560 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:07:41,560 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:07:41,560 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:07:41,560 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:07:41,560 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:07:41,561 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:07:41,561 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:07:41,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states. [2020-07-01 13:07:41,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-01 13:07:41,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:07:41,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:07:41,578 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:07:41,578 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:07:41,578 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:07:41,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states. [2020-07-01 13:07:41,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-01 13:07:41,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:07:41,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:07:41,582 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:07:41,582 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:07:41,588 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue [145] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 10#L-1true [239] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (> 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet17_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_1|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~mem16=|v_ULTIMATE.start_test_fun_#t~mem16_1|, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_main_#t~ret19=|v_ULTIMATE.start_main_#t~ret19_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_test_fun_#t~mem14, ULTIMATE.start_test_fun_#t~mem15, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~mem16, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_main_#t~ret19, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 12#L10true [118] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 59#L10-1true [170] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 31#L11true [146] L11-->L12: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 48#L12true [162] L12-->L13: Formula: (and (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 65#L13true [257] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (> |v_ULTIMATE.start_test_fun_#t~mem3_3| 0)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 64#L13-1true [178] L13-1-->L13-5: Formula: |v_ULTIMATE.start_test_fun_#t~short5_3| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} AuxVars[] AssignedVars[] 42#L13-5true [159] L13-5-->L17-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_9|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 68#L17-3true [2020-07-01 13:07:41,589 INFO L796 eck$LassoCheckResult]: Loop: 68#L17-3true [185] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 54#L17-1true [280] L17-1-->L18: Formula: (> 0 |v_ULTIMATE.start_test_fun_#t~mem8_6|) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 8#L18true [113] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= 1 (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 7#L18-1true [109] L18-1-->L18-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem10_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 5#L18-2true [107] L18-2-->L19: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem10_4| |v_ULTIMATE.start_test_fun_#t~mem9_4|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_4|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 28#L19true [142] L19-->L19-1: Formula: (and (= (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) |v_ULTIMATE.start_test_fun_#t~mem11_2|) (= 1 (select |v_#valid_31| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11)) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 26#L19-1true [326] L19-1-->L18-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 4) (select |v_#length_45| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_23) (= 1 (select |v_#valid_61| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (= |v_#memory_int_28| (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33) v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 |v_ULTIMATE.start_test_fun_#t~mem11_6|)))) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 19#L18-4true [129] L18-4-->L27: Formula: (and (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem15_2|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5)) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_47|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_47|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_22|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 37#L27true [329] L27-->L17-3: Formula: (and (= 1 (select |v_#valid_65| v_ULTIMATE.start_test_fun_~c~0.base_16)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (= (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1))) |v_#memory_int_33|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~c~0.base_16))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, #valid=|v_#valid_65|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 68#L17-3true [2020-07-01 13:07:41,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:41,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1993557259, now seen corresponding path program 1 times [2020-07-01 13:07:41,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:41,591 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136552420] [2020-07-01 13:07:41,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:41,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:41,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136552420] [2020-07-01 13:07:41,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:07:41,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:07:41,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313217564] [2020-07-01 13:07:41,611 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:07:41,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:41,612 INFO L82 PathProgramCache]: Analyzing trace with hash -774875025, now seen corresponding path program 1 times [2020-07-01 13:07:41,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:41,612 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344313799] [2020-07-01 13:07:41,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:07:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:07:41,651 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:07:41,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:41,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:07:41,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:41,781 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2020-07-01 13:07:41,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:41,907 INFO L93 Difference]: Finished difference Result 66 states and 109 transitions. [2020-07-01 13:07:41,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:07:41,910 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:07:41,915 INFO L168 Benchmark]: Toolchain (without parser) took 3085.53 ms. Allocated memory was 514.9 MB in the beginning and 586.2 MB in the end (delta: 71.3 MB). Free memory was 438.6 MB in the beginning and 378.1 MB in the end (delta: 60.5 MB). Peak memory consumption was 131.8 MB. Max. memory is 50.3 GB. [2020-07-01 13:07:41,915 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.6 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:07:41,916 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.19 ms. Allocated memory was 514.9 MB in the beginning and 558.4 MB in the end (delta: 43.5 MB). Free memory was 437.9 MB in the beginning and 524.9 MB in the end (delta: -87.0 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:07:41,917 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.64 ms. Allocated memory is still 558.4 MB. Free memory was 524.9 MB in the beginning and 522.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:07:41,917 INFO L168 Benchmark]: Boogie Preprocessor took 27.73 ms. Allocated memory is still 558.4 MB. Free memory was 522.9 MB in the beginning and 520.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:07:41,918 INFO L168 Benchmark]: RCFGBuilder took 473.92 ms. Allocated memory is still 558.4 MB. Free memory was 520.9 MB in the beginning and 490.5 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 50.3 GB. [2020-07-01 13:07:41,918 INFO L168 Benchmark]: BlockEncodingV2 took 140.21 ms. Allocated memory is still 558.4 MB. Free memory was 490.5 MB in the beginning and 477.7 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 50.3 GB. [2020-07-01 13:07:41,919 INFO L168 Benchmark]: TraceAbstraction took 1691.29 ms. Allocated memory was 558.4 MB in the beginning and 586.2 MB in the end (delta: 27.8 MB). Free memory was 477.0 MB in the beginning and 429.1 MB in the end (delta: 47.9 MB). Peak memory consumption was 75.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:07:41,919 INFO L168 Benchmark]: BuchiAutomizer took 381.53 ms. Allocated memory is still 586.2 MB. Free memory was 427.0 MB in the beginning and 378.1 MB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 50.3 GB. [2020-07-01 13:07:41,923 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 76 locations, 81 edges - StatisticsResult: Encoded RCFG 66 locations, 116 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.6 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 321.19 ms. Allocated memory was 514.9 MB in the beginning and 558.4 MB in the end (delta: 43.5 MB). Free memory was 437.9 MB in the beginning and 524.9 MB in the end (delta: -87.0 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 43.64 ms. Allocated memory is still 558.4 MB. Free memory was 524.9 MB in the beginning and 522.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 27.73 ms. Allocated memory is still 558.4 MB. Free memory was 522.9 MB in the beginning and 520.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. * RCFGBuilder took 473.92 ms. Allocated memory is still 558.4 MB. Free memory was 520.9 MB in the beginning and 490.5 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 140.21 ms. Allocated memory is still 558.4 MB. Free memory was 490.5 MB in the beginning and 477.7 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1691.29 ms. Allocated memory was 558.4 MB in the beginning and 586.2 MB in the end (delta: 27.8 MB). Free memory was 477.0 MB in the beginning and 429.1 MB in the end (delta: 47.9 MB). Peak memory consumption was 75.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 381.53 ms. Allocated memory is still 586.2 MB. Free memory was 427.0 MB in the beginning and 378.1 MB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 38 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant [2020-07-01 13:07:41,934 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:41,934 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:41,934 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:07:41,934 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:41,935 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:41,936 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:41,936 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:07:41,936 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((1 == \valid[c] && 4 == unknown-#length-unknown[c]) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[x_ref]) && 0 == c) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[y_ref] == 4) && 1 == \valid[y_ref]) && 0 == x_ref - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 38 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.5s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 81 SDtfs, 499 SDslu, 4 SDs, 0 SdLazy, 442 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 43 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 314 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:07:35.379 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_m_097H/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:07:42.161 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check