/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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.2.0-7d8eed3 [2020-11-07 05:09:31,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:09:31,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:09:31,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:09:31,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:09:31,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:09:31,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:09:31,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:09:31,587 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:09:31,588 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:09:31,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:09:31,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:09:31,591 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:09:31,592 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:09:31,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:09:31,595 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:09:31,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:09:31,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:09:31,599 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:09:31,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:09:31,603 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:09:31,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:09:31,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:09:31,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:09:31,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:09:31,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:09:31,614 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:09:31,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:09:31,616 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:09:31,617 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:09:31,617 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:09:31,618 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:09:31,619 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:09:31,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:09:31,621 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:09:31,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:09:31,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:09:31,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:09:31,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:09:31,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:09:31,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:09:31,640 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:09:31,653 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:09:31,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:09:31,655 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:09:31,656 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:09:31,656 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:09:31,656 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:09:31,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:09:31,657 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:09:31,657 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:09:31,657 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:09:31,657 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:09:31,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:09:31,658 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:09:31,658 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:09:31,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:09:31,658 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:09:31,659 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:09:31,659 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:09:31,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:09:31,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:09:31,660 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:09:31,660 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:09:31,660 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-11-07 05:09:32,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:09:32,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:09:32,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:09:32,092 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:09:32,093 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:09:32,094 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-with-pointer/simple-recursive.c [2020-11-07 05:09:32,186 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d156cdb/0ea23b1b1c114c4bb50147f5108d1450/FLAGcf8c11a2e [2020-11-07 05:09:32,904 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:09:32,905 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-with-pointer/simple-recursive.c [2020-11-07 05:09:32,913 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d156cdb/0ea23b1b1c114c4bb50147f5108d1450/FLAGcf8c11a2e [2020-11-07 05:09:33,243 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d156cdb/0ea23b1b1c114c4bb50147f5108d1450 [2020-11-07 05:09:33,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:09:33,259 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:09:33,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:09:33,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:09:33,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:09:33,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:09:33" (1/1) ... [2020-11-07 05:09:33,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e7909be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:33, skipping insertion in model container [2020-11-07 05:09:33,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:09:33" (1/1) ... [2020-11-07 05:09:33,282 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:09:33,298 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:09:33,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:09:33,481 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:09:33,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:09:33,519 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:09:33,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:33 WrapperNode [2020-11-07 05:09:33,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:09:33,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:09:33,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:09:33,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:09:33,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:33" (1/1) ... [2020-11-07 05:09:33,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:33" (1/1) ... [2020-11-07 05:09:33,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:33" (1/1) ... [2020-11-07 05:09:33,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:33" (1/1) ... [2020-11-07 05:09:33,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:33" (1/1) ... [2020-11-07 05:09:33,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:33" (1/1) ... [2020-11-07 05:09:33,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:33" (1/1) ... [2020-11-07 05:09:33,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:09:33,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:09:33,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:09:33,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:09:33,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:09:33,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:09:33,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:09:33,666 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:09:33,666 INFO L138 BoogieDeclarations]: Found implementation of procedure plus [2020-11-07 05:09:33,666 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2020-11-07 05:09:33,667 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:09:33,667 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:09:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:09:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:09:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:09:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2020-11-07 05:09:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure plus [2020-11-07 05:09:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:09:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:09:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:09:33,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:09:33,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:09:33,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:09:33,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:09:34,054 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:09:34,055 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 05:09:34,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:09:34 BoogieIcfgContainer [2020-11-07 05:09:34,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:09:34,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:09:34,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:09:34,091 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:09:34,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:09:33" (1/3) ... [2020-11-07 05:09:34,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568005e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:09:34, skipping insertion in model container [2020-11-07 05:09:34,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:33" (2/3) ... [2020-11-07 05:09:34,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568005e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:09:34, skipping insertion in model container [2020-11-07 05:09:34,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:09:34" (3/3) ... [2020-11-07 05:09:34,101 INFO L111 eAbstractionObserver]: Analyzing ICFG simple-recursive.c [2020-11-07 05:09:34,146 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:09:34,153 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:09:34,186 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:09:34,232 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:09:34,232 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:09:34,233 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:09:34,233 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:09:34,233 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:09:34,233 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:09:34,233 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:09:34,233 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:09:34,268 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2020-11-07 05:09:34,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-07 05:09:34,282 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:09:34,283 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, 1, 1, 1, 1, 1, 1] [2020-11-07 05:09:34,284 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:09:34,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:09:34,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1638199885, now seen corresponding path program 1 times [2020-11-07 05:09:34,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:09:34,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1724660511] [2020-11-07 05:09:34,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:09:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:34,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:09:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:34,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:09:34,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1724660511] [2020-11-07 05:09:34,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:09:34,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 05:09:34,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127958146] [2020-11-07 05:09:34,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:09:34,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:09:34,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:09:34,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:09:34,907 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 7 states. [2020-11-07 05:09:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:09:35,357 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2020-11-07 05:09:35,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:09:35,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-11-07 05:09:35,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:09:35,370 INFO L225 Difference]: With dead ends: 75 [2020-11-07 05:09:35,370 INFO L226 Difference]: Without dead ends: 43 [2020-11-07 05:09:35,375 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:09:35,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-11-07 05:09:35,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2020-11-07 05:09:35,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-07 05:09:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2020-11-07 05:09:35,431 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 28 [2020-11-07 05:09:35,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:09:35,432 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2020-11-07 05:09:35,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:09:35,432 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2020-11-07 05:09:35,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-07 05:09:35,434 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:09:35,434 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, 1, 1, 1, 1, 1, 1] [2020-11-07 05:09:35,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:09:35,435 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:09:35,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:09:35,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1455572344, now seen corresponding path program 1 times [2020-11-07 05:09:35,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:09:35,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [966038203] [2020-11-07 05:09:35,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:09:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:35,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:09:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:09:35,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [966038203] [2020-11-07 05:09:35,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:09:35,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 05:09:35,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887783720] [2020-11-07 05:09:35,728 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 05:09:35,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:09:35,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 05:09:35,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:09:35,731 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 14 states. [2020-11-07 05:09:36,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:09:36,644 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2020-11-07 05:09:36,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 05:09:36,644 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2020-11-07 05:09:36,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:09:36,647 INFO L225 Difference]: With dead ends: 62 [2020-11-07 05:09:36,647 INFO L226 Difference]: Without dead ends: 55 [2020-11-07 05:09:36,649 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2020-11-07 05:09:36,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-11-07 05:09:36,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-11-07 05:09:36,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-07 05:09:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2020-11-07 05:09:36,667 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 40 [2020-11-07 05:09:36,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:09:36,668 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2020-11-07 05:09:36,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 05:09:36,668 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2020-11-07 05:09:36,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-07 05:09:36,670 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:09:36,671 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, 1, 1, 1, 1, 1, 1] [2020-11-07 05:09:36,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:09:36,671 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:09:36,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:09:36,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1575157181, now seen corresponding path program 2 times [2020-11-07 05:09:36,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:09:36,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [864411266] [2020-11-07 05:09:36,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:09:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:37,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:09:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:37,097 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:09:37,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [864411266] [2020-11-07 05:09:37,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:09:37,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-11-07 05:09:37,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271721187] [2020-11-07 05:09:37,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 05:09:37,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:09:37,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 05:09:37,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2020-11-07 05:09:37,102 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 20 states. [2020-11-07 05:09:38,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:09:38,720 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2020-11-07 05:09:38,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-07 05:09:38,721 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2020-11-07 05:09:38,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:09:38,724 INFO L225 Difference]: With dead ends: 74 [2020-11-07 05:09:38,724 INFO L226 Difference]: Without dead ends: 67 [2020-11-07 05:09:38,726 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=282, Invalid=1440, Unknown=0, NotChecked=0, Total=1722 [2020-11-07 05:09:38,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-11-07 05:09:38,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2020-11-07 05:09:38,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-07 05:09:38,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2020-11-07 05:09:38,747 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 52 [2020-11-07 05:09:38,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:09:38,747 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2020-11-07 05:09:38,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 05:09:38,747 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2020-11-07 05:09:38,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-07 05:09:38,749 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:09:38,750 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, 1, 1, 1, 1, 1, 1] [2020-11-07 05:09:38,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:09:38,750 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:09:38,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:09:38,751 INFO L82 PathProgramCache]: Analyzing trace with hash -721450626, now seen corresponding path program 3 times [2020-11-07 05:09:38,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:09:38,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1988739535] [2020-11-07 05:09:38,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:09:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:39,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:09:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:39,354 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:09:39,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1988739535] [2020-11-07 05:09:39,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:09:39,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-11-07 05:09:39,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453903963] [2020-11-07 05:09:39,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-11-07 05:09:39,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:09:39,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-07 05:09:39,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2020-11-07 05:09:39,358 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 26 states. [2020-11-07 05:09:41,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:09:41,642 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2020-11-07 05:09:41,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-11-07 05:09:41,643 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 64 [2020-11-07 05:09:41,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:09:41,645 INFO L225 Difference]: With dead ends: 86 [2020-11-07 05:09:41,645 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 05:09:41,647 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=491, Invalid=2701, Unknown=0, NotChecked=0, Total=3192 [2020-11-07 05:09:41,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 05:09:41,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2020-11-07 05:09:41,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-07 05:09:41,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2020-11-07 05:09:41,668 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 64 [2020-11-07 05:09:41,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:09:41,669 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2020-11-07 05:09:41,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-11-07 05:09:41,669 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2020-11-07 05:09:41,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-07 05:09:41,672 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:09:41,672 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, 1, 1, 1, 1, 1, 1] [2020-11-07 05:09:41,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:09:41,673 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:09:41,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:09:41,673 INFO L82 PathProgramCache]: Analyzing trace with hash -712896455, now seen corresponding path program 4 times [2020-11-07 05:09:41,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:09:41,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1589414271] [2020-11-07 05:09:41,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:09:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:42,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:09:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:42,462 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:09:42,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1589414271] [2020-11-07 05:09:42,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:09:42,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2020-11-07 05:09:42,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066024134] [2020-11-07 05:09:42,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-11-07 05:09:42,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:09:42,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-11-07 05:09:42,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2020-11-07 05:09:42,467 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 32 states. [2020-11-07 05:09:45,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:09:45,596 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2020-11-07 05:09:45,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2020-11-07 05:09:45,598 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 76 [2020-11-07 05:09:45,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:09:45,600 INFO L225 Difference]: With dead ends: 98 [2020-11-07 05:09:45,601 INFO L226 Difference]: Without dead ends: 91 [2020-11-07 05:09:45,607 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=757, Invalid=4355, Unknown=0, NotChecked=0, Total=5112 [2020-11-07 05:09:45,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-11-07 05:09:45,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2020-11-07 05:09:45,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-11-07 05:09:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2020-11-07 05:09:45,634 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 76 [2020-11-07 05:09:45,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:09:45,635 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2020-11-07 05:09:45,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-11-07 05:09:45,635 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2020-11-07 05:09:45,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-07 05:09:45,638 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:09:45,638 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, 1, 1, 1, 1, 1, 1] [2020-11-07 05:09:45,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:09:45,639 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:09:45,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:09:45,640 INFO L82 PathProgramCache]: Analyzing trace with hash -232696204, now seen corresponding path program 5 times [2020-11-07 05:09:45,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:09:45,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1667555321] [2020-11-07 05:09:45,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:09:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:46,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:09:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:46,656 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:09:46,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1667555321] [2020-11-07 05:09:46,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:09:46,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2020-11-07 05:09:46,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906249302] [2020-11-07 05:09:46,662 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2020-11-07 05:09:46,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:09:46,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-11-07 05:09:46,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1258, Unknown=0, NotChecked=0, Total=1406 [2020-11-07 05:09:46,665 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 38 states. [2020-11-07 05:09:50,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:09:50,837 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2020-11-07 05:09:50,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2020-11-07 05:09:50,838 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 88 [2020-11-07 05:09:50,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:09:50,840 INFO L225 Difference]: With dead ends: 110 [2020-11-07 05:09:50,840 INFO L226 Difference]: Without dead ends: 103 [2020-11-07 05:09:50,843 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1621 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1080, Invalid=6402, Unknown=0, NotChecked=0, Total=7482 [2020-11-07 05:09:50,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-11-07 05:09:50,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2020-11-07 05:09:50,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-11-07 05:09:50,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2020-11-07 05:09:50,865 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 88 [2020-11-07 05:09:50,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:09:50,866 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2020-11-07 05:09:50,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2020-11-07 05:09:50,866 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2020-11-07 05:09:50,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-11-07 05:09:50,868 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:09:50,869 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, 1, 1, 1, 1, 1, 1] [2020-11-07 05:09:50,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:09:50,869 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:09:50,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:09:50,870 INFO L82 PathProgramCache]: Analyzing trace with hash -465953745, now seen corresponding path program 6 times [2020-11-07 05:09:50,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:09:50,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1762504567] [2020-11-07 05:09:50,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:09:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:52,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:09:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:52,072 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:09:52,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1762504567] [2020-11-07 05:09:52,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:09:52,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2020-11-07 05:09:52,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35701243] [2020-11-07 05:09:52,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2020-11-07 05:09:52,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:09:52,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2020-11-07 05:09:52,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1699, Unknown=0, NotChecked=0, Total=1892 [2020-11-07 05:09:52,076 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 44 states. [2020-11-07 05:09:57,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:09:57,171 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2020-11-07 05:09:57,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2020-11-07 05:09:57,172 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 100 [2020-11-07 05:09:57,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:09:57,175 INFO L225 Difference]: With dead ends: 122 [2020-11-07 05:09:57,175 INFO L226 Difference]: Without dead ends: 115 [2020-11-07 05:09:57,178 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2306 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1460, Invalid=8842, Unknown=0, NotChecked=0, Total=10302 [2020-11-07 05:09:57,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-11-07 05:09:57,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2020-11-07 05:09:57,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-11-07 05:09:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2020-11-07 05:09:57,200 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 100 [2020-11-07 05:09:57,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:09:57,200 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2020-11-07 05:09:57,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2020-11-07 05:09:57,201 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2020-11-07 05:09:57,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-11-07 05:09:57,205 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:09:57,206 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, 1, 1, 1, 1, 1, 1] [2020-11-07 05:09:57,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:09:57,206 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:09:57,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:09:57,207 INFO L82 PathProgramCache]: Analyzing trace with hash -2146885270, now seen corresponding path program 7 times [2020-11-07 05:09:57,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:09:57,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1819799555] [2020-11-07 05:09:57,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:09:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:58,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:09:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:58,777 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:09:58,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1819799555] [2020-11-07 05:09:58,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:09:58,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2020-11-07 05:09:58,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609554676] [2020-11-07 05:09:58,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 50 states [2020-11-07 05:09:58,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:09:58,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2020-11-07 05:09:58,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2206, Unknown=0, NotChecked=0, Total=2450 [2020-11-07 05:09:58,780 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 50 states. [2020-11-07 05:10:05,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:10:05,003 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2020-11-07 05:10:05,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2020-11-07 05:10:05,005 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 112 [2020-11-07 05:10:05,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:10:05,006 INFO L225 Difference]: With dead ends: 134 [2020-11-07 05:10:05,007 INFO L226 Difference]: Without dead ends: 127 [2020-11-07 05:10:05,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3111 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1897, Invalid=11675, Unknown=0, NotChecked=0, Total=13572 [2020-11-07 05:10:05,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-11-07 05:10:05,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2020-11-07 05:10:05,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-11-07 05:10:05,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2020-11-07 05:10:05,038 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 112 [2020-11-07 05:10:05,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:10:05,039 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2020-11-07 05:10:05,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2020-11-07 05:10:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2020-11-07 05:10:05,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-11-07 05:10:05,043 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:10:05,044 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, 1, 1, 1, 1, 1, 1] [2020-11-07 05:10:05,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:10:05,045 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:10:05,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:10:05,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1688938021, now seen corresponding path program 8 times [2020-11-07 05:10:05,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:10:05,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [139072683] [2020-11-07 05:10:05,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:10:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:10:06,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:10:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:10:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:10:06,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [139072683] [2020-11-07 05:10:06,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:10:06,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2020-11-07 05:10:06,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774143003] [2020-11-07 05:10:06,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 56 states [2020-11-07 05:10:06,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:10:06,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2020-11-07 05:10:06,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=2779, Unknown=0, NotChecked=0, Total=3080 [2020-11-07 05:10:06,888 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 56 states. [2020-11-07 05:10:14,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:10:14,033 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2020-11-07 05:10:14,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2020-11-07 05:10:14,034 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 124 [2020-11-07 05:10:14,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:10:14,036 INFO L225 Difference]: With dead ends: 146 [2020-11-07 05:10:14,036 INFO L226 Difference]: Without dead ends: 139 [2020-11-07 05:10:14,040 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4036 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=2391, Invalid=14901, Unknown=0, NotChecked=0, Total=17292 [2020-11-07 05:10:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-11-07 05:10:14,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2020-11-07 05:10:14,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-11-07 05:10:14,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2020-11-07 05:10:14,081 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 124 [2020-11-07 05:10:14,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:10:14,086 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2020-11-07 05:10:14,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2020-11-07 05:10:14,086 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2020-11-07 05:10:14,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-11-07 05:10:14,092 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:10:14,092 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, 1, 1, 1, 1, 1, 1] [2020-11-07 05:10:14,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:10:14,093 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:10:14,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:10:14,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1407391136, now seen corresponding path program 9 times [2020-11-07 05:10:14,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:10:14,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1918888353] [2020-11-07 05:10:14,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:10:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:10:16,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:10:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:10:16,304 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:10:16,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1918888353] [2020-11-07 05:10:16,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:10:16,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2020-11-07 05:10:16,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560909633] [2020-11-07 05:10:16,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 62 states [2020-11-07 05:10:16,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:10:16,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2020-11-07 05:10:16,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=3418, Unknown=0, NotChecked=0, Total=3782 [2020-11-07 05:10:16,307 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 62 states. [2020-11-07 05:10:25,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:10:25,798 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2020-11-07 05:10:25,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2020-11-07 05:10:25,799 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 136 [2020-11-07 05:10:25,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:10:25,802 INFO L225 Difference]: With dead ends: 158 [2020-11-07 05:10:25,802 INFO L226 Difference]: Without dead ends: 151 [2020-11-07 05:10:25,805 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5166 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=2956, Invalid=18800, Unknown=0, NotChecked=0, Total=21756 [2020-11-07 05:10:25,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-11-07 05:10:25,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2020-11-07 05:10:25,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-11-07 05:10:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2020-11-07 05:10:25,828 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 136 [2020-11-07 05:10:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:10:25,828 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2020-11-07 05:10:25,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2020-11-07 05:10:25,829 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2020-11-07 05:10:25,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-11-07 05:10:25,830 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:10:25,831 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, 1, 1, 1, 1, 1, 1] [2020-11-07 05:10:25,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:10:25,831 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:10:25,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:10:25,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1690620389, now seen corresponding path program 10 times [2020-11-07 05:10:25,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:10:25,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [68389218] [2020-11-07 05:10:25,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:10:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:10:28,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:10:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:10:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 477 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:10:29,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [68389218] [2020-11-07 05:10:29,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:10:29,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2020-11-07 05:10:29,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821489152] [2020-11-07 05:10:29,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 71 states [2020-11-07 05:10:29,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:10:29,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2020-11-07 05:10:29,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=4570, Unknown=0, NotChecked=0, Total=4970 [2020-11-07 05:10:29,015 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 71 states. [2020-11-07 05:10:37,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:10:37,713 INFO L93 Difference]: Finished difference Result 164 states and 165 transitions. [2020-11-07 05:10:37,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2020-11-07 05:10:37,713 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 148 [2020-11-07 05:10:37,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:10:37,714 INFO L225 Difference]: With dead ends: 164 [2020-11-07 05:10:37,715 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 05:10:37,719 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8651 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=3432, Invalid=24624, Unknown=0, NotChecked=0, Total=28056 [2020-11-07 05:10:37,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 05:10:37,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 05:10:37,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 05:10:37,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 05:10:37,720 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 148 [2020-11-07 05:10:37,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:10:37,720 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 05:10:37,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2020-11-07 05:10:37,721 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 05:10:37,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 05:10:37,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:10:37,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 05:10:37,917 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 53 [2020-11-07 05:10:39,163 WARN L194 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2020-11-07 05:10:39,944 WARN L194 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 131 [2020-11-07 05:10:40,854 WARN L194 SmtUtils]: Spent 903.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 140 [2020-11-07 05:10:41,583 WARN L194 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 115 [2020-11-07 05:10:41,872 WARN L194 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 77 [2020-11-07 05:10:42,096 WARN L194 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2020-11-07 05:10:43,037 WARN L194 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 153 [2020-11-07 05:10:43,802 WARN L194 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 134 [2020-11-07 05:10:44,354 WARN L194 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 115 [2020-11-07 05:10:45,083 WARN L194 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 134 [2020-11-07 05:10:45,545 WARN L194 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2020-11-07 05:10:46,143 WARN L194 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 120 [2020-11-07 05:10:46,953 WARN L194 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 153 [2020-11-07 05:10:47,495 WARN L194 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2020-11-07 05:10:48,148 WARN L194 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 126 [2020-11-07 05:10:48,154 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 05:10:48,154 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 05:10:48,154 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 05:10:48,155 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 05:10:48,155 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 05:10:48,155 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 05:10:48,155 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:10:48,155 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 05:10:48,155 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 05:10:48,156 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-11-07 05:10:48,156 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 05:10:48,156 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 05:10:48,156 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 05:10:48,157 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:10:48,157 INFO L269 CegarLoopResult]: At program point fooEXIT(lines 11 20) the Hoare annotation is: true [2020-11-07 05:10:48,157 INFO L262 CegarLoopResult]: At program point fooENTRY(lines 11 20) 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 (<= .cse0 15)) (not (<= 15 .cse0)) (and (<= 15 .cse1) (<= .cse1 15))) (or (not (<= 14 .cse0)) (and (<= .cse1 14) (<= 14 .cse1)) (not (<= .cse0 14))) (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 (<= 19 .cse0)) (and (<= 19 .cse1) (<= .cse1 19)) (not (<= .cse0 19))) (or (not (<= 12 .cse0)) (and (<= .cse1 12) (<= 12 .cse1)) (not (<= .cse0 12))))) [2020-11-07 05:10:48,158 INFO L262 CegarLoopResult]: At program point L18(line 18) 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 (<= .cse0 11)) (not (<= 11 .cse0))) (or (not (<= 19 .cse0)) (not (<= .cse0 19))) (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-11-07 05:10:48,158 INFO L262 CegarLoopResult]: At program point L18-1(line 18) 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 (<= .cse0 11)) (not (<= 11 .cse0))) (or (not (<= 19 .cse0)) (not (<= .cse0 19))) (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-11-07 05:10:48,159 INFO L262 CegarLoopResult]: At program point L14(line 14) 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 (<= .cse0 11)) (not (<= 11 .cse0))) (or (not (<= 19 .cse0)) (not (<= .cse0 19))) (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-11-07 05:10:48,159 INFO L262 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|)) (.cse0 (select (select |#memory_int| foo_~p.base) foo_~p.offset)) (.cse2 (select (select |old(#memory_int)| |foo_#in~p.base|) |foo_#in~p.offset|))) (and (or (and (<= .cse0 12) (<= .cse1 12) (<= 12 .cse1) (<= 12 .cse0)) (not (<= 12 .cse2)) (not (<= .cse2 12))) (or (not (<= 14 .cse2)) (not (<= .cse2 14)) (and (<= .cse1 14) (<= .cse0 14) (<= 14 .cse1) (<= 14 .cse0))) (or (not (<= .cse2 11)) (and (<= .cse1 11) (<= 11 .cse1) (<= .cse0 11) (<= 11 .cse0)) (not (<= 11 .cse2))) (or (not (<= 17 .cse2)) (not (<= .cse2 17)) (and (<= .cse0 17) (<= .cse1 17) (<= 17 .cse1) (<= 17 .cse0))) (not (= .cse2 20)) (or (not (<= .cse2 15)) (and (<= 15 .cse1) (<= .cse1 15) (<= 15 .cse0) (<= .cse0 15)) (not (<= 15 .cse2))) (or (not (<= .cse2 13)) (and (<= .cse1 13) (<= .cse0 13) (<= 13 .cse0) (<= 13 .cse1)) (not (<= 13 .cse2))) (or (not (= .cse2 10)) (and (= .cse0 10) (= 10 .cse1))) (or (not (<= 19 .cse2)) (and (<= 19 .cse1) (= 19 .cse0)) (not (<= .cse2 19))) (or (and (<= .cse1 18) (<= .cse0 18) (<= 18 .cse1) (<= 18 .cse0)) (not (<= 18 .cse2)) (not (<= .cse2 18))) (or (not (<= 16 .cse2)) (and (<= 16 .cse0) (<= 16 .cse1) (<= .cse1 16) (<= .cse0 16)) (not (<= .cse2 16))))) [2020-11-07 05:10:48,160 INFO L262 CegarLoopResult]: At program point L14-1(lines 14 19) 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 (<= .cse0 11)) (not (<= 11 .cse0))) (or (not (<= 19 .cse0)) (not (<= .cse0 19))) (or (not (<= 17 .cse0)) (not (<= .cse0 17))) (or (not (<= 14 .cse0)) (not (<= .cse0 14))) (or (not (<= .cse0 13)) (not (<= 13 .cse0))) (or (not (= .cse0 20)) (and (= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 20) (= |foo_#t~mem10| 20) (= 20 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|)))) (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-11-07 05:10:48,160 INFO L262 CegarLoopResult]: At program point L12(line 12) 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 (not (<= .cse0 11)) (and (<= .cse1 11) (<= 11 .cse1) (<= .cse2 11) (<= 11 .cse2)) (not (<= 11 .cse0))) (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 (<= 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-11-07 05:10:48,160 INFO L262 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: (not (= (select (select |old(#memory_int)| |foo_#in~p.base|) |foo_#in~p.offset|) 10)) [2020-11-07 05:10:48,161 INFO L262 CegarLoopResult]: At program point L12-1(lines 12 19) the Hoare annotation is: (let ((.cse3 (< 18 |foo_#t~mem9|)) (.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|)) (.cse1 (select (select |#memory_int| foo_~p.base) foo_~p.offset))) (and (or (not (<= 12 .cse0)) (not (<= .cse0 12)) (and (<= |foo_#t~mem9| 12) (<= .cse1 12) (<= .cse2 12) (<= 12 .cse2) (<= 12 .cse1))) (or (not (= .cse0 10)) (and (= .cse1 10) (= |foo_#t~mem9| 10) (= 10 .cse2))) (or (and (<= .cse2 18) (<= .cse1 18) (<= 18 .cse2) (<= 18 .cse1) (<= |foo_#t~mem9| 18)) (not (<= 18 .cse0)) (not (<= .cse0 18))) (or (not (<= .cse0 13)) (and (<= .cse2 13) (<= .cse1 13) (<= 13 .cse1) (<= 13 .cse2) (<= |foo_#t~mem9| 13)) (not (<= 13 .cse0))) (or (not (<= 14 .cse0)) (and (<= .cse2 14) (<= |foo_#t~mem9| 14) (<= .cse1 14) (<= 14 .cse2) (<= 14 .cse1)) (not (<= .cse0 14))) (or (not (<= 16 .cse0)) (and (<= 16 .cse1) (<= |foo_#t~mem9| 16) (<= 16 .cse2) (<= .cse2 16) (<= .cse1 16)) (not (<= .cse0 16))) (or (not (<= 17 .cse0)) (and (<= .cse1 17) (<= .cse2 17) (<= |foo_#t~mem9| 17) (<= 17 .cse2) (<= 17 .cse1)) (not (<= .cse0 17))) (or (not (<= .cse0 15)) (not (<= 15 .cse0)) (and (<= 15 .cse2) (<= |foo_#t~mem9| 15) (<= .cse2 15) (<= 15 .cse1) (<= .cse1 15))) (or (and (= .cse1 20) .cse3 (not (= 19 |foo_#t~mem9|)) (= 20 .cse2)) (not (= .cse0 20))) (or (not (<= 19 .cse0)) (and (<= |foo_#t~mem9| 19) (<= 19 .cse2) .cse3 (<= 19 .cse1) (<= .cse1 19) (<= .cse2 19)) (not (<= .cse0 19))) (or (not (<= .cse0 11)) (not (<= 11 .cse0)) (and (<= .cse2 11) (<= 11 .cse2) (<= .cse1 11) (<= 11 .cse1) (<= |foo_#t~mem9| 11))))) [2020-11-07 05:10:48,161 INFO L262 CegarLoopResult]: At program point L14-3(line 14) 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 (<= .cse0 11)) (not (<= 11 .cse0))) (or (not (<= 19 .cse0)) (not (<= .cse0 19))) (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-11-07 05:10:48,161 INFO L262 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: (let ((.cse3 (<= |foo_#t~mem9| 19)) (.cse2 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|)) (.cse1 (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 (<= 16 .cse0)) (and (<= |foo_#t~mem9| 17) (<= 16 .cse1) (<= 16 .cse2) (<= .cse2 16) (<= .cse1 16)) (not (<= .cse0 16))) (or (not (<= 17 .cse0)) (and (<= .cse1 17) (<= .cse2 17) (<= 17 .cse2) (<= |foo_#t~mem9| 18) (<= 17 .cse1)) (not (<= .cse0 17))) (not (= .cse0 20)) (or (not (<= 19 .cse0)) (and .cse3 (<= 19 .cse2) (= 19 .cse1) (< 18 |foo_#t~mem9|)) (not (<= .cse0 19))) (or (not (= .cse0 10)) (and (= .cse1 10) (= 10 .cse2) (<= |foo_#t~mem9| 11))) (or (not (<= .cse0 13)) (and (<= .cse2 13) (<= |foo_#t~mem9| 14) (<= .cse1 13) (<= 13 .cse1) (<= 13 .cse2)) (not (<= 13 .cse0))) (or (not (<= 12 .cse0)) (and (<= .cse1 12) (<= .cse2 12) (<= 12 .cse2) (<= 12 .cse1) (<= |foo_#t~mem9| 13)) (not (<= .cse0 12))) (or (and (<= .cse2 11) (<= |foo_#t~mem9| 12) (<= 11 .cse2) (<= .cse1 11) (<= 11 .cse1)) (not (<= .cse0 11)) (not (<= 11 .cse0))) (or (not (<= 14 .cse0)) (not (<= .cse0 14)) (and (<= .cse2 14) (<= |foo_#t~mem9| 15) (<= .cse1 14) (<= 14 .cse2) (<= 14 .cse1))) (or (not (<= .cse0 15)) (and (<= 15 .cse2) (<= .cse2 15) (<= 15 .cse1) (<= .cse1 15) (<= |foo_#t~mem9| 16)) (not (<= 15 .cse0))) (or (not (<= 18 .cse0)) (and .cse3 (<= .cse2 18) (<= .cse1 18) (<= 18 .cse2) (<= 18 .cse1)) (not (<= .cse0 18))))) [2020-11-07 05:10:48,162 INFO L262 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 (<= .cse0 11)) (not (<= 11 .cse0))) (or (not (<= 19 .cse0)) (not (<= .cse0 19))) (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 (and (= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 20) (< 18 |foo_#t~mem9|) (not (= 19 |foo_#t~mem9|)) (= 20 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))) (not (= .cse0 20))) (or (not (<= 18 .cse0)) (not (<= .cse0 18))) (or (not (<= 12 .cse0)) (not (<= .cse0 12))))) [2020-11-07 05:10:48,162 INFO L269 CegarLoopResult]: At program point L12-4(lines 11 20) the Hoare annotation is: true [2020-11-07 05:10:48,162 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:10:48,162 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:10:48,162 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 05:10:48,162 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 05:10:48,163 INFO L262 CegarLoopResult]: At program point mainENTRY(lines 22 28) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2020-11-07 05:10:48,163 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 22 28) the Hoare annotation is: true [2020-11-07 05:10:48,163 INFO L269 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-11-07 05:10:48,163 INFO L269 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-11-07 05:10:48,163 INFO L262 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10) [2020-11-07 05:10:48,163 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 22 28) the Hoare annotation is: true [2020-11-07 05:10:48,163 INFO L262 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2020-11-07 05:10:48,164 INFO L269 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: true [2020-11-07 05:10:48,164 INFO L262 CegarLoopResult]: At program point L22(lines 22 28) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2020-11-07 05:10:48,164 INFO L269 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: true [2020-11-07 05:10:48,164 INFO L269 CegarLoopResult]: At program point L24-3(line 24) the Hoare annotation is: true [2020-11-07 05:10:48,164 INFO L269 CegarLoopResult]: At program point plusFINAL(lines 6 9) the Hoare annotation is: true [2020-11-07 05:10:48,165 INFO L262 CegarLoopResult]: At program point plusENTRY(lines 6 9) 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 (= 19 .cse0) (not (= 19 .cse1))) (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 (and (<= 18 .cse0) (<= .cse0 18)) (not (<= 18 .cse1)) (not (<= .cse1 18))))) [2020-11-07 05:10:48,165 INFO L269 CegarLoopResult]: At program point plusEXIT(lines 6 9) the Hoare annotation is: true [2020-11-07 05:10:48,165 INFO L262 CegarLoopResult]: At program point L8(line 8) 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 (not (<= .cse0 14)) (and (<= .cse1 15) (<= 14 .cse2) (<= .cse2 15) (<= 15 .cse1)) (not (<= 14 .cse0))) (or (not (= 19 .cse0)) (and .cse3 (= .cse1 20))) (or (and (<= 17 .cse1) (<= .cse2 17) (<= 16 .cse2) (<= .cse1 17)) (not (<= 16 .cse0)) (not (<= .cse0 16))) (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 (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-11-07 05:10:48,166 INFO L262 CegarLoopResult]: At program point L7(line 7) 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 (and (<= .cse1 18) (<= 18 .cse2) (<= .cse2 18) (<= 18 .cse1)) (not (<= 18 .cse0)) (not (<= .cse0 18))) (or (not (<= 12 .cse0)) (not (<= .cse0 12)) (and (<= .cse1 12) (<= 12 .cse2) (<= 12 .cse1) (<= .cse2 12))) (or (and (<= .cse1 13) (<= 13 .cse2) (<= .cse2 13) (<= 13 .cse1)) (not (<= .cse0 13)) (not (<= 13 .cse0))) (or (not (= 19 .cse0)) (and (= 19 .cse2) (= 19 .cse1))) (or (not (<= .cse0 15)) (not (<= 15 .cse0)) (and (<= 15 .cse2) (<= .cse1 15) (<= .cse2 15) (<= 15 .cse1))) (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-11-07 05:10:48,166 INFO L262 CegarLoopResult]: At program point L7-1(line 7) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|)) (.cse2 (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 14)) (and (<= .cse1 14) (<= 14 .cse2) (<= 14 .cse1) (<= .cse2 14) (<= 14 |plus_#t~mem7|) (<= |plus_#t~mem7| 14)) (not (<= 14 .cse0))) (or (not (<= 18 .cse0)) (and (<= .cse2 18) (<= 18 .cse1) (<= .cse1 18) (<= 18 .cse2) (<= 18 |plus_#t~mem7|) (<= |plus_#t~mem7| 18)) (not (<= .cse0 18))) (or (not (<= .cse0 17)) (and (<= 17 .cse2) (<= .cse1 17) (<= 17 .cse1) (<= |plus_#t~mem7| 17) (<= .cse2 17) (<= 17 |plus_#t~mem7|)) (not (<= 17 .cse0))) (or (not (<= 12 .cse0)) (not (<= .cse0 12)) (and (<= .cse2 12) (<= |plus_#t~mem7| 12) (<= 12 .cse1) (<= 12 |plus_#t~mem7|) (<= 12 .cse2) (<= .cse1 12))) (or (not (<= 11 .cse0)) (not (<= .cse0 11)) (and (<= 11 |plus_#t~mem7|) (<= 11 .cse1) (<= .cse1 11) (<= |plus_#t~mem7| 11) (<= .cse2 11) (<= 11 .cse2))) (or (and (<= |plus_#t~mem7| 16) (<= 16 .cse2) (<= 16 .cse1) (<= .cse1 16) (<= .cse2 16) (<= 16 |plus_#t~mem7|)) (not (<= 16 .cse0)) (not (<= .cse0 16))) (or (and (= .cse2 10) (= |plus_#t~mem7| 10) (= .cse1 10)) (not (= .cse0 10))) (or (and (<= 15 .cse1) (<= 15 |plus_#t~mem7|) (<= .cse2 15) (<= .cse1 15) (<= 15 .cse2) (<= |plus_#t~mem7| 15)) (not (<= .cse0 15)) (not (<= 15 .cse0))) (or (not (<= .cse0 13)) (and (<= |plus_#t~mem7| 13) (<= .cse2 13) (<= 13 |plus_#t~mem7|) (<= 13 .cse1) (<= .cse1 13) (<= 13 .cse2)) (not (<= 13 .cse0))) (or (and (= 19 .cse1) (= 19 .cse2) (= 19 |plus_#t~mem7|)) (not (= 19 .cse0))))) [2020-11-07 05:10:48,167 INFO L262 CegarLoopResult]: At program point L7-2(line 7) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|)) (.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 (<= |plus_#t~mem7| 13) (<= |plus_#t~post8| 13) (<= 13 |plus_#t~post8|) (<= .cse0 13) (<= 13 |plus_#t~mem7|) (<= 13 .cse1) (<= .cse1 13) (<= 13 .cse0)) (not (<= .cse2 13)) (not (<= 13 .cse2))) (or (and (= .cse0 10) (= 10 |plus_#t~post8|) (= |plus_#t~mem7| 10) (= .cse1 10)) (not (= .cse2 10))) (or (not (<= .cse2 17)) (and (<= 17 .cse0) (<= .cse1 17) (<= 17 .cse1) (<= |plus_#t~post8| 17) (<= |plus_#t~mem7| 17) (<= .cse0 17) (<= 17 |plus_#t~mem7|) (<= 17 |plus_#t~post8|)) (not (<= 17 .cse2))) (or (not (<= 12 .cse2)) (and (<= .cse0 12) (<= |plus_#t~mem7| 12) (<= 12 |plus_#t~post8|) (<= |plus_#t~post8| 12) (<= 12 .cse1) (<= 12 |plus_#t~mem7|) (<= 12 .cse0) (<= .cse1 12)) (not (<= .cse2 12))) (or (not (<= .cse2 14)) (and (<= 14 |plus_#t~post8|) (<= .cse1 14) (<= 14 .cse0) (<= 14 .cse1) (<= |plus_#t~post8| 14) (<= .cse0 14) (<= 14 |plus_#t~mem7|) (<= |plus_#t~mem7| 14)) (not (<= 14 .cse2))) (or (and (= 19 .cse1) (= 19 |plus_#t~post8|) (= 19 .cse0) (= 19 |plus_#t~mem7|)) (not (= 19 .cse2))) (or (and (<= |plus_#t~mem7| 16) (<= 16 .cse0) (<= 16 .cse1) (<= .cse1 16) (<= .cse0 16) (<= |plus_#t~post8| 16) (<= 16 |plus_#t~mem7|) (<= 16 |plus_#t~post8|)) (not (<= 16 .cse2)) (not (<= .cse2 16))) (or (not (<= 11 .cse2)) (and (<= 11 |plus_#t~mem7|) (<= 11 .cse1) (<= .cse1 11) (<= |plus_#t~post8| 11) (<= |plus_#t~mem7| 11) (<= 11 |plus_#t~post8|) (<= .cse0 11) (<= 11 .cse0)) (not (<= .cse2 11))) (or (not (<= 18 .cse2)) (not (<= .cse2 18)) (and (<= .cse0 18) (<= 18 .cse1) (<= .cse1 18) (<= 18 .cse0) (<= |plus_#t~post8| 18) (<= 18 |plus_#t~mem7|) (<= |plus_#t~mem7| 18) (<= 18 |plus_#t~post8|))) (or (and (<= 15 .cse1) (<= 15 |plus_#t~post8|) (<= 15 |plus_#t~mem7|) (<= .cse0 15) (<= .cse1 15) (<= 15 .cse0) (<= |plus_#t~mem7| 15) (<= |plus_#t~post8| 15)) (not (<= .cse2 15)) (not (<= 15 .cse2))))) [2020-11-07 05:10:48,168 INFO L262 CegarLoopResult]: At program point L7-3(line 7) 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 (<= .cse0 11) (= 10 |plus_#t~post8|) (<= .cse1 11) (= |plus_#t~mem7| 10) (<= 11 .cse1)) (not (= .cse2 10))) (or (not (<= 12 .cse2)) (not (<= .cse2 12)) (and (<= .cse1 13) (<= |plus_#t~mem7| 12) (<= 12 |plus_#t~post8|) (<= |plus_#t~post8| 12) (<= 12 .cse0) (<= 12 |plus_#t~mem7|) (<= .cse0 13) (<= 13 .cse1))) (or (and (<= 17 .cse1) (<= |plus_#t~mem7| 16) (<= .cse0 17) (<= 16 .cse0) (<= |plus_#t~post8| 16) (<= 16 |plus_#t~mem7|) (<= 16 |plus_#t~post8|) (<= .cse1 17)) (not (<= 16 .cse2)) (not (<= .cse2 16))) (or (not (<= 18 .cse2)) (not (<= .cse2 18)) (and .cse3 (<= 19 .cse1) (<= |plus_#t~post8| 18) (<= 18 |plus_#t~mem7|) (<= |plus_#t~mem7| 18) (<= 18 |plus_#t~post8|) (<= .cse1 19))) (or (and .cse3 (= 19 |plus_#t~post8|) (= 19 |plus_#t~mem7|) (= .cse1 20)) (not (= 19 .cse2))) (or (not (<= .cse2 15)) (not (<= 15 .cse2)) (and (<= 15 .cse0) (<= 16 .cse1) (<= 15 |plus_#t~post8|) (<= 15 |plus_#t~mem7|) (<= .cse0 16) (<= .cse1 16) (<= |plus_#t~mem7| 15) (<= |plus_#t~post8| 15))) (or (not (<= .cse2 17)) (not (<= 17 .cse2)) (and (<= .cse1 18) (<= 17 .cse0) (<= |plus_#t~post8| 17) (<= .cse0 18) (<= 18 .cse1) (<= |plus_#t~mem7| 17) (<= 17 |plus_#t~mem7|) (<= 17 |plus_#t~post8|))) (or (and (<= |plus_#t~mem7| 13) (<= |plus_#t~post8| 13) (<= 13 |plus_#t~post8|) (<= .cse0 14) (<= 14 .cse1) (<= 13 |plus_#t~mem7|) (<= .cse1 14) (<= 13 .cse0)) (not (<= .cse2 13)) (not (<= 13 .cse2))) (or (not (<= 11 .cse2)) (and (<= 11 |plus_#t~mem7|) (<= .cse1 12) (<= 11 .cse0) (<= |plus_#t~post8| 11) (<= |plus_#t~mem7| 11) (<= 11 |plus_#t~post8|) (<= 12 .cse1) (<= .cse0 12)) (not (<= .cse2 11))) (or (not (<= .cse2 14)) (and (<= 14 |plus_#t~post8|) (<= .cse1 15) (<= 14 .cse0) (<= |plus_#t~post8| 14) (<= .cse0 15) (<= 15 .cse1) (<= 14 |plus_#t~mem7|) (<= |plus_#t~mem7| 14)) (not (<= 14 .cse2)))))) [2020-11-07 05:10:48,169 INFO L262 CegarLoopResult]: At program point L7-4(line 7) 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 (<= .cse0 17)) (and (<= .cse1 18) (<= 17 .cse2) (<= .cse2 18) (<= 18 .cse1) (<= |plus_#t~mem7| 17) (<= 17 |plus_#t~mem7|)) (not (<= 17 .cse0))) (or (not (<= 12 .cse0)) (not (<= .cse0 12)) (and (<= .cse1 13) (<= |plus_#t~mem7| 12) (<= 12 .cse2) (<= 12 |plus_#t~mem7|) (<= .cse2 13) (<= 13 .cse1))) (or (not (<= .cse0 14)) (not (<= 14 .cse0)) (and (<= .cse1 15) (<= 14 .cse2) (<= .cse2 15) (<= 15 .cse1) (<= 14 |plus_#t~mem7|) (<= |plus_#t~mem7| 14))) (or (not (<= .cse0 13)) (and (<= |plus_#t~mem7| 13) (<= .cse2 14) (<= 14 .cse1) (<= 13 |plus_#t~mem7|) (<= .cse1 14) (<= 13 .cse2)) (not (<= 13 .cse0))) (or (and (<= 15 .cse2) (<= 16 .cse1) (<= 15 |plus_#t~mem7|) (<= .cse2 16) (<= .cse1 16) (<= |plus_#t~mem7| 15)) (not (<= .cse0 15)) (not (<= 15 .cse0))) (or (not (<= 11 .cse0)) (and (<= 11 |plus_#t~mem7|) (<= .cse1 12) (<= 11 .cse2) (<= |plus_#t~mem7| 11) (<= 12 .cse1) (<= .cse2 12)) (not (<= .cse0 11))) (or (and (<= 17 .cse1) (<= |plus_#t~mem7| 16) (<= .cse2 17) (<= 16 .cse2) (<= 16 |plus_#t~mem7|) (<= .cse1 17)) (not (<= 16 .cse0)) (not (<= .cse0 16))) (or (and (<= .cse2 11) (<= .cse1 11) (= |plus_#t~mem7| 10) (<= 11 .cse1)) (not (= .cse0 10))) (or (and .cse3 (<= 19 .cse1) (<= 18 |plus_#t~mem7|) (<= |plus_#t~mem7| 18) (<= .cse1 19)) (not (<= 18 .cse0)) (not (<= .cse0 18))) (or (and .cse3 (= 19 |plus_#t~mem7|) (= .cse1 20)) (not (= 19 .cse0)))))) [2020-11-07 05:10:48,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:10:48 BoogieIcfgContainer [2020-11-07 05:10:48,182 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:10:48,184 INFO L168 Benchmark]: Toolchain (without parser) took 74931.03 ms. Allocated memory was 156.2 MB in the beginning and 270.5 MB in the end (delta: 114.3 MB). Free memory was 132.9 MB in the beginning and 170.8 MB in the end (delta: -37.9 MB). Peak memory consumption was 160.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:10:48,184 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 125.8 MB. Free memory is still 102.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:10:48,185 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.89 ms. Allocated memory is still 156.2 MB. Free memory was 132.3 MB in the beginning and 123.4 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:10:48,186 INFO L168 Benchmark]: Boogie Preprocessor took 38.92 ms. Allocated memory is still 156.2 MB. Free memory was 123.4 MB in the beginning and 122.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:10:48,187 INFO L168 Benchmark]: RCFGBuilder took 500.07 ms. Allocated memory is still 156.2 MB. Free memory was 122.0 MB in the beginning and 140.0 MB in the end (delta: -18.0 MB). Peak memory consumption was 19.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:10:48,187 INFO L168 Benchmark]: TraceAbstraction took 74114.28 ms. Allocated memory was 156.2 MB in the beginning and 270.5 MB in the end (delta: 114.3 MB). Free memory was 139.5 MB in the beginning and 170.8 MB in the end (delta: -31.2 MB). Peak memory consumption was 165.9 MB. Max. memory is 8.0 GB. [2020-11-07 05:10:48,191 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 125.8 MB. Free memory is still 102.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 259.89 ms. Allocated memory is still 156.2 MB. Free memory was 132.3 MB in the beginning and 123.4 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 38.92 ms. Allocated memory is still 156.2 MB. Free memory was 123.4 MB in the beginning and 122.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 500.07 ms. Allocated memory is still 156.2 MB. Free memory was 122.0 MB in the beginning and 140.0 MB in the end (delta: -18.0 MB). Peak memory consumption was 19.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 74114.28 ms. Allocated memory was 156.2 MB in the beginning and 270.5 MB in the end (delta: 114.3 MB). Free memory was 139.5 MB in the beginning and 170.8 MB in the end (delta: -31.2 MB). Peak memory consumption was 165.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for foo Derived contract for procedure foo: 1 - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for plus Derived contract for procedure plus: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 63.4s, OverallIterations: 11, TraceHistogramMax: 11, AutomataDifference: 49.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 392 SDtfs, 1852 SDslu, 3684 SDs, 0 SdLazy, 8071 SolverSat, 452 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1017 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 940 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26925 ImplicationChecksByTransitivity, 52.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred 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, 52 LocationsWithAnnotation, 336 PreInvPairs, 388 NumberOfFragments, 6474 HoareAnnotationTreeSize, 336 FomulaSimplifications, 319652 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 52 FomulaSimplificationsInter, 6554 FormulaSimplificationTreeSizeReductionInter, 9.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 968 NumberOfCodeBlocks, 968 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 957 ConstructedInterpolants, 0 QuantifiedInterpolants, 541638 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 477/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...