/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 17:23:23,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 17:23:23,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 17:23:23,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 17:23:23,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 17:23:23,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 17:23:23,656 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 17:23:23,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 17:23:23,673 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 17:23:23,676 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 17:23:23,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 17:23:23,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 17:23:23,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 17:23:23,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 17:23:23,686 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 17:23:23,687 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 17:23:23,689 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 17:23:23,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 17:23:23,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 17:23:23,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 17:23:23,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 17:23:23,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 17:23:23,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 17:23:23,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 17:23:23,713 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 17:23:23,713 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 17:23:23,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 17:23:23,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 17:23:23,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 17:23:23,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 17:23:23,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 17:23:23,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 17:23:23,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 17:23:23,723 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 17:23:23,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 17:23:23,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 17:23:23,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 17:23:23,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 17:23:23,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 17:23:23,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 17:23:23,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 17:23:23,729 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-17 17:23:23,758 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 17:23:23,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 17:23:23,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 17:23:23,763 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 17:23:23,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 17:23:23,764 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 17:23:23,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 17:23:23,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 17:23:23,764 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 17:23:23,764 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 17:23:23,765 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 17:23:23,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 17:23:23,765 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 17:23:23,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 17:23:23,767 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 17:23:23,767 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-17 17:23:23,768 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 17:23:23,768 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 17:23:23,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 17:23:23,768 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 17:23:23,769 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-17 17:23:23,770 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 17:23:23,770 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-17 17:23:24,089 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 17:23:24,102 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 17:23:24,106 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 17:23:24,107 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 17:23:24,108 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 17:23:24,108 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-07-17 17:23:24,184 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31c84f9b2/f35ca061c139438d80efe087de5b6ab5/FLAGd752b265b [2020-07-17 17:23:24,623 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 17:23:24,624 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-07-17 17:23:24,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31c84f9b2/f35ca061c139438d80efe087de5b6ab5/FLAGd752b265b [2020-07-17 17:23:25,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31c84f9b2/f35ca061c139438d80efe087de5b6ab5 [2020-07-17 17:23:25,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 17:23:25,038 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 17:23:25,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 17:23:25,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 17:23:25,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 17:23:25,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:23:25" (1/1) ... [2020-07-17 17:23:25,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12da261a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:23:25, skipping insertion in model container [2020-07-17 17:23:25,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:23:25" (1/1) ... [2020-07-17 17:23:25,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 17:23:25,074 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 17:23:25,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:23:25,274 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 17:23:25,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:23:25,315 INFO L208 MainTranslator]: Completed translation [2020-07-17 17:23:25,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:23:25 WrapperNode [2020-07-17 17:23:25,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 17:23:25,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 17:23:25,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 17:23:25,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 17:23:25,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:23:25" (1/1) ... [2020-07-17 17:23:25,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:23:25" (1/1) ... [2020-07-17 17:23:25,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:23:25" (1/1) ... [2020-07-17 17:23:25,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:23:25" (1/1) ... [2020-07-17 17:23:25,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:23:25" (1/1) ... [2020-07-17 17:23:25,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:23:25" (1/1) ... [2020-07-17 17:23:25,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:23:25" (1/1) ... [2020-07-17 17:23:25,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 17:23:25,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 17:23:25,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 17:23:25,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 17:23:25,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:23:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 17:23:25,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 17:23:25,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 17:23:25,573 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 17:23:25,573 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 17:23:25,573 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-17 17:23:25,574 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 17:23:25,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-17 17:23:25,574 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-17 17:23:25,574 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-17 17:23:25,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 17:23:25,574 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 17:23:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 17:23:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 17:23:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 17:23:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-17 17:23:25,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 17:23:25,576 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 17:23:25,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 17:23:25,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-17 17:23:25,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 17:23:25,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 17:23:25,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 17:23:25,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 17:23:25,968 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 17:23:25,968 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 17:23:25,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:23:25 BoogieIcfgContainer [2020-07-17 17:23:25,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 17:23:25,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 17:23:25,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 17:23:25,978 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 17:23:25,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 05:23:25" (1/3) ... [2020-07-17 17:23:25,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c45bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:23:25, skipping insertion in model container [2020-07-17 17:23:25,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:23:25" (2/3) ... [2020-07-17 17:23:25,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c45bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:23:25, skipping insertion in model container [2020-07-17 17:23:25,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:23:25" (3/3) ... [2020-07-17 17:23:25,982 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2020-07-17 17:23:25,993 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-17 17:23:26,001 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 17:23:26,016 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 17:23:26,039 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 17:23:26,040 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 17:23:26,040 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-17 17:23:26,040 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 17:23:26,040 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 17:23:26,041 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 17:23:26,041 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 17:23:26,041 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 17:23:26,059 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2020-07-17 17:23:26,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-17 17:23:26,071 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:26,072 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:23:26,073 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:26,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:26,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1228919024, now seen corresponding path program 1 times [2020-07-17 17:23:26,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:26,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [368646860] [2020-07-17 17:23:26,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:26,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 17:23:26,523 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [368646860] [2020-07-17 17:23:26,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:23:26,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-17 17:23:26,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534496780] [2020-07-17 17:23:26,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 17:23:26,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:26,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 17:23:26,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:23:26,558 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 10 states. [2020-07-17 17:23:27,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:27,535 INFO L93 Difference]: Finished difference Result 221 states and 257 transitions. [2020-07-17 17:23:27,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 17:23:27,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2020-07-17 17:23:27,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:27,551 INFO L225 Difference]: With dead ends: 221 [2020-07-17 17:23:27,551 INFO L226 Difference]: Without dead ends: 138 [2020-07-17 17:23:27,557 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2020-07-17 17:23:27,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-17 17:23:27,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2020-07-17 17:23:27,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-07-17 17:23:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2020-07-17 17:23:27,631 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 40 [2020-07-17 17:23:27,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:27,632 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2020-07-17 17:23:27,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 17:23:27,632 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2020-07-17 17:23:27,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-17 17:23:27,635 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:27,635 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:23:27,636 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 17:23:27,636 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:27,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:27,636 INFO L82 PathProgramCache]: Analyzing trace with hash -2013393660, now seen corresponding path program 1 times [2020-07-17 17:23:27,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:27,637 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1153136613] [2020-07-17 17:23:27,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:27,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 17:23:27,927 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1153136613] [2020-07-17 17:23:27,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:23:27,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-17 17:23:27,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340781387] [2020-07-17 17:23:27,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 17:23:27,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:27,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 17:23:27,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-07-17 17:23:27,931 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 13 states. [2020-07-17 17:23:28,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:28,816 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2020-07-17 17:23:28,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-17 17:23:28,816 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2020-07-17 17:23:28,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:28,818 INFO L225 Difference]: With dead ends: 128 [2020-07-17 17:23:28,819 INFO L226 Difference]: Without dead ends: 108 [2020-07-17 17:23:28,822 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2020-07-17 17:23:28,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-07-17 17:23:28,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-07-17 17:23:28,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-17 17:23:28,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2020-07-17 17:23:28,853 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 52 [2020-07-17 17:23:28,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:28,853 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2020-07-17 17:23:28,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 17:23:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2020-07-17 17:23:28,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-17 17:23:28,856 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:28,856 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:23:28,857 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 17:23:28,857 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:28,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:28,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1709597342, now seen corresponding path program 1 times [2020-07-17 17:23:28,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:28,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [59493607] [2020-07-17 17:23:28,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:29,204 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-17 17:23:29,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [59493607] [2020-07-17 17:23:29,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:23:29,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-17 17:23:29,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170123623] [2020-07-17 17:23:29,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-17 17:23:29,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:29,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-17 17:23:29,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-17 17:23:29,207 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 15 states. [2020-07-17 17:23:30,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:30,674 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2020-07-17 17:23:30,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-17 17:23:30,675 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-07-17 17:23:30,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:30,678 INFO L225 Difference]: With dead ends: 179 [2020-07-17 17:23:30,678 INFO L226 Difference]: Without dead ends: 177 [2020-07-17 17:23:30,683 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2020-07-17 17:23:30,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-07-17 17:23:30,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 151. [2020-07-17 17:23:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-07-17 17:23:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2020-07-17 17:23:30,717 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 67 [2020-07-17 17:23:30,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:30,718 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2020-07-17 17:23:30,718 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-17 17:23:30,718 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2020-07-17 17:23:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-17 17:23:30,720 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:30,720 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:23:30,721 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 17:23:30,721 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:30,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:30,721 INFO L82 PathProgramCache]: Analyzing trace with hash 587834366, now seen corresponding path program 1 times [2020-07-17 17:23:30,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:30,722 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1362566668] [2020-07-17 17:23:30,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:31,025 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-17 17:23:31,026 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1362566668] [2020-07-17 17:23:31,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:23:31,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-17 17:23:31,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588475147] [2020-07-17 17:23:31,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-17 17:23:31,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:31,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-17 17:23:31,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-07-17 17:23:31,031 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand 15 states. [2020-07-17 17:23:32,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:32,357 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2020-07-17 17:23:32,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-17 17:23:32,357 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-07-17 17:23:32,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:32,360 INFO L225 Difference]: With dead ends: 221 [2020-07-17 17:23:32,360 INFO L226 Difference]: Without dead ends: 219 [2020-07-17 17:23:32,361 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=806, Unknown=0, NotChecked=0, Total=1056 [2020-07-17 17:23:32,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-07-17 17:23:32,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 194. [2020-07-17 17:23:32,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-07-17 17:23:32,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 212 transitions. [2020-07-17 17:23:32,402 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 212 transitions. Word has length 67 [2020-07-17 17:23:32,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:32,402 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 212 transitions. [2020-07-17 17:23:32,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-17 17:23:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 212 transitions. [2020-07-17 17:23:32,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-17 17:23:32,404 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:32,405 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:23:32,405 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 17:23:32,405 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:32,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:32,406 INFO L82 PathProgramCache]: Analyzing trace with hash 687369648, now seen corresponding path program 1 times [2020-07-17 17:23:32,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:32,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1843516697] [2020-07-17 17:23:32,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:32,624 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-17 17:23:32,625 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1843516697] [2020-07-17 17:23:32,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:23:32,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-17 17:23:32,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005614551] [2020-07-17 17:23:32,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-17 17:23:32,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:32,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-17 17:23:32,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-07-17 17:23:32,627 INFO L87 Difference]: Start difference. First operand 194 states and 212 transitions. Second operand 15 states. [2020-07-17 17:23:33,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:33,400 INFO L93 Difference]: Finished difference Result 206 states and 226 transitions. [2020-07-17 17:23:33,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-17 17:23:33,401 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 79 [2020-07-17 17:23:33,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:33,403 INFO L225 Difference]: With dead ends: 206 [2020-07-17 17:23:33,404 INFO L226 Difference]: Without dead ends: 142 [2020-07-17 17:23:33,407 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2020-07-17 17:23:33,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-07-17 17:23:33,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2020-07-17 17:23:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-07-17 17:23:33,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2020-07-17 17:23:33,449 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 79 [2020-07-17 17:23:33,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:33,450 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2020-07-17 17:23:33,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-17 17:23:33,450 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2020-07-17 17:23:33,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-17 17:23:33,461 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:33,462 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:23:33,462 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 17:23:33,462 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:33,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:33,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1486199216, now seen corresponding path program 2 times [2020-07-17 17:23:33,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:33,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [669461524] [2020-07-17 17:23:33,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-07-17 17:23:33,891 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [669461524] [2020-07-17 17:23:33,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:23:33,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-07-17 17:23:33,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105538135] [2020-07-17 17:23:33,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-17 17:23:33,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:33,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-17 17:23:33,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-17 17:23:33,895 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 20 states. [2020-07-17 17:23:35,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:35,526 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2020-07-17 17:23:35,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-17 17:23:35,527 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-17 17:23:35,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:35,530 INFO L225 Difference]: With dead ends: 168 [2020-07-17 17:23:35,530 INFO L226 Difference]: Without dead ends: 166 [2020-07-17 17:23:35,532 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2020-07-17 17:23:35,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-07-17 17:23:35,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 119. [2020-07-17 17:23:35,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-07-17 17:23:35,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2020-07-17 17:23:35,548 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 94 [2020-07-17 17:23:35,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:35,548 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2020-07-17 17:23:35,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-17 17:23:35,549 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2020-07-17 17:23:35,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-17 17:23:35,551 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:35,551 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:23:35,551 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 17:23:35,552 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:35,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:35,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1687005104, now seen corresponding path program 1 times [2020-07-17 17:23:35,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:35,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [314194737] [2020-07-17 17:23:35,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:35,924 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-07-17 17:23:35,926 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [314194737] [2020-07-17 17:23:35,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:23:35,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-07-17 17:23:35,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240088936] [2020-07-17 17:23:35,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-17 17:23:35,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:35,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-17 17:23:35,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-17 17:23:35,930 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 20 states. [2020-07-17 17:23:37,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:37,567 INFO L93 Difference]: Finished difference Result 191 states and 204 transitions. [2020-07-17 17:23:37,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-07-17 17:23:37,569 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-17 17:23:37,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:37,571 INFO L225 Difference]: With dead ends: 191 [2020-07-17 17:23:37,571 INFO L226 Difference]: Without dead ends: 189 [2020-07-17 17:23:37,572 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2020-07-17 17:23:37,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-07-17 17:23:37,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 142. [2020-07-17 17:23:37,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-17 17:23:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2020-07-17 17:23:37,593 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 94 [2020-07-17 17:23:37,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:37,594 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2020-07-17 17:23:37,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-17 17:23:37,594 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2020-07-17 17:23:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-17 17:23:37,596 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:37,596 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:23:37,596 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 17:23:37,599 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:37,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:37,600 INFO L82 PathProgramCache]: Analyzing trace with hash 766068976, now seen corresponding path program 2 times [2020-07-17 17:23:37,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:37,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1752359336] [2020-07-17 17:23:37,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:37,978 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-07-17 17:23:37,979 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1752359336] [2020-07-17 17:23:37,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:23:37,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-07-17 17:23:37,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131834101] [2020-07-17 17:23:37,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-17 17:23:37,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:37,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-17 17:23:37,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-17 17:23:37,981 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 20 states. [2020-07-17 17:23:39,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:39,687 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2020-07-17 17:23:39,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-07-17 17:23:39,691 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-17 17:23:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:39,694 INFO L225 Difference]: With dead ends: 208 [2020-07-17 17:23:39,694 INFO L226 Difference]: Without dead ends: 206 [2020-07-17 17:23:39,695 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=346, Invalid=1634, Unknown=0, NotChecked=0, Total=1980 [2020-07-17 17:23:39,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-07-17 17:23:39,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2020-07-17 17:23:39,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-07-17 17:23:39,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 195 transitions. [2020-07-17 17:23:39,731 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 195 transitions. Word has length 94 [2020-07-17 17:23:39,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:39,733 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 195 transitions. [2020-07-17 17:23:39,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-17 17:23:39,733 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 195 transitions. [2020-07-17 17:23:39,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-17 17:23:39,735 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:39,735 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:23:39,735 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 17:23:39,736 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:39,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:39,736 INFO L82 PathProgramCache]: Analyzing trace with hash 888595646, now seen corresponding path program 3 times [2020-07-17 17:23:39,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:39,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [181586036] [2020-07-17 17:23:39,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:40,277 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 37 proven. 37 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-07-17 17:23:40,278 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [181586036] [2020-07-17 17:23:40,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:23:40,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-07-17 17:23:40,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121009827] [2020-07-17 17:23:40,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-17 17:23:40,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:40,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-17 17:23:40,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2020-07-17 17:23:40,280 INFO L87 Difference]: Start difference. First operand 182 states and 195 transitions. Second operand 25 states. [2020-07-17 17:23:42,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:42,758 INFO L93 Difference]: Finished difference Result 237 states and 252 transitions. [2020-07-17 17:23:42,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-07-17 17:23:42,758 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 121 [2020-07-17 17:23:42,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:42,761 INFO L225 Difference]: With dead ends: 237 [2020-07-17 17:23:42,761 INFO L226 Difference]: Without dead ends: 171 [2020-07-17 17:23:42,763 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=576, Invalid=2846, Unknown=0, NotChecked=0, Total=3422 [2020-07-17 17:23:42,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-07-17 17:23:42,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 159. [2020-07-17 17:23:42,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-07-17 17:23:42,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2020-07-17 17:23:42,788 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 121 [2020-07-17 17:23:42,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:42,788 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2020-07-17 17:23:42,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-17 17:23:42,788 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2020-07-17 17:23:42,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-17 17:23:42,790 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:23:42,791 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:23:42,791 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 17:23:42,792 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:23:42,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:23:42,792 INFO L82 PathProgramCache]: Analyzing trace with hash -32340482, now seen corresponding path program 4 times [2020-07-17 17:23:42,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:23:42,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1008992169] [2020-07-17 17:23:42,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:23:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:23:42,991 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 54 proven. 1 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2020-07-17 17:23:42,991 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1008992169] [2020-07-17 17:23:42,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:23:42,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-17 17:23:42,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460697648] [2020-07-17 17:23:42,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 17:23:42,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:23:42,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 17:23:42,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-07-17 17:23:42,995 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 11 states. [2020-07-17 17:23:43,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:23:43,464 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2020-07-17 17:23:43,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 17:23:43,464 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 121 [2020-07-17 17:23:43,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:23:43,466 INFO L225 Difference]: With dead ends: 163 [2020-07-17 17:23:43,466 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 17:23:43,468 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-07-17 17:23:43,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 17:23:43,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 17:23:43,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 17:23:43,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 17:23:43,469 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2020-07-17 17:23:43,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:23:43,469 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 17:23:43,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 17:23:43,470 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 17:23:43,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 17:23:43,471 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 17:23:43,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 17:23:45,706 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2020-07-17 17:23:45,863 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2020-07-17 17:23:46,134 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2020-07-17 17:23:46,341 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2020-07-17 17:23:46,499 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-07-17 17:23:46,691 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2020-07-17 17:23:46,926 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-07-17 17:23:47,179 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-17 17:23:47,482 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2020-07-17 17:23:47,784 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2020-07-17 17:23:48,059 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2020-07-17 17:23:48,215 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-07-17 17:23:48,478 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2020-07-17 17:23:48,687 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2020-07-17 17:23:48,996 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2020-07-17 17:23:49,289 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-07-17 17:23:49,569 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2020-07-17 17:23:49,739 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2020-07-17 17:23:49,945 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-07-17 17:23:50,138 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2020-07-17 17:23:50,418 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-17 17:23:50,657 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-17 17:23:50,827 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2020-07-17 17:23:51,187 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-17 17:23:51,366 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2020-07-17 17:23:51,675 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-17 17:23:51,938 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-17 17:23:52,166 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-07-17 17:23:52,333 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2020-07-17 17:23:52,352 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 17:23:52,353 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-17 17:23:52,353 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 17:23:52,353 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-17 17:23:52,353 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-17 17:23:52,353 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-17 17:23:52,353 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 17:23:52,353 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 17:23:52,354 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-17 17:23:52,354 INFO L271 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2020-07-17 17:23:52,354 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-17 17:23:52,354 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-17 17:23:52,354 INFO L271 CegarLoopResult]: At program point L6-3(lines 5 7) the Hoare annotation is: true [2020-07-17 17:23:52,354 INFO L271 CegarLoopResult]: At program point assume_abort_if_notEXIT(lines 5 7) the Hoare annotation is: true [2020-07-17 17:23:52,355 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 38 52) the Hoare annotation is: true [2020-07-17 17:23:52,355 INFO L271 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: true [2020-07-17 17:23:52,355 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (<= main_~ai~1 main_~ax~1) (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-17 17:23:52,355 INFO L271 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: true [2020-07-17 17:23:52,355 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-17 17:23:52,355 INFO L264 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= |main_#t~mem12| 0) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-17 17:23:52,356 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 38 52) the Hoare annotation is: true [2020-07-17 17:23:52,356 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-17 17:23:52,356 INFO L264 CegarLoopResult]: At program point L46-2(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= |main_#t~mem12| 0) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-17 17:23:52,356 INFO L264 CegarLoopResult]: At program point L44-1(line 44) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|)) [2020-07-17 17:23:52,356 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-17 17:23:52,357 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-17 17:23:52,357 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 38 52) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-17 17:23:52,357 INFO L264 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-17 17:23:52,357 INFO L264 CegarLoopResult]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |main_#t~mem13| 0) (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-17 17:23:52,357 INFO L264 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-17 17:23:52,358 INFO L264 CegarLoopResult]: At program point L47-2(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |main_#t~mem13| 0) (<= main_~ai~1 main_~ax~1) (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-17 17:23:52,358 INFO L264 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-17 17:23:52,358 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-17 17:23:52,358 INFO L264 CegarLoopResult]: At program point L45-2(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-17 17:23:52,358 INFO L264 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-17 17:23:52,358 INFO L264 CegarLoopResult]: At program point L45-3(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-17 17:23:52,359 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-17 17:23:52,359 INFO L264 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-17 17:23:52,359 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-17 17:23:52,359 INFO L264 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-17 17:23:52,359 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 check_~ax~0)) (.cse1 (= 0 check_~ai~0)) (.cse2 (= .cse6 (select |#memory_int| check_~a.base))) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 .cse2 (or (= 0 check_~x) (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))))) .cse4 .cse5 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse1 .cse2) (not (<= 1 |check_#in~x|)) .cse4 .cse5)))) [2020-07-17 17:23:52,360 INFO L264 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (= 0 check_~ax~0) (= 0 check_~ai~0) (= .cse0 (select |#memory_int| check_~a.base))) (not (<= 1 |check_#in~x|)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (= .cse0 (select |#memory_int| |check_#in~a.base|))))) [2020-07-17 17:23:52,360 INFO L271 CegarLoopResult]: At program point checkENTRY(lines 14 36) the Hoare annotation is: true [2020-07-17 17:23:52,360 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-17 17:23:52,360 INFO L264 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 |check_#t~mem6|)) (.cse1 (= .cse5 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1) (not (<= 1 |check_#in~x|)) .cse2 .cse3) (or (and .cse0 .cse1 (or (= 0 check_~x) (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|)))))) [2020-07-17 17:23:52,360 INFO L264 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 check_~ai~0)) (.cse1 (= 0 |check_#t~mem6|)) (.cse2 (= .cse6 (select |#memory_int| check_~a.base))) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 .cse2 (or (= 0 check_~x) (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))))) .cse4 .cse5 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse1 .cse2) (not (<= 1 |check_#in~x|)) .cse4 .cse5)))) [2020-07-17 17:23:52,361 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-17 17:23:52,361 INFO L264 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-17 17:23:52,361 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-17 17:23:52,361 INFO L264 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-17 17:23:52,361 INFO L264 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-17 17:23:52,361 INFO L264 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-17 17:23:52,362 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-17 17:23:52,362 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-17 17:23:52,362 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (let ((.cse1 ((as const (Array Int Int)) 0)) (.cse5 (+ check_~y 1))) (let ((.cse0 (<= .cse5 |check_#in~n|)) (.cse2 (<= .cse5 check_~n)) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse1 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= 1 |check_#in~x|)) (and .cse0 (= .cse1 (select |#memory_int| check_~a.base)) .cse2 (<= 1 check_~x)) .cse3 .cse4) (or (and .cse0 (= 0 check_~x) .cse2) .cse3 .cse4 (not (= 0 |check_#in~x|)))))) [2020-07-17 17:23:52,362 INFO L264 CegarLoopResult]: At program point checkFINAL(lines 14 36) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= 1 |check_#in~x|)) (= .cse0 (select |#memory_int| check_~a.base)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (= .cse0 (select |#memory_int| |check_#in~a.base|))))) [2020-07-17 17:23:52,362 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 check_~ai~0)) (.cse1 (= .cse5 (select |#memory_int| check_~a.base))) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 (or (= 0 check_~x) (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) (<= 1 check_~x))))) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse1) (not (<= 1 |check_#in~x|)) .cse3 .cse4)))) [2020-07-17 17:23:52,362 INFO L264 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse1 (= 0 check_~ai~0)) (.cse2 (= .cse6 (select |#memory_int| check_~a.base))) (.cse3 (= 0 |check_#t~mem7|)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse1 .cse2 .cse3) .cse4) (or (and .cse1 .cse2 (or (= 0 check_~x) (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x)))) .cse3) .cse0 .cse4 (not (= 0 |check_#in~x|)))))) [2020-07-17 17:23:52,363 INFO L264 CegarLoopResult]: At program point L32-2(line 32) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 check_~ax~0)) (.cse1 (= 0 check_~ai~0)) (.cse2 (= .cse7 (select |#memory_int| check_~a.base))) (.cse3 (= 0 |check_#t~mem7|)) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 .cse2 .cse3) (not (<= 1 |check_#in~x|)) .cse4 .cse5) (or (and .cse0 .cse1 .cse2 (or (= 0 check_~x) (let ((.cse6 (+ check_~y 1))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n) (<= 1 check_~x)))) .cse3) .cse4 .cse5 (not (= 0 |check_#in~x|)))))) [2020-07-17 17:23:52,363 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-17 17:23:52,363 INFO L264 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: (let ((.cse8 ((as const (Array Int Int)) 0)) (.cse9 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse4 (<= .cse9 |check_#in~n|)) (.cse5 (= .cse8 (select |#memory_int| check_~a.base))) (.cse6 (<= .cse9 check_~n)) (.cse7 (= 0 |check_#t~mem1|)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse8 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse3 (+ check_~y 2))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n))) .cse2 .cse1) (or (and .cse4 (= 0 check_~x) .cse5 .cse6 .cse7) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (and .cse4 .cse5 (<= 1 check_~x) .cse6 .cse7) (not (<= 1 |check_#in~x|)) .cse0 .cse1)))) [2020-07-17 17:23:52,363 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-17 17:23:52,363 INFO L264 CegarLoopResult]: At program point L24-2(lines 24 25) the Hoare annotation is: (let ((.cse9 ((as const (Array Int Int)) 0)) (.cse10 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse4 (<= .cse10 |check_#in~n|)) (.cse5 (= .cse9 (select |#memory_int| check_~a.base))) (.cse6 (<= .cse10 check_~n)) (.cse7 (= 0 |check_#t~mem1|)) (.cse8 (= 0 |check_#t~mem2|)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse9 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse3 (+ check_~y 2))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n))) .cse2 .cse1) (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse4 .cse5 (<= 1 check_~x) .cse6 .cse7 .cse8) .cse1) (or (and .cse4 (= 0 check_~x) .cse5 .cse6 .cse7 .cse8) .cse0 .cse1 (not (= 0 |check_#in~x|)))))) [2020-07-17 17:23:52,364 INFO L264 CegarLoopResult]: At program point L24-3(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (= .cse7 (select |#memory_int| check_~a.base))) (.cse5 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse2 .cse1) (or (and .cse3 (= 0 check_~x) .cse4 .cse5 (= 0 |check_#t~mem1|) (= 0 |check_#t~mem2|)) .cse0 .cse1 (not (= 0 |check_#in~x|)))))) [2020-07-17 17:23:52,364 INFO L264 CegarLoopResult]: At program point L24-4(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (= .cse7 (select |#memory_int| check_~a.base))) (.cse5 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse2 .cse1) (or (and .cse3 (= 0 check_~x) .cse4 .cse5 (= 0 |check_#t~mem1|)) .cse0 .cse1 (not (= 0 |check_#in~x|)))))) [2020-07-17 17:23:52,364 INFO L264 CegarLoopResult]: At program point L24-5(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-17 17:23:52,364 INFO L264 CegarLoopResult]: At program point checkEXIT(lines 14 36) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= 1 |check_#in~x|)) (= .cse0 (select |#memory_int| check_~a.base)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (= .cse0 (select |#memory_int| |check_#in~a.base|))))) [2020-07-17 17:23:52,364 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-17 17:23:52,364 INFO L264 CegarLoopResult]: At program point L24-6(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse0 (<= .cse8 |check_#in~n|)) (.cse1 (= .cse7 (select |#memory_int| check_~a.base))) (.cse2 (<= .cse8 check_~n)) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse4 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= 1 |check_#in~x|)) (and .cse0 .cse1 (<= 1 |check_#t~post3|) .cse2 (<= 1 check_~x)) .cse3 .cse4) (or .cse3 .cse4 .cse5 (<= 2 check_~x)) (or (and (= 0 |check_#t~post3|) .cse0 (= 0 check_~x) .cse1 .cse2) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse4)))) [2020-07-17 17:23:52,365 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-17 17:23:52,365 INFO L264 CegarLoopResult]: At program point L24-7(line 24) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0)) (.cse7 (+ check_~y 1))) (let ((.cse0 (<= .cse7 |check_#in~n|)) (.cse1 (= .cse6 (select |#memory_int| check_~a.base))) (.cse2 (<= .cse7 check_~n)) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (and (= 0 |check_#t~post3|) .cse0 .cse1 (<= 1 check_~x) .cse2) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse1 (<= 1 |check_#t~post3|) .cse2 (<= 2 check_~x)) (not (<= 1 |check_#in~x|)) .cse3 .cse4) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n))) (not (<= 2 |check_#in~x|)) .cse4)))) [2020-07-17 17:23:52,365 INFO L264 CegarLoopResult]: At program point L24-9(line 24) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-17 17:23:52,365 INFO L264 CegarLoopResult]: At program point L14(lines 14 36) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (= 0 check_~x) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) (<= 1 check_~x) .cse0 .cse1))) [2020-07-17 17:23:52,365 INFO L264 CegarLoopResult]: At program point L24-10(line 24) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-17 17:23:52,366 INFO L264 CegarLoopResult]: At program point L14-1(lines 14 36) the Hoare annotation is: (let ((.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (not (<= 2 |check_#in~x|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 (= 0 check_~x)) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (and .cse3 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse2 .cse1 (<= (+ check_~y 2) |check_#in~n|)))) [2020-07-17 17:23:52,366 INFO L264 CegarLoopResult]: At program point L24-11(lines 24 25) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse0 (<= .cse6 |check_#in~n|)) (.cse1 (= .cse5 (select |#memory_int| check_~a.base))) (.cse2 (<= .cse6 check_~n)) (.cse4 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 .cse2 (<= 1 check_~x)) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse3 (and .cse0 .cse1 .cse2 (<= 2 check_~x)) .cse4) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (not (<= 2 |check_#in~x|)) .cse4 (<= (+ check_~y 2) check_~n))))) [2020-07-17 17:23:52,366 INFO L264 CegarLoopResult]: At program point L14-2(lines 14 36) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse4 (= .cse5 (select |#memory_int| check_~a.base))) (.cse2 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 (= 0 check_~x) .cse4) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse3 .cse4 (<= 1 check_~x)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse2 .cse1 (<= (+ check_~y 2) |check_#in~n|))))) [2020-07-17 17:23:52,366 INFO L264 CegarLoopResult]: At program point L14-3(lines 14 36) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse4 (= .cse5 (select |#memory_int| check_~a.base))) (.cse2 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 (= 0 check_~x) .cse4) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse3 .cse4 (<= 1 check_~x)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse2 .cse1 (<= (+ check_~y 2) |check_#in~n|))))) [2020-07-17 17:23:52,367 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 10) the Hoare annotation is: true [2020-07-17 17:23:52,367 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 8 10) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-17 17:23:52,367 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-17 17:23:52,367 INFO L264 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-17 17:23:52,367 INFO L264 CegarLoopResult]: At program point L9-3(lines 8 10) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-17 17:23:52,368 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-17 17:23:52,368 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-17 17:23:52,368 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitEXIT(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-07-17 17:23:52,368 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitFINAL(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-07-17 17:23:52,387 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.getLongDescription(ProcedureContractResult.java:74) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createProcedureContractResults(TraceAbstractionStarter.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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-17 17:23:52,391 INFO L168 Benchmark]: Toolchain (without parser) took 27354.71 ms. Allocated memory was 145.8 MB in the beginning and 374.9 MB in the end (delta: 229.1 MB). Free memory was 103.2 MB in the beginning and 94.5 MB in the end (delta: 8.7 MB). Peak memory consumption was 240.4 MB. Max. memory is 7.1 GB. [2020-07-17 17:23:52,392 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 17:23:52,393 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.88 ms. Allocated memory is still 145.8 MB. Free memory was 103.0 MB in the beginning and 91.9 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-17 17:23:52,393 INFO L168 Benchmark]: Boogie Preprocessor took 194.47 ms. Allocated memory was 145.8 MB in the beginning and 207.1 MB in the end (delta: 61.3 MB). Free memory was 91.9 MB in the beginning and 184.6 MB in the end (delta: -92.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-17 17:23:52,394 INFO L168 Benchmark]: RCFGBuilder took 462.73 ms. Allocated memory is still 207.1 MB. Free memory was 184.6 MB in the beginning and 162.2 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2020-07-17 17:23:52,395 INFO L168 Benchmark]: TraceAbstraction took 26414.33 ms. Allocated memory was 207.1 MB in the beginning and 374.9 MB in the end (delta: 167.8 MB). Free memory was 161.6 MB in the beginning and 94.5 MB in the end (delta: 67.0 MB). Peak memory consumption was 237.4 MB. Max. memory is 7.1 GB. [2020-07-17 17:23:52,399 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 276.88 ms. Allocated memory is still 145.8 MB. Free memory was 103.0 MB in the beginning and 91.9 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 194.47 ms. Allocated memory was 145.8 MB in the beginning and 207.1 MB in the end (delta: 61.3 MB). Free memory was 91.9 MB in the beginning and 184.6 MB in the end (delta: -92.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 462.73 ms. Allocated memory is still 207.1 MB. Free memory was 184.6 MB in the beginning and 162.2 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26414.33 ms. Allocated memory was 207.1 MB in the beginning and 374.9 MB in the end (delta: 167.8 MB). Free memory was 161.6 MB in the beginning and 94.5 MB in the end (delta: 67.0 MB). Peak memory consumption was 237.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 5]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 38]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...