/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/recursive-with-pointer/simple-recursive.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:57:36,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:57:36,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:57:36,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:57:36,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:57:36,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:57:36,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:57:36,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:57:36,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:57:36,519 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:57:36,520 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:57:36,522 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:57:36,522 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:57:36,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:57:36,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:57:36,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:57:36,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:57:36,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:57:36,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:57:36,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:57:36,533 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:57:36,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:57:36,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:57:36,537 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:57:36,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:57:36,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:57:36,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:57:36,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:57:36,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:57:36,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:57:36,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:57:36,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:57:36,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:57:36,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:57:36,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:57:36,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:57:36,549 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:57:36,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:57:36,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:57:36,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:57:36,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:57:36,552 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 21:57:36,581 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:57:36,581 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:57:36,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:57:36,583 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:57:36,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:57:36,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:57:36,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:57:36,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:57:36,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:57:36,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:57:36,588 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:57:36,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:57:36,588 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:57:36,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:57:36,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:57:36,589 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:57:36,590 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:57:36,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:57:36,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:57:36,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:57:36,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:57:36,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:57:36,591 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-09-04 21:57:37,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:57:37,076 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:57:37,082 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:57:37,084 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:57:37,085 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:57:37,086 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-with-pointer/simple-recursive.c [2020-09-04 21:57:37,186 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d752afbc1/f868339858e740a38b6855fced67f8ed/FLAG321284404 [2020-09-04 21:57:37,769 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:57:37,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-with-pointer/simple-recursive.c [2020-09-04 21:57:37,779 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d752afbc1/f868339858e740a38b6855fced67f8ed/FLAG321284404 [2020-09-04 21:57:38,111 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d752afbc1/f868339858e740a38b6855fced67f8ed [2020-09-04 21:57:38,126 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:57:38,128 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:57:38,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:57:38,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:57:38,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:57:38,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:57:38" (1/1) ... [2020-09-04 21:57:38,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4147c445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:38, skipping insertion in model container [2020-09-04 21:57:38,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:57:38" (1/1) ... [2020-09-04 21:57:38,150 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:57:38,179 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:57:38,401 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:57:38,416 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:57:38,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:57:38,455 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:57:38,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:38 WrapperNode [2020-09-04 21:57:38,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:57:38,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:57:38,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:57:38,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:57:38,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:38" (1/1) ... [2020-09-04 21:57:38,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:38" (1/1) ... [2020-09-04 21:57:38,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:38" (1/1) ... [2020-09-04 21:57:38,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:38" (1/1) ... [2020-09-04 21:57:38,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:38" (1/1) ... [2020-09-04 21:57:38,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:38" (1/1) ... [2020-09-04 21:57:38,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:38" (1/1) ... [2020-09-04 21:57:38,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:57:38,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:57:38,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:57:38,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:57:38,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:38" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 21:57:38,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:57:38,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:57:38,677 INFO L138 BoogieDeclarations]: Found implementation of procedure plus [2020-09-04 21:57:38,677 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2020-09-04 21:57:38,677 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:57:38,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:57:38,677 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2020-09-04 21:57:38,677 INFO L130 BoogieDeclarations]: Found specification of procedure plus [2020-09-04 21:57:38,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-04 21:57:38,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-04 21:57:38,678 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:57:38,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-04 21:57:38,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-09-04 21:57:38,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-04 21:57:38,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:57:38,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:57:38,951 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:57:38,952 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:57:38,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:57:38 BoogieIcfgContainer [2020-09-04 21:57:38,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:57:38,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:57:38,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:57:38,965 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:57:38,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:57:38" (1/3) ... [2020-09-04 21:57:38,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60207021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:57:38, skipping insertion in model container [2020-09-04 21:57:38,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:38" (2/3) ... [2020-09-04 21:57:38,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60207021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:57:38, skipping insertion in model container [2020-09-04 21:57:38,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:57:38" (3/3) ... [2020-09-04 21:57:38,969 INFO L109 eAbstractionObserver]: Analyzing ICFG simple-recursive.c [2020-09-04 21:57:38,983 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:57:38,995 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:57:39,022 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:57:39,072 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:57:39,072 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:57:39,072 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:57:39,073 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:57:39,073 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:57:39,073 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:57:39,073 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:57:39,073 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:57:39,093 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-09-04 21:57:39,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-04 21:57:39,108 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:39,109 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:57:39,110 INFO L427 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:39,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:39,118 INFO L82 PathProgramCache]: Analyzing trace with hash 474032392, now seen corresponding path program 1 times [2020-09-04 21:57:39,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:39,131 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1145805742] [2020-09-04 21:57:39,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:39,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:39,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:57:39,443 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1145805742] [2020-09-04 21:57:39,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:57:39,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 21:57:39,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812716593] [2020-09-04 21:57:39,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:57:39,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:39,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:57:39,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:57:39,476 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 7 states. [2020-09-04 21:57:39,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:57:39,814 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2020-09-04 21:57:39,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:57:39,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-09-04 21:57:39,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:57:39,830 INFO L225 Difference]: With dead ends: 65 [2020-09-04 21:57:39,830 INFO L226 Difference]: Without dead ends: 37 [2020-09-04 21:57:39,835 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:57:39,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-09-04 21:57:39,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2020-09-04 21:57:39,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-09-04 21:57:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2020-09-04 21:57:39,897 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 22 [2020-09-04 21:57:39,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:57:39,898 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2020-09-04 21:57:39,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:57:39,898 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-09-04 21:57:39,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 21:57:39,899 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:39,900 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-04 21:57:39,900 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:57:39,901 INFO L427 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:39,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:39,901 INFO L82 PathProgramCache]: Analyzing trace with hash 705842607, now seen corresponding path program 1 times [2020-09-04 21:57:39,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:39,902 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2077572039] [2020-09-04 21:57:39,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:40,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:57:40,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2077572039] [2020-09-04 21:57:40,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:57:40,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:57:40,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581257029] [2020-09-04 21:57:40,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:57:40,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:40,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:57:40,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:57:40,261 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 14 states. [2020-09-04 21:57:40,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:57:40,817 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2020-09-04 21:57:40,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 21:57:40,817 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-09-04 21:57:40,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:57:40,819 INFO L225 Difference]: With dead ends: 55 [2020-09-04 21:57:40,819 INFO L226 Difference]: Without dead ends: 49 [2020-09-04 21:57:40,821 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2020-09-04 21:57:40,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-09-04 21:57:40,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2020-09-04 21:57:40,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-09-04 21:57:40,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2020-09-04 21:57:40,834 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 34 [2020-09-04 21:57:40,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:57:40,835 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2020-09-04 21:57:40,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:57:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2020-09-04 21:57:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-09-04 21:57:40,837 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:40,837 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-04 21:57:40,837 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:57:40,838 INFO L427 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:40,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:40,838 INFO L82 PathProgramCache]: Analyzing trace with hash 180793302, now seen corresponding path program 2 times [2020-09-04 21:57:40,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:40,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [875936472] [2020-09-04 21:57:40,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:41,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:57:41,213 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [875936472] [2020-09-04 21:57:41,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:57:41,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-09-04 21:57:41,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683635144] [2020-09-04 21:57:41,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 21:57:41,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:41,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 21:57:41,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2020-09-04 21:57:41,216 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 20 states. [2020-09-04 21:57:42,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:57:42,281 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2020-09-04 21:57:42,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 21:57:42,283 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 46 [2020-09-04 21:57:42,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:57:42,286 INFO L225 Difference]: With dead ends: 67 [2020-09-04 21:57:42,286 INFO L226 Difference]: Without dead ends: 61 [2020-09-04 21:57:42,289 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=282, Invalid=1440, Unknown=0, NotChecked=0, Total=1722 [2020-09-04 21:57:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-09-04 21:57:42,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2020-09-04 21:57:42,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-09-04 21:57:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2020-09-04 21:57:42,314 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 46 [2020-09-04 21:57:42,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:57:42,315 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2020-09-04 21:57:42,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 21:57:42,315 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2020-09-04 21:57:42,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-09-04 21:57:42,320 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:42,320 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:57:42,321 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:57:42,321 INFO L427 AbstractCegarLoop]: === Iteration 4 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:42,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:42,321 INFO L82 PathProgramCache]: Analyzing trace with hash -68284547, now seen corresponding path program 3 times [2020-09-04 21:57:42,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:42,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1431955590] [2020-09-04 21:57:42,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:42,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:42,855 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:57:42,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1431955590] [2020-09-04 21:57:42,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:57:42,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-09-04 21:57:42,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820222854] [2020-09-04 21:57:42,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-09-04 21:57:42,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:42,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-09-04 21:57:42,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2020-09-04 21:57:42,858 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 26 states. [2020-09-04 21:57:44,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:57:44,356 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2020-09-04 21:57:44,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-09-04 21:57:44,357 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 58 [2020-09-04 21:57:44,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:57:44,359 INFO L225 Difference]: With dead ends: 79 [2020-09-04 21:57:44,359 INFO L226 Difference]: Without dead ends: 73 [2020-09-04 21:57:44,361 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=491, Invalid=2701, Unknown=0, NotChecked=0, Total=3192 [2020-09-04 21:57:44,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-09-04 21:57:44,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2020-09-04 21:57:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-09-04 21:57:44,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2020-09-04 21:57:44,385 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 58 [2020-09-04 21:57:44,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:57:44,386 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2020-09-04 21:57:44,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-09-04 21:57:44,386 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2020-09-04 21:57:44,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 21:57:44,390 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:44,390 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:57:44,390 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:57:44,390 INFO L427 AbstractCegarLoop]: === Iteration 5 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:44,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:44,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1585959772, now seen corresponding path program 4 times [2020-09-04 21:57:44,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:44,391 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1632649216] [2020-09-04 21:57:44,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:45,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:45,113 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:57:45,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1632649216] [2020-09-04 21:57:45,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:57:45,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2020-09-04 21:57:45,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661483199] [2020-09-04 21:57:45,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-09-04 21:57:45,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:45,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-09-04 21:57:45,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2020-09-04 21:57:45,117 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 32 states. [2020-09-04 21:57:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:57:47,200 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2020-09-04 21:57:47,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2020-09-04 21:57:47,201 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2020-09-04 21:57:47,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:57:47,203 INFO L225 Difference]: With dead ends: 91 [2020-09-04 21:57:47,203 INFO L226 Difference]: Without dead ends: 85 [2020-09-04 21:57:47,207 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=757, Invalid=4355, Unknown=0, NotChecked=0, Total=5112 [2020-09-04 21:57:47,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-09-04 21:57:47,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2020-09-04 21:57:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-09-04 21:57:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2020-09-04 21:57:47,230 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 70 [2020-09-04 21:57:47,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:57:47,231 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2020-09-04 21:57:47,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-09-04 21:57:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2020-09-04 21:57:47,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-09-04 21:57:47,232 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:47,233 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:57:47,233 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:57:47,233 INFO L427 AbstractCegarLoop]: === Iteration 6 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:47,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:47,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1974781771, now seen corresponding path program 5 times [2020-09-04 21:57:47,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:47,234 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [352726939] [2020-09-04 21:57:47,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:48,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:57:48,126 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [352726939] [2020-09-04 21:57:48,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:57:48,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2020-09-04 21:57:48,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592695903] [2020-09-04 21:57:48,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2020-09-04 21:57:48,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:48,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-09-04 21:57:48,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1258, Unknown=0, NotChecked=0, Total=1406 [2020-09-04 21:57:48,129 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 38 states. [2020-09-04 21:57:50,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:57:50,664 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2020-09-04 21:57:50,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2020-09-04 21:57:50,664 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 82 [2020-09-04 21:57:50,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:57:50,666 INFO L225 Difference]: With dead ends: 103 [2020-09-04 21:57:50,666 INFO L226 Difference]: Without dead ends: 97 [2020-09-04 21:57:50,669 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1621 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1080, Invalid=6402, Unknown=0, NotChecked=0, Total=7482 [2020-09-04 21:57:50,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-09-04 21:57:50,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2020-09-04 21:57:50,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-09-04 21:57:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2020-09-04 21:57:50,698 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 82 [2020-09-04 21:57:50,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:57:50,700 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2020-09-04 21:57:50,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 38 states. [2020-09-04 21:57:50,700 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2020-09-04 21:57:50,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-09-04 21:57:50,707 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:50,707 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:57:50,708 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:57:50,708 INFO L427 AbstractCegarLoop]: === Iteration 7 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:50,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:50,708 INFO L82 PathProgramCache]: Analyzing trace with hash 961781618, now seen corresponding path program 6 times [2020-09-04 21:57:50,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:50,712 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1107427792] [2020-09-04 21:57:50,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:51,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:57:51,815 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1107427792] [2020-09-04 21:57:51,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:57:51,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2020-09-04 21:57:51,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986300237] [2020-09-04 21:57:51,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2020-09-04 21:57:51,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:51,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2020-09-04 21:57:51,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1699, Unknown=0, NotChecked=0, Total=1892 [2020-09-04 21:57:51,818 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 44 states. [2020-09-04 21:57:55,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:57:55,411 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2020-09-04 21:57:55,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2020-09-04 21:57:55,412 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 94 [2020-09-04 21:57:55,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:57:55,414 INFO L225 Difference]: With dead ends: 115 [2020-09-04 21:57:55,414 INFO L226 Difference]: Without dead ends: 109 [2020-09-04 21:57:55,417 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2306 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1460, Invalid=8842, Unknown=0, NotChecked=0, Total=10302 [2020-09-04 21:57:55,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-09-04 21:57:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2020-09-04 21:57:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-09-04 21:57:55,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2020-09-04 21:57:55,431 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 94 [2020-09-04 21:57:55,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:57:55,432 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2020-09-04 21:57:55,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 44 states. [2020-09-04 21:57:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2020-09-04 21:57:55,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-09-04 21:57:55,434 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:55,434 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:57:55,434 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:57:55,435 INFO L427 AbstractCegarLoop]: === Iteration 8 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:55,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:55,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1667527961, now seen corresponding path program 7 times [2020-09-04 21:57:55,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:55,436 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1771228493] [2020-09-04 21:57:55,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:56,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:57:56,819 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1771228493] [2020-09-04 21:57:56,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:57:56,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2020-09-04 21:57:56,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032981044] [2020-09-04 21:57:56,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2020-09-04 21:57:56,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:56,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2020-09-04 21:57:56,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2206, Unknown=0, NotChecked=0, Total=2450 [2020-09-04 21:57:56,822 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 50 states. [2020-09-04 21:58:01,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:58:01,009 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2020-09-04 21:58:01,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2020-09-04 21:58:01,010 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 106 [2020-09-04 21:58:01,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:58:01,012 INFO L225 Difference]: With dead ends: 127 [2020-09-04 21:58:01,012 INFO L226 Difference]: Without dead ends: 121 [2020-09-04 21:58:01,016 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3111 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1897, Invalid=11675, Unknown=0, NotChecked=0, Total=13572 [2020-09-04 21:58:01,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-09-04 21:58:01,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2020-09-04 21:58:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-09-04 21:58:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2020-09-04 21:58:01,031 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 106 [2020-09-04 21:58:01,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:58:01,031 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2020-09-04 21:58:01,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 50 states. [2020-09-04 21:58:01,032 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2020-09-04 21:58:01,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-09-04 21:58:01,033 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:58:01,034 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:58:01,034 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:58:01,034 INFO L427 AbstractCegarLoop]: === Iteration 9 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:58:01,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:58:01,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1856567232, now seen corresponding path program 8 times [2020-09-04 21:58:01,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:58:01,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [507123831] [2020-09-04 21:58:01,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:58:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:02,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:58:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:58:02,658 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [507123831] [2020-09-04 21:58:02,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:58:02,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2020-09-04 21:58:02,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214826710] [2020-09-04 21:58:02,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2020-09-04 21:58:02,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:58:02,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2020-09-04 21:58:02,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=2779, Unknown=0, NotChecked=0, Total=3080 [2020-09-04 21:58:02,661 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 56 states. [2020-09-04 21:58:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:58:08,227 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2020-09-04 21:58:08,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2020-09-04 21:58:08,227 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 118 [2020-09-04 21:58:08,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:58:08,229 INFO L225 Difference]: With dead ends: 139 [2020-09-04 21:58:08,230 INFO L226 Difference]: Without dead ends: 133 [2020-09-04 21:58:08,234 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4036 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2391, Invalid=14901, Unknown=0, NotChecked=0, Total=17292 [2020-09-04 21:58:08,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-09-04 21:58:08,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2020-09-04 21:58:08,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-09-04 21:58:08,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2020-09-04 21:58:08,248 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 118 [2020-09-04 21:58:08,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:58:08,249 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2020-09-04 21:58:08,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 56 states. [2020-09-04 21:58:08,249 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2020-09-04 21:58:08,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-09-04 21:58:08,251 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:58:08,251 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:58:08,252 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:58:08,252 INFO L427 AbstractCegarLoop]: === Iteration 10 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:58:08,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:58:08,252 INFO L82 PathProgramCache]: Analyzing trace with hash -151316249, now seen corresponding path program 9 times [2020-09-04 21:58:08,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:58:08,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [827050566] [2020-09-04 21:58:08,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:58:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:10,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:58:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:10,191 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:58:10,192 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [827050566] [2020-09-04 21:58:10,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:58:10,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2020-09-04 21:58:10,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639549900] [2020-09-04 21:58:10,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2020-09-04 21:58:10,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:58:10,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2020-09-04 21:58:10,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=3418, Unknown=0, NotChecked=0, Total=3782 [2020-09-04 21:58:10,194 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 62 states. [2020-09-04 21:58:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:58:16,737 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2020-09-04 21:58:16,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2020-09-04 21:58:16,738 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 130 [2020-09-04 21:58:16,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:58:16,740 INFO L225 Difference]: With dead ends: 151 [2020-09-04 21:58:16,740 INFO L226 Difference]: Without dead ends: 145 [2020-09-04 21:58:16,743 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5166 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2956, Invalid=18800, Unknown=0, NotChecked=0, Total=21756 [2020-09-04 21:58:16,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-09-04 21:58:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2020-09-04 21:58:16,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-09-04 21:58:16,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2020-09-04 21:58:16,756 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 130 [2020-09-04 21:58:16,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:58:16,757 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2020-09-04 21:58:16,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 62 states. [2020-09-04 21:58:16,757 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2020-09-04 21:58:16,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-09-04 21:58:16,758 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:58:16,759 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:58:16,759 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:58:16,759 INFO L427 AbstractCegarLoop]: === Iteration 11 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:58:16,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:58:16,760 INFO L82 PathProgramCache]: Analyzing trace with hash -830445810, now seen corresponding path program 10 times [2020-09-04 21:58:16,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:58:16,760 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [326222882] [2020-09-04 21:58:16,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:58:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:19,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:58:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:19,654 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 485 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:58:19,655 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [326222882] [2020-09-04 21:58:19,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:58:19,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2020-09-04 21:58:19,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844016443] [2020-09-04 21:58:19,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2020-09-04 21:58:19,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:58:19,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2020-09-04 21:58:19,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=4561, Unknown=0, NotChecked=0, Total=4970 [2020-09-04 21:58:19,657 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 71 states. [2020-09-04 21:58:25,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:58:25,578 INFO L93 Difference]: Finished difference Result 158 states and 159 transitions. [2020-09-04 21:58:25,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2020-09-04 21:58:25,578 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 142 [2020-09-04 21:58:25,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:58:25,579 INFO L225 Difference]: With dead ends: 158 [2020-09-04 21:58:25,579 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 21:58:25,583 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8741 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=3441, Invalid=24615, Unknown=0, NotChecked=0, Total=28056 [2020-09-04 21:58:25,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 21:58:25,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 21:58:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 21:58:25,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 21:58:25,584 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2020-09-04 21:58:25,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:58:25,585 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 21:58:25,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 71 states. [2020-09-04 21:58:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 21:58:25,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 21:58:25,585 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 21:58:25,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 21:58:27,248 WARN L193 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 137 [2020-09-04 21:58:27,739 WARN L193 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 126 [2020-09-04 21:58:27,916 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2020-09-04 21:58:28,091 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2020-09-04 21:58:28,677 WARN L193 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 131 [2020-09-04 21:58:29,145 WARN L193 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 119 [2020-09-04 21:58:29,734 WARN L193 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 156 [2020-09-04 21:58:30,409 WARN L193 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 158 [2020-09-04 21:58:30,721 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2020-09-04 21:58:31,276 WARN L193 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 139 [2020-09-04 21:58:31,824 WARN L193 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 137 [2020-09-04 21:58:32,296 WARN L193 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 121 [2020-09-04 21:58:32,717 WARN L193 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 100 [2020-09-04 21:58:33,155 WARN L193 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 117 [2020-09-04 21:58:33,401 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2020-09-04 21:58:33,407 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 21:58:33,407 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-09-04 21:58:33,407 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:58:33,408 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-09-04 21:58:33,408 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:58:33,408 INFO L271 CegarLoopResult]: At program point fooEXIT(lines 9 18) the Hoare annotation is: true [2020-09-04 21:58:33,409 INFO L264 CegarLoopResult]: At program point fooENTRY(lines 9 18) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|)) (.cse0 (select (select |old(#memory_int)| |foo_#in~p.base|) |foo_#in~p.offset|))) (and (or (not (= .cse0 20)) (= 20 .cse1)) (or (and (<= .cse1 18) (<= 18 .cse1)) (not (<= 18 .cse0)) (not (<= .cse0 18))) (or (not (<= 14 .cse0)) (and (<= .cse1 14) (<= 14 .cse1)) (not (<= .cse0 14))) (or (not (<= .cse0 15)) (not (<= 15 .cse0)) (and (<= 15 .cse1) (<= .cse1 15))) (or (and (<= .cse1 17) (<= 17 .cse1)) (not (<= 17 .cse0)) (not (<= .cse0 17))) (or (not (<= 16 .cse0)) (and (<= 16 .cse1) (<= .cse1 16)) (not (<= .cse0 16))) (or (not (= .cse0 10)) (= 10 .cse1)) (or (not (<= .cse0 13)) (and (<= .cse1 13) (<= 13 .cse1)) (not (<= 13 .cse0))) (or (not (<= .cse0 11)) (and (<= .cse1 11) (<= 11 .cse1)) (not (<= 11 .cse0))) (or (not (<= 12 .cse0)) (and (<= .cse1 12) (<= 12 .cse1)) (not (<= .cse0 12))) (or (not (<= 19 .cse0)) (and (<= 19 .cse1) (<= .cse1 19)) (not (<= .cse0 19))))) [2020-09-04 21:58:33,409 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (let ((.cse0 (select (select |old(#memory_int)| |foo_#in~p.base|) |foo_#in~p.offset|))) (and (not (= .cse0 10)) (or (not (<= 19 .cse0)) (not (<= .cse0 19))) (or (not (<= .cse0 11)) (not (<= 11 .cse0))) (or (not (<= 17 .cse0)) (not (<= .cse0 17))) (or (not (<= 14 .cse0)) (not (<= .cse0 14))) (or (not (<= .cse0 13)) (not (<= 13 .cse0))) (not (= .cse0 20)) (or (not (<= .cse0 15)) (not (<= 15 .cse0))) (or (not (<= 16 .cse0)) (not (<= .cse0 16))) (or (not (<= 18 .cse0)) (not (<= .cse0 18))) (or (not (<= 12 .cse0)) (not (<= .cse0 12))))) [2020-09-04 21:58:33,410 INFO L264 CegarLoopResult]: At program point fooErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (let ((.cse0 (select (select |old(#memory_int)| |foo_#in~p.base|) |foo_#in~p.offset|))) (and (not (= .cse0 10)) (or (not (<= 19 .cse0)) (not (<= .cse0 19))) (or (not (<= .cse0 11)) (not (<= 11 .cse0))) (or (not (<= 17 .cse0)) (not (<= .cse0 17))) (or (not (<= 14 .cse0)) (not (<= .cse0 14))) (or (not (<= .cse0 13)) (not (<= 13 .cse0))) (not (= .cse0 20)) (or (not (<= .cse0 15)) (not (<= 15 .cse0))) (or (not (<= 16 .cse0)) (not (<= .cse0 16))) (or (not (<= 18 .cse0)) (not (<= .cse0 18))) (or (not (<= 12 .cse0)) (not (<= .cse0 12))))) [2020-09-04 21:58:33,410 INFO L264 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: (let ((.cse0 (select (select |old(#memory_int)| |foo_#in~p.base|) |foo_#in~p.offset|))) (and (not (= .cse0 10)) (or (not (<= 19 .cse0)) (not (<= .cse0 19))) (or (not (<= .cse0 11)) (not (<= 11 .cse0))) (or (not (<= 17 .cse0)) (not (<= .cse0 17))) (or (not (<= 14 .cse0)) (not (<= .cse0 14))) (or (not (= .cse0 20)) (and (= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 20) (= 20 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|)))) (or (not (<= .cse0 13)) (not (<= 13 .cse0))) (or (not (<= .cse0 15)) (not (<= 15 .cse0))) (or (not (<= 16 .cse0)) (not (<= .cse0 16))) (or (not (<= 18 .cse0)) (not (<= .cse0 18))) (or (not (<= 12 .cse0)) (not (<= .cse0 12))))) [2020-09-04 21:58:33,411 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|)) (.cse2 (select (select |#memory_int| foo_~p.base) foo_~p.offset)) (.cse0 (select (select |old(#memory_int)| |foo_#in~p.base|) |foo_#in~p.offset|))) (and (or (not (<= 18 .cse0)) (and (<= .cse1 18) (<= .cse2 18) (<= 18 .cse1) (<= 18 .cse2)) (not (<= .cse0 18))) (or (and (<= .cse2 12) (<= .cse1 12) (<= 12 .cse1) (<= 12 .cse2)) (not (<= 12 .cse0)) (not (<= .cse0 12))) (or (not (<= 14 .cse0)) (not (<= .cse0 14)) (and (<= .cse1 14) (<= .cse2 14) (<= 14 .cse1) (<= 14 .cse2))) (or (not (<= .cse0 11)) (not (<= 11 .cse0)) (and (<= .cse1 11) (<= 11 .cse1) (<= .cse2 11) (<= 11 .cse2))) (or (not (<= 17 .cse0)) (not (<= .cse0 17)) (and (<= .cse2 17) (<= .cse1 17) (<= 17 .cse1) (<= 17 .cse2))) (or (not (<= 19 .cse0)) (and (<= 19 .cse1) (<= 19 .cse2) (<= .cse2 19)) (not (<= .cse0 19))) (not (= .cse0 20)) (or (not (<= .cse0 15)) (and (<= 15 .cse1) (<= .cse1 15) (<= 15 .cse2) (<= .cse2 15)) (not (<= 15 .cse0))) (or (not (<= .cse0 13)) (and (<= .cse1 13) (<= .cse2 13) (<= 13 .cse2) (<= 13 .cse1)) (not (<= 13 .cse0))) (or (not (= .cse0 10)) (and (= .cse2 10) (= 10 .cse1))) (or (not (<= 16 .cse0)) (and (<= 16 .cse2) (<= 16 .cse1) (<= .cse1 16) (<= .cse2 16)) (not (<= .cse0 16))))) [2020-09-04 21:58:33,411 INFO L264 CegarLoopResult]: At program point L12-1(lines 12 17) the Hoare annotation is: (let ((.cse0 (select (select |old(#memory_int)| |foo_#in~p.base|) |foo_#in~p.offset|))) (and (not (= .cse0 10)) (or (not (<= 19 .cse0)) (not (<= .cse0 19))) (or (not (<= .cse0 11)) (not (<= 11 .cse0))) (or (not (<= 17 .cse0)) (not (<= .cse0 17))) (or (not (<= 14 .cse0)) (not (<= .cse0 14))) (or (not (<= .cse0 13)) (not (<= 13 .cse0))) (or (and (= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 20) (= |foo_#t~mem3| 20) (= 20 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))) (not (= .cse0 20))) (or (not (<= .cse0 15)) (not (<= 15 .cse0))) (or (not (<= 16 .cse0)) (not (<= .cse0 16))) (or (not (<= 18 .cse0)) (not (<= .cse0 18))) (or (not (<= 12 .cse0)) (not (<= .cse0 12))))) [2020-09-04 21:58:33,412 INFO L264 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|)) (.cse2 (select (select |#memory_int| foo_~p.base) foo_~p.offset)) (.cse0 (select (select |old(#memory_int)| |foo_#in~p.base|) |foo_#in~p.offset|))) (and (or (not (<= 18 .cse0)) (and (<= .cse1 18) (<= .cse2 18) (<= 18 .cse1) (<= 18 .cse2)) (not (<= .cse0 18))) (or (not (<= 14 .cse0)) (not (<= .cse0 14)) (and (<= .cse1 14) (<= .cse2 14) (<= 14 .cse1) (<= 14 .cse2))) (or (and (<= .cse2 12) (<= .cse1 12) (<= 12 .cse1) (<= 12 .cse2)) (not (<= 12 .cse0)) (not (<= .cse0 12))) (or (not (= .cse0 20)) (and (= .cse2 20) (= 20 .cse1))) (or (not (<= .cse0 11)) (not (<= 11 .cse0)) (and (<= .cse1 11) (<= 11 .cse1) (<= .cse2 11) (<= 11 .cse2))) (or (not (<= 17 .cse0)) (not (<= .cse0 17)) (and (<= .cse2 17) (<= .cse1 17) (<= 17 .cse1) (<= 17 .cse2))) (or (not (<= .cse0 13)) (and (<= .cse1 13) (<= .cse2 13) (<= 13 .cse2) (<= 13 .cse1)) (not (<= 13 .cse0))) (or (not (= .cse0 10)) (and (= .cse2 10) (= 10 .cse1))) (or (not (<= .cse0 15)) (not (<= 15 .cse0)) (and (<= 15 .cse1) (<= .cse1 15) (<= 15 .cse2) (<= .cse2 15))) (or (not (<= 19 .cse0)) (not (<= .cse0 19)) (and (<= 19 .cse1) (<= 19 .cse2) (<= .cse2 19) (<= .cse1 19))) (or (not (<= 16 .cse0)) (and (<= 16 .cse2) (<= 16 .cse1) (<= .cse1 16) (<= .cse2 16)) (not (<= .cse0 16))))) [2020-09-04 21:58:33,412 INFO L264 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: (not (= (select (select |old(#memory_int)| |foo_#in~p.base|) |foo_#in~p.offset|) 10)) [2020-09-04 21:58:33,412 INFO L264 CegarLoopResult]: At program point L10-1(lines 10 17) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| foo_~p.base) foo_~p.offset))) (let ((.cse3 (<= .cse1 |foo_#t~mem2|)) (.cse0 (select (select |old(#memory_int)| |foo_#in~p.base|) |foo_#in~p.offset|)) (.cse2 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))) (and (or (not (<= 12 .cse0)) (not (<= .cse0 12)) (and (<= .cse1 12) (<= .cse2 12) (<= 12 .cse2) (<= |foo_#t~mem2| 12) (<= 12 .cse1))) (or (not (<= .cse0 15)) (not (<= 15 .cse0)) (and (<= 15 .cse2) (<= |foo_#t~mem2| 15) (<= .cse2 15) (<= 15 .cse1) (<= .cse1 15))) (or (not (<= 16 .cse0)) (and (<= 16 .cse1) (<= 16 .cse2) (<= |foo_#t~mem2| 16) (<= .cse2 16) (<= .cse1 16)) (not (<= .cse0 16))) (or (not (<= 19 .cse0)) (and (<= |foo_#t~mem2| 19) .cse3 (<= 19 .cse2) (<= 19 .cse1) (<= .cse2 19)) (not (<= .cse0 19))) (or (not (<= .cse0 13)) (and (<= .cse2 13) (<= .cse1 13) (<= 13 .cse1) (<= |foo_#t~mem2| 13) (<= 13 .cse2)) (not (<= 13 .cse0))) (or (not (<= 18 .cse0)) (and (<= .cse2 18) (<= .cse1 18) (<= 18 .cse2) (<= 18 .cse1) (<= |foo_#t~mem2| 18)) (not (<= .cse0 18))) (or (not (<= .cse0 11)) (and (<= .cse2 11) (<= |foo_#t~mem2| 11) (<= 11 .cse2) (<= .cse1 11) (<= 11 .cse1)) (not (<= 11 .cse0))) (or (not (= .cse0 10)) (and (= .cse1 10) (= |foo_#t~mem2| 10) (= 10 .cse2))) (or (not (= .cse0 20)) (and .cse3 (= .cse1 20) (= 20 .cse2))) (or (not (<= 14 .cse0)) (and (<= .cse2 14) (<= .cse1 14) (<= 14 .cse2) (<= |foo_#t~mem2| 14) (<= 14 .cse1)) (not (<= .cse0 14))) (or (not (<= 17 .cse0)) (not (<= .cse0 17)) (and (<= .cse1 17) (<= .cse2 17) (<= 17 .cse2) (<= |foo_#t~mem2| 17) (<= 17 .cse1)))))) [2020-09-04 21:58:33,413 INFO L264 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: (let ((.cse0 (select (select |old(#memory_int)| |foo_#in~p.base|) |foo_#in~p.offset|))) (and (not (= .cse0 10)) (or (not (<= 19 .cse0)) (not (<= .cse0 19))) (or (not (<= .cse0 11)) (not (<= 11 .cse0))) (or (not (<= 17 .cse0)) (not (<= .cse0 17))) (or (not (<= 14 .cse0)) (not (<= .cse0 14))) (or (not (<= .cse0 13)) (not (<= 13 .cse0))) (not (= .cse0 20)) (or (not (<= .cse0 15)) (not (<= 15 .cse0))) (or (not (<= 16 .cse0)) (not (<= .cse0 16))) (or (not (<= 18 .cse0)) (not (<= .cse0 18))) (or (not (<= 12 .cse0)) (not (<= .cse0 12))))) [2020-09-04 21:58:33,413 INFO L264 CegarLoopResult]: At program point L10-2(line 10) the Hoare annotation is: (let ((.cse3 (<= |foo_#t~mem2| 19)) (.cse0 (select (select |old(#memory_int)| |foo_#in~p.base|) |foo_#in~p.offset|)) (.cse2 (select (select |#memory_int| foo_~p.base) foo_~p.offset)) (.cse1 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))) (and (or (not (<= .cse0 13)) (not (<= 13 .cse0)) (and (<= .cse1 13) (<= .cse2 13) (<= 13 .cse2) (<= |foo_#t~mem2| 14) (<= 13 .cse1))) (or (not (<= .cse0 15)) (and (<= 15 .cse1) (<= .cse1 15) (<= 15 .cse2) (<= .cse2 15) (<= |foo_#t~mem2| 16)) (not (<= 15 .cse0))) (or (and (<= .cse2 12) (<= .cse1 12) (<= |foo_#t~mem2| 13) (<= 12 .cse1) (<= 12 .cse2)) (not (<= 12 .cse0)) (not (<= .cse0 12))) (or (not (<= 18 .cse0)) (and .cse3 (<= .cse1 18) (<= .cse2 18) (<= 18 .cse1) (<= 18 .cse2)) (not (<= .cse0 18))) (or (not (<= 14 .cse0)) (not (<= .cse0 14)) (and (<= |foo_#t~mem2| 15) (<= .cse1 14) (<= .cse2 14) (<= 14 .cse1) (<= 14 .cse2))) (not (= .cse0 20)) (or (not (<= 17 .cse0)) (and (<= .cse2 17) (<= .cse1 17) (<= 17 .cse1) (<= 17 .cse2) (<= |foo_#t~mem2| 18)) (not (<= .cse0 17))) (or (not (<= 16 .cse0)) (and (<= 16 .cse2) (<= |foo_#t~mem2| 17) (<= 16 .cse1) (<= .cse1 16) (<= .cse2 16)) (not (<= .cse0 16))) (or (not (<= .cse0 11)) (not (<= 11 .cse0)) (and (<= .cse1 11) (<= 11 .cse1) (<= .cse2 11) (<= |foo_#t~mem2| 12) (<= 11 .cse2))) (or (not (<= 19 .cse0)) (not (<= .cse0 19)) (and (<= .cse2 |foo_#t~mem2|) .cse3 (<= 19 .cse1) (<= 19 .cse2))) (or (not (= .cse0 10)) (and (<= |foo_#t~mem2| 11) (= .cse2 10) (= 10 .cse1))))) [2020-09-04 21:58:33,413 INFO L264 CegarLoopResult]: At program point L10-3(line 10) the Hoare annotation is: (let ((.cse0 (select (select |old(#memory_int)| |foo_#in~p.base|) |foo_#in~p.offset|))) (and (not (= .cse0 10)) (or (not (<= 19 .cse0)) (not (<= .cse0 19))) (or (not (<= .cse0 11)) (not (<= 11 .cse0))) (or (not (<= 17 .cse0)) (not (<= .cse0 17))) (or (not (<= 14 .cse0)) (not (<= .cse0 14))) (or (not (<= .cse0 13)) (not (<= 13 .cse0))) (or (not (<= .cse0 15)) (not (<= 15 .cse0))) (or (not (<= 16 .cse0)) (not (<= .cse0 16))) (or (not (<= 18 .cse0)) (not (<= .cse0 18))) (or (not (= .cse0 20)) (let ((.cse1 (select (select |#memory_int| foo_~p.base) foo_~p.offset))) (and (<= .cse1 |foo_#t~mem2|) (= .cse1 20) (= 20 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))))) (or (not (<= 12 .cse0)) (not (<= .cse0 12))))) [2020-09-04 21:58:33,413 INFO L271 CegarLoopResult]: At program point L10-4(lines 9 18) the Hoare annotation is: true [2020-09-04 21:58:33,414 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:58:33,414 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 21:58:33,414 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 21:58:33,414 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:58:33,414 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 20 26) the Hoare annotation is: (= |old(#valid)| |#valid|) [2020-09-04 21:58:33,414 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 20 26) the Hoare annotation is: true [2020-09-04 21:58:33,414 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-09-04 21:58:33,414 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 20 26) the Hoare annotation is: true [2020-09-04 21:58:33,414 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-09-04 21:58:33,415 INFO L264 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10) [2020-09-04 21:58:33,415 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (= |old(#valid)| |#valid|) [2020-09-04 21:58:33,415 INFO L271 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: true [2020-09-04 21:58:33,415 INFO L264 CegarLoopResult]: At program point L20(lines 20 26) the Hoare annotation is: (= |old(#valid)| |#valid|) [2020-09-04 21:58:33,415 INFO L271 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: true [2020-09-04 21:58:33,415 INFO L271 CegarLoopResult]: At program point L22-3(line 22) the Hoare annotation is: true [2020-09-04 21:58:33,416 INFO L264 CegarLoopResult]: At program point L5-4(line 5) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|))) (let ((.cse3 (<= 18 .cse0)) (.cse1 (select (select |#memory_int| plus_~p.base) plus_~p.offset)) (.cse2 (select (select |old(#memory_int)| |plus_#in~p.base|) |plus_#in~p.offset|))) (and (or (and (= |plus_#t~mem0| 10) (<= .cse0 11) (<= .cse1 11) (<= 11 .cse1)) (not (= .cse2 10))) (or (and .cse3 (<= 19 .cse1) (<= |plus_#t~mem0| 18) (<= 18 |plus_#t~mem0|) (<= .cse1 19)) (not (<= 18 .cse2)) (not (<= .cse2 18))) (or (and (<= |plus_#t~mem0| 11) (<= .cse1 12) (<= 11 .cse0) (<= 11 |plus_#t~mem0|) (<= 12 .cse1) (<= .cse0 12)) (not (<= 11 .cse2)) (not (<= .cse2 11))) (or (not (<= 19 .cse2)) (and .cse3 (<= |plus_#t~mem0| 19) (<= 19 |plus_#t~mem0|) (= .cse1 20)) (not (<= .cse2 19))) (or (and (<= 17 .cse1) (<= .cse0 17) (<= 16 .cse0) (<= .cse1 17) (<= 16 |plus_#t~mem0|) (<= |plus_#t~mem0| 16)) (not (<= 16 .cse2)) (not (<= .cse2 16))) (or (not (<= .cse2 15)) (not (<= 15 .cse2)) (and (<= |plus_#t~mem0| 15) (<= 15 |plus_#t~mem0|) (<= 15 .cse0) (<= 16 .cse1) (<= .cse0 16) (<= .cse1 16))) (or (not (<= .cse2 17)) (and (<= .cse1 18) (<= |plus_#t~mem0| 17) (<= 17 .cse0) (<= 17 |plus_#t~mem0|) (<= .cse0 18) (<= 18 .cse1)) (not (<= 17 .cse2))) (or (and (<= .cse0 14) (<= |plus_#t~mem0| 13) (<= 14 .cse1) (<= 13 |plus_#t~mem0|) (<= .cse1 14) (<= 13 .cse0)) (not (<= .cse2 13)) (not (<= 13 .cse2))) (or (not (<= 12 .cse2)) (not (<= .cse2 12)) (and (<= .cse1 13) (<= 12 |plus_#t~mem0|) (<= |plus_#t~mem0| 12) (<= 12 .cse0) (<= .cse0 13) (<= 13 .cse1))) (or (not (<= .cse2 14)) (and (<= 14 |plus_#t~mem0|) (<= |plus_#t~mem0| 14) (<= .cse1 15) (<= 14 .cse0) (<= .cse0 15) (<= 15 .cse1)) (not (<= 14 .cse2)))))) [2020-09-04 21:58:33,416 INFO L271 CegarLoopResult]: At program point plusFINAL(lines 4 7) the Hoare annotation is: true [2020-09-04 21:58:33,417 INFO L264 CegarLoopResult]: At program point plusENTRY(lines 4 7) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|)) (.cse1 (select (select |old(#memory_int)| |plus_#in~p.base|) |plus_#in~p.offset|))) (and (or (and (<= 16 .cse0) (<= .cse0 16)) (not (<= 16 .cse1)) (not (<= .cse1 16))) (or (and (<= 12 .cse0) (<= .cse0 12)) (not (<= 12 .cse1)) (not (<= .cse1 12))) (or (not (<= 11 .cse1)) (not (<= .cse1 11)) (and (<= 11 .cse0) (<= .cse0 11))) (or (= .cse0 10) (not (= .cse1 10))) (or (not (<= .cse1 17)) (and (<= .cse0 17) (<= 17 .cse0)) (not (<= 17 .cse1))) (or (not (<= .cse1 14)) (and (<= .cse0 14) (<= 14 .cse0)) (not (<= 14 .cse1))) (or (not (<= .cse1 15)) (not (<= 15 .cse1)) (and (<= 15 .cse0) (<= .cse0 15))) (or (not (<= .cse1 13)) (and (<= 13 .cse0) (<= .cse0 13)) (not (<= 13 .cse1))) (or (not (<= 19 .cse1)) (and (<= .cse0 19) (<= 19 .cse0)) (not (<= .cse1 19))) (or (and (<= 18 .cse0) (<= .cse0 18)) (not (<= 18 .cse1)) (not (<= .cse1 18))))) [2020-09-04 21:58:33,417 INFO L271 CegarLoopResult]: At program point plusEXIT(lines 4 7) the Hoare annotation is: true [2020-09-04 21:58:33,417 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|))) (let ((.cse3 (<= 18 .cse2)) (.cse1 (select (select |#memory_int| plus_~p.base) plus_~p.offset)) (.cse0 (select (select |old(#memory_int)| |plus_#in~p.base|) |plus_#in~p.offset|))) (and (or (not (<= 12 .cse0)) (not (<= .cse0 12)) (and (<= .cse1 13) (<= 12 .cse2) (<= .cse2 13) (<= 13 .cse1))) (or (and (<= 17 .cse1) (<= .cse2 17) (<= 16 .cse2) (<= .cse1 17)) (not (<= 16 .cse0)) (not (<= .cse0 16))) (or (not (<= .cse0 14)) (and (<= .cse1 15) (<= 14 .cse2) (<= .cse2 15) (<= 15 .cse1)) (not (<= 14 .cse0))) (or (not (<= .cse0 17)) (and (<= .cse1 18) (<= 17 .cse2) (<= .cse2 18) (<= 18 .cse1)) (not (<= 17 .cse0))) (or (not (<= .cse0 13)) (and (<= .cse2 14) (<= 14 .cse1) (<= .cse1 14) (<= 13 .cse2)) (not (<= 13 .cse0))) (or (and .cse3 (<= 19 .cse1) (<= .cse1 19)) (not (<= 18 .cse0)) (not (<= .cse0 18))) (or (not (<= 11 .cse0)) (not (<= .cse0 11)) (and (<= .cse1 12) (<= 11 .cse2) (<= 12 .cse1) (<= .cse2 12))) (or (not (<= 19 .cse0)) (and .cse3 (= .cse1 20)) (not (<= .cse0 19))) (or (and (<= 15 .cse2) (<= 16 .cse1) (<= .cse2 16) (<= .cse1 16)) (not (<= .cse0 15)) (not (<= 15 .cse0))) (or (and (<= .cse2 11) (<= .cse1 11) (<= 11 .cse1)) (not (= .cse0 10)))))) [2020-09-04 21:58:33,418 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|)) (.cse1 (select (select |#memory_int| plus_~p.base) plus_~p.offset)) (.cse0 (select (select |old(#memory_int)| |plus_#in~p.base|) |plus_#in~p.offset|))) (and (or (not (<= .cse0 17)) (not (<= 17 .cse0)) (and (<= 17 .cse1) (<= .cse2 17) (<= 17 .cse2) (<= .cse1 17))) (or (not (<= 12 .cse0)) (not (<= .cse0 12)) (and (<= .cse1 12) (<= 12 .cse2) (<= 12 .cse1) (<= .cse2 12))) (or (and (<= 19 .cse1) (<= .cse2 19) (<= 19 .cse2) (<= .cse1 19)) (not (<= 19 .cse0)) (not (<= .cse0 19))) (or (and (<= .cse1 18) (<= 18 .cse2) (<= .cse2 18) (<= 18 .cse1)) (not (<= 18 .cse0)) (not (<= .cse0 18))) (or (and (<= .cse1 13) (<= 13 .cse2) (<= .cse2 13) (<= 13 .cse1)) (not (<= .cse0 13)) (not (<= 13 .cse0))) (or (and (<= 15 .cse2) (<= .cse1 15) (<= .cse2 15) (<= 15 .cse1)) (not (<= .cse0 15)) (not (<= 15 .cse0))) (or (and (<= 11 .cse2) (<= .cse2 11) (<= .cse1 11) (<= 11 .cse1)) (not (<= 11 .cse0)) (not (<= .cse0 11))) (or (and (= .cse1 10) (= .cse2 10)) (not (= .cse0 10))) (or (not (<= .cse0 14)) (and (<= .cse2 14) (<= 14 .cse1) (<= 14 .cse2) (<= .cse1 14)) (not (<= 14 .cse0))) (or (and (<= 16 .cse1) (<= 16 .cse2) (<= .cse2 16) (<= .cse1 16)) (not (<= 16 .cse0)) (not (<= .cse0 16))))) [2020-09-04 21:58:33,419 INFO L264 CegarLoopResult]: At program point L5-1(line 5) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| plus_~p.base) plus_~p.offset)) (.cse1 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|)) (.cse2 (select (select |old(#memory_int)| |plus_#in~p.base|) |plus_#in~p.offset|))) (and (or (and (<= .cse0 18) (<= 18 .cse1) (<= .cse1 18) (<= 18 .cse0) (<= |plus_#t~mem0| 18) (<= 18 |plus_#t~mem0|)) (not (<= 18 .cse2)) (not (<= .cse2 18))) (or (not (<= .cse2 13)) (and (<= .cse0 13) (<= |plus_#t~mem0| 13) (<= 13 |plus_#t~mem0|) (<= 13 .cse1) (<= .cse1 13) (<= 13 .cse0)) (not (<= 13 .cse2))) (or (not (<= .cse2 17)) (not (<= 17 .cse2)) (and (<= 17 .cse0) (<= .cse1 17) (<= |plus_#t~mem0| 17) (<= 17 .cse1) (<= 17 |plus_#t~mem0|) (<= .cse0 17))) (or (and (<= 16 .cse0) (<= 16 .cse1) (<= .cse1 16) (<= .cse0 16) (<= 16 |plus_#t~mem0|) (<= |plus_#t~mem0| 16)) (not (<= 16 .cse2)) (not (<= .cse2 16))) (or (and (<= .cse0 12) (<= 12 |plus_#t~mem0|) (<= |plus_#t~mem0| 12) (<= 12 .cse1) (<= 12 .cse0) (<= .cse1 12)) (not (<= 12 .cse2)) (not (<= .cse2 12))) (or (and (<= 19 .cse0) (<= |plus_#t~mem0| 19) (<= .cse1 19) (<= 19 |plus_#t~mem0|) (<= 19 .cse1) (<= .cse0 19)) (not (<= 19 .cse2)) (not (<= .cse2 19))) (or (and (<= |plus_#t~mem0| 15) (<= 15 |plus_#t~mem0|) (<= 15 .cse1) (<= .cse0 15) (<= .cse1 15) (<= 15 .cse0)) (not (<= .cse2 15)) (not (<= 15 .cse2))) (or (not (<= .cse2 14)) (and (<= 14 |plus_#t~mem0|) (<= .cse1 14) (<= 14 .cse0) (<= |plus_#t~mem0| 14) (<= 14 .cse1) (<= .cse0 14)) (not (<= 14 .cse2))) (or (not (<= 11 .cse2)) (and (<= |plus_#t~mem0| 11) (<= 11 .cse1) (<= .cse1 11) (<= .cse0 11) (<= 11 |plus_#t~mem0|) (<= 11 .cse0)) (not (<= .cse2 11))) (or (and (= |plus_#t~mem0| 10) (= .cse0 10) (= .cse1 10)) (not (= .cse2 10))))) [2020-09-04 21:58:33,422 INFO L264 CegarLoopResult]: At program point L5-2(line 5) the Hoare annotation is: (let ((.cse0 (select (select |old(#memory_int)| |plus_#in~p.base|) |plus_#in~p.offset|)) (.cse2 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|)) (.cse1 (select (select |#memory_int| plus_~p.base) plus_~p.offset))) (and (or (not (<= 12 .cse0)) (and (<= 12 |plus_#t~post1|) (<= .cse1 12) (<= |plus_#t~post1| 12) (<= 12 |plus_#t~mem0|) (<= |plus_#t~mem0| 12) (<= 12 .cse2) (<= 12 .cse1) (<= .cse2 12)) (not (<= .cse0 12))) (or (and (<= .cse1 18) (<= 18 .cse2) (<= .cse2 18) (<= 18 .cse1) (<= |plus_#t~mem0| 18) (<= 18 |plus_#t~post1|) (<= |plus_#t~post1| 18) (<= 18 |plus_#t~mem0|)) (not (<= 18 .cse0)) (not (<= .cse0 18))) (or (not (<= .cse0 13)) (and (<= .cse1 13) (<= |plus_#t~mem0| 13) (<= 13 |plus_#t~post1|) (<= |plus_#t~post1| 13) (<= 13 |plus_#t~mem0|) (<= 13 .cse2) (<= .cse2 13) (<= 13 .cse1)) (not (<= 13 .cse0))) (or (and (<= 19 .cse1) (<= |plus_#t~mem0| 19) (<= .cse2 19) (<= 19 |plus_#t~mem0|) (= 19 |plus_#t~post1|) (<= 19 .cse2) (<= .cse1 19)) (not (<= 19 .cse0)) (not (<= .cse0 19))) (or (and (<= 16 .cse1) (<= 16 |plus_#t~post1|) (<= 16 .cse2) (<= |plus_#t~post1| 16) (<= .cse2 16) (<= .cse1 16) (<= 16 |plus_#t~mem0|) (<= |plus_#t~mem0| 16)) (not (<= 16 .cse0)) (not (<= .cse0 16))) (or (and (= |plus_#t~mem0| 10) (= .cse1 10) (= .cse2 10) (= 10 |plus_#t~post1|)) (not (= .cse0 10))) (or (not (<= 11 .cse0)) (and (<= |plus_#t~mem0| 11) (<= 11 .cse2) (<= .cse2 11) (<= |plus_#t~post1| 11) (<= 11 |plus_#t~post1|) (<= .cse1 11) (<= 11 |plus_#t~mem0|) (<= 11 .cse1)) (not (<= .cse0 11))) (or (not (<= .cse0 15)) (not (<= 15 .cse0)) (and (<= |plus_#t~mem0| 15) (<= 15 |plus_#t~mem0|) (<= 15 .cse2) (<= |plus_#t~post1| 15) (<= .cse1 15) (<= 15 |plus_#t~post1|) (<= .cse2 15) (<= 15 .cse1))) (or (not (<= .cse0 14)) (and (<= 14 |plus_#t~mem0|) (<= 14 |plus_#t~post1|) (<= .cse2 14) (<= |plus_#t~post1| 14) (<= 14 .cse1) (<= |plus_#t~mem0| 14) (<= 14 .cse2) (<= .cse1 14)) (not (<= 14 .cse0))) (or (not (<= .cse0 17)) (not (<= 17 .cse0)) (and (<= 17 |plus_#t~post1|) (<= 17 .cse1) (<= .cse2 17) (<= |plus_#t~mem0| 17) (<= 17 .cse2) (<= 17 |plus_#t~mem0|) (<= .cse1 17) (<= |plus_#t~post1| 17))))) [2020-09-04 21:58:33,423 INFO L264 CegarLoopResult]: At program point L5-3(line 5) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|))) (let ((.cse3 (<= 18 .cse1)) (.cse0 (select (select |#memory_int| plus_~p.base) plus_~p.offset)) (.cse2 (select (select |old(#memory_int)| |plus_#in~p.base|) |plus_#in~p.offset|))) (and (or (and (<= 17 .cse0) (<= .cse1 17) (<= 16 |plus_#t~post1|) (<= 16 .cse1) (<= |plus_#t~post1| 16) (<= .cse0 17) (<= 16 |plus_#t~mem0|) (<= |plus_#t~mem0| 16)) (not (<= 16 .cse2)) (not (<= .cse2 16))) (or (and (= |plus_#t~mem0| 10) (<= .cse1 11) (<= .cse0 11) (= 10 |plus_#t~post1|) (<= 11 .cse0)) (not (= .cse2 10))) (or (not (<= .cse2 14)) (not (<= 14 .cse2)) (and (<= 14 |plus_#t~mem0|) (<= 14 |plus_#t~post1|) (<= |plus_#t~post1| 14) (<= |plus_#t~mem0| 14) (<= .cse0 15) (<= 14 .cse1) (<= .cse1 15) (<= 15 .cse0))) (or (and (<= .cse1 14) (<= |plus_#t~mem0| 13) (<= 14 .cse0) (<= 13 |plus_#t~post1|) (<= |plus_#t~post1| 13) (<= 13 |plus_#t~mem0|) (<= .cse0 14) (<= 13 .cse1)) (not (<= .cse2 13)) (not (<= 13 .cse2))) (or (and (<= |plus_#t~mem0| 15) (<= 15 |plus_#t~mem0|) (<= 15 .cse1) (<= 16 .cse0) (<= .cse1 16) (<= |plus_#t~post1| 15) (<= .cse0 16) (<= 15 |plus_#t~post1|)) (not (<= .cse2 15)) (not (<= 15 .cse2))) (or (and (<= 12 |plus_#t~post1|) (<= .cse0 13) (<= |plus_#t~post1| 12) (<= 12 |plus_#t~mem0|) (<= |plus_#t~mem0| 12) (<= 12 .cse1) (<= .cse1 13) (<= 13 .cse0)) (not (<= 12 .cse2)) (not (<= .cse2 12))) (or (not (<= 11 .cse2)) (not (<= .cse2 11)) (and (<= |plus_#t~mem0| 11) (<= .cse0 12) (<= 11 .cse1) (<= |plus_#t~post1| 11) (<= 11 |plus_#t~post1|) (<= 11 |plus_#t~mem0|) (<= 12 .cse0) (<= .cse1 12))) (or (not (<= .cse2 17)) (not (<= 17 .cse2)) (and (<= 17 |plus_#t~post1|) (<= .cse0 18) (<= |plus_#t~mem0| 17) (<= 17 .cse1) (<= 17 |plus_#t~mem0|) (<= .cse1 18) (<= 18 .cse0) (<= |plus_#t~post1| 17))) (or (and .cse3 (<= |plus_#t~mem0| 19) (<= 19 |plus_#t~mem0|) (= .cse0 20) (= 19 |plus_#t~post1|)) (not (<= 19 .cse2)) (not (<= .cse2 19))) (or (and .cse3 (<= 19 .cse0) (<= |plus_#t~mem0| 18) (<= 18 |plus_#t~post1|) (<= |plus_#t~post1| 18) (<= 18 |plus_#t~mem0|) (<= .cse0 19)) (not (<= 18 .cse2)) (not (<= .cse2 18)))))) [2020-09-04 21:58:33,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:58:33 BoogieIcfgContainer [2020-09-04 21:58:33,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:58:33,445 INFO L168 Benchmark]: Toolchain (without parser) took 55315.80 ms. Allocated memory was 137.4 MB in the beginning and 488.1 MB in the end (delta: 350.7 MB). Free memory was 101.4 MB in the beginning and 314.7 MB in the end (delta: -213.3 MB). Peak memory consumption was 362.9 MB. Max. memory is 7.1 GB. [2020-09-04 21:58:33,446 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 137.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 21:58:33,448 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.95 ms. Allocated memory is still 137.4 MB. Free memory was 101.2 MB in the beginning and 91.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-09-04 21:58:33,449 INFO L168 Benchmark]: Boogie Preprocessor took 124.40 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 91.5 MB in the beginning and 178.6 MB in the end (delta: -87.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2020-09-04 21:58:33,450 INFO L168 Benchmark]: RCFGBuilder took 378.40 ms. Allocated memory is still 201.3 MB. Free memory was 178.6 MB in the beginning and 162.8 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2020-09-04 21:58:33,451 INFO L168 Benchmark]: TraceAbstraction took 54479.53 ms. Allocated memory was 201.3 MB in the beginning and 488.1 MB in the end (delta: 286.8 MB). Free memory was 162.1 MB in the beginning and 314.7 MB in the end (delta: -152.6 MB). Peak memory consumption was 359.6 MB. Max. memory is 7.1 GB. [2020-09-04 21:58:33,454 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.28 ms. Allocated memory is still 137.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 326.95 ms. Allocated memory is still 137.4 MB. Free memory was 101.2 MB in the beginning and 91.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.40 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 91.5 MB in the beginning and 178.6 MB in the end (delta: -87.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 378.40 ms. Allocated memory is still 201.3 MB. Free memory was 178.6 MB in the beginning and 162.8 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 54479.53 ms. Allocated memory was 201.3 MB in the beginning and 488.1 MB in the end (delta: 286.8 MB). Free memory was 162.1 MB in the beginning and 314.7 MB in the end (delta: -152.6 MB). Peak memory consumption was 359.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: 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: 9]: Procedure Contract for foo Derived contract for procedure foo: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 4]: Procedure Contract for plus Derived contract for procedure plus: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 46.5s, OverallIterations: 11, TraceHistogramMax: 11, AutomataDifference: 33.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 327 SDtfs, 1785 SDslu, 2852 SDs, 0 SdLazy, 8448 SolverSat, 430 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1017 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 940 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27015 ImplicationChecksByTransitivity, 35.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 20 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 287 PreInvPairs, 339 NumberOfFragments, 6558 HoareAnnotationTreeSize, 287 FomulaSimplifications, 148628 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 43 FomulaSimplificationsInter, 2770 FormulaSimplificationTreeSizeReductionInter, 6.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 902 NumberOfCodeBlocks, 902 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 891 ConstructedInterpolants, 0 QuantifiedInterpolants, 492192 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 485/2145 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...