/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/array-lopstr16/flag_loopdep.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:47:07,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:47:07,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:47:07,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:47:07,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:47:07,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:47:07,982 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:47:07,996 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:47:07,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:47:07,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:47:08,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:47:08,004 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:47:08,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:47:08,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:47:08,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:47:08,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:47:08,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:47:08,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:47:08,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:47:08,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:47:08,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:47:08,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:47:08,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:47:08,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:47:08,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:47:08,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:47:08,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:47:08,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:47:08,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:47:08,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:47:08,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:47:08,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:47:08,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:47:08,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:47:08,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:47:08,043 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:47:08,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:47:08,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:47:08,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:47:08,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:47:08,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:47:08,049 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:47:08,064 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:47:08,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:47:08,067 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:47:08,067 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:47:08,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:47:08,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:47:08,068 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:47:08,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:47:08,068 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:47:08,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:47:08,069 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:47:08,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:47:08,070 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:47:08,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:47:08,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:47:08,071 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:47:08,071 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:47:08,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:47:08,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:08,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:47:08,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:47:08,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:47:08,072 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:47:08,361 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:47:08,378 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:47:08,381 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:47:08,383 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:47:08,383 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:47:08,384 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-lopstr16/flag_loopdep.i [2020-07-18 00:47:08,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a3fcf7f1/d1fd7e2c82d34a03afae8b7334b7440f/FLAGf3fe461c3 [2020-07-18 00:47:08,938 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:47:08,939 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-lopstr16/flag_loopdep.i [2020-07-18 00:47:08,946 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a3fcf7f1/d1fd7e2c82d34a03afae8b7334b7440f/FLAGf3fe461c3 [2020-07-18 00:47:09,327 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a3fcf7f1/d1fd7e2c82d34a03afae8b7334b7440f [2020-07-18 00:47:09,336 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:47:09,340 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:47:09,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:09,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:47:09,344 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:47:09,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:09" (1/1) ... [2020-07-18 00:47:09,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fccddc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:09, skipping insertion in model container [2020-07-18 00:47:09,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:09" (1/1) ... [2020-07-18 00:47:09,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:47:09,376 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:47:09,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:09,569 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:47:09,602 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:09,622 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:47:09,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:09 WrapperNode [2020-07-18 00:47:09,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:09,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:47:09,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:47:09,623 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:47:09,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:09" (1/1) ... [2020-07-18 00:47:09,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:09" (1/1) ... [2020-07-18 00:47:09,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:09" (1/1) ... [2020-07-18 00:47:09,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:09" (1/1) ... [2020-07-18 00:47:09,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:09" (1/1) ... [2020-07-18 00:47:09,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:09" (1/1) ... [2020-07-18 00:47:09,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:09" (1/1) ... [2020-07-18 00:47:09,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:47:09,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:47:09,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:47:09,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:47:09,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:09,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:47:09,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:47:09,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:47:09,815 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2020-07-18 00:47:09,815 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:47:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:47:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:47:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 00:47:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_pointer [2020-07-18 00:47:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-07-18 00:47:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 00:47:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-18 00:47:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:47:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 00:47:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-18 00:47:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:47:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:47:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:47:10,204 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:47:10,205 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-18 00:47:10,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:10 BoogieIcfgContainer [2020-07-18 00:47:10,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:47:10,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:47:10,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:47:10,214 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:47:10,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:47:09" (1/3) ... [2020-07-18 00:47:10,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a125da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:10, skipping insertion in model container [2020-07-18 00:47:10,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:09" (2/3) ... [2020-07-18 00:47:10,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a125da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:10, skipping insertion in model container [2020-07-18 00:47:10,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:10" (3/3) ... [2020-07-18 00:47:10,218 INFO L109 eAbstractionObserver]: Analyzing ICFG flag_loopdep.i [2020-07-18 00:47:10,229 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:47:10,237 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:47:10,260 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:47:10,280 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:47:10,281 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:47:10,281 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:47:10,281 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:47:10,281 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:47:10,281 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:47:10,281 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:47:10,282 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:47:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2020-07-18 00:47:10,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-18 00:47:10,309 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:10,310 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, 1] [2020-07-18 00:47:10,311 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:10,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:10,317 INFO L82 PathProgramCache]: Analyzing trace with hash -2004589429, now seen corresponding path program 1 times [2020-07-18 00:47:10,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:10,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [634300234] [2020-07-18 00:47:10,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:10,572 INFO L280 TraceCheckUtils]: 0: Hoare triple {73#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {59#true} is VALID [2020-07-18 00:47:10,573 INFO L280 TraceCheckUtils]: 1: Hoare triple {59#true} #valid := #valid[0 := 0]; {59#true} is VALID [2020-07-18 00:47:10,574 INFO L280 TraceCheckUtils]: 2: Hoare triple {59#true} assume 0 < #StackHeapBarrier; {59#true} is VALID [2020-07-18 00:47:10,574 INFO L280 TraceCheckUtils]: 3: Hoare triple {59#true} assume true; {59#true} is VALID [2020-07-18 00:47:10,575 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {59#true} {59#true} #103#return; {59#true} is VALID [2020-07-18 00:47:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:10,615 INFO L280 TraceCheckUtils]: 0: Hoare triple {74#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {59#true} is VALID [2020-07-18 00:47:10,615 INFO L280 TraceCheckUtils]: 1: Hoare triple {59#true} ~size := #in~size; {59#true} is VALID [2020-07-18 00:47:10,616 INFO L280 TraceCheckUtils]: 2: Hoare triple {59#true} havoc ~i~0; {59#true} is VALID [2020-07-18 00:47:10,616 INFO L280 TraceCheckUtils]: 3: Hoare triple {59#true} ~i~0 := 0; {59#true} is VALID [2020-07-18 00:47:10,620 INFO L280 TraceCheckUtils]: 4: Hoare triple {59#true} assume !true; {60#false} is VALID [2020-07-18 00:47:10,620 INFO L280 TraceCheckUtils]: 5: Hoare triple {60#false} assume true; {60#false} is VALID [2020-07-18 00:47:10,621 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {60#false} {59#true} #99#return; {60#false} is VALID [2020-07-18 00:47:10,623 INFO L263 TraceCheckUtils]: 0: Hoare triple {59#true} call ULTIMATE.init(); {73#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:47:10,624 INFO L280 TraceCheckUtils]: 1: Hoare triple {73#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {59#true} is VALID [2020-07-18 00:47:10,624 INFO L280 TraceCheckUtils]: 2: Hoare triple {59#true} #valid := #valid[0 := 0]; {59#true} is VALID [2020-07-18 00:47:10,625 INFO L280 TraceCheckUtils]: 3: Hoare triple {59#true} assume 0 < #StackHeapBarrier; {59#true} is VALID [2020-07-18 00:47:10,625 INFO L280 TraceCheckUtils]: 4: Hoare triple {59#true} assume true; {59#true} is VALID [2020-07-18 00:47:10,626 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {59#true} {59#true} #103#return; {59#true} is VALID [2020-07-18 00:47:10,627 INFO L263 TraceCheckUtils]: 6: Hoare triple {59#true} call #t~ret6 := main(); {59#true} is VALID [2020-07-18 00:47:10,627 INFO L280 TraceCheckUtils]: 7: Hoare triple {59#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000); srcloc: mainENTRY {59#true} is VALID [2020-07-18 00:47:10,628 INFO L280 TraceCheckUtils]: 8: Hoare triple {59#true} havoc ~i~1; {59#true} is VALID [2020-07-18 00:47:10,628 INFO L280 TraceCheckUtils]: 9: Hoare triple {59#true} havoc ~flag~0; {59#true} is VALID [2020-07-18 00:47:10,629 INFO L280 TraceCheckUtils]: 10: Hoare triple {59#true} ~flag~0 := 0; {59#true} is VALID [2020-07-18 00:47:10,631 INFO L263 TraceCheckUtils]: 11: Hoare triple {59#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {74#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 00:47:10,632 INFO L280 TraceCheckUtils]: 12: Hoare triple {74#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {59#true} is VALID [2020-07-18 00:47:10,632 INFO L280 TraceCheckUtils]: 13: Hoare triple {59#true} ~size := #in~size; {59#true} is VALID [2020-07-18 00:47:10,633 INFO L280 TraceCheckUtils]: 14: Hoare triple {59#true} havoc ~i~0; {59#true} is VALID [2020-07-18 00:47:10,633 INFO L280 TraceCheckUtils]: 15: Hoare triple {59#true} ~i~0 := 0; {59#true} is VALID [2020-07-18 00:47:10,634 INFO L280 TraceCheckUtils]: 16: Hoare triple {59#true} assume !true; {60#false} is VALID [2020-07-18 00:47:10,635 INFO L280 TraceCheckUtils]: 17: Hoare triple {60#false} assume true; {60#false} is VALID [2020-07-18 00:47:10,635 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {60#false} {59#true} #99#return; {60#false} is VALID [2020-07-18 00:47:10,636 INFO L280 TraceCheckUtils]: 19: Hoare triple {60#false} ~i~1 := 0; {60#false} is VALID [2020-07-18 00:47:10,636 INFO L280 TraceCheckUtils]: 20: Hoare triple {60#false} assume !(~i~1 < 1000000); {60#false} is VALID [2020-07-18 00:47:10,636 INFO L280 TraceCheckUtils]: 21: Hoare triple {60#false} ~i~1 := 0; {60#false} is VALID [2020-07-18 00:47:10,637 INFO L280 TraceCheckUtils]: 22: Hoare triple {60#false} assume !!(~i~1 < 1000000); {60#false} is VALID [2020-07-18 00:47:10,637 INFO L280 TraceCheckUtils]: 23: Hoare triple {60#false} assume 0 == ~flag~0; {60#false} is VALID [2020-07-18 00:47:10,638 INFO L280 TraceCheckUtils]: 24: Hoare triple {60#false} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); srcloc: L34 {60#false} is VALID [2020-07-18 00:47:10,638 INFO L263 TraceCheckUtils]: 25: Hoare triple {60#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {60#false} is VALID [2020-07-18 00:47:10,639 INFO L280 TraceCheckUtils]: 26: Hoare triple {60#false} ~cond := #in~cond; {60#false} is VALID [2020-07-18 00:47:10,639 INFO L280 TraceCheckUtils]: 27: Hoare triple {60#false} assume 0 == ~cond; {60#false} is VALID [2020-07-18 00:47:10,639 INFO L280 TraceCheckUtils]: 28: Hoare triple {60#false} assume !false; {60#false} is VALID [2020-07-18 00:47:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:47:10,646 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:10,648 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [634300234] [2020-07-18 00:47:10,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:10,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:47:10,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594717004] [2020-07-18 00:47:10,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-18 00:47:10,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:10,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:47:10,722 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:10,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:47:10,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:10,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:47:10,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:47:10,735 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 4 states. [2020-07-18 00:47:11,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:11,224 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions. [2020-07-18 00:47:11,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:47:11,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-18 00:47:11,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:11,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:47:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2020-07-18 00:47:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:47:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2020-07-18 00:47:11,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2020-07-18 00:47:11,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:11,409 INFO L225 Difference]: With dead ends: 94 [2020-07-18 00:47:11,409 INFO L226 Difference]: Without dead ends: 53 [2020-07-18 00:47:11,413 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:47:11,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-18 00:47:11,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2020-07-18 00:47:11,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:11,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 49 states. [2020-07-18 00:47:11,510 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 49 states. [2020-07-18 00:47:11,511 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 49 states. [2020-07-18 00:47:11,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:11,517 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2020-07-18 00:47:11,518 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2020-07-18 00:47:11,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:11,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:11,519 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 53 states. [2020-07-18 00:47:11,519 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 53 states. [2020-07-18 00:47:11,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:11,525 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2020-07-18 00:47:11,525 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2020-07-18 00:47:11,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:11,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:11,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:11,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:11,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-18 00:47:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2020-07-18 00:47:11,532 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 29 [2020-07-18 00:47:11,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:11,533 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2020-07-18 00:47:11,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:47:11,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 53 transitions. [2020-07-18 00:47:11,601 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2020-07-18 00:47:11,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-18 00:47:11,603 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:11,604 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, 1] [2020-07-18 00:47:11,604 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:47:11,604 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:11,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:11,605 INFO L82 PathProgramCache]: Analyzing trace with hash 929440641, now seen corresponding path program 1 times [2020-07-18 00:47:11,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:11,606 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [335955322] [2020-07-18 00:47:11,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:11,697 INFO L280 TraceCheckUtils]: 0: Hoare triple {486#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {472#true} is VALID [2020-07-18 00:47:11,697 INFO L280 TraceCheckUtils]: 1: Hoare triple {472#true} #valid := #valid[0 := 0]; {472#true} is VALID [2020-07-18 00:47:11,698 INFO L280 TraceCheckUtils]: 2: Hoare triple {472#true} assume 0 < #StackHeapBarrier; {472#true} is VALID [2020-07-18 00:47:11,698 INFO L280 TraceCheckUtils]: 3: Hoare triple {472#true} assume true; {472#true} is VALID [2020-07-18 00:47:11,698 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {472#true} {472#true} #103#return; {472#true} is VALID [2020-07-18 00:47:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:11,831 INFO L280 TraceCheckUtils]: 0: Hoare triple {487#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {472#true} is VALID [2020-07-18 00:47:11,832 INFO L280 TraceCheckUtils]: 1: Hoare triple {472#true} ~size := #in~size; {488#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} is VALID [2020-07-18 00:47:11,833 INFO L280 TraceCheckUtils]: 2: Hoare triple {488#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} havoc ~i~0; {488#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} is VALID [2020-07-18 00:47:11,834 INFO L280 TraceCheckUtils]: 3: Hoare triple {488#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} ~i~0 := 0; {489#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-18 00:47:11,836 INFO L280 TraceCheckUtils]: 4: Hoare triple {489#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {490#(not (= |init_#in~size| 1000000))} is VALID [2020-07-18 00:47:11,837 INFO L280 TraceCheckUtils]: 5: Hoare triple {490#(not (= |init_#in~size| 1000000))} assume true; {490#(not (= |init_#in~size| 1000000))} is VALID [2020-07-18 00:47:11,839 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {490#(not (= |init_#in~size| 1000000))} {472#true} #99#return; {473#false} is VALID [2020-07-18 00:47:11,840 INFO L263 TraceCheckUtils]: 0: Hoare triple {472#true} call ULTIMATE.init(); {486#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:47:11,841 INFO L280 TraceCheckUtils]: 1: Hoare triple {486#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {472#true} is VALID [2020-07-18 00:47:11,841 INFO L280 TraceCheckUtils]: 2: Hoare triple {472#true} #valid := #valid[0 := 0]; {472#true} is VALID [2020-07-18 00:47:11,842 INFO L280 TraceCheckUtils]: 3: Hoare triple {472#true} assume 0 < #StackHeapBarrier; {472#true} is VALID [2020-07-18 00:47:11,842 INFO L280 TraceCheckUtils]: 4: Hoare triple {472#true} assume true; {472#true} is VALID [2020-07-18 00:47:11,842 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {472#true} {472#true} #103#return; {472#true} is VALID [2020-07-18 00:47:11,843 INFO L263 TraceCheckUtils]: 6: Hoare triple {472#true} call #t~ret6 := main(); {472#true} is VALID [2020-07-18 00:47:11,843 INFO L280 TraceCheckUtils]: 7: Hoare triple {472#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000); srcloc: mainENTRY {472#true} is VALID [2020-07-18 00:47:11,843 INFO L280 TraceCheckUtils]: 8: Hoare triple {472#true} havoc ~i~1; {472#true} is VALID [2020-07-18 00:47:11,844 INFO L280 TraceCheckUtils]: 9: Hoare triple {472#true} havoc ~flag~0; {472#true} is VALID [2020-07-18 00:47:11,844 INFO L280 TraceCheckUtils]: 10: Hoare triple {472#true} ~flag~0 := 0; {472#true} is VALID [2020-07-18 00:47:11,846 INFO L263 TraceCheckUtils]: 11: Hoare triple {472#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {487#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 00:47:11,847 INFO L280 TraceCheckUtils]: 12: Hoare triple {487#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {472#true} is VALID [2020-07-18 00:47:11,848 INFO L280 TraceCheckUtils]: 13: Hoare triple {472#true} ~size := #in~size; {488#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} is VALID [2020-07-18 00:47:11,849 INFO L280 TraceCheckUtils]: 14: Hoare triple {488#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} havoc ~i~0; {488#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} is VALID [2020-07-18 00:47:11,850 INFO L280 TraceCheckUtils]: 15: Hoare triple {488#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} ~i~0 := 0; {489#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-18 00:47:11,851 INFO L280 TraceCheckUtils]: 16: Hoare triple {489#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {490#(not (= |init_#in~size| 1000000))} is VALID [2020-07-18 00:47:11,852 INFO L280 TraceCheckUtils]: 17: Hoare triple {490#(not (= |init_#in~size| 1000000))} assume true; {490#(not (= |init_#in~size| 1000000))} is VALID [2020-07-18 00:47:11,853 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {490#(not (= |init_#in~size| 1000000))} {472#true} #99#return; {473#false} is VALID [2020-07-18 00:47:11,854 INFO L280 TraceCheckUtils]: 19: Hoare triple {473#false} ~i~1 := 0; {473#false} is VALID [2020-07-18 00:47:11,854 INFO L280 TraceCheckUtils]: 20: Hoare triple {473#false} assume !(~i~1 < 1000000); {473#false} is VALID [2020-07-18 00:47:11,855 INFO L280 TraceCheckUtils]: 21: Hoare triple {473#false} ~i~1 := 0; {473#false} is VALID [2020-07-18 00:47:11,855 INFO L280 TraceCheckUtils]: 22: Hoare triple {473#false} assume !!(~i~1 < 1000000); {473#false} is VALID [2020-07-18 00:47:11,855 INFO L280 TraceCheckUtils]: 23: Hoare triple {473#false} assume 0 == ~flag~0; {473#false} is VALID [2020-07-18 00:47:11,856 INFO L280 TraceCheckUtils]: 24: Hoare triple {473#false} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); srcloc: L34 {473#false} is VALID [2020-07-18 00:47:11,856 INFO L263 TraceCheckUtils]: 25: Hoare triple {473#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {473#false} is VALID [2020-07-18 00:47:11,856 INFO L280 TraceCheckUtils]: 26: Hoare triple {473#false} ~cond := #in~cond; {473#false} is VALID [2020-07-18 00:47:11,857 INFO L280 TraceCheckUtils]: 27: Hoare triple {473#false} assume 0 == ~cond; {473#false} is VALID [2020-07-18 00:47:11,857 INFO L280 TraceCheckUtils]: 28: Hoare triple {473#false} assume !false; {473#false} is VALID [2020-07-18 00:47:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:47:11,880 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:11,881 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [335955322] [2020-07-18 00:47:11,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:11,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 00:47:11,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503314821] [2020-07-18 00:47:11,883 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-07-18 00:47:11,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:11,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 00:47:11,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:11,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 00:47:11,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:11,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 00:47:11,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:47:11,929 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 8 states. [2020-07-18 00:47:12,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:12,600 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2020-07-18 00:47:12,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-18 00:47:12,601 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-07-18 00:47:12,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:12,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:47:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2020-07-18 00:47:12,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:47:12,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2020-07-18 00:47:12,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 89 transitions. [2020-07-18 00:47:12,714 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:12,717 INFO L225 Difference]: With dead ends: 81 [2020-07-18 00:47:12,717 INFO L226 Difference]: Without dead ends: 54 [2020-07-18 00:47:12,719 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-07-18 00:47:12,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-18 00:47:12,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2020-07-18 00:47:12,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:12,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 50 states. [2020-07-18 00:47:12,791 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 50 states. [2020-07-18 00:47:12,791 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 50 states. [2020-07-18 00:47:12,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:12,799 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-07-18 00:47:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-07-18 00:47:12,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:12,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:12,801 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 54 states. [2020-07-18 00:47:12,801 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 54 states. [2020-07-18 00:47:12,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:12,806 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-07-18 00:47:12,806 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-07-18 00:47:12,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:12,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:12,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:12,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-18 00:47:12,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2020-07-18 00:47:12,818 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 29 [2020-07-18 00:47:12,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:12,819 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2020-07-18 00:47:12,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 00:47:12,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2020-07-18 00:47:12,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:12,901 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-07-18 00:47:12,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-18 00:47:12,902 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:12,902 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:47:12,902 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:47:12,903 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:12,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:12,903 INFO L82 PathProgramCache]: Analyzing trace with hash -300797571, now seen corresponding path program 1 times [2020-07-18 00:47:12,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:12,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1507297643] [2020-07-18 00:47:12,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:13,012 INFO L280 TraceCheckUtils]: 0: Hoare triple {893#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {873#true} is VALID [2020-07-18 00:47:13,012 INFO L280 TraceCheckUtils]: 1: Hoare triple {873#true} #valid := #valid[0 := 0]; {873#true} is VALID [2020-07-18 00:47:13,013 INFO L280 TraceCheckUtils]: 2: Hoare triple {873#true} assume 0 < #StackHeapBarrier; {873#true} is VALID [2020-07-18 00:47:13,013 INFO L280 TraceCheckUtils]: 3: Hoare triple {873#true} assume true; {873#true} is VALID [2020-07-18 00:47:13,013 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {873#true} {873#true} #103#return; {873#true} is VALID [2020-07-18 00:47:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:13,251 INFO L280 TraceCheckUtils]: 0: Hoare triple {894#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {873#true} is VALID [2020-07-18 00:47:13,253 INFO L280 TraceCheckUtils]: 1: Hoare triple {873#true} ~size := #in~size; {895#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} is VALID [2020-07-18 00:47:13,253 INFO L280 TraceCheckUtils]: 2: Hoare triple {895#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} havoc ~i~0; {895#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} is VALID [2020-07-18 00:47:13,254 INFO L280 TraceCheckUtils]: 3: Hoare triple {895#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} ~i~0 := 0; {896#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-18 00:47:13,254 INFO L280 TraceCheckUtils]: 4: Hoare triple {896#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size); {896#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-18 00:47:13,256 INFO L280 TraceCheckUtils]: 5: Hoare triple {896#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4); srcloc: L14 {896#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-18 00:47:13,257 INFO L280 TraceCheckUtils]: 6: Hoare triple {896#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} SUMMARY for call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); srcloc: L14-1 {896#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-18 00:47:13,258 INFO L280 TraceCheckUtils]: 7: Hoare triple {896#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0; {897#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= |init_#t~post0| 0)))} is VALID [2020-07-18 00:47:13,259 INFO L280 TraceCheckUtils]: 8: Hoare triple {897#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= |init_#t~post0| 0)))} ~i~0 := 1 + #t~post0; {898#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-18 00:47:13,260 INFO L280 TraceCheckUtils]: 9: Hoare triple {898#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} havoc #t~post0; {898#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-18 00:47:13,261 INFO L280 TraceCheckUtils]: 10: Hoare triple {898#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {899#(not (= |init_#in~size| 1000000))} is VALID [2020-07-18 00:47:13,261 INFO L280 TraceCheckUtils]: 11: Hoare triple {899#(not (= |init_#in~size| 1000000))} assume true; {899#(not (= |init_#in~size| 1000000))} is VALID [2020-07-18 00:47:13,262 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {899#(not (= |init_#in~size| 1000000))} {873#true} #99#return; {874#false} is VALID [2020-07-18 00:47:13,270 INFO L263 TraceCheckUtils]: 0: Hoare triple {873#true} call ULTIMATE.init(); {893#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:47:13,271 INFO L280 TraceCheckUtils]: 1: Hoare triple {893#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {873#true} is VALID [2020-07-18 00:47:13,271 INFO L280 TraceCheckUtils]: 2: Hoare triple {873#true} #valid := #valid[0 := 0]; {873#true} is VALID [2020-07-18 00:47:13,271 INFO L280 TraceCheckUtils]: 3: Hoare triple {873#true} assume 0 < #StackHeapBarrier; {873#true} is VALID [2020-07-18 00:47:13,272 INFO L280 TraceCheckUtils]: 4: Hoare triple {873#true} assume true; {873#true} is VALID [2020-07-18 00:47:13,272 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {873#true} {873#true} #103#return; {873#true} is VALID [2020-07-18 00:47:13,272 INFO L263 TraceCheckUtils]: 6: Hoare triple {873#true} call #t~ret6 := main(); {873#true} is VALID [2020-07-18 00:47:13,273 INFO L280 TraceCheckUtils]: 7: Hoare triple {873#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000); srcloc: mainENTRY {873#true} is VALID [2020-07-18 00:47:13,273 INFO L280 TraceCheckUtils]: 8: Hoare triple {873#true} havoc ~i~1; {873#true} is VALID [2020-07-18 00:47:13,273 INFO L280 TraceCheckUtils]: 9: Hoare triple {873#true} havoc ~flag~0; {873#true} is VALID [2020-07-18 00:47:13,273 INFO L280 TraceCheckUtils]: 10: Hoare triple {873#true} ~flag~0 := 0; {873#true} is VALID [2020-07-18 00:47:13,277 INFO L263 TraceCheckUtils]: 11: Hoare triple {873#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {894#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 00:47:13,277 INFO L280 TraceCheckUtils]: 12: Hoare triple {894#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {873#true} is VALID [2020-07-18 00:47:13,279 INFO L280 TraceCheckUtils]: 13: Hoare triple {873#true} ~size := #in~size; {895#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} is VALID [2020-07-18 00:47:13,280 INFO L280 TraceCheckUtils]: 14: Hoare triple {895#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} havoc ~i~0; {895#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} is VALID [2020-07-18 00:47:13,281 INFO L280 TraceCheckUtils]: 15: Hoare triple {895#(or (= |init_#in~size| init_~size) (= 1000000 init_~size))} ~i~0 := 0; {896#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-18 00:47:13,282 INFO L280 TraceCheckUtils]: 16: Hoare triple {896#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size); {896#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-18 00:47:13,283 INFO L280 TraceCheckUtils]: 17: Hoare triple {896#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4); srcloc: L14 {896#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-18 00:47:13,284 INFO L280 TraceCheckUtils]: 18: Hoare triple {896#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} SUMMARY for call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); srcloc: L14-1 {896#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-18 00:47:13,285 INFO L280 TraceCheckUtils]: 19: Hoare triple {896#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0; {897#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= |init_#t~post0| 0)))} is VALID [2020-07-18 00:47:13,286 INFO L280 TraceCheckUtils]: 20: Hoare triple {897#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= |init_#t~post0| 0)))} ~i~0 := 1 + #t~post0; {898#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-18 00:47:13,300 INFO L280 TraceCheckUtils]: 21: Hoare triple {898#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} havoc #t~post0; {898#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-18 00:47:13,302 INFO L280 TraceCheckUtils]: 22: Hoare triple {898#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {899#(not (= |init_#in~size| 1000000))} is VALID [2020-07-18 00:47:13,303 INFO L280 TraceCheckUtils]: 23: Hoare triple {899#(not (= |init_#in~size| 1000000))} assume true; {899#(not (= |init_#in~size| 1000000))} is VALID [2020-07-18 00:47:13,304 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {899#(not (= |init_#in~size| 1000000))} {873#true} #99#return; {874#false} is VALID [2020-07-18 00:47:13,304 INFO L280 TraceCheckUtils]: 25: Hoare triple {874#false} ~i~1 := 0; {874#false} is VALID [2020-07-18 00:47:13,305 INFO L280 TraceCheckUtils]: 26: Hoare triple {874#false} assume !(~i~1 < 1000000); {874#false} is VALID [2020-07-18 00:47:13,305 INFO L280 TraceCheckUtils]: 27: Hoare triple {874#false} ~i~1 := 0; {874#false} is VALID [2020-07-18 00:47:13,305 INFO L280 TraceCheckUtils]: 28: Hoare triple {874#false} assume !!(~i~1 < 1000000); {874#false} is VALID [2020-07-18 00:47:13,305 INFO L280 TraceCheckUtils]: 29: Hoare triple {874#false} assume 0 == ~flag~0; {874#false} is VALID [2020-07-18 00:47:13,306 INFO L280 TraceCheckUtils]: 30: Hoare triple {874#false} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); srcloc: L34 {874#false} is VALID [2020-07-18 00:47:13,306 INFO L263 TraceCheckUtils]: 31: Hoare triple {874#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {874#false} is VALID [2020-07-18 00:47:13,306 INFO L280 TraceCheckUtils]: 32: Hoare triple {874#false} ~cond := #in~cond; {874#false} is VALID [2020-07-18 00:47:13,306 INFO L280 TraceCheckUtils]: 33: Hoare triple {874#false} assume 0 == ~cond; {874#false} is VALID [2020-07-18 00:47:13,307 INFO L280 TraceCheckUtils]: 34: Hoare triple {874#false} assume !false; {874#false} is VALID [2020-07-18 00:47:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:47:13,332 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:13,332 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1507297643] [2020-07-18 00:47:13,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:13,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-18 00:47:13,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048625995] [2020-07-18 00:47:13,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2020-07-18 00:47:13,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:13,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-18 00:47:13,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:13,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-18 00:47:13,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:13,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-18 00:47:13,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-18 00:47:13,382 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 10 states. [2020-07-18 00:47:14,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:14,268 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2020-07-18 00:47:14,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 00:47:14,268 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2020-07-18 00:47:14,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:14,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 00:47:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 95 transitions. [2020-07-18 00:47:14,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 00:47:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 95 transitions. [2020-07-18 00:47:14,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 95 transitions. [2020-07-18 00:47:14,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:14,396 INFO L225 Difference]: With dead ends: 87 [2020-07-18 00:47:14,396 INFO L226 Difference]: Without dead ends: 60 [2020-07-18 00:47:14,397 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2020-07-18 00:47:14,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-18 00:47:14,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2020-07-18 00:47:14,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:14,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 56 states. [2020-07-18 00:47:14,473 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 56 states. [2020-07-18 00:47:14,473 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 56 states. [2020-07-18 00:47:14,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:14,477 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-18 00:47:14,477 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-07-18 00:47:14,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:14,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:14,478 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 60 states. [2020-07-18 00:47:14,478 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 60 states. [2020-07-18 00:47:14,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:14,483 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-18 00:47:14,483 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-07-18 00:47:14,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:14,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:14,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:14,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:14,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-18 00:47:14,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2020-07-18 00:47:14,490 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 35 [2020-07-18 00:47:14,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:14,490 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2020-07-18 00:47:14,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-18 00:47:14,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 60 transitions. [2020-07-18 00:47:14,563 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:14,563 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2020-07-18 00:47:14,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-18 00:47:14,567 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:14,567 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:47:14,568 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:47:14,568 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:14,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:14,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1218260359, now seen corresponding path program 2 times [2020-07-18 00:47:14,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:14,569 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1550300168] [2020-07-18 00:47:14,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:14,646 INFO L280 TraceCheckUtils]: 0: Hoare triple {1349#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1322#true} is VALID [2020-07-18 00:47:14,647 INFO L280 TraceCheckUtils]: 1: Hoare triple {1322#true} #valid := #valid[0 := 0]; {1322#true} is VALID [2020-07-18 00:47:14,647 INFO L280 TraceCheckUtils]: 2: Hoare triple {1322#true} assume 0 < #StackHeapBarrier; {1322#true} is VALID [2020-07-18 00:47:14,647 INFO L280 TraceCheckUtils]: 3: Hoare triple {1322#true} assume true; {1322#true} is VALID [2020-07-18 00:47:14,648 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1322#true} {1322#true} #103#return; {1322#true} is VALID [2020-07-18 00:47:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:14,681 INFO L280 TraceCheckUtils]: 0: Hoare triple {1350#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1322#true} is VALID [2020-07-18 00:47:14,682 INFO L280 TraceCheckUtils]: 1: Hoare triple {1322#true} ~size := #in~size; {1322#true} is VALID [2020-07-18 00:47:14,682 INFO L280 TraceCheckUtils]: 2: Hoare triple {1322#true} havoc ~i~0; {1322#true} is VALID [2020-07-18 00:47:14,683 INFO L280 TraceCheckUtils]: 3: Hoare triple {1322#true} ~i~0 := 0; {1322#true} is VALID [2020-07-18 00:47:14,683 INFO L280 TraceCheckUtils]: 4: Hoare triple {1322#true} assume !!(~i~0 < ~size); {1322#true} is VALID [2020-07-18 00:47:14,683 INFO L280 TraceCheckUtils]: 5: Hoare triple {1322#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4); srcloc: L14 {1322#true} is VALID [2020-07-18 00:47:14,684 INFO L280 TraceCheckUtils]: 6: Hoare triple {1322#true} SUMMARY for call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); srcloc: L14-1 {1322#true} is VALID [2020-07-18 00:47:14,684 INFO L280 TraceCheckUtils]: 7: Hoare triple {1322#true} #t~post0 := ~i~0; {1322#true} is VALID [2020-07-18 00:47:14,684 INFO L280 TraceCheckUtils]: 8: Hoare triple {1322#true} ~i~0 := 1 + #t~post0; {1322#true} is VALID [2020-07-18 00:47:14,685 INFO L280 TraceCheckUtils]: 9: Hoare triple {1322#true} havoc #t~post0; {1322#true} is VALID [2020-07-18 00:47:14,685 INFO L280 TraceCheckUtils]: 10: Hoare triple {1322#true} assume !!(~i~0 < ~size); {1322#true} is VALID [2020-07-18 00:47:14,685 INFO L280 TraceCheckUtils]: 11: Hoare triple {1322#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4); srcloc: L14 {1322#true} is VALID [2020-07-18 00:47:14,685 INFO L280 TraceCheckUtils]: 12: Hoare triple {1322#true} SUMMARY for call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); srcloc: L14-1 {1322#true} is VALID [2020-07-18 00:47:14,686 INFO L280 TraceCheckUtils]: 13: Hoare triple {1322#true} #t~post0 := ~i~0; {1322#true} is VALID [2020-07-18 00:47:14,686 INFO L280 TraceCheckUtils]: 14: Hoare triple {1322#true} ~i~0 := 1 + #t~post0; {1322#true} is VALID [2020-07-18 00:47:14,686 INFO L280 TraceCheckUtils]: 15: Hoare triple {1322#true} havoc #t~post0; {1322#true} is VALID [2020-07-18 00:47:14,687 INFO L280 TraceCheckUtils]: 16: Hoare triple {1322#true} assume !(~i~0 < ~size); {1322#true} is VALID [2020-07-18 00:47:14,687 INFO L280 TraceCheckUtils]: 17: Hoare triple {1322#true} assume true; {1322#true} is VALID [2020-07-18 00:47:14,687 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1322#true} {1322#true} #99#return; {1322#true} is VALID [2020-07-18 00:47:14,690 INFO L263 TraceCheckUtils]: 0: Hoare triple {1322#true} call ULTIMATE.init(); {1349#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:47:14,690 INFO L280 TraceCheckUtils]: 1: Hoare triple {1349#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1322#true} is VALID [2020-07-18 00:47:14,691 INFO L280 TraceCheckUtils]: 2: Hoare triple {1322#true} #valid := #valid[0 := 0]; {1322#true} is VALID [2020-07-18 00:47:14,691 INFO L280 TraceCheckUtils]: 3: Hoare triple {1322#true} assume 0 < #StackHeapBarrier; {1322#true} is VALID [2020-07-18 00:47:14,691 INFO L280 TraceCheckUtils]: 4: Hoare triple {1322#true} assume true; {1322#true} is VALID [2020-07-18 00:47:14,692 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1322#true} {1322#true} #103#return; {1322#true} is VALID [2020-07-18 00:47:14,692 INFO L263 TraceCheckUtils]: 6: Hoare triple {1322#true} call #t~ret6 := main(); {1322#true} is VALID [2020-07-18 00:47:14,692 INFO L280 TraceCheckUtils]: 7: Hoare triple {1322#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000); srcloc: mainENTRY {1322#true} is VALID [2020-07-18 00:47:14,693 INFO L280 TraceCheckUtils]: 8: Hoare triple {1322#true} havoc ~i~1; {1322#true} is VALID [2020-07-18 00:47:14,693 INFO L280 TraceCheckUtils]: 9: Hoare triple {1322#true} havoc ~flag~0; {1322#true} is VALID [2020-07-18 00:47:14,693 INFO L280 TraceCheckUtils]: 10: Hoare triple {1322#true} ~flag~0 := 0; {1322#true} is VALID [2020-07-18 00:47:14,695 INFO L263 TraceCheckUtils]: 11: Hoare triple {1322#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {1350#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 00:47:14,696 INFO L280 TraceCheckUtils]: 12: Hoare triple {1350#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1322#true} is VALID [2020-07-18 00:47:14,696 INFO L280 TraceCheckUtils]: 13: Hoare triple {1322#true} ~size := #in~size; {1322#true} is VALID [2020-07-18 00:47:14,696 INFO L280 TraceCheckUtils]: 14: Hoare triple {1322#true} havoc ~i~0; {1322#true} is VALID [2020-07-18 00:47:14,697 INFO L280 TraceCheckUtils]: 15: Hoare triple {1322#true} ~i~0 := 0; {1322#true} is VALID [2020-07-18 00:47:14,697 INFO L280 TraceCheckUtils]: 16: Hoare triple {1322#true} assume !!(~i~0 < ~size); {1322#true} is VALID [2020-07-18 00:47:14,697 INFO L280 TraceCheckUtils]: 17: Hoare triple {1322#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4); srcloc: L14 {1322#true} is VALID [2020-07-18 00:47:14,698 INFO L280 TraceCheckUtils]: 18: Hoare triple {1322#true} SUMMARY for call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); srcloc: L14-1 {1322#true} is VALID [2020-07-18 00:47:14,698 INFO L280 TraceCheckUtils]: 19: Hoare triple {1322#true} #t~post0 := ~i~0; {1322#true} is VALID [2020-07-18 00:47:14,698 INFO L280 TraceCheckUtils]: 20: Hoare triple {1322#true} ~i~0 := 1 + #t~post0; {1322#true} is VALID [2020-07-18 00:47:14,699 INFO L280 TraceCheckUtils]: 21: Hoare triple {1322#true} havoc #t~post0; {1322#true} is VALID [2020-07-18 00:47:14,699 INFO L280 TraceCheckUtils]: 22: Hoare triple {1322#true} assume !!(~i~0 < ~size); {1322#true} is VALID [2020-07-18 00:47:14,699 INFO L280 TraceCheckUtils]: 23: Hoare triple {1322#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4); srcloc: L14 {1322#true} is VALID [2020-07-18 00:47:14,700 INFO L280 TraceCheckUtils]: 24: Hoare triple {1322#true} SUMMARY for call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); srcloc: L14-1 {1322#true} is VALID [2020-07-18 00:47:14,700 INFO L280 TraceCheckUtils]: 25: Hoare triple {1322#true} #t~post0 := ~i~0; {1322#true} is VALID [2020-07-18 00:47:14,700 INFO L280 TraceCheckUtils]: 26: Hoare triple {1322#true} ~i~0 := 1 + #t~post0; {1322#true} is VALID [2020-07-18 00:47:14,700 INFO L280 TraceCheckUtils]: 27: Hoare triple {1322#true} havoc #t~post0; {1322#true} is VALID [2020-07-18 00:47:14,701 INFO L280 TraceCheckUtils]: 28: Hoare triple {1322#true} assume !(~i~0 < ~size); {1322#true} is VALID [2020-07-18 00:47:14,701 INFO L280 TraceCheckUtils]: 29: Hoare triple {1322#true} assume true; {1322#true} is VALID [2020-07-18 00:47:14,701 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1322#true} {1322#true} #99#return; {1322#true} is VALID [2020-07-18 00:47:14,703 INFO L280 TraceCheckUtils]: 31: Hoare triple {1322#true} ~i~1 := 0; {1348#(= 0 main_~i~1)} is VALID [2020-07-18 00:47:14,704 INFO L280 TraceCheckUtils]: 32: Hoare triple {1348#(= 0 main_~i~1)} assume !(~i~1 < 1000000); {1323#false} is VALID [2020-07-18 00:47:14,705 INFO L280 TraceCheckUtils]: 33: Hoare triple {1323#false} ~i~1 := 0; {1323#false} is VALID [2020-07-18 00:47:14,705 INFO L280 TraceCheckUtils]: 34: Hoare triple {1323#false} assume !!(~i~1 < 1000000); {1323#false} is VALID [2020-07-18 00:47:14,705 INFO L280 TraceCheckUtils]: 35: Hoare triple {1323#false} assume 0 == ~flag~0; {1323#false} is VALID [2020-07-18 00:47:14,706 INFO L280 TraceCheckUtils]: 36: Hoare triple {1323#false} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); srcloc: L34 {1323#false} is VALID [2020-07-18 00:47:14,706 INFO L263 TraceCheckUtils]: 37: Hoare triple {1323#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {1323#false} is VALID [2020-07-18 00:47:14,706 INFO L280 TraceCheckUtils]: 38: Hoare triple {1323#false} ~cond := #in~cond; {1323#false} is VALID [2020-07-18 00:47:14,706 INFO L280 TraceCheckUtils]: 39: Hoare triple {1323#false} assume 0 == ~cond; {1323#false} is VALID [2020-07-18 00:47:14,707 INFO L280 TraceCheckUtils]: 40: Hoare triple {1323#false} assume !false; {1323#false} is VALID [2020-07-18 00:47:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:47:14,712 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:14,713 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1550300168] [2020-07-18 00:47:14,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:14,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:47:14,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624614592] [2020-07-18 00:47:14,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-07-18 00:47:14,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:14,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:47:14,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:14,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:47:14,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:14,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:47:14,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:47:14,764 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2020-07-18 00:47:15,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:15,214 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2020-07-18 00:47:15,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:47:15,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-07-18 00:47:15,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:15,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2020-07-18 00:47:15,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:15,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2020-07-18 00:47:15,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 90 transitions. [2020-07-18 00:47:15,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:15,328 INFO L225 Difference]: With dead ends: 86 [2020-07-18 00:47:15,328 INFO L226 Difference]: Without dead ends: 71 [2020-07-18 00:47:15,329 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:47:15,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-07-18 00:47:15,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 57. [2020-07-18 00:47:15,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:15,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 57 states. [2020-07-18 00:47:15,414 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 57 states. [2020-07-18 00:47:15,414 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 57 states. [2020-07-18 00:47:15,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:15,418 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-18 00:47:15,418 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2020-07-18 00:47:15,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:15,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:15,419 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 71 states. [2020-07-18 00:47:15,419 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 71 states. [2020-07-18 00:47:15,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:15,423 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-18 00:47:15,423 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2020-07-18 00:47:15,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:15,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:15,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:15,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-18 00:47:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2020-07-18 00:47:15,427 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 41 [2020-07-18 00:47:15,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:15,427 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2020-07-18 00:47:15,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:47:15,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 61 transitions. [2020-07-18 00:47:15,505 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2020-07-18 00:47:15,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-18 00:47:15,507 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:15,508 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:47:15,508 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:47:15,508 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:15,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:15,509 INFO L82 PathProgramCache]: Analyzing trace with hash -632447720, now seen corresponding path program 1 times [2020-07-18 00:47:15,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:15,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1006244378] [2020-07-18 00:47:15,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:15,529 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:47:15,529 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:458) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:290) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-18 00:47:15,535 INFO L168 Benchmark]: Toolchain (without parser) took 6196.53 ms. Allocated memory was 137.9 MB in the beginning and 285.2 MB in the end (delta: 147.3 MB). Free memory was 103.1 MB in the beginning and 129.6 MB in the end (delta: -26.6 MB). Peak memory consumption was 120.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:15,536 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 00:47:15,537 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.78 ms. Allocated memory is still 137.9 MB. Free memory was 102.6 MB in the beginning and 91.6 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:15,538 INFO L168 Benchmark]: Boogie Preprocessor took 126.89 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 91.6 MB in the beginning and 179.4 MB in the end (delta: -87.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:15,539 INFO L168 Benchmark]: RCFGBuilder took 459.43 ms. Allocated memory is still 201.9 MB. Free memory was 179.4 MB in the beginning and 152.9 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:15,539 INFO L168 Benchmark]: TraceAbstraction took 5321.68 ms. Allocated memory was 201.9 MB in the beginning and 285.2 MB in the end (delta: 83.4 MB). Free memory was 152.2 MB in the beginning and 129.6 MB in the end (delta: 22.6 MB). Peak memory consumption was 106.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:15,543 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 281.78 ms. Allocated memory is still 137.9 MB. Free memory was 102.6 MB in the beginning and 91.6 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.89 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 91.6 MB in the beginning and 179.4 MB in the end (delta: -87.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 459.43 ms. Allocated memory is still 201.9 MB. Free memory was 179.4 MB in the beginning and 152.9 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5321.68 ms. Allocated memory was 201.9 MB in the beginning and 285.2 MB in the end (delta: 83.4 MB). Free memory was 152.2 MB in the beginning and 129.6 MB in the end (delta: 22.6 MB). Peak memory consumption was 106.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...