/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-examples/sanfoundry_24-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:25:53,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:25:53,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:25:53,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:25:53,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:25:53,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:25:53,127 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:25:53,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:25:53,132 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:25:53,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:25:53,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:25:53,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:25:53,138 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:25:53,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:25:53,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:25:53,142 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:25:53,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:25:53,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:25:53,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:25:53,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:25:53,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:25:53,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:25:53,169 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:25:53,170 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:25:53,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:25:53,176 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:25:53,176 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:25:53,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:25:53,179 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:25:53,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:25:53,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:25:53,185 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:25:53,187 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:25:53,188 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:25:53,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:25:53,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:25:53,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:25:53,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:25:53,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:25:53,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:25:53,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:25:53,205 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:25:53,224 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:25:53,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:25:53,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:25:53,229 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:25:53,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:25:53,229 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:25:53,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:25:53,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:25:53,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:25:53,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:25:53,231 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:25:53,232 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:25:53,232 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:25:53,232 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:25:53,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:25:53,233 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:25:53,233 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:25:53,233 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:25:53,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:25:53,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:25:53,234 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:25:53,234 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:25:53,234 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-11 02:25:53,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:25:53,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:25:53,574 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:25:53,576 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:25:53,577 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:25:53,578 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_24-1.i [2020-07-11 02:25:53,680 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77ea56da1/9e816fb70018412187e9642fe8d10fc8/FLAGa530ef6c6 [2020-07-11 02:25:54,288 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:25:54,289 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_24-1.i [2020-07-11 02:25:54,298 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77ea56da1/9e816fb70018412187e9642fe8d10fc8/FLAGa530ef6c6 [2020-07-11 02:25:54,621 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77ea56da1/9e816fb70018412187e9642fe8d10fc8 [2020-07-11 02:25:54,632 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:25:54,635 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:25:54,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:25:54,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:25:54,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:25:54,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:25:54" (1/1) ... [2020-07-11 02:25:54,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48078b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:25:54, skipping insertion in model container [2020-07-11 02:25:54,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:25:54" (1/1) ... [2020-07-11 02:25:54,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:25:54,675 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:25:54,883 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:25:54,893 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:25:54,923 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:25:54,950 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:25:54,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:25:54 WrapperNode [2020-07-11 02:25:54,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:25:54,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:25:54,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:25:54,952 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:25:55,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:25:54" (1/1) ... [2020-07-11 02:25:55,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:25:54" (1/1) ... [2020-07-11 02:25:55,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:25:54" (1/1) ... [2020-07-11 02:25:55,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:25:54" (1/1) ... [2020-07-11 02:25:55,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:25:54" (1/1) ... [2020-07-11 02:25:55,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:25:54" (1/1) ... [2020-07-11 02:25:55,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:25:54" (1/1) ... [2020-07-11 02:25:55,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:25:55,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:25:55,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:25:55,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:25:55,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:25:54" (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-11 02:25:55,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:25:55,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:25:55,186 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:25:55,186 INFO L138 BoogieDeclarations]: Found implementation of procedure printEven [2020-07-11 02:25:55,186 INFO L138 BoogieDeclarations]: Found implementation of procedure printOdd [2020-07-11 02:25:55,186 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:25:55,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:25:55,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:25:55,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:25:55,187 INFO L130 BoogieDeclarations]: Found specification of procedure printEven [2020-07-11 02:25:55,187 INFO L130 BoogieDeclarations]: Found specification of procedure printOdd [2020-07-11 02:25:55,189 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:25:55,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-11 02:25:55,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 02:25:55,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 02:25:55,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 02:25:55,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:25:55,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:25:55,762 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:25:55,762 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-11 02:25:55,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:25:55 BoogieIcfgContainer [2020-07-11 02:25:55,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:25:55,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:25:55,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:25:55,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:25:55,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:25:54" (1/3) ... [2020-07-11 02:25:55,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a6a462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:25:55, skipping insertion in model container [2020-07-11 02:25:55,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:25:54" (2/3) ... [2020-07-11 02:25:55,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a6a462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:25:55, skipping insertion in model container [2020-07-11 02:25:55,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:25:55" (3/3) ... [2020-07-11 02:25:55,778 INFO L109 eAbstractionObserver]: Analyzing ICFG sanfoundry_24-1.i [2020-07-11 02:25:55,789 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:25:55,796 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:25:55,812 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:25:55,840 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:25:55,841 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:25:55,841 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:25:55,841 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:25:55,841 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:25:55,841 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:25:55,842 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:25:55,842 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:25:55,861 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2020-07-11 02:25:55,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-11 02:25:55,875 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:25:55,876 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] [2020-07-11 02:25:55,877 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:25:55,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:25:55,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1447674201, now seen corresponding path program 1 times [2020-07-11 02:25:55,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:25:55,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [806978134] [2020-07-11 02:25:55,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:25:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:25:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:25:56,133 INFO L280 TraceCheckUtils]: 0: Hoare triple {75#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {68#true} is VALID [2020-07-11 02:25:56,134 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#true} #valid := #valid[0 := 0]; {68#true} is VALID [2020-07-11 02:25:56,135 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} assume 0 < #StackHeapBarrier; {68#true} is VALID [2020-07-11 02:25:56,136 INFO L280 TraceCheckUtils]: 3: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-11 02:25:56,136 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {68#true} {68#true} #109#return; {68#true} is VALID [2020-07-11 02:25:56,141 INFO L263 TraceCheckUtils]: 0: Hoare triple {68#true} call ULTIMATE.init(); {75#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:25:56,141 INFO L280 TraceCheckUtils]: 1: Hoare triple {75#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {68#true} is VALID [2020-07-11 02:25:56,142 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} #valid := #valid[0 := 0]; {68#true} is VALID [2020-07-11 02:25:56,142 INFO L280 TraceCheckUtils]: 3: Hoare triple {68#true} assume 0 < #StackHeapBarrier; {68#true} is VALID [2020-07-11 02:25:56,143 INFO L280 TraceCheckUtils]: 4: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-11 02:25:56,143 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {68#true} {68#true} #109#return; {68#true} is VALID [2020-07-11 02:25:56,143 INFO L263 TraceCheckUtils]: 6: Hoare triple {68#true} call #t~ret9 := main(); {68#true} is VALID [2020-07-11 02:25:56,144 INFO L280 TraceCheckUtils]: 7: Hoare triple {68#true} SUMMARY for call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(400000); srcloc: mainENTRY {68#true} is VALID [2020-07-11 02:25:56,145 INFO L280 TraceCheckUtils]: 8: Hoare triple {68#true} havoc ~i~0; {68#true} is VALID [2020-07-11 02:25:56,145 INFO L280 TraceCheckUtils]: 9: Hoare triple {68#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {68#true} is VALID [2020-07-11 02:25:56,146 INFO L280 TraceCheckUtils]: 10: Hoare triple {68#true} ~num~0 := #t~nondet0; {68#true} is VALID [2020-07-11 02:25:56,146 INFO L280 TraceCheckUtils]: 11: Hoare triple {68#true} havoc #t~nondet0; {68#true} is VALID [2020-07-11 02:25:56,147 INFO L280 TraceCheckUtils]: 12: Hoare triple {68#true} ~i~0 := 0; {68#true} is VALID [2020-07-11 02:25:56,148 INFO L280 TraceCheckUtils]: 13: Hoare triple {68#true} assume !true; {69#false} is VALID [2020-07-11 02:25:56,149 INFO L280 TraceCheckUtils]: 14: Hoare triple {69#false} ~i~0 := 0; {69#false} is VALID [2020-07-11 02:25:56,149 INFO L280 TraceCheckUtils]: 15: Hoare triple {69#false} assume !!(~i~0 < ~num~0); {69#false} is VALID [2020-07-11 02:25:56,150 INFO L280 TraceCheckUtils]: 16: Hoare triple {69#false} SUMMARY for call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L23 {69#false} is VALID [2020-07-11 02:25:56,150 INFO L280 TraceCheckUtils]: 17: Hoare triple {69#false} assume 0 == (if #t~mem4 < 0 && 0 != #t~mem4 % 2 then #t~mem4 % 2 - 2 else #t~mem4 % 2); {69#false} is VALID [2020-07-11 02:25:56,150 INFO L280 TraceCheckUtils]: 18: Hoare triple {69#false} havoc #t~mem4; {69#false} is VALID [2020-07-11 02:25:56,151 INFO L280 TraceCheckUtils]: 19: Hoare triple {69#false} SUMMARY for call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L25 {69#false} is VALID [2020-07-11 02:25:56,151 INFO L263 TraceCheckUtils]: 20: Hoare triple {69#false} call printEven(#t~mem5); {69#false} is VALID [2020-07-11 02:25:56,152 INFO L280 TraceCheckUtils]: 21: Hoare triple {69#false} ~i := #in~i; {69#false} is VALID [2020-07-11 02:25:56,153 INFO L263 TraceCheckUtils]: 22: Hoare triple {69#false} call __VERIFIER_assert((if 0 == (if ~i < 0 && 0 != ~i % 2 then ~i % 2 - 2 else ~i % 2) then 1 else 0)); {69#false} is VALID [2020-07-11 02:25:56,153 INFO L280 TraceCheckUtils]: 23: Hoare triple {69#false} ~cond := #in~cond; {69#false} is VALID [2020-07-11 02:25:56,154 INFO L280 TraceCheckUtils]: 24: Hoare triple {69#false} assume 0 == ~cond; {69#false} is VALID [2020-07-11 02:25:56,154 INFO L280 TraceCheckUtils]: 25: Hoare triple {69#false} assume !false; {69#false} is VALID [2020-07-11 02:25:56,158 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-11 02:25:56,160 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [806978134] [2020-07-11 02:25:56,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:25:56,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 02:25:56,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684495123] [2020-07-11 02:25:56,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-11 02:25:56,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:25:56,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 02:25:56,273 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:25:56,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 02:25:56,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:25:56,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 02:25:56,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 02:25:56,291 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2020-07-11 02:25:56,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:25:56,928 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2020-07-11 02:25:56,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 02:25:56,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-11 02:25:56,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:25:56,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:25:56,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-11 02:25:56,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:25:56,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-11 02:25:56,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 130 transitions. [2020-07-11 02:25:57,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:25:57,168 INFO L225 Difference]: With dead ends: 110 [2020-07-11 02:25:57,168 INFO L226 Difference]: Without dead ends: 58 [2020-07-11 02:25:57,174 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11 02:25:57,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-11 02:25:57,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-07-11 02:25:57,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:25:57,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2020-07-11 02:25:57,328 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2020-07-11 02:25:57,328 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2020-07-11 02:25:57,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:25:57,353 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2020-07-11 02:25:57,353 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2020-07-11 02:25:57,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:25:57,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:25:57,355 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2020-07-11 02:25:57,356 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2020-07-11 02:25:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:25:57,376 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2020-07-11 02:25:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2020-07-11 02:25:57,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:25:57,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:25:57,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:25:57,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:25:57,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-11 02:25:57,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2020-07-11 02:25:57,400 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 26 [2020-07-11 02:25:57,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:25:57,402 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2020-07-11 02:25:57,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 02:25:57,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 63 transitions. [2020-07-11 02:25:57,510 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-11 02:25:57,510 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2020-07-11 02:25:57,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-11 02:25:57,513 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:25:57,513 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] [2020-07-11 02:25:57,515 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:25:57,516 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:25:57,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:25:57,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1779758876, now seen corresponding path program 1 times [2020-07-11 02:25:57,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:25:57,517 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1043064166] [2020-07-11 02:25:57,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:25:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:25:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:25:57,702 INFO L280 TraceCheckUtils]: 0: Hoare triple {540#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {530#true} is VALID [2020-07-11 02:25:57,702 INFO L280 TraceCheckUtils]: 1: Hoare triple {530#true} #valid := #valid[0 := 0]; {530#true} is VALID [2020-07-11 02:25:57,703 INFO L280 TraceCheckUtils]: 2: Hoare triple {530#true} assume 0 < #StackHeapBarrier; {530#true} is VALID [2020-07-11 02:25:57,703 INFO L280 TraceCheckUtils]: 3: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-11 02:25:57,703 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {530#true} {530#true} #109#return; {530#true} is VALID [2020-07-11 02:25:57,705 INFO L263 TraceCheckUtils]: 0: Hoare triple {530#true} call ULTIMATE.init(); {540#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:25:57,706 INFO L280 TraceCheckUtils]: 1: Hoare triple {540#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {530#true} is VALID [2020-07-11 02:25:57,706 INFO L280 TraceCheckUtils]: 2: Hoare triple {530#true} #valid := #valid[0 := 0]; {530#true} is VALID [2020-07-11 02:25:57,706 INFO L280 TraceCheckUtils]: 3: Hoare triple {530#true} assume 0 < #StackHeapBarrier; {530#true} is VALID [2020-07-11 02:25:57,707 INFO L280 TraceCheckUtils]: 4: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-11 02:25:57,707 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {530#true} {530#true} #109#return; {530#true} is VALID [2020-07-11 02:25:57,708 INFO L263 TraceCheckUtils]: 6: Hoare triple {530#true} call #t~ret9 := main(); {530#true} is VALID [2020-07-11 02:25:57,708 INFO L280 TraceCheckUtils]: 7: Hoare triple {530#true} SUMMARY for call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(400000); srcloc: mainENTRY {530#true} is VALID [2020-07-11 02:25:57,708 INFO L280 TraceCheckUtils]: 8: Hoare triple {530#true} havoc ~i~0; {530#true} is VALID [2020-07-11 02:25:57,709 INFO L280 TraceCheckUtils]: 9: Hoare triple {530#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {530#true} is VALID [2020-07-11 02:25:57,709 INFO L280 TraceCheckUtils]: 10: Hoare triple {530#true} ~num~0 := #t~nondet0; {530#true} is VALID [2020-07-11 02:25:57,709 INFO L280 TraceCheckUtils]: 11: Hoare triple {530#true} havoc #t~nondet0; {530#true} is VALID [2020-07-11 02:25:57,710 INFO L280 TraceCheckUtils]: 12: Hoare triple {530#true} ~i~0 := 0; {537#(= 0 main_~i~0)} is VALID [2020-07-11 02:25:57,711 INFO L280 TraceCheckUtils]: 13: Hoare triple {537#(= 0 main_~i~0)} assume !(~i~0 < ~num~0); {538#(<= main_~num~0 0)} is VALID [2020-07-11 02:25:57,712 INFO L280 TraceCheckUtils]: 14: Hoare triple {538#(<= main_~num~0 0)} ~i~0 := 0; {539#(and (<= main_~num~0 0) (= 0 main_~i~0))} is VALID [2020-07-11 02:25:57,714 INFO L280 TraceCheckUtils]: 15: Hoare triple {539#(and (<= main_~num~0 0) (= 0 main_~i~0))} assume !!(~i~0 < ~num~0); {531#false} is VALID [2020-07-11 02:25:57,714 INFO L280 TraceCheckUtils]: 16: Hoare triple {531#false} SUMMARY for call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L23 {531#false} is VALID [2020-07-11 02:25:57,714 INFO L280 TraceCheckUtils]: 17: Hoare triple {531#false} assume 0 == (if #t~mem4 < 0 && 0 != #t~mem4 % 2 then #t~mem4 % 2 - 2 else #t~mem4 % 2); {531#false} is VALID [2020-07-11 02:25:57,715 INFO L280 TraceCheckUtils]: 18: Hoare triple {531#false} havoc #t~mem4; {531#false} is VALID [2020-07-11 02:25:57,715 INFO L280 TraceCheckUtils]: 19: Hoare triple {531#false} SUMMARY for call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L25 {531#false} is VALID [2020-07-11 02:25:57,715 INFO L263 TraceCheckUtils]: 20: Hoare triple {531#false} call printEven(#t~mem5); {531#false} is VALID [2020-07-11 02:25:57,716 INFO L280 TraceCheckUtils]: 21: Hoare triple {531#false} ~i := #in~i; {531#false} is VALID [2020-07-11 02:25:57,716 INFO L263 TraceCheckUtils]: 22: Hoare triple {531#false} call __VERIFIER_assert((if 0 == (if ~i < 0 && 0 != ~i % 2 then ~i % 2 - 2 else ~i % 2) then 1 else 0)); {531#false} is VALID [2020-07-11 02:25:57,716 INFO L280 TraceCheckUtils]: 23: Hoare triple {531#false} ~cond := #in~cond; {531#false} is VALID [2020-07-11 02:25:57,717 INFO L280 TraceCheckUtils]: 24: Hoare triple {531#false} assume 0 == ~cond; {531#false} is VALID [2020-07-11 02:25:57,717 INFO L280 TraceCheckUtils]: 25: Hoare triple {531#false} assume !false; {531#false} is VALID [2020-07-11 02:25:57,718 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-11 02:25:57,719 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1043064166] [2020-07-11 02:25:57,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:25:57,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 02:25:57,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223401402] [2020-07-11 02:25:57,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-11 02:25:57,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:25:57,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 02:25:57,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:25:57,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 02:25:57,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:25:57,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 02:25:57,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-11 02:25:57,761 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 6 states. [2020-07-11 02:25:58,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:25:58,521 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2020-07-11 02:25:58,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 02:25:58,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-11 02:25:58,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:25:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:25:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2020-07-11 02:25:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:25:58,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2020-07-11 02:25:58,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 141 transitions. [2020-07-11 02:25:58,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:25:58,748 INFO L225 Difference]: With dead ends: 125 [2020-07-11 02:25:58,749 INFO L226 Difference]: Without dead ends: 84 [2020-07-11 02:25:58,750 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-11 02:25:58,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-07-11 02:25:58,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 60. [2020-07-11 02:25:58,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:25:58,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 60 states. [2020-07-11 02:25:58,806 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 60 states. [2020-07-11 02:25:58,806 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 60 states. [2020-07-11 02:25:58,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:25:58,813 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2020-07-11 02:25:58,814 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2020-07-11 02:25:58,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:25:58,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:25:58,816 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 84 states. [2020-07-11 02:25:58,816 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 84 states. [2020-07-11 02:25:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:25:58,822 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2020-07-11 02:25:58,822 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2020-07-11 02:25:58,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:25:58,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:25:58,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:25:58,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:25:58,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-11 02:25:58,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2020-07-11 02:25:58,828 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 26 [2020-07-11 02:25:58,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:25:58,828 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2020-07-11 02:25:58,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 02:25:58,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states and 65 transitions. [2020-07-11 02:25:58,917 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:25:58,918 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2020-07-11 02:25:58,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-11 02:25:58,920 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:25:58,920 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] [2020-07-11 02:25:58,921 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:25:58,921 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:25:58,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:25:58,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1567937856, now seen corresponding path program 1 times [2020-07-11 02:25:58,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:25:58,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1077467346] [2020-07-11 02:25:58,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:25:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:25:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:25:59,508 INFO L280 TraceCheckUtils]: 0: Hoare triple {1095#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1081#true} is VALID [2020-07-11 02:25:59,509 INFO L280 TraceCheckUtils]: 1: Hoare triple {1081#true} #valid := #valid[0 := 0]; {1081#true} is VALID [2020-07-11 02:25:59,509 INFO L280 TraceCheckUtils]: 2: Hoare triple {1081#true} assume 0 < #StackHeapBarrier; {1081#true} is VALID [2020-07-11 02:25:59,509 INFO L280 TraceCheckUtils]: 3: Hoare triple {1081#true} assume true; {1081#true} is VALID [2020-07-11 02:25:59,510 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1081#true} {1081#true} #109#return; {1081#true} is VALID [2020-07-11 02:25:59,511 INFO L263 TraceCheckUtils]: 0: Hoare triple {1081#true} call ULTIMATE.init(); {1095#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:25:59,512 INFO L280 TraceCheckUtils]: 1: Hoare triple {1095#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1081#true} is VALID [2020-07-11 02:25:59,512 INFO L280 TraceCheckUtils]: 2: Hoare triple {1081#true} #valid := #valid[0 := 0]; {1081#true} is VALID [2020-07-11 02:25:59,512 INFO L280 TraceCheckUtils]: 3: Hoare triple {1081#true} assume 0 < #StackHeapBarrier; {1081#true} is VALID [2020-07-11 02:25:59,513 INFO L280 TraceCheckUtils]: 4: Hoare triple {1081#true} assume true; {1081#true} is VALID [2020-07-11 02:25:59,513 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1081#true} {1081#true} #109#return; {1081#true} is VALID [2020-07-11 02:25:59,513 INFO L263 TraceCheckUtils]: 6: Hoare triple {1081#true} call #t~ret9 := main(); {1081#true} is VALID [2020-07-11 02:25:59,513 INFO L280 TraceCheckUtils]: 7: Hoare triple {1081#true} SUMMARY for call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(400000); srcloc: mainENTRY {1081#true} is VALID [2020-07-11 02:25:59,514 INFO L280 TraceCheckUtils]: 8: Hoare triple {1081#true} havoc ~i~0; {1081#true} is VALID [2020-07-11 02:25:59,514 INFO L280 TraceCheckUtils]: 9: Hoare triple {1081#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1081#true} is VALID [2020-07-11 02:25:59,514 INFO L280 TraceCheckUtils]: 10: Hoare triple {1081#true} ~num~0 := #t~nondet0; {1081#true} is VALID [2020-07-11 02:25:59,515 INFO L280 TraceCheckUtils]: 11: Hoare triple {1081#true} havoc #t~nondet0; {1081#true} is VALID [2020-07-11 02:25:59,519 INFO L280 TraceCheckUtils]: 12: Hoare triple {1081#true} ~i~0 := 0; {1081#true} is VALID [2020-07-11 02:25:59,520 INFO L280 TraceCheckUtils]: 13: Hoare triple {1081#true} assume !!(~i~0 < ~num~0); {1081#true} is VALID [2020-07-11 02:25:59,520 INFO L280 TraceCheckUtils]: 14: Hoare triple {1081#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1081#true} is VALID [2020-07-11 02:25:59,521 INFO L280 TraceCheckUtils]: 15: Hoare triple {1081#true} SUMMARY for call write~int(#t~nondet2, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L18-1 {1081#true} is VALID [2020-07-11 02:25:59,521 INFO L280 TraceCheckUtils]: 16: Hoare triple {1081#true} havoc #t~nondet2; {1081#true} is VALID [2020-07-11 02:25:59,521 INFO L280 TraceCheckUtils]: 17: Hoare triple {1081#true} #t~post1 := ~i~0; {1081#true} is VALID [2020-07-11 02:25:59,522 INFO L280 TraceCheckUtils]: 18: Hoare triple {1081#true} ~i~0 := 1 + #t~post1; {1081#true} is VALID [2020-07-11 02:25:59,522 INFO L280 TraceCheckUtils]: 19: Hoare triple {1081#true} havoc #t~post1; {1081#true} is VALID [2020-07-11 02:25:59,522 INFO L280 TraceCheckUtils]: 20: Hoare triple {1081#true} assume !(~i~0 < ~num~0); {1081#true} is VALID [2020-07-11 02:25:59,523 INFO L280 TraceCheckUtils]: 21: Hoare triple {1081#true} ~i~0 := 0; {1081#true} is VALID [2020-07-11 02:25:59,523 INFO L280 TraceCheckUtils]: 22: Hoare triple {1081#true} assume !!(~i~0 < ~num~0); {1081#true} is VALID [2020-07-11 02:25:59,526 INFO L280 TraceCheckUtils]: 23: Hoare triple {1081#true} SUMMARY for call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L23 {1088#(or (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) |main_#t~mem4|) (not (= |main_#t~mem4| (* 2 (div |main_#t~mem4| 2)))))} is VALID [2020-07-11 02:25:59,528 INFO L280 TraceCheckUtils]: 24: Hoare triple {1088#(or (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) |main_#t~mem4|) (not (= |main_#t~mem4| (* 2 (div |main_#t~mem4| 2)))))} assume 0 == (if #t~mem4 < 0 && 0 != #t~mem4 % 2 then #t~mem4 % 2 - 2 else #t~mem4 % 2); {1089#(<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) (* 2 (div (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) 2)))} is VALID [2020-07-11 02:25:59,530 INFO L280 TraceCheckUtils]: 25: Hoare triple {1089#(<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) (* 2 (div (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) 2)))} havoc #t~mem4; {1089#(<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) (* 2 (div (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) 2)))} is VALID [2020-07-11 02:25:59,532 INFO L280 TraceCheckUtils]: 26: Hoare triple {1089#(<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) (* 2 (div (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) 2)))} SUMMARY for call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L25 {1090#(<= |main_#t~mem5| (* 2 (div |main_#t~mem5| 2)))} is VALID [2020-07-11 02:25:59,534 INFO L263 TraceCheckUtils]: 27: Hoare triple {1090#(<= |main_#t~mem5| (* 2 (div |main_#t~mem5| 2)))} call printEven(#t~mem5); {1091#(<= |printEven_#in~i| (* 2 (div |printEven_#in~i| 2)))} is VALID [2020-07-11 02:25:59,535 INFO L280 TraceCheckUtils]: 28: Hoare triple {1091#(<= |printEven_#in~i| (* 2 (div |printEven_#in~i| 2)))} ~i := #in~i; {1092#(<= printEven_~i (* 2 (div printEven_~i 2)))} is VALID [2020-07-11 02:25:59,537 INFO L263 TraceCheckUtils]: 29: Hoare triple {1092#(<= printEven_~i (* 2 (div printEven_~i 2)))} call __VERIFIER_assert((if 0 == (if ~i < 0 && 0 != ~i % 2 then ~i % 2 - 2 else ~i % 2) then 1 else 0)); {1093#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:25:59,538 INFO L280 TraceCheckUtils]: 30: Hoare triple {1093#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1094#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:25:59,540 INFO L280 TraceCheckUtils]: 31: Hoare triple {1094#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1082#false} is VALID [2020-07-11 02:25:59,540 INFO L280 TraceCheckUtils]: 32: Hoare triple {1082#false} assume !false; {1082#false} is VALID [2020-07-11 02:25:59,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-11 02:25:59,544 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1077467346] [2020-07-11 02:25:59,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:25:59,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-11 02:25:59,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094536402] [2020-07-11 02:25:59,547 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2020-07-11 02:25:59,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:25:59,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 02:25:59,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:25:59,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 02:25:59,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:25:59,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 02:25:59,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-11 02:25:59,588 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 10 states. [2020-07-11 02:26:00,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:00,918 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2020-07-11 02:26:00,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 02:26:00,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2020-07-11 02:26:00,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:26:00,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 02:26:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2020-07-11 02:26:00,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 02:26:00,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2020-07-11 02:26:00,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2020-07-11 02:26:01,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:01,046 INFO L225 Difference]: With dead ends: 68 [2020-07-11 02:26:01,046 INFO L226 Difference]: Without dead ends: 66 [2020-07-11 02:26:01,047 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2020-07-11 02:26:01,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-11 02:26:01,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2020-07-11 02:26:01,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:26:01,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 64 states. [2020-07-11 02:26:01,139 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 64 states. [2020-07-11 02:26:01,139 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 64 states. [2020-07-11 02:26:01,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:01,146 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2020-07-11 02:26:01,146 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2020-07-11 02:26:01,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:26:01,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:26:01,148 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 66 states. [2020-07-11 02:26:01,148 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 66 states. [2020-07-11 02:26:01,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:01,157 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2020-07-11 02:26:01,157 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2020-07-11 02:26:01,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:26:01,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:26:01,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:26:01,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:26:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-11 02:26:01,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2020-07-11 02:26:01,164 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 33 [2020-07-11 02:26:01,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:26:01,164 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2020-07-11 02:26:01,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 02:26:01,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 68 transitions. [2020-07-11 02:26:01,254 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-11 02:26:01,255 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2020-07-11 02:26:01,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-11 02:26:01,256 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:26:01,256 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-11 02:26:01,257 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:26:01,257 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:26:01,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:26:01,258 INFO L82 PathProgramCache]: Analyzing trace with hash -741681537, now seen corresponding path program 1 times [2020-07-11 02:26:01,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:26:01,258 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1457201841] [2020-07-11 02:26:01,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:26:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:01,554 INFO L280 TraceCheckUtils]: 0: Hoare triple {1522#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1508#true} is VALID [2020-07-11 02:26:01,554 INFO L280 TraceCheckUtils]: 1: Hoare triple {1508#true} #valid := #valid[0 := 0]; {1508#true} is VALID [2020-07-11 02:26:01,555 INFO L280 TraceCheckUtils]: 2: Hoare triple {1508#true} assume 0 < #StackHeapBarrier; {1508#true} is VALID [2020-07-11 02:26:01,555 INFO L280 TraceCheckUtils]: 3: Hoare triple {1508#true} assume true; {1508#true} is VALID [2020-07-11 02:26:01,555 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1508#true} {1508#true} #109#return; {1508#true} is VALID [2020-07-11 02:26:01,557 INFO L263 TraceCheckUtils]: 0: Hoare triple {1508#true} call ULTIMATE.init(); {1522#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:26:01,558 INFO L280 TraceCheckUtils]: 1: Hoare triple {1522#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1508#true} is VALID [2020-07-11 02:26:01,558 INFO L280 TraceCheckUtils]: 2: Hoare triple {1508#true} #valid := #valid[0 := 0]; {1508#true} is VALID [2020-07-11 02:26:01,558 INFO L280 TraceCheckUtils]: 3: Hoare triple {1508#true} assume 0 < #StackHeapBarrier; {1508#true} is VALID [2020-07-11 02:26:01,559 INFO L280 TraceCheckUtils]: 4: Hoare triple {1508#true} assume true; {1508#true} is VALID [2020-07-11 02:26:01,559 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1508#true} {1508#true} #109#return; {1508#true} is VALID [2020-07-11 02:26:01,559 INFO L263 TraceCheckUtils]: 6: Hoare triple {1508#true} call #t~ret9 := main(); {1508#true} is VALID [2020-07-11 02:26:01,560 INFO L280 TraceCheckUtils]: 7: Hoare triple {1508#true} SUMMARY for call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(400000); srcloc: mainENTRY {1508#true} is VALID [2020-07-11 02:26:01,560 INFO L280 TraceCheckUtils]: 8: Hoare triple {1508#true} havoc ~i~0; {1508#true} is VALID [2020-07-11 02:26:01,561 INFO L280 TraceCheckUtils]: 9: Hoare triple {1508#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1508#true} is VALID [2020-07-11 02:26:01,561 INFO L280 TraceCheckUtils]: 10: Hoare triple {1508#true} ~num~0 := #t~nondet0; {1508#true} is VALID [2020-07-11 02:26:01,561 INFO L280 TraceCheckUtils]: 11: Hoare triple {1508#true} havoc #t~nondet0; {1508#true} is VALID [2020-07-11 02:26:01,562 INFO L280 TraceCheckUtils]: 12: Hoare triple {1508#true} ~i~0 := 0; {1508#true} is VALID [2020-07-11 02:26:01,562 INFO L280 TraceCheckUtils]: 13: Hoare triple {1508#true} assume !!(~i~0 < ~num~0); {1508#true} is VALID [2020-07-11 02:26:01,562 INFO L280 TraceCheckUtils]: 14: Hoare triple {1508#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1508#true} is VALID [2020-07-11 02:26:01,563 INFO L280 TraceCheckUtils]: 15: Hoare triple {1508#true} SUMMARY for call write~int(#t~nondet2, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L18-1 {1508#true} is VALID [2020-07-11 02:26:01,563 INFO L280 TraceCheckUtils]: 16: Hoare triple {1508#true} havoc #t~nondet2; {1508#true} is VALID [2020-07-11 02:26:01,563 INFO L280 TraceCheckUtils]: 17: Hoare triple {1508#true} #t~post1 := ~i~0; {1508#true} is VALID [2020-07-11 02:26:01,564 INFO L280 TraceCheckUtils]: 18: Hoare triple {1508#true} ~i~0 := 1 + #t~post1; {1508#true} is VALID [2020-07-11 02:26:01,564 INFO L280 TraceCheckUtils]: 19: Hoare triple {1508#true} havoc #t~post1; {1508#true} is VALID [2020-07-11 02:26:01,564 INFO L280 TraceCheckUtils]: 20: Hoare triple {1508#true} assume !(~i~0 < ~num~0); {1508#true} is VALID [2020-07-11 02:26:01,565 INFO L280 TraceCheckUtils]: 21: Hoare triple {1508#true} ~i~0 := 0; {1508#true} is VALID [2020-07-11 02:26:01,565 INFO L280 TraceCheckUtils]: 22: Hoare triple {1508#true} assume !!(~i~0 < ~num~0); {1508#true} is VALID [2020-07-11 02:26:01,565 INFO L280 TraceCheckUtils]: 23: Hoare triple {1508#true} SUMMARY for call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L23 {1508#true} is VALID [2020-07-11 02:26:01,566 INFO L280 TraceCheckUtils]: 24: Hoare triple {1508#true} assume !(0 == (if #t~mem4 < 0 && 0 != #t~mem4 % 2 then #t~mem4 % 2 - 2 else #t~mem4 % 2)); {1508#true} is VALID [2020-07-11 02:26:01,566 INFO L280 TraceCheckUtils]: 25: Hoare triple {1508#true} havoc #t~mem4; {1508#true} is VALID [2020-07-11 02:26:01,567 INFO L280 TraceCheckUtils]: 26: Hoare triple {1508#true} #t~post3 := ~i~0; {1508#true} is VALID [2020-07-11 02:26:01,567 INFO L280 TraceCheckUtils]: 27: Hoare triple {1508#true} ~i~0 := 1 + #t~post3; {1508#true} is VALID [2020-07-11 02:26:01,567 INFO L280 TraceCheckUtils]: 28: Hoare triple {1508#true} havoc #t~post3; {1508#true} is VALID [2020-07-11 02:26:01,568 INFO L280 TraceCheckUtils]: 29: Hoare triple {1508#true} assume !(~i~0 < ~num~0); {1508#true} is VALID [2020-07-11 02:26:01,568 INFO L280 TraceCheckUtils]: 30: Hoare triple {1508#true} ~i~0 := 0; {1508#true} is VALID [2020-07-11 02:26:01,568 INFO L280 TraceCheckUtils]: 31: Hoare triple {1508#true} assume !!(~i~0 < ~num~0); {1508#true} is VALID [2020-07-11 02:26:01,570 INFO L280 TraceCheckUtils]: 32: Hoare triple {1508#true} SUMMARY for call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L30 {1515#(= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) |main_#t~mem7|)} is VALID [2020-07-11 02:26:01,573 INFO L280 TraceCheckUtils]: 33: Hoare triple {1515#(= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) |main_#t~mem7|)} assume 0 != (if #t~mem7 < 0 && 0 != #t~mem7 % 2 then #t~mem7 % 2 - 2 else #t~mem7 % 2); {1516#(<= (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) 1) (* 2 (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) 1) 2)))} is VALID [2020-07-11 02:26:01,575 INFO L280 TraceCheckUtils]: 34: Hoare triple {1516#(<= (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) 1) (* 2 (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) 1) 2)))} havoc #t~mem7; {1516#(<= (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) 1) (* 2 (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) 1) 2)))} is VALID [2020-07-11 02:26:01,576 INFO L280 TraceCheckUtils]: 35: Hoare triple {1516#(<= (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) 1) (* 2 (div (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) 1) 2)))} SUMMARY for call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L32 {1517#(<= (+ |main_#t~mem8| 1) (* 2 (div (+ |main_#t~mem8| 1) 2)))} is VALID [2020-07-11 02:26:01,577 INFO L263 TraceCheckUtils]: 36: Hoare triple {1517#(<= (+ |main_#t~mem8| 1) (* 2 (div (+ |main_#t~mem8| 1) 2)))} call printOdd(#t~mem8); {1518#(<= (+ |printOdd_#in~i| 1) (* 2 (div (+ |printOdd_#in~i| 1) 2)))} is VALID [2020-07-11 02:26:01,579 INFO L280 TraceCheckUtils]: 37: Hoare triple {1518#(<= (+ |printOdd_#in~i| 1) (* 2 (div (+ |printOdd_#in~i| 1) 2)))} ~i := #in~i; {1519#(<= (+ (* 2 (div printOdd_~i 2)) 1) printOdd_~i)} is VALID [2020-07-11 02:26:01,581 INFO L263 TraceCheckUtils]: 38: Hoare triple {1519#(<= (+ (* 2 (div printOdd_~i 2)) 1) printOdd_~i)} call __VERIFIER_assert((if 0 != (if ~i < 0 && 0 != ~i % 2 then ~i % 2 - 2 else ~i % 2) then 1 else 0)); {1520#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:26:01,583 INFO L280 TraceCheckUtils]: 39: Hoare triple {1520#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1521#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:26:01,584 INFO L280 TraceCheckUtils]: 40: Hoare triple {1521#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1509#false} is VALID [2020-07-11 02:26:01,585 INFO L280 TraceCheckUtils]: 41: Hoare triple {1509#false} assume !false; {1509#false} is VALID [2020-07-11 02:26:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-11 02:26:01,609 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1457201841] [2020-07-11 02:26:01,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:26:01,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-11 02:26:01,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751943839] [2020-07-11 02:26:01,611 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2020-07-11 02:26:01,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:26:01,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 02:26:01,665 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-11 02:26:01,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 02:26:01,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:26:01,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 02:26:01,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-11 02:26:01,666 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 10 states. [2020-07-11 02:26:02,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:02,910 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2020-07-11 02:26:02,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 02:26:02,910 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2020-07-11 02:26:02,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:26:02,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 02:26:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 68 transitions. [2020-07-11 02:26:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 02:26:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 68 transitions. [2020-07-11 02:26:02,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 68 transitions. [2020-07-11 02:26:03,019 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-11 02:26:03,020 INFO L225 Difference]: With dead ends: 66 [2020-07-11 02:26:03,020 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 02:26:03,021 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2020-07-11 02:26:03,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 02:26:03,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 02:26:03,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:26:03,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 02:26:03,023 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:26:03,023 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:26:03,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:03,023 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:26:03,023 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:26:03,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:26:03,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:26:03,024 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:26:03,024 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:26:03,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:03,025 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:26:03,025 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:26:03,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:26:03,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:26:03,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:26:03,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:26:03,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 02:26:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 02:26:03,026 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2020-07-11 02:26:03,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:26:03,026 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 02:26:03,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 02:26:03,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 02:26:03,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:26:03,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:26:03,027 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 02:26:03,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 02:26:03,653 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 02:26:03,653 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-11 02:26:03,653 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:26:03,654 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-11 02:26:03,654 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:26:03,654 INFO L271 CegarLoopResult]: At program point printOddENTRY(lines 7 9) the Hoare annotation is: true [2020-07-11 02:26:03,654 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (or (<= (+ (* 2 (div printOdd_~i 2)) 1) printOdd_~i) (not (let ((.cse0 (+ |printOdd_#in~i| 1))) (<= .cse0 (* 2 (div .cse0 2)))))) [2020-07-11 02:26:03,654 INFO L264 CegarLoopResult]: At program point printOddFINAL(lines 7 9) the Hoare annotation is: (or (<= (+ (* 2 (div printOdd_~i 2)) 1) printOdd_~i) (not (let ((.cse0 (+ |printOdd_#in~i| 1))) (<= .cse0 (* 2 (div .cse0 2)))))) [2020-07-11 02:26:03,655 INFO L264 CegarLoopResult]: At program point printOddEXIT(lines 7 9) the Hoare annotation is: (or (<= (+ (* 2 (div printOdd_~i 2)) 1) printOdd_~i) (not (let ((.cse0 (+ |printOdd_#in~i| 1))) (<= .cse0 (* 2 (div .cse0 2)))))) [2020-07-11 02:26:03,655 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:26:03,655 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 02:26:03,655 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 02:26:03,655 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:26:03,656 INFO L264 CegarLoopResult]: At program point printEvenEXIT(lines 4 6) the Hoare annotation is: (or (not (<= |printEven_#in~i| (* 2 (div |printEven_#in~i| 2)))) (<= printEven_~i (* 2 (div printEven_~i 2)))) [2020-07-11 02:26:03,656 INFO L271 CegarLoopResult]: At program point printEvenENTRY(lines 4 6) the Hoare annotation is: true [2020-07-11 02:26:03,656 INFO L264 CegarLoopResult]: At program point printEvenFINAL(lines 4 6) the Hoare annotation is: (or (not (<= |printEven_#in~i| (* 2 (div |printEven_#in~i| 2)))) (<= printEven_~i (* 2 (div printEven_~i 2)))) [2020-07-11 02:26:03,656 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (or (not (<= |printEven_#in~i| (* 2 (div |printEven_#in~i| 2)))) (<= printEven_~i (* 2 (div printEven_~i 2)))) [2020-07-11 02:26:03,657 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 10 36) the Hoare annotation is: true [2020-07-11 02:26:03,657 INFO L271 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-07-11 02:26:03,658 INFO L264 CegarLoopResult]: At program point L23-1(lines 23 26) the Hoare annotation is: (or (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) |main_#t~mem4|) (not (= |main_#t~mem4| (* 2 (div |main_#t~mem4| 2))))) [2020-07-11 02:26:03,659 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)))) (and (or (= .cse0 |main_#t~mem4|) (not (= |main_#t~mem4| (* 2 (div |main_#t~mem4| 2))))) (<= .cse0 (* 2 (div .cse0 2))))) [2020-07-11 02:26:03,659 INFO L264 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (or (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) |main_#t~mem4|) (not (= |main_#t~mem4| (* 2 (div |main_#t~mem4| 2))))) [2020-07-11 02:26:03,659 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) 1))) (<= .cse0 (* 2 (div .cse0 2)))) [2020-07-11 02:26:03,659 INFO L264 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (and (let ((.cse0 (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) 1))) (<= .cse0 (* 2 (div .cse0 2)))) (let ((.cse1 (+ |main_#t~mem8| 1))) (<= .cse1 (* 2 (div .cse1 2))))) [2020-07-11 02:26:03,660 INFO L264 CegarLoopResult]: At program point L32-2(line 32) the Hoare annotation is: (and (let ((.cse0 (+ (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) 1))) (<= .cse0 (* 2 (div .cse0 2)))) (let ((.cse1 (+ |main_#t~mem8| 1))) (<= .cse1 (* 2 (div .cse1 2))))) [2020-07-11 02:26:03,660 INFO L271 CegarLoopResult]: At program point L28-2(lines 28 34) the Hoare annotation is: true [2020-07-11 02:26:03,660 INFO L271 CegarLoopResult]: At program point L28-3(line 28) the Hoare annotation is: true [2020-07-11 02:26:03,660 INFO L271 CegarLoopResult]: At program point L28-4(line 28) the Hoare annotation is: true [2020-07-11 02:26:03,660 INFO L271 CegarLoopResult]: At program point L28-5(lines 28 34) the Hoare annotation is: true [2020-07-11 02:26:03,660 INFO L271 CegarLoopResult]: At program point L28-6(lines 28 34) the Hoare annotation is: true [2020-07-11 02:26:03,661 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-11 02:26:03,661 INFO L271 CegarLoopResult]: At program point L16-3(lines 16 19) the Hoare annotation is: true [2020-07-11 02:26:03,661 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-11 02:26:03,661 INFO L271 CegarLoopResult]: At program point L16-4(line 16) the Hoare annotation is: true [2020-07-11 02:26:03,661 INFO L271 CegarLoopResult]: At program point L16-5(line 16) the Hoare annotation is: true [2020-07-11 02:26:03,661 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-11 02:26:03,661 INFO L271 CegarLoopResult]: At program point L16-6(lines 16 19) the Hoare annotation is: true [2020-07-11 02:26:03,662 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-11 02:26:03,662 INFO L271 CegarLoopResult]: At program point L16-7(lines 16 19) the Hoare annotation is: true [2020-07-11 02:26:03,663 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)))) (<= .cse0 (* 2 (div .cse0 2)))) [2020-07-11 02:26:03,663 INFO L264 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (and (let ((.cse0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)))) (<= .cse0 (* 2 (div .cse0 2)))) (<= |main_#t~mem5| (* 2 (div |main_#t~mem5| 2)))) [2020-07-11 02:26:03,663 INFO L264 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (and (let ((.cse0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)))) (<= .cse0 (* 2 (div .cse0 2)))) (<= |main_#t~mem5| (* 2 (div |main_#t~mem5| 2)))) [2020-07-11 02:26:03,663 INFO L271 CegarLoopResult]: At program point L21-2(lines 21 27) the Hoare annotation is: true [2020-07-11 02:26:03,664 INFO L271 CegarLoopResult]: At program point L21-3(line 21) the Hoare annotation is: true [2020-07-11 02:26:03,664 INFO L271 CegarLoopResult]: At program point L21-4(line 21) the Hoare annotation is: true [2020-07-11 02:26:03,664 INFO L271 CegarLoopResult]: At program point L21-5(lines 21 27) the Hoare annotation is: true [2020-07-11 02:26:03,664 INFO L271 CegarLoopResult]: At program point L21-6(lines 21 27) the Hoare annotation is: true [2020-07-11 02:26:03,664 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 10 36) the Hoare annotation is: true [2020-07-11 02:26:03,665 INFO L271 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-07-11 02:26:03,665 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 10 36) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-11 02:26:03,665 INFO L264 CegarLoopResult]: At program point L30-1(lines 30 33) the Hoare annotation is: (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) |main_#t~mem7|) [2020-07-11 02:26:03,666 INFO L264 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)))) (and (let ((.cse0 (+ .cse1 1))) (<= .cse0 (* 2 (div .cse0 2)))) (= .cse1 |main_#t~mem7|))) [2020-07-11 02:26:03,666 INFO L264 CegarLoopResult]: At program point L30-4(line 30) the Hoare annotation is: (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~i~0 4) |main_~#array~0.offset|)) |main_#t~mem7|) [2020-07-11 02:26:03,666 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-11 02:26:03,667 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-11 02:26:03,667 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-11 02:26:03,667 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-11 02:26:03,667 INFO L271 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-07-11 02:26:03,667 INFO L271 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-07-11 02:26:03,667 INFO L264 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:26:03,669 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(line 3) the Hoare annotation is: true [2020-07-11 02:26:03,669 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(line 3) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:26:03,669 INFO L264 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:26:03,670 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:26:03,670 INFO L264 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:26:03,697 INFO L163 areAnnotationChecker]: CFG has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 02:26:03,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:26:03 BoogieIcfgContainer [2020-07-11 02:26:03,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:26:03,724 INFO L168 Benchmark]: Toolchain (without parser) took 9088.79 ms. Allocated memory was 138.4 MB in the beginning and 299.4 MB in the end (delta: 161.0 MB). Free memory was 102.4 MB in the beginning and 152.9 MB in the end (delta: -50.6 MB). Peak memory consumption was 110.4 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:03,725 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 138.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 02:26:03,726 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.99 ms. Allocated memory is still 138.4 MB. Free memory was 102.1 MB in the beginning and 91.7 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:03,727 INFO L168 Benchmark]: Boogie Preprocessor took 148.63 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 91.7 MB in the beginning and 180.9 MB in the end (delta: -89.2 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:03,728 INFO L168 Benchmark]: RCFGBuilder took 667.49 ms. Allocated memory is still 203.4 MB. Free memory was 180.9 MB in the beginning and 152.7 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:03,729 INFO L168 Benchmark]: TraceAbstraction took 7950.24 ms. Allocated memory was 203.4 MB in the beginning and 299.4 MB in the end (delta: 95.9 MB). Free memory was 152.7 MB in the beginning and 152.9 MB in the end (delta: -208.2 kB). Peak memory consumption was 95.7 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:03,734 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.28 ms. Allocated memory is still 138.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 314.99 ms. Allocated memory is still 138.4 MB. Free memory was 102.1 MB in the beginning and 91.7 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 148.63 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 91.7 MB in the beginning and 180.9 MB in the end (delta: -89.2 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 667.49 ms. Allocated memory is still 203.4 MB. Free memory was 180.9 MB in the beginning and 152.7 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7950.24 ms. Allocated memory was 203.4 MB in the beginning and 299.4 MB in the end (delta: 95.9 MB). Free memory was 152.7 MB in the beginning and 152.9 MB in the end (delta: -208.2 kB). Peak memory consumption was 95.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 7]: Procedure Contract for printOdd Derived contract for procedure printOdd: 2 * (i / 2) + 1 <= i || !(\old(i) + 1 <= 2 * ((\old(i) + 1) / 2)) - ProcedureContractResult [Line: 4]: Procedure Contract for printEven Derived contract for procedure printEven: !(\old(i) <= 2 * (\old(i) / 2)) || i <= 2 * (i / 2) - ProcedureContractResult [Line: 10]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 3]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.1s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 225 SDtfs, 93 SDslu, 656 SDs, 0 SdLazy, 576 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 4 MinimizatonAttempts, 26 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 65 LocationsWithAnnotation, 111 PreInvPairs, 158 NumberOfFragments, 532 HoareAnnotationTreeSize, 111 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 65 FomulaSimplificationsInter, 238 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 12032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...