/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/array-fpi/brs2f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 06:32:14,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 06:32:14,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 06:32:14,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 06:32:14,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 06:32:14,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 06:32:14,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 06:32:14,551 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 06:32:14,555 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 06:32:14,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 06:32:14,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 06:32:14,563 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 06:32:14,563 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 06:32:14,565 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 06:32:14,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 06:32:14,569 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 06:32:14,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 06:32:14,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 06:32:14,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 06:32:14,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 06:32:14,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 06:32:14,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 06:32:14,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 06:32:14,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 06:32:14,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 06:32:14,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 06:32:14,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 06:32:14,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 06:32:14,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 06:32:14,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 06:32:14,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 06:32:14,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 06:32:14,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 06:32:14,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 06:32:14,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 06:32:14,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 06:32:14,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 06:32:14,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 06:32:14,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 06:32:14,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 06:32:14,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 06:32:14,612 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 06:32:14,641 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 06:32:14,641 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 06:32:14,646 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 06:32:14,646 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 06:32:14,646 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 06:32:14,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 06:32:14,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 06:32:14,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 06:32:14,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 06:32:14,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 06:32:14,651 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 06:32:14,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 06:32:14,651 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 06:32:14,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 06:32:14,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 06:32:14,652 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 06:32:14,652 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 06:32:14,652 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 06:32:14,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 06:32:14,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 06:32:14,653 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 06:32:14,653 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 06:32:14,653 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-18 06:32:15,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 06:32:15,025 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 06:32:15,031 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 06:32:15,033 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 06:32:15,034 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 06:32:15,034 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/brs2f.c [2020-07-18 06:32:15,123 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c91230ef1/16613033c8f2486194f5eae6eefef52e/FLAG40a75cafe [2020-07-18 06:32:15,684 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 06:32:15,685 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs2f.c [2020-07-18 06:32:15,693 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c91230ef1/16613033c8f2486194f5eae6eefef52e/FLAG40a75cafe [2020-07-18 06:32:15,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c91230ef1/16613033c8f2486194f5eae6eefef52e [2020-07-18 06:32:15,982 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 06:32:15,985 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 06:32:15,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 06:32:15,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 06:32:15,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 06:32:15,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:32:15" (1/1) ... [2020-07-18 06:32:15,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a431c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:15, skipping insertion in model container [2020-07-18 06:32:15,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:32:15" (1/1) ... [2020-07-18 06:32:16,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 06:32:16,026 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 06:32:16,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:32:16,230 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 06:32:16,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:32:16,273 INFO L208 MainTranslator]: Completed translation [2020-07-18 06:32:16,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:16 WrapperNode [2020-07-18 06:32:16,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 06:32:16,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 06:32:16,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 06:32:16,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 06:32:16,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:16" (1/1) ... [2020-07-18 06:32:16,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:16" (1/1) ... [2020-07-18 06:32:16,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:16" (1/1) ... [2020-07-18 06:32:16,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:16" (1/1) ... [2020-07-18 06:32:16,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:16" (1/1) ... [2020-07-18 06:32:16,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:16" (1/1) ... [2020-07-18 06:32:16,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:16" (1/1) ... [2020-07-18 06:32:16,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 06:32:16,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 06:32:16,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 06:32:16,431 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 06:32:16,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:16" (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 06:32:16,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 06:32:16,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 06:32:16,500 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 06:32:16,500 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 06:32:16,500 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 06:32:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 06:32:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 06:32:16,501 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 06:32:16,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 06:32:16,502 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 06:32:16,502 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 06:32:16,503 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 06:32:16,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 06:32:16,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 06:32:16,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 06:32:16,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 06:32:16,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 06:32:16,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 06:32:16,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 06:32:16,978 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 06:32:16,978 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-18 06:32:16,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:32:16 BoogieIcfgContainer [2020-07-18 06:32:16,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 06:32:16,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 06:32:16,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 06:32:16,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 06:32:16,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 06:32:15" (1/3) ... [2020-07-18 06:32:16,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f00d8fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:32:16, skipping insertion in model container [2020-07-18 06:32:16,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:16" (2/3) ... [2020-07-18 06:32:16,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f00d8fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:32:16, skipping insertion in model container [2020-07-18 06:32:16,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:32:16" (3/3) ... [2020-07-18 06:32:16,993 INFO L109 eAbstractionObserver]: Analyzing ICFG brs2f.c [2020-07-18 06:32:17,005 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 06:32:17,014 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 06:32:17,029 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 06:32:17,054 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 06:32:17,054 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 06:32:17,054 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 06:32:17,055 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 06:32:17,055 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 06:32:17,055 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 06:32:17,056 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 06:32:17,056 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 06:32:17,075 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2020-07-18 06:32:17,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-18 06:32:17,088 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:32:17,090 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] [2020-07-18 06:32:17,090 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:32:17,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:32:17,099 INFO L82 PathProgramCache]: Analyzing trace with hash 221259408, now seen corresponding path program 1 times [2020-07-18 06:32:17,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:32:17,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1991853630] [2020-07-18 06:32:17,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:32:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:17,373 INFO L280 TraceCheckUtils]: 0: Hoare triple {74#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {62#true} is VALID [2020-07-18 06:32:17,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} #valid := #valid[0 := 0]; {62#true} is VALID [2020-07-18 06:32:17,374 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} assume 0 < #StackHeapBarrier; {62#true} is VALID [2020-07-18 06:32:17,375 INFO L280 TraceCheckUtils]: 3: Hoare triple {62#true} ~N~0 := 0; {62#true} is VALID [2020-07-18 06:32:17,375 INFO L280 TraceCheckUtils]: 4: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-18 06:32:17,376 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {62#true} {62#true} #103#return; {62#true} is VALID [2020-07-18 06:32:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:17,387 INFO L280 TraceCheckUtils]: 0: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2020-07-18 06:32:17,387 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} assume !(0 == ~cond); {62#true} is VALID [2020-07-18 06:32:17,388 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-18 06:32:17,388 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {62#true} {62#true} #99#return; {62#true} is VALID [2020-07-18 06:32:17,391 INFO L263 TraceCheckUtils]: 0: Hoare triple {62#true} call ULTIMATE.init(); {74#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 06:32:17,391 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {62#true} is VALID [2020-07-18 06:32:17,392 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} #valid := #valid[0 := 0]; {62#true} is VALID [2020-07-18 06:32:17,392 INFO L280 TraceCheckUtils]: 3: Hoare triple {62#true} assume 0 < #StackHeapBarrier; {62#true} is VALID [2020-07-18 06:32:17,392 INFO L280 TraceCheckUtils]: 4: Hoare triple {62#true} ~N~0 := 0; {62#true} is VALID [2020-07-18 06:32:17,393 INFO L280 TraceCheckUtils]: 5: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-18 06:32:17,393 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {62#true} {62#true} #103#return; {62#true} is VALID [2020-07-18 06:32:17,393 INFO L263 TraceCheckUtils]: 7: Hoare triple {62#true} call #t~ret7 := main(); {62#true} is VALID [2020-07-18 06:32:17,394 INFO L280 TraceCheckUtils]: 8: Hoare triple {62#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {62#true} is VALID [2020-07-18 06:32:17,394 INFO L280 TraceCheckUtils]: 9: Hoare triple {62#true} ~N~0 := #t~nondet0; {62#true} is VALID [2020-07-18 06:32:17,395 INFO L280 TraceCheckUtils]: 10: Hoare triple {62#true} havoc #t~nondet0; {62#true} is VALID [2020-07-18 06:32:17,395 INFO L280 TraceCheckUtils]: 11: Hoare triple {62#true} assume !(~N~0 <= 0); {62#true} is VALID [2020-07-18 06:32:17,396 INFO L263 TraceCheckUtils]: 12: Hoare triple {62#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {62#true} is VALID [2020-07-18 06:32:17,396 INFO L280 TraceCheckUtils]: 13: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2020-07-18 06:32:17,397 INFO L280 TraceCheckUtils]: 14: Hoare triple {62#true} assume !(0 == ~cond); {62#true} is VALID [2020-07-18 06:32:17,397 INFO L280 TraceCheckUtils]: 15: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-18 06:32:17,397 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {62#true} {62#true} #99#return; {62#true} is VALID [2020-07-18 06:32:17,398 INFO L280 TraceCheckUtils]: 17: Hoare triple {62#true} havoc ~i~0; {62#true} is VALID [2020-07-18 06:32:17,398 INFO L280 TraceCheckUtils]: 18: Hoare triple {62#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {62#true} is VALID [2020-07-18 06:32:17,399 INFO L280 TraceCheckUtils]: 19: Hoare triple {62#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {62#true} is VALID [2020-07-18 06:32:17,399 INFO L280 TraceCheckUtils]: 20: Hoare triple {62#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {62#true} is VALID [2020-07-18 06:32:17,399 INFO L280 TraceCheckUtils]: 21: Hoare triple {62#true} ~i~0 := 0; {62#true} is VALID [2020-07-18 06:32:17,401 INFO L280 TraceCheckUtils]: 22: Hoare triple {62#true} assume !true; {63#false} is VALID [2020-07-18 06:32:17,401 INFO L280 TraceCheckUtils]: 23: Hoare triple {63#false} ~i~0 := 0; {63#false} is VALID [2020-07-18 06:32:17,402 INFO L280 TraceCheckUtils]: 24: Hoare triple {63#false} assume !(~i~0 < ~N~0); {63#false} is VALID [2020-07-18 06:32:17,402 INFO L280 TraceCheckUtils]: 25: Hoare triple {63#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {63#false} is VALID [2020-07-18 06:32:17,403 INFO L263 TraceCheckUtils]: 26: Hoare triple {63#false} call __VERIFIER_assert((if #t~mem6 <= 2 * ~N~0 then 1 else 0)); {63#false} is VALID [2020-07-18 06:32:17,403 INFO L280 TraceCheckUtils]: 27: Hoare triple {63#false} ~cond := #in~cond; {63#false} is VALID [2020-07-18 06:32:17,403 INFO L280 TraceCheckUtils]: 28: Hoare triple {63#false} assume 0 == ~cond; {63#false} is VALID [2020-07-18 06:32:17,404 INFO L280 TraceCheckUtils]: 29: Hoare triple {63#false} assume !false; {63#false} is VALID [2020-07-18 06:32:17,408 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 06:32:17,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1991853630] [2020-07-18 06:32:17,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:32:17,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 06:32:17,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564370780] [2020-07-18 06:32:17,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-18 06:32:17,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:32:17,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 06:32:17,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:17,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 06:32:17,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:32:17,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 06:32:17,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 06:32:17,504 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2020-07-18 06:32:17,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:17,906 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2020-07-18 06:32:17,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 06:32:17,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-18 06:32:17,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:32:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 06:32:17,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2020-07-18 06:32:17,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 06:32:17,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2020-07-18 06:32:17,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 116 transitions. [2020-07-18 06:32:18,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:18,096 INFO L225 Difference]: With dead ends: 101 [2020-07-18 06:32:18,096 INFO L226 Difference]: Without dead ends: 47 [2020-07-18 06:32:18,100 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 06:32:18,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-18 06:32:18,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-18 06:32:18,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:32:18,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2020-07-18 06:32:18,200 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-18 06:32:18,200 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-18 06:32:18,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:18,207 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-07-18 06:32:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-18 06:32:18,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:18,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:18,209 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-18 06:32:18,209 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-18 06:32:18,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:18,214 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-07-18 06:32:18,214 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-18 06:32:18,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:18,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:18,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:32:18,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:32:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-18 06:32:18,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2020-07-18 06:32:18,222 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 30 [2020-07-18 06:32:18,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:32:18,222 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2020-07-18 06:32:18,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 06:32:18,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2020-07-18 06:32:18,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-18 06:32:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-18 06:32:18,288 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:32:18,288 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] [2020-07-18 06:32:18,288 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 06:32:18,289 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:32:18,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:32:18,289 INFO L82 PathProgramCache]: Analyzing trace with hash -151091841, now seen corresponding path program 1 times [2020-07-18 06:32:18,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:32:18,290 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [981772907] [2020-07-18 06:32:18,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:32:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:18,414 INFO L280 TraceCheckUtils]: 0: Hoare triple {481#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {467#true} is VALID [2020-07-18 06:32:18,415 INFO L280 TraceCheckUtils]: 1: Hoare triple {467#true} #valid := #valid[0 := 0]; {467#true} is VALID [2020-07-18 06:32:18,415 INFO L280 TraceCheckUtils]: 2: Hoare triple {467#true} assume 0 < #StackHeapBarrier; {467#true} is VALID [2020-07-18 06:32:18,416 INFO L280 TraceCheckUtils]: 3: Hoare triple {467#true} ~N~0 := 0; {467#true} is VALID [2020-07-18 06:32:18,416 INFO L280 TraceCheckUtils]: 4: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-18 06:32:18,416 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {467#true} {467#true} #103#return; {467#true} is VALID [2020-07-18 06:32:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:18,425 INFO L280 TraceCheckUtils]: 0: Hoare triple {467#true} ~cond := #in~cond; {467#true} is VALID [2020-07-18 06:32:18,426 INFO L280 TraceCheckUtils]: 1: Hoare triple {467#true} assume !(0 == ~cond); {467#true} is VALID [2020-07-18 06:32:18,426 INFO L280 TraceCheckUtils]: 2: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-18 06:32:18,427 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {467#true} {475#(<= 1 ~N~0)} #99#return; {475#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:18,429 INFO L263 TraceCheckUtils]: 0: Hoare triple {467#true} call ULTIMATE.init(); {481#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 06:32:18,429 INFO L280 TraceCheckUtils]: 1: Hoare triple {481#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {467#true} is VALID [2020-07-18 06:32:18,429 INFO L280 TraceCheckUtils]: 2: Hoare triple {467#true} #valid := #valid[0 := 0]; {467#true} is VALID [2020-07-18 06:32:18,430 INFO L280 TraceCheckUtils]: 3: Hoare triple {467#true} assume 0 < #StackHeapBarrier; {467#true} is VALID [2020-07-18 06:32:18,430 INFO L280 TraceCheckUtils]: 4: Hoare triple {467#true} ~N~0 := 0; {467#true} is VALID [2020-07-18 06:32:18,430 INFO L280 TraceCheckUtils]: 5: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-18 06:32:18,431 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {467#true} {467#true} #103#return; {467#true} is VALID [2020-07-18 06:32:18,431 INFO L263 TraceCheckUtils]: 7: Hoare triple {467#true} call #t~ret7 := main(); {467#true} is VALID [2020-07-18 06:32:18,431 INFO L280 TraceCheckUtils]: 8: Hoare triple {467#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {467#true} is VALID [2020-07-18 06:32:18,432 INFO L280 TraceCheckUtils]: 9: Hoare triple {467#true} ~N~0 := #t~nondet0; {467#true} is VALID [2020-07-18 06:32:18,432 INFO L280 TraceCheckUtils]: 10: Hoare triple {467#true} havoc #t~nondet0; {467#true} is VALID [2020-07-18 06:32:18,433 INFO L280 TraceCheckUtils]: 11: Hoare triple {467#true} assume !(~N~0 <= 0); {475#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:18,433 INFO L263 TraceCheckUtils]: 12: Hoare triple {475#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {467#true} is VALID [2020-07-18 06:32:18,434 INFO L280 TraceCheckUtils]: 13: Hoare triple {467#true} ~cond := #in~cond; {467#true} is VALID [2020-07-18 06:32:18,434 INFO L280 TraceCheckUtils]: 14: Hoare triple {467#true} assume !(0 == ~cond); {467#true} is VALID [2020-07-18 06:32:18,434 INFO L280 TraceCheckUtils]: 15: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-18 06:32:18,435 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {467#true} {475#(<= 1 ~N~0)} #99#return; {475#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:18,436 INFO L280 TraceCheckUtils]: 17: Hoare triple {475#(<= 1 ~N~0)} havoc ~i~0; {475#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:18,437 INFO L280 TraceCheckUtils]: 18: Hoare triple {475#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {475#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:18,438 INFO L280 TraceCheckUtils]: 19: Hoare triple {475#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {475#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:18,439 INFO L280 TraceCheckUtils]: 20: Hoare triple {475#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {475#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:18,440 INFO L280 TraceCheckUtils]: 21: Hoare triple {475#(<= 1 ~N~0)} ~i~0 := 0; {480#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-18 06:32:18,441 INFO L280 TraceCheckUtils]: 22: Hoare triple {480#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {468#false} is VALID [2020-07-18 06:32:18,441 INFO L280 TraceCheckUtils]: 23: Hoare triple {468#false} ~i~0 := 0; {468#false} is VALID [2020-07-18 06:32:18,441 INFO L280 TraceCheckUtils]: 24: Hoare triple {468#false} assume !(~i~0 < ~N~0); {468#false} is VALID [2020-07-18 06:32:18,442 INFO L280 TraceCheckUtils]: 25: Hoare triple {468#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {468#false} is VALID [2020-07-18 06:32:18,442 INFO L263 TraceCheckUtils]: 26: Hoare triple {468#false} call __VERIFIER_assert((if #t~mem6 <= 2 * ~N~0 then 1 else 0)); {468#false} is VALID [2020-07-18 06:32:18,442 INFO L280 TraceCheckUtils]: 27: Hoare triple {468#false} ~cond := #in~cond; {468#false} is VALID [2020-07-18 06:32:18,442 INFO L280 TraceCheckUtils]: 28: Hoare triple {468#false} assume 0 == ~cond; {468#false} is VALID [2020-07-18 06:32:18,443 INFO L280 TraceCheckUtils]: 29: Hoare triple {468#false} assume !false; {468#false} is VALID [2020-07-18 06:32:18,444 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 06:32:18,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [981772907] [2020-07-18 06:32:18,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:32:18,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 06:32:18,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708601590] [2020-07-18 06:32:18,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-18 06:32:18,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:32:18,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 06:32:18,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:18,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 06:32:18,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:32:18,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 06:32:18,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-18 06:32:18,490 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 5 states. [2020-07-18 06:32:18,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:18,949 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2020-07-18 06:32:18,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 06:32:18,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-18 06:32:18,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:32:18,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:32:18,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2020-07-18 06:32:18,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:32:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2020-07-18 06:32:18,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 91 transitions. [2020-07-18 06:32:19,069 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:19,072 INFO L225 Difference]: With dead ends: 81 [2020-07-18 06:32:19,072 INFO L226 Difference]: Without dead ends: 56 [2020-07-18 06:32:19,074 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-18 06:32:19,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-18 06:32:19,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2020-07-18 06:32:19,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:32:19,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 51 states. [2020-07-18 06:32:19,149 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 51 states. [2020-07-18 06:32:19,149 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 51 states. [2020-07-18 06:32:19,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:19,153 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2020-07-18 06:32:19,153 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-07-18 06:32:19,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:19,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:19,155 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 56 states. [2020-07-18 06:32:19,155 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 56 states. [2020-07-18 06:32:19,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:19,158 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2020-07-18 06:32:19,159 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-07-18 06:32:19,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:19,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:19,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:32:19,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:32:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-18 06:32:19,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2020-07-18 06:32:19,163 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 30 [2020-07-18 06:32:19,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:32:19,164 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2020-07-18 06:32:19,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 06:32:19,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 54 transitions. [2020-07-18 06:32:19,231 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 06:32:19,232 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-07-18 06:32:19,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-18 06:32:19,233 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:32:19,233 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:32:19,234 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 06:32:19,234 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:32:19,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:32:19,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1707000309, now seen corresponding path program 1 times [2020-07-18 06:32:19,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:32:19,235 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1066611912] [2020-07-18 06:32:19,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:32:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:19,485 INFO L280 TraceCheckUtils]: 0: Hoare triple {880#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {863#true} is VALID [2020-07-18 06:32:19,486 INFO L280 TraceCheckUtils]: 1: Hoare triple {863#true} #valid := #valid[0 := 0]; {863#true} is VALID [2020-07-18 06:32:19,486 INFO L280 TraceCheckUtils]: 2: Hoare triple {863#true} assume 0 < #StackHeapBarrier; {863#true} is VALID [2020-07-18 06:32:19,487 INFO L280 TraceCheckUtils]: 3: Hoare triple {863#true} ~N~0 := 0; {863#true} is VALID [2020-07-18 06:32:19,487 INFO L280 TraceCheckUtils]: 4: Hoare triple {863#true} assume true; {863#true} is VALID [2020-07-18 06:32:19,487 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {863#true} {863#true} #103#return; {863#true} is VALID [2020-07-18 06:32:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:19,495 INFO L280 TraceCheckUtils]: 0: Hoare triple {863#true} ~cond := #in~cond; {863#true} is VALID [2020-07-18 06:32:19,496 INFO L280 TraceCheckUtils]: 1: Hoare triple {863#true} assume !(0 == ~cond); {863#true} is VALID [2020-07-18 06:32:19,496 INFO L280 TraceCheckUtils]: 2: Hoare triple {863#true} assume true; {863#true} is VALID [2020-07-18 06:32:19,497 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {863#true} {871#(<= 1 ~N~0)} #99#return; {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:19,498 INFO L263 TraceCheckUtils]: 0: Hoare triple {863#true} call ULTIMATE.init(); {880#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 06:32:19,499 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {863#true} is VALID [2020-07-18 06:32:19,499 INFO L280 TraceCheckUtils]: 2: Hoare triple {863#true} #valid := #valid[0 := 0]; {863#true} is VALID [2020-07-18 06:32:19,499 INFO L280 TraceCheckUtils]: 3: Hoare triple {863#true} assume 0 < #StackHeapBarrier; {863#true} is VALID [2020-07-18 06:32:19,499 INFO L280 TraceCheckUtils]: 4: Hoare triple {863#true} ~N~0 := 0; {863#true} is VALID [2020-07-18 06:32:19,500 INFO L280 TraceCheckUtils]: 5: Hoare triple {863#true} assume true; {863#true} is VALID [2020-07-18 06:32:19,500 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {863#true} {863#true} #103#return; {863#true} is VALID [2020-07-18 06:32:19,500 INFO L263 TraceCheckUtils]: 7: Hoare triple {863#true} call #t~ret7 := main(); {863#true} is VALID [2020-07-18 06:32:19,501 INFO L280 TraceCheckUtils]: 8: Hoare triple {863#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {863#true} is VALID [2020-07-18 06:32:19,501 INFO L280 TraceCheckUtils]: 9: Hoare triple {863#true} ~N~0 := #t~nondet0; {863#true} is VALID [2020-07-18 06:32:19,501 INFO L280 TraceCheckUtils]: 10: Hoare triple {863#true} havoc #t~nondet0; {863#true} is VALID [2020-07-18 06:32:19,503 INFO L280 TraceCheckUtils]: 11: Hoare triple {863#true} assume !(~N~0 <= 0); {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:19,503 INFO L263 TraceCheckUtils]: 12: Hoare triple {871#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {863#true} is VALID [2020-07-18 06:32:19,503 INFO L280 TraceCheckUtils]: 13: Hoare triple {863#true} ~cond := #in~cond; {863#true} is VALID [2020-07-18 06:32:19,504 INFO L280 TraceCheckUtils]: 14: Hoare triple {863#true} assume !(0 == ~cond); {863#true} is VALID [2020-07-18 06:32:19,504 INFO L280 TraceCheckUtils]: 15: Hoare triple {863#true} assume true; {863#true} is VALID [2020-07-18 06:32:19,505 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {863#true} {871#(<= 1 ~N~0)} #99#return; {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:19,506 INFO L280 TraceCheckUtils]: 17: Hoare triple {871#(<= 1 ~N~0)} havoc ~i~0; {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:19,507 INFO L280 TraceCheckUtils]: 18: Hoare triple {871#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:19,508 INFO L280 TraceCheckUtils]: 19: Hoare triple {871#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:19,508 INFO L280 TraceCheckUtils]: 20: Hoare triple {871#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:19,509 INFO L280 TraceCheckUtils]: 21: Hoare triple {871#(<= 1 ~N~0)} ~i~0 := 0; {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:19,511 INFO L280 TraceCheckUtils]: 22: Hoare triple {871#(<= 1 ~N~0)} assume !!(~i~0 < ~N~0); {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:19,513 INFO L280 TraceCheckUtils]: 23: Hoare triple {871#(<= 1 ~N~0)} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2); {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:19,514 INFO L280 TraceCheckUtils]: 24: Hoare triple {871#(<= 1 ~N~0)} SUMMARY for call write~int(20, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L32 {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:19,515 INFO L280 TraceCheckUtils]: 25: Hoare triple {871#(<= 1 ~N~0)} #t~post2 := ~i~0; {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:19,516 INFO L280 TraceCheckUtils]: 26: Hoare triple {871#(<= 1 ~N~0)} ~i~0 := 1 + #t~post2; {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:19,516 INFO L280 TraceCheckUtils]: 27: Hoare triple {871#(<= 1 ~N~0)} havoc #t~post2; {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:19,517 INFO L280 TraceCheckUtils]: 28: Hoare triple {871#(<= 1 ~N~0)} assume !(~i~0 < ~N~0); {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:19,518 INFO L280 TraceCheckUtils]: 29: Hoare triple {871#(<= 1 ~N~0)} ~i~0 := 0; {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:19,519 INFO L280 TraceCheckUtils]: 30: Hoare triple {871#(<= 1 ~N~0)} assume !!(~i~0 < ~N~0); {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:19,520 INFO L280 TraceCheckUtils]: 31: Hoare triple {871#(<= 1 ~N~0)} assume 0 == ~i~0; {871#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:19,521 INFO L280 TraceCheckUtils]: 32: Hoare triple {871#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L41 {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-18 06:32:19,522 INFO L280 TraceCheckUtils]: 33: Hoare triple {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} #t~post3 := ~i~0; {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-18 06:32:19,523 INFO L280 TraceCheckUtils]: 34: Hoare triple {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} ~i~0 := 1 + #t~post3; {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-18 06:32:19,524 INFO L280 TraceCheckUtils]: 35: Hoare triple {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} havoc #t~post3; {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-18 06:32:19,525 INFO L280 TraceCheckUtils]: 36: Hoare triple {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} assume !(~i~0 < ~N~0); {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-18 06:32:19,526 INFO L280 TraceCheckUtils]: 37: Hoare triple {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {877#(and (= 0 |main_#t~mem6|) (<= 1 ~N~0))} is VALID [2020-07-18 06:32:19,527 INFO L263 TraceCheckUtils]: 38: Hoare triple {877#(and (= 0 |main_#t~mem6|) (<= 1 ~N~0))} call __VERIFIER_assert((if #t~mem6 <= 2 * ~N~0 then 1 else 0)); {878#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:32:19,528 INFO L280 TraceCheckUtils]: 39: Hoare triple {878#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {879#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:32:19,528 INFO L280 TraceCheckUtils]: 40: Hoare triple {879#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {864#false} is VALID [2020-07-18 06:32:19,529 INFO L280 TraceCheckUtils]: 41: Hoare triple {864#false} assume !false; {864#false} is VALID [2020-07-18 06:32:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-18 06:32:19,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1066611912] [2020-07-18 06:32:19,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:32:19,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 06:32:19,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307627724] [2020-07-18 06:32:19,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2020-07-18 06:32:19,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:32:19,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 06:32:19,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:19,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 06:32:19,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:32:19,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 06:32:19,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-18 06:32:19,584 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 8 states. [2020-07-18 06:32:20,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:20,250 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2020-07-18 06:32:20,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-18 06:32:20,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2020-07-18 06:32:20,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:32:20,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 06:32:20,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2020-07-18 06:32:20,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 06:32:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2020-07-18 06:32:20,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 66 transitions. [2020-07-18 06:32:20,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:20,349 INFO L225 Difference]: With dead ends: 66 [2020-07-18 06:32:20,350 INFO L226 Difference]: Without dead ends: 60 [2020-07-18 06:32:20,350 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-07-18 06:32:20,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-18 06:32:20,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2020-07-18 06:32:20,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:32:20,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 55 states. [2020-07-18 06:32:20,441 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 55 states. [2020-07-18 06:32:20,441 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 55 states. [2020-07-18 06:32:20,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:20,446 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-18 06:32:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-07-18 06:32:20,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:20,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:20,447 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 60 states. [2020-07-18 06:32:20,448 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 60 states. [2020-07-18 06:32:20,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:20,452 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-18 06:32:20,452 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-07-18 06:32:20,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:20,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:20,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:32:20,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:32:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-18 06:32:20,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2020-07-18 06:32:20,457 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 42 [2020-07-18 06:32:20,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:32:20,460 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2020-07-18 06:32:20,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 06:32:20,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 58 transitions. [2020-07-18 06:32:20,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:20,526 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-18 06:32:20,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-18 06:32:20,528 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:32:20,528 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:32:20,529 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 06:32:20,529 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:32:20,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:32:20,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1747495296, now seen corresponding path program 1 times [2020-07-18 06:32:20,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:32:20,530 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2081892480] [2020-07-18 06:32:20,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:32:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:20,699 INFO L280 TraceCheckUtils]: 0: Hoare triple {1273#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1254#true} is VALID [2020-07-18 06:32:20,699 INFO L280 TraceCheckUtils]: 1: Hoare triple {1254#true} #valid := #valid[0 := 0]; {1254#true} is VALID [2020-07-18 06:32:20,700 INFO L280 TraceCheckUtils]: 2: Hoare triple {1254#true} assume 0 < #StackHeapBarrier; {1254#true} is VALID [2020-07-18 06:32:20,700 INFO L280 TraceCheckUtils]: 3: Hoare triple {1254#true} ~N~0 := 0; {1254#true} is VALID [2020-07-18 06:32:20,700 INFO L280 TraceCheckUtils]: 4: Hoare triple {1254#true} assume true; {1254#true} is VALID [2020-07-18 06:32:20,700 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1254#true} {1254#true} #103#return; {1254#true} is VALID [2020-07-18 06:32:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:20,721 INFO L280 TraceCheckUtils]: 0: Hoare triple {1254#true} ~cond := #in~cond; {1254#true} is VALID [2020-07-18 06:32:20,722 INFO L280 TraceCheckUtils]: 1: Hoare triple {1254#true} assume !(0 == ~cond); {1254#true} is VALID [2020-07-18 06:32:20,722 INFO L280 TraceCheckUtils]: 2: Hoare triple {1254#true} assume true; {1254#true} is VALID [2020-07-18 06:32:20,722 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1254#true} {1254#true} #99#return; {1254#true} is VALID [2020-07-18 06:32:20,728 INFO L263 TraceCheckUtils]: 0: Hoare triple {1254#true} call ULTIMATE.init(); {1273#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 06:32:20,728 INFO L280 TraceCheckUtils]: 1: Hoare triple {1273#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1254#true} is VALID [2020-07-18 06:32:20,728 INFO L280 TraceCheckUtils]: 2: Hoare triple {1254#true} #valid := #valid[0 := 0]; {1254#true} is VALID [2020-07-18 06:32:20,729 INFO L280 TraceCheckUtils]: 3: Hoare triple {1254#true} assume 0 < #StackHeapBarrier; {1254#true} is VALID [2020-07-18 06:32:20,729 INFO L280 TraceCheckUtils]: 4: Hoare triple {1254#true} ~N~0 := 0; {1254#true} is VALID [2020-07-18 06:32:20,729 INFO L280 TraceCheckUtils]: 5: Hoare triple {1254#true} assume true; {1254#true} is VALID [2020-07-18 06:32:20,730 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1254#true} {1254#true} #103#return; {1254#true} is VALID [2020-07-18 06:32:20,730 INFO L263 TraceCheckUtils]: 7: Hoare triple {1254#true} call #t~ret7 := main(); {1254#true} is VALID [2020-07-18 06:32:20,730 INFO L280 TraceCheckUtils]: 8: Hoare triple {1254#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1254#true} is VALID [2020-07-18 06:32:20,730 INFO L280 TraceCheckUtils]: 9: Hoare triple {1254#true} ~N~0 := #t~nondet0; {1254#true} is VALID [2020-07-18 06:32:20,731 INFO L280 TraceCheckUtils]: 10: Hoare triple {1254#true} havoc #t~nondet0; {1254#true} is VALID [2020-07-18 06:32:20,731 INFO L280 TraceCheckUtils]: 11: Hoare triple {1254#true} assume !(~N~0 <= 0); {1254#true} is VALID [2020-07-18 06:32:20,731 INFO L263 TraceCheckUtils]: 12: Hoare triple {1254#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1254#true} is VALID [2020-07-18 06:32:20,731 INFO L280 TraceCheckUtils]: 13: Hoare triple {1254#true} ~cond := #in~cond; {1254#true} is VALID [2020-07-18 06:32:20,732 INFO L280 TraceCheckUtils]: 14: Hoare triple {1254#true} assume !(0 == ~cond); {1254#true} is VALID [2020-07-18 06:32:20,732 INFO L280 TraceCheckUtils]: 15: Hoare triple {1254#true} assume true; {1254#true} is VALID [2020-07-18 06:32:20,732 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1254#true} {1254#true} #99#return; {1254#true} is VALID [2020-07-18 06:32:20,732 INFO L280 TraceCheckUtils]: 17: Hoare triple {1254#true} havoc ~i~0; {1254#true} is VALID [2020-07-18 06:32:20,733 INFO L280 TraceCheckUtils]: 18: Hoare triple {1254#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {1254#true} is VALID [2020-07-18 06:32:20,733 INFO L280 TraceCheckUtils]: 19: Hoare triple {1254#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {1254#true} is VALID [2020-07-18 06:32:20,733 INFO L280 TraceCheckUtils]: 20: Hoare triple {1254#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {1254#true} is VALID [2020-07-18 06:32:20,734 INFO L280 TraceCheckUtils]: 21: Hoare triple {1254#true} ~i~0 := 0; {1266#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:20,735 INFO L280 TraceCheckUtils]: 22: Hoare triple {1266#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0); {1266#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:20,735 INFO L280 TraceCheckUtils]: 23: Hoare triple {1266#(= 0 main_~i~0)} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2); {1266#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:20,736 INFO L280 TraceCheckUtils]: 24: Hoare triple {1266#(= 0 main_~i~0)} SUMMARY for call write~int(20, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L32 {1266#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:20,737 INFO L280 TraceCheckUtils]: 25: Hoare triple {1266#(= 0 main_~i~0)} #t~post2 := ~i~0; {1267#(= |main_#t~post2| 0)} is VALID [2020-07-18 06:32:20,737 INFO L280 TraceCheckUtils]: 26: Hoare triple {1267#(= |main_#t~post2| 0)} ~i~0 := 1 + #t~post2; {1268#(<= main_~i~0 1)} is VALID [2020-07-18 06:32:20,738 INFO L280 TraceCheckUtils]: 27: Hoare triple {1268#(<= main_~i~0 1)} havoc #t~post2; {1268#(<= main_~i~0 1)} is VALID [2020-07-18 06:32:20,739 INFO L280 TraceCheckUtils]: 28: Hoare triple {1268#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {1269#(<= ~N~0 1)} is VALID [2020-07-18 06:32:20,739 INFO L280 TraceCheckUtils]: 29: Hoare triple {1269#(<= ~N~0 1)} ~i~0 := 0; {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-18 06:32:20,740 INFO L280 TraceCheckUtils]: 30: Hoare triple {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0); {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-18 06:32:20,741 INFO L280 TraceCheckUtils]: 31: Hoare triple {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} assume 0 == ~i~0; {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-18 06:32:20,741 INFO L280 TraceCheckUtils]: 32: Hoare triple {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L41 {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-18 06:32:20,742 INFO L280 TraceCheckUtils]: 33: Hoare triple {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} #t~post3 := ~i~0; {1271#(and (= |main_#t~post3| 0) (<= ~N~0 1))} is VALID [2020-07-18 06:32:20,743 INFO L280 TraceCheckUtils]: 34: Hoare triple {1271#(and (= |main_#t~post3| 0) (<= ~N~0 1))} ~i~0 := 1 + #t~post3; {1272#(<= ~N~0 main_~i~0)} is VALID [2020-07-18 06:32:20,743 INFO L280 TraceCheckUtils]: 35: Hoare triple {1272#(<= ~N~0 main_~i~0)} havoc #t~post3; {1272#(<= ~N~0 main_~i~0)} is VALID [2020-07-18 06:32:20,747 INFO L280 TraceCheckUtils]: 36: Hoare triple {1272#(<= ~N~0 main_~i~0)} assume !!(~i~0 < ~N~0); {1255#false} is VALID [2020-07-18 06:32:20,747 INFO L280 TraceCheckUtils]: 37: Hoare triple {1255#false} assume !(0 == ~i~0); {1255#false} is VALID [2020-07-18 06:32:20,748 INFO L280 TraceCheckUtils]: 38: Hoare triple {1255#false} SUMMARY for call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L43 {1255#false} is VALID [2020-07-18 06:32:20,748 INFO L280 TraceCheckUtils]: 39: Hoare triple {1255#false} SUMMARY for call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L43-1 {1255#false} is VALID [2020-07-18 06:32:20,748 INFO L280 TraceCheckUtils]: 40: Hoare triple {1255#false} SUMMARY for call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L43-2 {1255#false} is VALID [2020-07-18 06:32:20,749 INFO L280 TraceCheckUtils]: 41: Hoare triple {1255#false} havoc #t~mem4; {1255#false} is VALID [2020-07-18 06:32:20,749 INFO L280 TraceCheckUtils]: 42: Hoare triple {1255#false} havoc #t~mem5; {1255#false} is VALID [2020-07-18 06:32:20,749 INFO L280 TraceCheckUtils]: 43: Hoare triple {1255#false} #t~post3 := ~i~0; {1255#false} is VALID [2020-07-18 06:32:20,749 INFO L280 TraceCheckUtils]: 44: Hoare triple {1255#false} ~i~0 := 1 + #t~post3; {1255#false} is VALID [2020-07-18 06:32:20,750 INFO L280 TraceCheckUtils]: 45: Hoare triple {1255#false} havoc #t~post3; {1255#false} is VALID [2020-07-18 06:32:20,750 INFO L280 TraceCheckUtils]: 46: Hoare triple {1255#false} assume !(~i~0 < ~N~0); {1255#false} is VALID [2020-07-18 06:32:20,750 INFO L280 TraceCheckUtils]: 47: Hoare triple {1255#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {1255#false} is VALID [2020-07-18 06:32:20,750 INFO L263 TraceCheckUtils]: 48: Hoare triple {1255#false} call __VERIFIER_assert((if #t~mem6 <= 2 * ~N~0 then 1 else 0)); {1255#false} is VALID [2020-07-18 06:32:20,751 INFO L280 TraceCheckUtils]: 49: Hoare triple {1255#false} ~cond := #in~cond; {1255#false} is VALID [2020-07-18 06:32:20,751 INFO L280 TraceCheckUtils]: 50: Hoare triple {1255#false} assume 0 == ~cond; {1255#false} is VALID [2020-07-18 06:32:20,751 INFO L280 TraceCheckUtils]: 51: Hoare triple {1255#false} assume !false; {1255#false} is VALID [2020-07-18 06:32:20,754 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:32:20,755 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2081892480] [2020-07-18 06:32:20,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:32:20,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-18 06:32:20,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344494963] [2020-07-18 06:32:20,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2020-07-18 06:32:20,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:32:20,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-18 06:32:20,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:20,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-18 06:32:20,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:32:20,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-18 06:32:20,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-18 06:32:20,817 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 10 states. [2020-07-18 06:32:21,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:21,582 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2020-07-18 06:32:21,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-18 06:32:21,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2020-07-18 06:32:21,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:32:21,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 06:32:21,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 94 transitions. [2020-07-18 06:32:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 06:32:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 94 transitions. [2020-07-18 06:32:21,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 94 transitions. [2020-07-18 06:32:21,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:21,712 INFO L225 Difference]: With dead ends: 94 [2020-07-18 06:32:21,713 INFO L226 Difference]: Without dead ends: 65 [2020-07-18 06:32:21,713 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2020-07-18 06:32:21,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-18 06:32:21,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2020-07-18 06:32:21,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:32:21,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 60 states. [2020-07-18 06:32:21,801 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 60 states. [2020-07-18 06:32:21,801 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 60 states. [2020-07-18 06:32:21,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:21,804 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-07-18 06:32:21,805 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-07-18 06:32:21,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:21,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:21,806 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 65 states. [2020-07-18 06:32:21,806 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 65 states. [2020-07-18 06:32:21,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:21,809 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-07-18 06:32:21,809 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-07-18 06:32:21,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:21,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:21,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:32:21,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:32:21,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-18 06:32:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2020-07-18 06:32:21,813 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 52 [2020-07-18 06:32:21,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:32:21,813 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2020-07-18 06:32:21,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-18 06:32:21,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states and 63 transitions. [2020-07-18 06:32:21,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:21,893 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2020-07-18 06:32:21,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-18 06:32:21,895 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:32:21,896 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:32:21,896 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 06:32:21,896 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:32:21,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:32:21,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1872706551, now seen corresponding path program 2 times [2020-07-18 06:32:21,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:32:21,897 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [614365718] [2020-07-18 06:32:21,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:32:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:22,045 INFO L280 TraceCheckUtils]: 0: Hoare triple {1741#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1726#true} is VALID [2020-07-18 06:32:22,046 INFO L280 TraceCheckUtils]: 1: Hoare triple {1726#true} #valid := #valid[0 := 0]; {1726#true} is VALID [2020-07-18 06:32:22,046 INFO L280 TraceCheckUtils]: 2: Hoare triple {1726#true} assume 0 < #StackHeapBarrier; {1726#true} is VALID [2020-07-18 06:32:22,046 INFO L280 TraceCheckUtils]: 3: Hoare triple {1726#true} ~N~0 := 0; {1726#true} is VALID [2020-07-18 06:32:22,047 INFO L280 TraceCheckUtils]: 4: Hoare triple {1726#true} assume true; {1726#true} is VALID [2020-07-18 06:32:22,047 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1726#true} {1726#true} #103#return; {1726#true} is VALID [2020-07-18 06:32:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:22,071 INFO L280 TraceCheckUtils]: 0: Hoare triple {1726#true} ~cond := #in~cond; {1726#true} is VALID [2020-07-18 06:32:22,071 INFO L280 TraceCheckUtils]: 1: Hoare triple {1726#true} assume !(0 == ~cond); {1726#true} is VALID [2020-07-18 06:32:22,071 INFO L280 TraceCheckUtils]: 2: Hoare triple {1726#true} assume true; {1726#true} is VALID [2020-07-18 06:32:22,072 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1726#true} {1726#true} #99#return; {1726#true} is VALID [2020-07-18 06:32:22,079 INFO L263 TraceCheckUtils]: 0: Hoare triple {1726#true} call ULTIMATE.init(); {1741#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 06:32:22,080 INFO L280 TraceCheckUtils]: 1: Hoare triple {1741#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1726#true} is VALID [2020-07-18 06:32:22,080 INFO L280 TraceCheckUtils]: 2: Hoare triple {1726#true} #valid := #valid[0 := 0]; {1726#true} is VALID [2020-07-18 06:32:22,080 INFO L280 TraceCheckUtils]: 3: Hoare triple {1726#true} assume 0 < #StackHeapBarrier; {1726#true} is VALID [2020-07-18 06:32:22,081 INFO L280 TraceCheckUtils]: 4: Hoare triple {1726#true} ~N~0 := 0; {1726#true} is VALID [2020-07-18 06:32:22,081 INFO L280 TraceCheckUtils]: 5: Hoare triple {1726#true} assume true; {1726#true} is VALID [2020-07-18 06:32:22,081 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1726#true} {1726#true} #103#return; {1726#true} is VALID [2020-07-18 06:32:22,081 INFO L263 TraceCheckUtils]: 7: Hoare triple {1726#true} call #t~ret7 := main(); {1726#true} is VALID [2020-07-18 06:32:22,082 INFO L280 TraceCheckUtils]: 8: Hoare triple {1726#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1726#true} is VALID [2020-07-18 06:32:22,082 INFO L280 TraceCheckUtils]: 9: Hoare triple {1726#true} ~N~0 := #t~nondet0; {1726#true} is VALID [2020-07-18 06:32:22,082 INFO L280 TraceCheckUtils]: 10: Hoare triple {1726#true} havoc #t~nondet0; {1726#true} is VALID [2020-07-18 06:32:22,082 INFO L280 TraceCheckUtils]: 11: Hoare triple {1726#true} assume !(~N~0 <= 0); {1726#true} is VALID [2020-07-18 06:32:22,083 INFO L263 TraceCheckUtils]: 12: Hoare triple {1726#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1726#true} is VALID [2020-07-18 06:32:22,083 INFO L280 TraceCheckUtils]: 13: Hoare triple {1726#true} ~cond := #in~cond; {1726#true} is VALID [2020-07-18 06:32:22,083 INFO L280 TraceCheckUtils]: 14: Hoare triple {1726#true} assume !(0 == ~cond); {1726#true} is VALID [2020-07-18 06:32:22,083 INFO L280 TraceCheckUtils]: 15: Hoare triple {1726#true} assume true; {1726#true} is VALID [2020-07-18 06:32:22,083 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1726#true} {1726#true} #99#return; {1726#true} is VALID [2020-07-18 06:32:22,084 INFO L280 TraceCheckUtils]: 17: Hoare triple {1726#true} havoc ~i~0; {1726#true} is VALID [2020-07-18 06:32:22,084 INFO L280 TraceCheckUtils]: 18: Hoare triple {1726#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {1726#true} is VALID [2020-07-18 06:32:22,084 INFO L280 TraceCheckUtils]: 19: Hoare triple {1726#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {1726#true} is VALID [2020-07-18 06:32:22,084 INFO L280 TraceCheckUtils]: 20: Hoare triple {1726#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {1726#true} is VALID [2020-07-18 06:32:22,086 INFO L280 TraceCheckUtils]: 21: Hoare triple {1726#true} ~i~0 := 0; {1738#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:22,087 INFO L280 TraceCheckUtils]: 22: Hoare triple {1738#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0); {1738#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:22,087 INFO L280 TraceCheckUtils]: 23: Hoare triple {1738#(= 0 main_~i~0)} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2); {1738#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:22,088 INFO L280 TraceCheckUtils]: 24: Hoare triple {1738#(= 0 main_~i~0)} SUMMARY for call write~int(20, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L32 {1738#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:22,088 INFO L280 TraceCheckUtils]: 25: Hoare triple {1738#(= 0 main_~i~0)} #t~post2 := ~i~0; {1739#(= |main_#t~post2| 0)} is VALID [2020-07-18 06:32:22,089 INFO L280 TraceCheckUtils]: 26: Hoare triple {1739#(= |main_#t~post2| 0)} ~i~0 := 1 + #t~post2; {1740#(not (= main_~i~0 (* 2 (div main_~i~0 2))))} is VALID [2020-07-18 06:32:22,091 INFO L280 TraceCheckUtils]: 27: Hoare triple {1740#(not (= main_~i~0 (* 2 (div main_~i~0 2))))} havoc #t~post2; {1740#(not (= main_~i~0 (* 2 (div main_~i~0 2))))} is VALID [2020-07-18 06:32:22,092 INFO L280 TraceCheckUtils]: 28: Hoare triple {1740#(not (= main_~i~0 (* 2 (div main_~i~0 2))))} assume !!(~i~0 < ~N~0); {1740#(not (= main_~i~0 (* 2 (div main_~i~0 2))))} is VALID [2020-07-18 06:32:22,093 INFO L280 TraceCheckUtils]: 29: Hoare triple {1740#(not (= main_~i~0 (* 2 (div main_~i~0 2))))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2); {1727#false} is VALID [2020-07-18 06:32:22,093 INFO L280 TraceCheckUtils]: 30: Hoare triple {1727#false} SUMMARY for call write~int(20, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L32 {1727#false} is VALID [2020-07-18 06:32:22,094 INFO L280 TraceCheckUtils]: 31: Hoare triple {1727#false} #t~post2 := ~i~0; {1727#false} is VALID [2020-07-18 06:32:22,094 INFO L280 TraceCheckUtils]: 32: Hoare triple {1727#false} ~i~0 := 1 + #t~post2; {1727#false} is VALID [2020-07-18 06:32:22,094 INFO L280 TraceCheckUtils]: 33: Hoare triple {1727#false} havoc #t~post2; {1727#false} is VALID [2020-07-18 06:32:22,094 INFO L280 TraceCheckUtils]: 34: Hoare triple {1727#false} assume !(~i~0 < ~N~0); {1727#false} is VALID [2020-07-18 06:32:22,095 INFO L280 TraceCheckUtils]: 35: Hoare triple {1727#false} ~i~0 := 0; {1727#false} is VALID [2020-07-18 06:32:22,095 INFO L280 TraceCheckUtils]: 36: Hoare triple {1727#false} assume !!(~i~0 < ~N~0); {1727#false} is VALID [2020-07-18 06:32:22,095 INFO L280 TraceCheckUtils]: 37: Hoare triple {1727#false} assume 0 == ~i~0; {1727#false} is VALID [2020-07-18 06:32:22,095 INFO L280 TraceCheckUtils]: 38: Hoare triple {1727#false} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L41 {1727#false} is VALID [2020-07-18 06:32:22,096 INFO L280 TraceCheckUtils]: 39: Hoare triple {1727#false} #t~post3 := ~i~0; {1727#false} is VALID [2020-07-18 06:32:22,096 INFO L280 TraceCheckUtils]: 40: Hoare triple {1727#false} ~i~0 := 1 + #t~post3; {1727#false} is VALID [2020-07-18 06:32:22,096 INFO L280 TraceCheckUtils]: 41: Hoare triple {1727#false} havoc #t~post3; {1727#false} is VALID [2020-07-18 06:32:22,096 INFO L280 TraceCheckUtils]: 42: Hoare triple {1727#false} assume !!(~i~0 < ~N~0); {1727#false} is VALID [2020-07-18 06:32:22,096 INFO L280 TraceCheckUtils]: 43: Hoare triple {1727#false} assume !(0 == ~i~0); {1727#false} is VALID [2020-07-18 06:32:22,097 INFO L280 TraceCheckUtils]: 44: Hoare triple {1727#false} SUMMARY for call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L43 {1727#false} is VALID [2020-07-18 06:32:22,097 INFO L280 TraceCheckUtils]: 45: Hoare triple {1727#false} SUMMARY for call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L43-1 {1727#false} is VALID [2020-07-18 06:32:22,097 INFO L280 TraceCheckUtils]: 46: Hoare triple {1727#false} SUMMARY for call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L43-2 {1727#false} is VALID [2020-07-18 06:32:22,097 INFO L280 TraceCheckUtils]: 47: Hoare triple {1727#false} havoc #t~mem4; {1727#false} is VALID [2020-07-18 06:32:22,098 INFO L280 TraceCheckUtils]: 48: Hoare triple {1727#false} havoc #t~mem5; {1727#false} is VALID [2020-07-18 06:32:22,098 INFO L280 TraceCheckUtils]: 49: Hoare triple {1727#false} #t~post3 := ~i~0; {1727#false} is VALID [2020-07-18 06:32:22,098 INFO L280 TraceCheckUtils]: 50: Hoare triple {1727#false} ~i~0 := 1 + #t~post3; {1727#false} is VALID [2020-07-18 06:32:22,098 INFO L280 TraceCheckUtils]: 51: Hoare triple {1727#false} havoc #t~post3; {1727#false} is VALID [2020-07-18 06:32:22,099 INFO L280 TraceCheckUtils]: 52: Hoare triple {1727#false} assume !(~i~0 < ~N~0); {1727#false} is VALID [2020-07-18 06:32:22,099 INFO L280 TraceCheckUtils]: 53: Hoare triple {1727#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {1727#false} is VALID [2020-07-18 06:32:22,099 INFO L263 TraceCheckUtils]: 54: Hoare triple {1727#false} call __VERIFIER_assert((if #t~mem6 <= 2 * ~N~0 then 1 else 0)); {1727#false} is VALID [2020-07-18 06:32:22,099 INFO L280 TraceCheckUtils]: 55: Hoare triple {1727#false} ~cond := #in~cond; {1727#false} is VALID [2020-07-18 06:32:22,100 INFO L280 TraceCheckUtils]: 56: Hoare triple {1727#false} assume 0 == ~cond; {1727#false} is VALID [2020-07-18 06:32:22,100 INFO L280 TraceCheckUtils]: 57: Hoare triple {1727#false} assume !false; {1727#false} is VALID [2020-07-18 06:32:22,104 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-18 06:32:22,104 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [614365718] [2020-07-18 06:32:22,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:32:22,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-18 06:32:22,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236766576] [2020-07-18 06:32:22,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2020-07-18 06:32:22,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:32:22,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 06:32:22,170 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 06:32:22,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 06:32:22,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:32:22,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 06:32:22,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 06:32:22,172 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 6 states. [2020-07-18 06:32:22,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:22,658 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2020-07-18 06:32:22,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 06:32:22,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2020-07-18 06:32:22,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:32:22,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 06:32:22,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2020-07-18 06:32:22,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 06:32:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2020-07-18 06:32:22,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 93 transitions. [2020-07-18 06:32:22,773 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:22,775 INFO L225 Difference]: With dead ends: 94 [2020-07-18 06:32:22,776 INFO L226 Difference]: Without dead ends: 63 [2020-07-18 06:32:22,776 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-18 06:32:22,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-18 06:32:22,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2020-07-18 06:32:22,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:32:22,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 61 states. [2020-07-18 06:32:22,880 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 61 states. [2020-07-18 06:32:22,880 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 61 states. [2020-07-18 06:32:22,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:22,883 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2020-07-18 06:32:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2020-07-18 06:32:22,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:22,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:22,884 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 63 states. [2020-07-18 06:32:22,884 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 63 states. [2020-07-18 06:32:22,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:22,886 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2020-07-18 06:32:22,886 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2020-07-18 06:32:22,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:22,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:22,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:32:22,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:32:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-18 06:32:22,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2020-07-18 06:32:22,890 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 58 [2020-07-18 06:32:22,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:32:22,890 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2020-07-18 06:32:22,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 06:32:22,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states and 64 transitions. [2020-07-18 06:32:22,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:22,972 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2020-07-18 06:32:22,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-18 06:32:22,972 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:32:22,973 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:32:22,973 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 06:32:22,973 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:32:22,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:32:22,974 INFO L82 PathProgramCache]: Analyzing trace with hash -557611095, now seen corresponding path program 1 times [2020-07-18 06:32:22,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:32:22,974 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1585104066] [2020-07-18 06:32:22,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:32:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:23,857 INFO L280 TraceCheckUtils]: 0: Hoare triple {2218#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2184#true} is VALID [2020-07-18 06:32:23,858 INFO L280 TraceCheckUtils]: 1: Hoare triple {2184#true} #valid := #valid[0 := 0]; {2184#true} is VALID [2020-07-18 06:32:23,858 INFO L280 TraceCheckUtils]: 2: Hoare triple {2184#true} assume 0 < #StackHeapBarrier; {2184#true} is VALID [2020-07-18 06:32:23,858 INFO L280 TraceCheckUtils]: 3: Hoare triple {2184#true} ~N~0 := 0; {2184#true} is VALID [2020-07-18 06:32:23,858 INFO L280 TraceCheckUtils]: 4: Hoare triple {2184#true} assume true; {2184#true} is VALID [2020-07-18 06:32:23,858 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2184#true} {2184#true} #103#return; {2184#true} is VALID [2020-07-18 06:32:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:23,868 INFO L280 TraceCheckUtils]: 0: Hoare triple {2184#true} ~cond := #in~cond; {2184#true} is VALID [2020-07-18 06:32:23,869 INFO L280 TraceCheckUtils]: 1: Hoare triple {2184#true} assume !(0 == ~cond); {2184#true} is VALID [2020-07-18 06:32:23,869 INFO L280 TraceCheckUtils]: 2: Hoare triple {2184#true} assume true; {2184#true} is VALID [2020-07-18 06:32:23,869 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2184#true} {2184#true} #99#return; {2184#true} is VALID [2020-07-18 06:32:23,871 INFO L263 TraceCheckUtils]: 0: Hoare triple {2184#true} call ULTIMATE.init(); {2218#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 06:32:23,871 INFO L280 TraceCheckUtils]: 1: Hoare triple {2218#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2184#true} is VALID [2020-07-18 06:32:23,872 INFO L280 TraceCheckUtils]: 2: Hoare triple {2184#true} #valid := #valid[0 := 0]; {2184#true} is VALID [2020-07-18 06:32:23,872 INFO L280 TraceCheckUtils]: 3: Hoare triple {2184#true} assume 0 < #StackHeapBarrier; {2184#true} is VALID [2020-07-18 06:32:23,872 INFO L280 TraceCheckUtils]: 4: Hoare triple {2184#true} ~N~0 := 0; {2184#true} is VALID [2020-07-18 06:32:23,873 INFO L280 TraceCheckUtils]: 5: Hoare triple {2184#true} assume true; {2184#true} is VALID [2020-07-18 06:32:23,873 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {2184#true} {2184#true} #103#return; {2184#true} is VALID [2020-07-18 06:32:23,873 INFO L263 TraceCheckUtils]: 7: Hoare triple {2184#true} call #t~ret7 := main(); {2184#true} is VALID [2020-07-18 06:32:23,873 INFO L280 TraceCheckUtils]: 8: Hoare triple {2184#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2184#true} is VALID [2020-07-18 06:32:23,874 INFO L280 TraceCheckUtils]: 9: Hoare triple {2184#true} ~N~0 := #t~nondet0; {2184#true} is VALID [2020-07-18 06:32:23,874 INFO L280 TraceCheckUtils]: 10: Hoare triple {2184#true} havoc #t~nondet0; {2184#true} is VALID [2020-07-18 06:32:23,878 INFO L280 TraceCheckUtils]: 11: Hoare triple {2184#true} assume !(~N~0 <= 0); {2184#true} is VALID [2020-07-18 06:32:23,878 INFO L263 TraceCheckUtils]: 12: Hoare triple {2184#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {2184#true} is VALID [2020-07-18 06:32:23,879 INFO L280 TraceCheckUtils]: 13: Hoare triple {2184#true} ~cond := #in~cond; {2184#true} is VALID [2020-07-18 06:32:23,879 INFO L280 TraceCheckUtils]: 14: Hoare triple {2184#true} assume !(0 == ~cond); {2184#true} is VALID [2020-07-18 06:32:23,879 INFO L280 TraceCheckUtils]: 15: Hoare triple {2184#true} assume true; {2184#true} is VALID [2020-07-18 06:32:23,879 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2184#true} {2184#true} #99#return; {2184#true} is VALID [2020-07-18 06:32:23,880 INFO L280 TraceCheckUtils]: 17: Hoare triple {2184#true} havoc ~i~0; {2184#true} is VALID [2020-07-18 06:32:23,887 INFO L280 TraceCheckUtils]: 18: Hoare triple {2184#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {2196#(= 1 (select |#valid| |main_~#sum~0.base|))} is VALID [2020-07-18 06:32:23,888 INFO L280 TraceCheckUtils]: 19: Hoare triple {2196#(= 1 (select |#valid| |main_~#sum~0.base|))} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {2197#(not (= |main_#t~malloc1.base| |main_~#sum~0.base|))} is VALID [2020-07-18 06:32:23,889 INFO L280 TraceCheckUtils]: 20: Hoare triple {2197#(not (= |main_#t~malloc1.base| |main_~#sum~0.base|))} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {2198#(not (= main_~a~0.base |main_~#sum~0.base|))} is VALID [2020-07-18 06:32:23,890 INFO L280 TraceCheckUtils]: 21: Hoare triple {2198#(not (= main_~a~0.base |main_~#sum~0.base|))} ~i~0 := 0; {2199#(and (= 0 main_~i~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} is VALID [2020-07-18 06:32:23,891 INFO L280 TraceCheckUtils]: 22: Hoare triple {2199#(and (= 0 main_~i~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} assume !!(~i~0 < ~N~0); {2199#(and (= 0 main_~i~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} is VALID [2020-07-18 06:32:23,892 INFO L280 TraceCheckUtils]: 23: Hoare triple {2199#(and (= 0 main_~i~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2); {2199#(and (= 0 main_~i~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} is VALID [2020-07-18 06:32:23,893 INFO L280 TraceCheckUtils]: 24: Hoare triple {2199#(and (= 0 main_~i~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} SUMMARY for call write~int(20, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L32 {2199#(and (= 0 main_~i~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} is VALID [2020-07-18 06:32:23,893 INFO L280 TraceCheckUtils]: 25: Hoare triple {2199#(and (= 0 main_~i~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} #t~post2 := ~i~0; {2200#(and (= |main_#t~post2| 0) (not (= main_~a~0.base |main_~#sum~0.base|)))} is VALID [2020-07-18 06:32:23,894 INFO L280 TraceCheckUtils]: 26: Hoare triple {2200#(and (= |main_#t~post2| 0) (not (= main_~a~0.base |main_~#sum~0.base|)))} ~i~0 := 1 + #t~post2; {2201#(and (not (= main_~a~0.base |main_~#sum~0.base|)) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-18 06:32:23,895 INFO L280 TraceCheckUtils]: 27: Hoare triple {2201#(and (not (= main_~a~0.base |main_~#sum~0.base|)) (<= main_~i~0 1) (<= 1 main_~i~0))} havoc #t~post2; {2201#(and (not (= main_~a~0.base |main_~#sum~0.base|)) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-18 06:32:23,896 INFO L280 TraceCheckUtils]: 28: Hoare triple {2201#(and (not (= main_~a~0.base |main_~#sum~0.base|)) (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~N~0); {2202#(and (<= 2 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (<= main_~i~0 1))} is VALID [2020-07-18 06:32:23,898 INFO L280 TraceCheckUtils]: 29: Hoare triple {2202#(and (<= 2 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (<= main_~i~0 1))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {2202#(and (<= 2 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (<= main_~i~0 1))} is VALID [2020-07-18 06:32:23,900 INFO L280 TraceCheckUtils]: 30: Hoare triple {2202#(and (<= 2 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (<= main_~i~0 1))} SUMMARY for call write~int(0, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L34 {2203#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 2 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (<= main_~i~0 1))} is VALID [2020-07-18 06:32:23,901 INFO L280 TraceCheckUtils]: 31: Hoare triple {2203#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 2 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (<= main_~i~0 1))} #t~post2 := ~i~0; {2204#(and (<= |main_#t~post2| 1) (or (< |main_#t~post2| 1) (and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= 2 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))))} is VALID [2020-07-18 06:32:23,902 INFO L280 TraceCheckUtils]: 32: Hoare triple {2204#(and (<= |main_#t~post2| 1) (or (< |main_#t~post2| 1) (and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= 2 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))))} ~i~0 := 1 + #t~post2; {2205#(and (or (< main_~i~0 2) (and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= 2 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))) (<= main_~i~0 2))} is VALID [2020-07-18 06:32:23,903 INFO L280 TraceCheckUtils]: 33: Hoare triple {2205#(and (or (< main_~i~0 2) (and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= 2 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))) (<= main_~i~0 2))} havoc #t~post2; {2205#(and (or (< main_~i~0 2) (and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= 2 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))) (<= main_~i~0 2))} is VALID [2020-07-18 06:32:23,905 INFO L280 TraceCheckUtils]: 34: Hoare triple {2205#(and (or (< main_~i~0 2) (and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (<= 2 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))) (<= main_~i~0 2))} assume !(~i~0 < ~N~0); {2206#(and (<= ~N~0 2) (or (< ~N~0 2) (and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~a~0.base |main_~#sum~0.base|)))))} is VALID [2020-07-18 06:32:23,906 INFO L280 TraceCheckUtils]: 35: Hoare triple {2206#(and (<= ~N~0 2) (or (< ~N~0 2) (and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~a~0.base |main_~#sum~0.base|)))))} ~i~0 := 0; {2207#(and (<= ~N~0 2) (or (< ~N~0 2) (and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~a~0.base |main_~#sum~0.base|)))) (= 0 main_~i~0))} is VALID [2020-07-18 06:32:23,907 INFO L280 TraceCheckUtils]: 36: Hoare triple {2207#(and (<= ~N~0 2) (or (< ~N~0 2) (and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~a~0.base |main_~#sum~0.base|)))) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0); {2207#(and (<= ~N~0 2) (or (< ~N~0 2) (and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~a~0.base |main_~#sum~0.base|)))) (= 0 main_~i~0))} is VALID [2020-07-18 06:32:23,907 INFO L280 TraceCheckUtils]: 37: Hoare triple {2207#(and (<= ~N~0 2) (or (< ~N~0 2) (and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~a~0.base |main_~#sum~0.base|)))) (= 0 main_~i~0))} assume 0 == ~i~0; {2207#(and (<= ~N~0 2) (or (< ~N~0 2) (and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~a~0.base |main_~#sum~0.base|)))) (= 0 main_~i~0))} is VALID [2020-07-18 06:32:23,909 INFO L280 TraceCheckUtils]: 38: Hoare triple {2207#(and (<= ~N~0 2) (or (< ~N~0 2) (and (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~a~0.base |main_~#sum~0.base|)))) (= 0 main_~i~0))} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L41 {2208#(and (<= ~N~0 2) (= 0 main_~i~0) (or (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (< ~N~0 2)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-18 06:32:23,910 INFO L280 TraceCheckUtils]: 39: Hoare triple {2208#(and (<= ~N~0 2) (= 0 main_~i~0) (or (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (< ~N~0 2)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} #t~post3 := ~i~0; {2209#(and (<= ~N~0 2) (= |main_#t~post3| 0) (or (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (< ~N~0 2)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-18 06:32:23,911 INFO L280 TraceCheckUtils]: 40: Hoare triple {2209#(and (<= ~N~0 2) (= |main_#t~post3| 0) (or (= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4))) (< ~N~0 2)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} ~i~0 := 1 + #t~post3; {2210#(and (or (<= ~N~0 main_~i~0) (and (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 2 ~N~0))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-18 06:32:23,913 INFO L280 TraceCheckUtils]: 41: Hoare triple {2210#(and (or (<= ~N~0 main_~i~0) (and (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 2 ~N~0))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} havoc #t~post3; {2210#(and (or (<= ~N~0 main_~i~0) (and (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 2 ~N~0))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-18 06:32:23,915 INFO L280 TraceCheckUtils]: 42: Hoare triple {2210#(and (or (<= ~N~0 main_~i~0) (and (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 2 ~N~0))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} assume !!(~i~0 < ~N~0); {2211#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 2 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-18 06:32:23,916 INFO L280 TraceCheckUtils]: 43: Hoare triple {2211#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 2 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} assume !(0 == ~i~0); {2211#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 2 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-18 06:32:23,921 INFO L280 TraceCheckUtils]: 44: Hoare triple {2211#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 2 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} SUMMARY for call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L43 {2212#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 |main_#t~mem4|) (<= 2 ~N~0))} is VALID [2020-07-18 06:32:23,922 INFO L280 TraceCheckUtils]: 45: Hoare triple {2212#(and (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 |main_#t~mem4|) (<= 2 ~N~0))} SUMMARY for call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L43-1 {2213#(and (= |main_#t~mem4| 0) (<= 2 ~N~0) (= 0 (+ |main_#t~mem4| |main_#t~mem5|)))} is VALID [2020-07-18 06:32:23,923 INFO L280 TraceCheckUtils]: 46: Hoare triple {2213#(and (= |main_#t~mem4| 0) (<= 2 ~N~0) (= 0 (+ |main_#t~mem4| |main_#t~mem5|)))} SUMMARY for call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L43-2 {2214#(<= (+ (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4) (* 2 ~N~0))} is VALID [2020-07-18 06:32:23,924 INFO L280 TraceCheckUtils]: 47: Hoare triple {2214#(<= (+ (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4) (* 2 ~N~0))} havoc #t~mem4; {2214#(<= (+ (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4) (* 2 ~N~0))} is VALID [2020-07-18 06:32:23,925 INFO L280 TraceCheckUtils]: 48: Hoare triple {2214#(<= (+ (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4) (* 2 ~N~0))} havoc #t~mem5; {2214#(<= (+ (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4) (* 2 ~N~0))} is VALID [2020-07-18 06:32:23,925 INFO L280 TraceCheckUtils]: 49: Hoare triple {2214#(<= (+ (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4) (* 2 ~N~0))} #t~post3 := ~i~0; {2214#(<= (+ (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4) (* 2 ~N~0))} is VALID [2020-07-18 06:32:23,926 INFO L280 TraceCheckUtils]: 50: Hoare triple {2214#(<= (+ (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4) (* 2 ~N~0))} ~i~0 := 1 + #t~post3; {2214#(<= (+ (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4) (* 2 ~N~0))} is VALID [2020-07-18 06:32:23,927 INFO L280 TraceCheckUtils]: 51: Hoare triple {2214#(<= (+ (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4) (* 2 ~N~0))} havoc #t~post3; {2214#(<= (+ (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4) (* 2 ~N~0))} is VALID [2020-07-18 06:32:23,928 INFO L280 TraceCheckUtils]: 52: Hoare triple {2214#(<= (+ (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4) (* 2 ~N~0))} assume !(~i~0 < ~N~0); {2214#(<= (+ (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4) (* 2 ~N~0))} is VALID [2020-07-18 06:32:23,929 INFO L280 TraceCheckUtils]: 53: Hoare triple {2214#(<= (+ (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4) (* 2 ~N~0))} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {2215#(<= (+ |main_#t~mem6| 4) (* 2 ~N~0))} is VALID [2020-07-18 06:32:23,930 INFO L263 TraceCheckUtils]: 54: Hoare triple {2215#(<= (+ |main_#t~mem6| 4) (* 2 ~N~0))} call __VERIFIER_assert((if #t~mem6 <= 2 * ~N~0 then 1 else 0)); {2216#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:32:23,931 INFO L280 TraceCheckUtils]: 55: Hoare triple {2216#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2217#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:32:23,932 INFO L280 TraceCheckUtils]: 56: Hoare triple {2217#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2185#false} is VALID [2020-07-18 06:32:23,932 INFO L280 TraceCheckUtils]: 57: Hoare triple {2185#false} assume !false; {2185#false} is VALID [2020-07-18 06:32:23,959 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:32:23,960 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1585104066] [2020-07-18 06:32:23,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:32:23,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-07-18 06:32:23,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088990003] [2020-07-18 06:32:23,963 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 58 [2020-07-18 06:32:23,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:32:23,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2020-07-18 06:32:24,028 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:24,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-18 06:32:24,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:32:24,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-18 06:32:24,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2020-07-18 06:32:24,030 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 25 states. [2020-07-18 06:32:28,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:28,389 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2020-07-18 06:32:28,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-07-18 06:32:28,389 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 58 [2020-07-18 06:32:28,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:32:28,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-18 06:32:28,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 136 transitions. [2020-07-18 06:32:28,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-18 06:32:28,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 136 transitions. [2020-07-18 06:32:28,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 136 transitions. [2020-07-18 06:32:28,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:28,586 INFO L225 Difference]: With dead ends: 131 [2020-07-18 06:32:28,587 INFO L226 Difference]: Without dead ends: 106 [2020-07-18 06:32:28,588 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=427, Invalid=2225, Unknown=0, NotChecked=0, Total=2652 [2020-07-18 06:32:28,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-07-18 06:32:28,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2020-07-18 06:32:28,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:32:28,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 94 states. [2020-07-18 06:32:28,901 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 94 states. [2020-07-18 06:32:28,901 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 94 states. [2020-07-18 06:32:28,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:28,907 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2020-07-18 06:32:28,907 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2020-07-18 06:32:28,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:28,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:28,908 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 106 states. [2020-07-18 06:32:28,909 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 106 states. [2020-07-18 06:32:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:28,913 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2020-07-18 06:32:28,913 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2020-07-18 06:32:28,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:28,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:28,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:32:28,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:32:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-18 06:32:28,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2020-07-18 06:32:28,918 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 58 [2020-07-18 06:32:28,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:32:28,918 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2020-07-18 06:32:28,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-18 06:32:28,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 94 states and 100 transitions. [2020-07-18 06:32:29,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:29,113 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2020-07-18 06:32:29,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-18 06:32:29,114 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:32:29,114 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:32:29,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 06:32:29,115 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:32:29,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:32:29,115 INFO L82 PathProgramCache]: Analyzing trace with hash -2138852750, now seen corresponding path program 2 times [2020-07-18 06:32:29,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:32:29,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1832153422] [2020-07-18 06:32:29,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:32:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:29,357 INFO L280 TraceCheckUtils]: 0: Hoare triple {2960#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2937#true} is VALID [2020-07-18 06:32:29,358 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} #valid := #valid[0 := 0]; {2937#true} is VALID [2020-07-18 06:32:29,358 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} assume 0 < #StackHeapBarrier; {2937#true} is VALID [2020-07-18 06:32:29,358 INFO L280 TraceCheckUtils]: 3: Hoare triple {2937#true} ~N~0 := 0; {2937#true} is VALID [2020-07-18 06:32:29,360 INFO L280 TraceCheckUtils]: 4: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 06:32:29,360 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2937#true} {2937#true} #103#return; {2937#true} is VALID [2020-07-18 06:32:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:29,366 INFO L280 TraceCheckUtils]: 0: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-18 06:32:29,366 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-18 06:32:29,366 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 06:32:29,367 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2937#true} {2937#true} #99#return; {2937#true} is VALID [2020-07-18 06:32:29,368 INFO L263 TraceCheckUtils]: 0: Hoare triple {2937#true} call ULTIMATE.init(); {2960#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 06:32:29,368 INFO L280 TraceCheckUtils]: 1: Hoare triple {2960#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2937#true} is VALID [2020-07-18 06:32:29,368 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} #valid := #valid[0 := 0]; {2937#true} is VALID [2020-07-18 06:32:29,369 INFO L280 TraceCheckUtils]: 3: Hoare triple {2937#true} assume 0 < #StackHeapBarrier; {2937#true} is VALID [2020-07-18 06:32:29,369 INFO L280 TraceCheckUtils]: 4: Hoare triple {2937#true} ~N~0 := 0; {2937#true} is VALID [2020-07-18 06:32:29,369 INFO L280 TraceCheckUtils]: 5: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 06:32:29,370 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {2937#true} {2937#true} #103#return; {2937#true} is VALID [2020-07-18 06:32:29,370 INFO L263 TraceCheckUtils]: 7: Hoare triple {2937#true} call #t~ret7 := main(); {2937#true} is VALID [2020-07-18 06:32:29,372 INFO L280 TraceCheckUtils]: 8: Hoare triple {2937#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2937#true} is VALID [2020-07-18 06:32:29,373 INFO L280 TraceCheckUtils]: 9: Hoare triple {2937#true} ~N~0 := #t~nondet0; {2937#true} is VALID [2020-07-18 06:32:29,373 INFO L280 TraceCheckUtils]: 10: Hoare triple {2937#true} havoc #t~nondet0; {2937#true} is VALID [2020-07-18 06:32:29,373 INFO L280 TraceCheckUtils]: 11: Hoare triple {2937#true} assume !(~N~0 <= 0); {2937#true} is VALID [2020-07-18 06:32:29,373 INFO L263 TraceCheckUtils]: 12: Hoare triple {2937#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {2937#true} is VALID [2020-07-18 06:32:29,374 INFO L280 TraceCheckUtils]: 13: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-18 06:32:29,374 INFO L280 TraceCheckUtils]: 14: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-18 06:32:29,374 INFO L280 TraceCheckUtils]: 15: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 06:32:29,375 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2937#true} {2937#true} #99#return; {2937#true} is VALID [2020-07-18 06:32:29,375 INFO L280 TraceCheckUtils]: 17: Hoare triple {2937#true} havoc ~i~0; {2937#true} is VALID [2020-07-18 06:32:29,375 INFO L280 TraceCheckUtils]: 18: Hoare triple {2937#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {2937#true} is VALID [2020-07-18 06:32:29,375 INFO L280 TraceCheckUtils]: 19: Hoare triple {2937#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {2937#true} is VALID [2020-07-18 06:32:29,376 INFO L280 TraceCheckUtils]: 20: Hoare triple {2937#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {2937#true} is VALID [2020-07-18 06:32:29,377 INFO L280 TraceCheckUtils]: 21: Hoare triple {2937#true} ~i~0 := 0; {2949#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:29,377 INFO L280 TraceCheckUtils]: 22: Hoare triple {2949#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0); {2949#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:29,379 INFO L280 TraceCheckUtils]: 23: Hoare triple {2949#(= 0 main_~i~0)} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2); {2949#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:29,380 INFO L280 TraceCheckUtils]: 24: Hoare triple {2949#(= 0 main_~i~0)} SUMMARY for call write~int(20, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L32 {2949#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:29,381 INFO L280 TraceCheckUtils]: 25: Hoare triple {2949#(= 0 main_~i~0)} #t~post2 := ~i~0; {2950#(= |main_#t~post2| 0)} is VALID [2020-07-18 06:32:29,382 INFO L280 TraceCheckUtils]: 26: Hoare triple {2950#(= |main_#t~post2| 0)} ~i~0 := 1 + #t~post2; {2951#(<= 1 main_~i~0)} is VALID [2020-07-18 06:32:29,383 INFO L280 TraceCheckUtils]: 27: Hoare triple {2951#(<= 1 main_~i~0)} havoc #t~post2; {2951#(<= 1 main_~i~0)} is VALID [2020-07-18 06:32:29,383 INFO L280 TraceCheckUtils]: 28: Hoare triple {2951#(<= 1 main_~i~0)} assume !!(~i~0 < ~N~0); {2951#(<= 1 main_~i~0)} is VALID [2020-07-18 06:32:29,384 INFO L280 TraceCheckUtils]: 29: Hoare triple {2951#(<= 1 main_~i~0)} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {2951#(<= 1 main_~i~0)} is VALID [2020-07-18 06:32:29,385 INFO L280 TraceCheckUtils]: 30: Hoare triple {2951#(<= 1 main_~i~0)} SUMMARY for call write~int(0, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L34 {2951#(<= 1 main_~i~0)} is VALID [2020-07-18 06:32:29,386 INFO L280 TraceCheckUtils]: 31: Hoare triple {2951#(<= 1 main_~i~0)} #t~post2 := ~i~0; {2952#(<= 1 |main_#t~post2|)} is VALID [2020-07-18 06:32:29,387 INFO L280 TraceCheckUtils]: 32: Hoare triple {2952#(<= 1 |main_#t~post2|)} ~i~0 := 1 + #t~post2; {2953#(<= 2 main_~i~0)} is VALID [2020-07-18 06:32:29,388 INFO L280 TraceCheckUtils]: 33: Hoare triple {2953#(<= 2 main_~i~0)} havoc #t~post2; {2953#(<= 2 main_~i~0)} is VALID [2020-07-18 06:32:29,389 INFO L280 TraceCheckUtils]: 34: Hoare triple {2953#(<= 2 main_~i~0)} assume !!(~i~0 < ~N~0); {2954#(<= 3 ~N~0)} is VALID [2020-07-18 06:32:29,389 INFO L280 TraceCheckUtils]: 35: Hoare triple {2954#(<= 3 ~N~0)} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2); {2954#(<= 3 ~N~0)} is VALID [2020-07-18 06:32:29,390 INFO L280 TraceCheckUtils]: 36: Hoare triple {2954#(<= 3 ~N~0)} SUMMARY for call write~int(20, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L32 {2954#(<= 3 ~N~0)} is VALID [2020-07-18 06:32:29,391 INFO L280 TraceCheckUtils]: 37: Hoare triple {2954#(<= 3 ~N~0)} #t~post2 := ~i~0; {2954#(<= 3 ~N~0)} is VALID [2020-07-18 06:32:29,391 INFO L280 TraceCheckUtils]: 38: Hoare triple {2954#(<= 3 ~N~0)} ~i~0 := 1 + #t~post2; {2954#(<= 3 ~N~0)} is VALID [2020-07-18 06:32:29,392 INFO L280 TraceCheckUtils]: 39: Hoare triple {2954#(<= 3 ~N~0)} havoc #t~post2; {2954#(<= 3 ~N~0)} is VALID [2020-07-18 06:32:29,393 INFO L280 TraceCheckUtils]: 40: Hoare triple {2954#(<= 3 ~N~0)} assume !(~i~0 < ~N~0); {2954#(<= 3 ~N~0)} is VALID [2020-07-18 06:32:29,395 INFO L280 TraceCheckUtils]: 41: Hoare triple {2954#(<= 3 ~N~0)} ~i~0 := 0; {2955#(and (<= 3 ~N~0) (= 0 main_~i~0))} is VALID [2020-07-18 06:32:29,400 INFO L280 TraceCheckUtils]: 42: Hoare triple {2955#(and (<= 3 ~N~0) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0); {2955#(and (<= 3 ~N~0) (= 0 main_~i~0))} is VALID [2020-07-18 06:32:29,405 INFO L280 TraceCheckUtils]: 43: Hoare triple {2955#(and (<= 3 ~N~0) (= 0 main_~i~0))} assume 0 == ~i~0; {2955#(and (<= 3 ~N~0) (= 0 main_~i~0))} is VALID [2020-07-18 06:32:29,409 INFO L280 TraceCheckUtils]: 44: Hoare triple {2955#(and (<= 3 ~N~0) (= 0 main_~i~0))} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L41 {2955#(and (<= 3 ~N~0) (= 0 main_~i~0))} is VALID [2020-07-18 06:32:29,410 INFO L280 TraceCheckUtils]: 45: Hoare triple {2955#(and (<= 3 ~N~0) (= 0 main_~i~0))} #t~post3 := ~i~0; {2956#(and (= |main_#t~post3| 0) (<= 3 ~N~0))} is VALID [2020-07-18 06:32:29,411 INFO L280 TraceCheckUtils]: 46: Hoare triple {2956#(and (= |main_#t~post3| 0) (<= 3 ~N~0))} ~i~0 := 1 + #t~post3; {2957#(<= (+ main_~i~0 2) ~N~0)} is VALID [2020-07-18 06:32:29,411 INFO L280 TraceCheckUtils]: 47: Hoare triple {2957#(<= (+ main_~i~0 2) ~N~0)} havoc #t~post3; {2957#(<= (+ main_~i~0 2) ~N~0)} is VALID [2020-07-18 06:32:29,412 INFO L280 TraceCheckUtils]: 48: Hoare triple {2957#(<= (+ main_~i~0 2) ~N~0)} assume !!(~i~0 < ~N~0); {2957#(<= (+ main_~i~0 2) ~N~0)} is VALID [2020-07-18 06:32:29,412 INFO L280 TraceCheckUtils]: 49: Hoare triple {2957#(<= (+ main_~i~0 2) ~N~0)} assume !(0 == ~i~0); {2957#(<= (+ main_~i~0 2) ~N~0)} is VALID [2020-07-18 06:32:29,413 INFO L280 TraceCheckUtils]: 50: Hoare triple {2957#(<= (+ main_~i~0 2) ~N~0)} SUMMARY for call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L43 {2957#(<= (+ main_~i~0 2) ~N~0)} is VALID [2020-07-18 06:32:29,413 INFO L280 TraceCheckUtils]: 51: Hoare triple {2957#(<= (+ main_~i~0 2) ~N~0)} SUMMARY for call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L43-1 {2957#(<= (+ main_~i~0 2) ~N~0)} is VALID [2020-07-18 06:32:29,414 INFO L280 TraceCheckUtils]: 52: Hoare triple {2957#(<= (+ main_~i~0 2) ~N~0)} SUMMARY for call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L43-2 {2957#(<= (+ main_~i~0 2) ~N~0)} is VALID [2020-07-18 06:32:29,414 INFO L280 TraceCheckUtils]: 53: Hoare triple {2957#(<= (+ main_~i~0 2) ~N~0)} havoc #t~mem4; {2957#(<= (+ main_~i~0 2) ~N~0)} is VALID [2020-07-18 06:32:29,415 INFO L280 TraceCheckUtils]: 54: Hoare triple {2957#(<= (+ main_~i~0 2) ~N~0)} havoc #t~mem5; {2957#(<= (+ main_~i~0 2) ~N~0)} is VALID [2020-07-18 06:32:29,416 INFO L280 TraceCheckUtils]: 55: Hoare triple {2957#(<= (+ main_~i~0 2) ~N~0)} #t~post3 := ~i~0; {2958#(<= (+ |main_#t~post3| 2) ~N~0)} is VALID [2020-07-18 06:32:29,417 INFO L280 TraceCheckUtils]: 56: Hoare triple {2958#(<= (+ |main_#t~post3| 2) ~N~0)} ~i~0 := 1 + #t~post3; {2959#(<= (+ main_~i~0 1) ~N~0)} is VALID [2020-07-18 06:32:29,417 INFO L280 TraceCheckUtils]: 57: Hoare triple {2959#(<= (+ main_~i~0 1) ~N~0)} havoc #t~post3; {2959#(<= (+ main_~i~0 1) ~N~0)} is VALID [2020-07-18 06:32:29,418 INFO L280 TraceCheckUtils]: 58: Hoare triple {2959#(<= (+ main_~i~0 1) ~N~0)} assume !(~i~0 < ~N~0); {2938#false} is VALID [2020-07-18 06:32:29,418 INFO L280 TraceCheckUtils]: 59: Hoare triple {2938#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {2938#false} is VALID [2020-07-18 06:32:29,419 INFO L263 TraceCheckUtils]: 60: Hoare triple {2938#false} call __VERIFIER_assert((if #t~mem6 <= 2 * ~N~0 then 1 else 0)); {2938#false} is VALID [2020-07-18 06:32:29,419 INFO L280 TraceCheckUtils]: 61: Hoare triple {2938#false} ~cond := #in~cond; {2938#false} is VALID [2020-07-18 06:32:29,419 INFO L280 TraceCheckUtils]: 62: Hoare triple {2938#false} assume 0 == ~cond; {2938#false} is VALID [2020-07-18 06:32:29,419 INFO L280 TraceCheckUtils]: 63: Hoare triple {2938#false} assume !false; {2938#false} is VALID [2020-07-18 06:32:29,424 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:32:29,425 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1832153422] [2020-07-18 06:32:29,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:32:29,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-18 06:32:29,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547121284] [2020-07-18 06:32:29,426 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2020-07-18 06:32:29,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:32:29,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-18 06:32:29,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:29,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-18 06:32:29,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:32:29,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-18 06:32:29,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-07-18 06:32:29,491 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 14 states. [2020-07-18 06:32:31,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:31,404 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2020-07-18 06:32:31,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-18 06:32:31,405 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2020-07-18 06:32:31,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:32:31,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 06:32:31,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 123 transitions. [2020-07-18 06:32:31,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 06:32:31,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 123 transitions. [2020-07-18 06:32:31,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 123 transitions. [2020-07-18 06:32:31,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:31,565 INFO L225 Difference]: With dead ends: 131 [2020-07-18 06:32:31,565 INFO L226 Difference]: Without dead ends: 110 [2020-07-18 06:32:31,566 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2020-07-18 06:32:31,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-18 06:32:31,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 71. [2020-07-18 06:32:31,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:32:31,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 71 states. [2020-07-18 06:32:31,862 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 71 states. [2020-07-18 06:32:31,862 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 71 states. [2020-07-18 06:32:31,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:31,865 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2020-07-18 06:32:31,866 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2020-07-18 06:32:31,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:31,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:31,867 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 110 states. [2020-07-18 06:32:31,867 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 110 states. [2020-07-18 06:32:31,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:31,871 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2020-07-18 06:32:31,871 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2020-07-18 06:32:31,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:31,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:31,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:32:31,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:32:31,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-07-18 06:32:31,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2020-07-18 06:32:31,875 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 64 [2020-07-18 06:32:31,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:32:31,876 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2020-07-18 06:32:31,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-18 06:32:31,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 71 states and 74 transitions. [2020-07-18 06:32:32,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:32,046 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2020-07-18 06:32:32,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-18 06:32:32,047 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:32:32,047 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:32:32,047 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 06:32:32,047 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:32:32,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:32:32,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1245154100, now seen corresponding path program 3 times [2020-07-18 06:32:32,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:32:32,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1887065550] [2020-07-18 06:32:32,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:32:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:32,271 INFO L280 TraceCheckUtils]: 0: Hoare triple {3644#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3621#true} is VALID [2020-07-18 06:32:32,272 INFO L280 TraceCheckUtils]: 1: Hoare triple {3621#true} #valid := #valid[0 := 0]; {3621#true} is VALID [2020-07-18 06:32:32,272 INFO L280 TraceCheckUtils]: 2: Hoare triple {3621#true} assume 0 < #StackHeapBarrier; {3621#true} is VALID [2020-07-18 06:32:32,273 INFO L280 TraceCheckUtils]: 3: Hoare triple {3621#true} ~N~0 := 0; {3621#true} is VALID [2020-07-18 06:32:32,273 INFO L280 TraceCheckUtils]: 4: Hoare triple {3621#true} assume true; {3621#true} is VALID [2020-07-18 06:32:32,273 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3621#true} {3621#true} #103#return; {3621#true} is VALID [2020-07-18 06:32:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:32,282 INFO L280 TraceCheckUtils]: 0: Hoare triple {3621#true} ~cond := #in~cond; {3621#true} is VALID [2020-07-18 06:32:32,282 INFO L280 TraceCheckUtils]: 1: Hoare triple {3621#true} assume !(0 == ~cond); {3621#true} is VALID [2020-07-18 06:32:32,282 INFO L280 TraceCheckUtils]: 2: Hoare triple {3621#true} assume true; {3621#true} is VALID [2020-07-18 06:32:32,283 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3621#true} {3621#true} #99#return; {3621#true} is VALID [2020-07-18 06:32:32,284 INFO L263 TraceCheckUtils]: 0: Hoare triple {3621#true} call ULTIMATE.init(); {3644#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 06:32:32,284 INFO L280 TraceCheckUtils]: 1: Hoare triple {3644#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3621#true} is VALID [2020-07-18 06:32:32,284 INFO L280 TraceCheckUtils]: 2: Hoare triple {3621#true} #valid := #valid[0 := 0]; {3621#true} is VALID [2020-07-18 06:32:32,285 INFO L280 TraceCheckUtils]: 3: Hoare triple {3621#true} assume 0 < #StackHeapBarrier; {3621#true} is VALID [2020-07-18 06:32:32,285 INFO L280 TraceCheckUtils]: 4: Hoare triple {3621#true} ~N~0 := 0; {3621#true} is VALID [2020-07-18 06:32:32,285 INFO L280 TraceCheckUtils]: 5: Hoare triple {3621#true} assume true; {3621#true} is VALID [2020-07-18 06:32:32,285 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {3621#true} {3621#true} #103#return; {3621#true} is VALID [2020-07-18 06:32:32,286 INFO L263 TraceCheckUtils]: 7: Hoare triple {3621#true} call #t~ret7 := main(); {3621#true} is VALID [2020-07-18 06:32:32,286 INFO L280 TraceCheckUtils]: 8: Hoare triple {3621#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3621#true} is VALID [2020-07-18 06:32:32,286 INFO L280 TraceCheckUtils]: 9: Hoare triple {3621#true} ~N~0 := #t~nondet0; {3621#true} is VALID [2020-07-18 06:32:32,286 INFO L280 TraceCheckUtils]: 10: Hoare triple {3621#true} havoc #t~nondet0; {3621#true} is VALID [2020-07-18 06:32:32,286 INFO L280 TraceCheckUtils]: 11: Hoare triple {3621#true} assume !(~N~0 <= 0); {3621#true} is VALID [2020-07-18 06:32:32,287 INFO L263 TraceCheckUtils]: 12: Hoare triple {3621#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {3621#true} is VALID [2020-07-18 06:32:32,287 INFO L280 TraceCheckUtils]: 13: Hoare triple {3621#true} ~cond := #in~cond; {3621#true} is VALID [2020-07-18 06:32:32,287 INFO L280 TraceCheckUtils]: 14: Hoare triple {3621#true} assume !(0 == ~cond); {3621#true} is VALID [2020-07-18 06:32:32,290 INFO L280 TraceCheckUtils]: 15: Hoare triple {3621#true} assume true; {3621#true} is VALID [2020-07-18 06:32:32,290 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3621#true} {3621#true} #99#return; {3621#true} is VALID [2020-07-18 06:32:32,290 INFO L280 TraceCheckUtils]: 17: Hoare triple {3621#true} havoc ~i~0; {3621#true} is VALID [2020-07-18 06:32:32,291 INFO L280 TraceCheckUtils]: 18: Hoare triple {3621#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {3621#true} is VALID [2020-07-18 06:32:32,291 INFO L280 TraceCheckUtils]: 19: Hoare triple {3621#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {3621#true} is VALID [2020-07-18 06:32:32,291 INFO L280 TraceCheckUtils]: 20: Hoare triple {3621#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {3621#true} is VALID [2020-07-18 06:32:32,293 INFO L280 TraceCheckUtils]: 21: Hoare triple {3621#true} ~i~0 := 0; {3633#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:32,293 INFO L280 TraceCheckUtils]: 22: Hoare triple {3633#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0); {3633#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:32,294 INFO L280 TraceCheckUtils]: 23: Hoare triple {3633#(= 0 main_~i~0)} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2); {3633#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:32,295 INFO L280 TraceCheckUtils]: 24: Hoare triple {3633#(= 0 main_~i~0)} SUMMARY for call write~int(20, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L32 {3633#(= 0 main_~i~0)} is VALID [2020-07-18 06:32:32,296 INFO L280 TraceCheckUtils]: 25: Hoare triple {3633#(= 0 main_~i~0)} #t~post2 := ~i~0; {3634#(= |main_#t~post2| 0)} is VALID [2020-07-18 06:32:32,297 INFO L280 TraceCheckUtils]: 26: Hoare triple {3634#(= |main_#t~post2| 0)} ~i~0 := 1 + #t~post2; {3635#(<= main_~i~0 1)} is VALID [2020-07-18 06:32:32,297 INFO L280 TraceCheckUtils]: 27: Hoare triple {3635#(<= main_~i~0 1)} havoc #t~post2; {3635#(<= main_~i~0 1)} is VALID [2020-07-18 06:32:32,300 INFO L280 TraceCheckUtils]: 28: Hoare triple {3635#(<= main_~i~0 1)} assume !!(~i~0 < ~N~0); {3635#(<= main_~i~0 1)} is VALID [2020-07-18 06:32:32,300 INFO L280 TraceCheckUtils]: 29: Hoare triple {3635#(<= main_~i~0 1)} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {3635#(<= main_~i~0 1)} is VALID [2020-07-18 06:32:32,301 INFO L280 TraceCheckUtils]: 30: Hoare triple {3635#(<= main_~i~0 1)} SUMMARY for call write~int(0, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L34 {3635#(<= main_~i~0 1)} is VALID [2020-07-18 06:32:32,302 INFO L280 TraceCheckUtils]: 31: Hoare triple {3635#(<= main_~i~0 1)} #t~post2 := ~i~0; {3636#(<= |main_#t~post2| 1)} is VALID [2020-07-18 06:32:32,303 INFO L280 TraceCheckUtils]: 32: Hoare triple {3636#(<= |main_#t~post2| 1)} ~i~0 := 1 + #t~post2; {3637#(<= main_~i~0 2)} is VALID [2020-07-18 06:32:32,304 INFO L280 TraceCheckUtils]: 33: Hoare triple {3637#(<= main_~i~0 2)} havoc #t~post2; {3637#(<= main_~i~0 2)} is VALID [2020-07-18 06:32:32,305 INFO L280 TraceCheckUtils]: 34: Hoare triple {3637#(<= main_~i~0 2)} assume !(~i~0 < ~N~0); {3638#(<= ~N~0 2)} is VALID [2020-07-18 06:32:32,306 INFO L280 TraceCheckUtils]: 35: Hoare triple {3638#(<= ~N~0 2)} ~i~0 := 0; {3639#(and (<= ~N~0 2) (= 0 main_~i~0))} is VALID [2020-07-18 06:32:32,307 INFO L280 TraceCheckUtils]: 36: Hoare triple {3639#(and (<= ~N~0 2) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0); {3639#(and (<= ~N~0 2) (= 0 main_~i~0))} is VALID [2020-07-18 06:32:32,307 INFO L280 TraceCheckUtils]: 37: Hoare triple {3639#(and (<= ~N~0 2) (= 0 main_~i~0))} assume 0 == ~i~0; {3639#(and (<= ~N~0 2) (= 0 main_~i~0))} is VALID [2020-07-18 06:32:32,308 INFO L280 TraceCheckUtils]: 38: Hoare triple {3639#(and (<= ~N~0 2) (= 0 main_~i~0))} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L41 {3639#(and (<= ~N~0 2) (= 0 main_~i~0))} is VALID [2020-07-18 06:32:32,309 INFO L280 TraceCheckUtils]: 39: Hoare triple {3639#(and (<= ~N~0 2) (= 0 main_~i~0))} #t~post3 := ~i~0; {3640#(and (<= ~N~0 2) (= |main_#t~post3| 0))} is VALID [2020-07-18 06:32:32,310 INFO L280 TraceCheckUtils]: 40: Hoare triple {3640#(and (<= ~N~0 2) (= |main_#t~post3| 0))} ~i~0 := 1 + #t~post3; {3641#(<= ~N~0 (+ main_~i~0 1))} is VALID [2020-07-18 06:32:32,311 INFO L280 TraceCheckUtils]: 41: Hoare triple {3641#(<= ~N~0 (+ main_~i~0 1))} havoc #t~post3; {3641#(<= ~N~0 (+ main_~i~0 1))} is VALID [2020-07-18 06:32:32,312 INFO L280 TraceCheckUtils]: 42: Hoare triple {3641#(<= ~N~0 (+ main_~i~0 1))} assume !!(~i~0 < ~N~0); {3641#(<= ~N~0 (+ main_~i~0 1))} is VALID [2020-07-18 06:32:32,313 INFO L280 TraceCheckUtils]: 43: Hoare triple {3641#(<= ~N~0 (+ main_~i~0 1))} assume !(0 == ~i~0); {3641#(<= ~N~0 (+ main_~i~0 1))} is VALID [2020-07-18 06:32:32,314 INFO L280 TraceCheckUtils]: 44: Hoare triple {3641#(<= ~N~0 (+ main_~i~0 1))} SUMMARY for call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L43 {3641#(<= ~N~0 (+ main_~i~0 1))} is VALID [2020-07-18 06:32:32,314 INFO L280 TraceCheckUtils]: 45: Hoare triple {3641#(<= ~N~0 (+ main_~i~0 1))} SUMMARY for call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L43-1 {3641#(<= ~N~0 (+ main_~i~0 1))} is VALID [2020-07-18 06:32:32,315 INFO L280 TraceCheckUtils]: 46: Hoare triple {3641#(<= ~N~0 (+ main_~i~0 1))} SUMMARY for call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L43-2 {3641#(<= ~N~0 (+ main_~i~0 1))} is VALID [2020-07-18 06:32:32,316 INFO L280 TraceCheckUtils]: 47: Hoare triple {3641#(<= ~N~0 (+ main_~i~0 1))} havoc #t~mem4; {3641#(<= ~N~0 (+ main_~i~0 1))} is VALID [2020-07-18 06:32:32,317 INFO L280 TraceCheckUtils]: 48: Hoare triple {3641#(<= ~N~0 (+ main_~i~0 1))} havoc #t~mem5; {3641#(<= ~N~0 (+ main_~i~0 1))} is VALID [2020-07-18 06:32:32,317 INFO L280 TraceCheckUtils]: 49: Hoare triple {3641#(<= ~N~0 (+ main_~i~0 1))} #t~post3 := ~i~0; {3642#(<= ~N~0 (+ |main_#t~post3| 1))} is VALID [2020-07-18 06:32:32,318 INFO L280 TraceCheckUtils]: 50: Hoare triple {3642#(<= ~N~0 (+ |main_#t~post3| 1))} ~i~0 := 1 + #t~post3; {3643#(<= ~N~0 main_~i~0)} is VALID [2020-07-18 06:32:32,319 INFO L280 TraceCheckUtils]: 51: Hoare triple {3643#(<= ~N~0 main_~i~0)} havoc #t~post3; {3643#(<= ~N~0 main_~i~0)} is VALID [2020-07-18 06:32:32,320 INFO L280 TraceCheckUtils]: 52: Hoare triple {3643#(<= ~N~0 main_~i~0)} assume !!(~i~0 < ~N~0); {3622#false} is VALID [2020-07-18 06:32:32,320 INFO L280 TraceCheckUtils]: 53: Hoare triple {3622#false} assume !(0 == ~i~0); {3622#false} is VALID [2020-07-18 06:32:32,320 INFO L280 TraceCheckUtils]: 54: Hoare triple {3622#false} SUMMARY for call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L43 {3622#false} is VALID [2020-07-18 06:32:32,320 INFO L280 TraceCheckUtils]: 55: Hoare triple {3622#false} SUMMARY for call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L43-1 {3622#false} is VALID [2020-07-18 06:32:32,320 INFO L280 TraceCheckUtils]: 56: Hoare triple {3622#false} SUMMARY for call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L43-2 {3622#false} is VALID [2020-07-18 06:32:32,321 INFO L280 TraceCheckUtils]: 57: Hoare triple {3622#false} havoc #t~mem4; {3622#false} is VALID [2020-07-18 06:32:32,321 INFO L280 TraceCheckUtils]: 58: Hoare triple {3622#false} havoc #t~mem5; {3622#false} is VALID [2020-07-18 06:32:32,321 INFO L280 TraceCheckUtils]: 59: Hoare triple {3622#false} #t~post3 := ~i~0; {3622#false} is VALID [2020-07-18 06:32:32,321 INFO L280 TraceCheckUtils]: 60: Hoare triple {3622#false} ~i~0 := 1 + #t~post3; {3622#false} is VALID [2020-07-18 06:32:32,321 INFO L280 TraceCheckUtils]: 61: Hoare triple {3622#false} havoc #t~post3; {3622#false} is VALID [2020-07-18 06:32:32,322 INFO L280 TraceCheckUtils]: 62: Hoare triple {3622#false} assume !(~i~0 < ~N~0); {3622#false} is VALID [2020-07-18 06:32:32,322 INFO L280 TraceCheckUtils]: 63: Hoare triple {3622#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {3622#false} is VALID [2020-07-18 06:32:32,322 INFO L263 TraceCheckUtils]: 64: Hoare triple {3622#false} call __VERIFIER_assert((if #t~mem6 <= 2 * ~N~0 then 1 else 0)); {3622#false} is VALID [2020-07-18 06:32:32,322 INFO L280 TraceCheckUtils]: 65: Hoare triple {3622#false} ~cond := #in~cond; {3622#false} is VALID [2020-07-18 06:32:32,323 INFO L280 TraceCheckUtils]: 66: Hoare triple {3622#false} assume 0 == ~cond; {3622#false} is VALID [2020-07-18 06:32:32,323 INFO L280 TraceCheckUtils]: 67: Hoare triple {3622#false} assume !false; {3622#false} is VALID [2020-07-18 06:32:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:32:32,329 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1887065550] [2020-07-18 06:32:32,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:32:32,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-18 06:32:32,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114934719] [2020-07-18 06:32:32,331 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2020-07-18 06:32:32,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:32:32,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-18 06:32:32,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:32,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-18 06:32:32,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:32:32,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-18 06:32:32,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-07-18 06:32:32,419 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 14 states. [2020-07-18 06:32:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:33,833 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2020-07-18 06:32:33,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-18 06:32:33,833 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2020-07-18 06:32:33,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:32:33,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 06:32:33,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 109 transitions. [2020-07-18 06:32:33,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 06:32:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 109 transitions. [2020-07-18 06:32:33,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 109 transitions. [2020-07-18 06:32:33,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:33,959 INFO L225 Difference]: With dead ends: 129 [2020-07-18 06:32:33,959 INFO L226 Difference]: Without dead ends: 80 [2020-07-18 06:32:33,961 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2020-07-18 06:32:33,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-18 06:32:34,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2020-07-18 06:32:34,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:32:34,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 77 states. [2020-07-18 06:32:34,303 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 77 states. [2020-07-18 06:32:34,303 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 77 states. [2020-07-18 06:32:34,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:34,309 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2020-07-18 06:32:34,309 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2020-07-18 06:32:34,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:34,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:34,310 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 80 states. [2020-07-18 06:32:34,310 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 80 states. [2020-07-18 06:32:34,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:34,317 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2020-07-18 06:32:34,318 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2020-07-18 06:32:34,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:34,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:34,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:32:34,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:32:34,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-18 06:32:34,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2020-07-18 06:32:34,324 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 68 [2020-07-18 06:32:34,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:32:34,324 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2020-07-18 06:32:34,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-18 06:32:34,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 77 states and 81 transitions. [2020-07-18 06:32:34,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:34,499 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2020-07-18 06:32:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-07-18 06:32:34,500 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:32:34,500 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:32:34,500 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 06:32:34,501 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:32:34,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:32:34,501 INFO L82 PathProgramCache]: Analyzing trace with hash 685477565, now seen corresponding path program 4 times [2020-07-18 06:32:34,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:32:34,502 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [403784484] [2020-07-18 06:32:34,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:32:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 06:32:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 06:32:34,639 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-18 06:32:34,640 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-18 06:32:34,640 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 06:32:34,716 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-18 06:32:34,716 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 06:32:34,716 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 06:32:34,716 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-18 06:32:34,716 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-18 06:32:34,716 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-18 06:32:34,717 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 06:32:34,717 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 06:32:34,717 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 06:32:34,717 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-18 06:32:34,717 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-18 06:32:34,717 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-18 06:32:34,717 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-18 06:32:34,717 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-18 06:32:34,717 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-18 06:32:34,718 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-18 06:32:34,718 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-18 06:32:34,718 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-18 06:32:34,718 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-18 06:32:34,718 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-18 06:32:34,718 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-18 06:32:34,718 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-18 06:32:34,718 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-18 06:32:34,718 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-18 06:32:34,719 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-18 06:32:34,719 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-18 06:32:34,719 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-18 06:32:34,719 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-18 06:32:34,719 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-18 06:32:34,719 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-18 06:32:34,719 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-18 06:32:34,719 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-18 06:32:34,719 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2020-07-18 06:32:34,719 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-18 06:32:34,720 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-18 06:32:34,720 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-18 06:32:34,720 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-18 06:32:34,720 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-18 06:32:34,720 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-18 06:32:34,720 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-18 06:32:34,720 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-18 06:32:34,720 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-18 06:32:34,720 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-18 06:32:34,721 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2020-07-18 06:32:34,721 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2020-07-18 06:32:34,721 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2020-07-18 06:32:34,721 WARN L170 areAnnotationChecker]: L29-6 has no Hoare annotation [2020-07-18 06:32:34,721 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-18 06:32:34,721 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-18 06:32:34,721 WARN L170 areAnnotationChecker]: L38-5 has no Hoare annotation [2020-07-18 06:32:34,721 WARN L170 areAnnotationChecker]: L38-5 has no Hoare annotation [2020-07-18 06:32:34,721 WARN L170 areAnnotationChecker]: L38-5 has no Hoare annotation [2020-07-18 06:32:34,722 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-18 06:32:34,722 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-18 06:32:34,722 WARN L170 areAnnotationChecker]: L38-6 has no Hoare annotation [2020-07-18 06:32:34,722 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-18 06:32:34,722 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-18 06:32:34,722 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-18 06:32:34,722 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-18 06:32:34,722 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-18 06:32:34,722 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-18 06:32:34,723 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-18 06:32:34,723 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-18 06:32:34,723 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-18 06:32:34,723 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2020-07-18 06:32:34,723 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2020-07-18 06:32:34,723 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-18 06:32:34,723 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2020-07-18 06:32:34,723 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2020-07-18 06:32:34,723 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2020-07-18 06:32:34,723 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2020-07-18 06:32:34,724 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 06:32:34,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 06:32:34 BoogieIcfgContainer [2020-07-18 06:32:34,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 06:32:34,731 INFO L168 Benchmark]: Toolchain (without parser) took 18746.70 ms. Allocated memory was 137.9 MB in the beginning and 391.1 MB in the end (delta: 253.2 MB). Free memory was 102.9 MB in the beginning and 153.2 MB in the end (delta: -50.3 MB). Peak memory consumption was 202.9 MB. Max. memory is 7.1 GB. [2020-07-18 06:32:34,731 INFO L168 Benchmark]: CDTParser took 0.91 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.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 06:32:34,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.31 ms. Allocated memory is still 137.9 MB. Free memory was 102.4 MB in the beginning and 91.6 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-18 06:32:34,733 INFO L168 Benchmark]: Boogie Preprocessor took 155.89 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 91.6 MB in the beginning and 179.8 MB in the end (delta: -88.2 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2020-07-18 06:32:34,733 INFO L168 Benchmark]: RCFGBuilder took 553.08 ms. Allocated memory is still 202.4 MB. Free memory was 179.8 MB in the beginning and 151.7 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. [2020-07-18 06:32:34,734 INFO L168 Benchmark]: TraceAbstraction took 17743.08 ms. Allocated memory was 202.4 MB in the beginning and 391.1 MB in the end (delta: 188.7 MB). Free memory was 151.7 MB in the beginning and 153.2 MB in the end (delta: -1.5 MB). Peak memory consumption was 187.3 MB. Max. memory is 7.1 GB. [2020-07-18 06:32:34,737 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.91 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.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 287.31 ms. Allocated memory is still 137.9 MB. Free memory was 102.4 MB in the beginning and 91.6 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 155.89 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 91.6 MB in the beginning and 179.8 MB in the end (delta: -88.2 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 553.08 ms. Allocated memory is still 202.4 MB. Free memory was 179.8 MB in the beginning and 151.7 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17743.08 ms. Allocated memory was 202.4 MB in the beginning and 391.1 MB in the end (delta: 188.7 MB). Free memory was 151.7 MB in the beginning and 153.2 MB in the end (delta: -1.5 MB). Peak memory consumption was 187.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=22, N=0] [L21] N = __VERIFIER_nondet_int() VAL [\old(N)=0, __VERIFIER_nondet_int()=3, N=3] [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=3] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=3] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=3] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=3] [L25] int i; VAL [\old(N)=0, N=3] [L26] long long sum[1]; VAL [\old(N)=0, N=3, sum={2:0}] [L27] int *a = malloc(sizeof(int)*N); VAL [\old(N)=0, a={-1:0}, malloc(sizeof(int)*N)={-1:0}, N=3, sum={2:0}] [L29] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=3, sum={2:0}] [L29] COND TRUE i