/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/array-fpi/brs3f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 23:34:57,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:34:57,097 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:34:57,123 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:34:57,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:34:57,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:34:57,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:34:57,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:34:57,149 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:34:57,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:34:57,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:34:57,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:34:57,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:34:57,161 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:34:57,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:34:57,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:34:57,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:34:57,174 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:34:57,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:34:57,183 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:34:57,190 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:34:57,194 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:34:57,196 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:34:57,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:34:57,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:34:57,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:34:57,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:34:57,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:34:57,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:34:57,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:34:57,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:34:57,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:34:57,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:34:57,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:34:57,211 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:34:57,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:34:57,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:34:57,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:34:57,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:34:57,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:34:57,216 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:34:57,217 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 23:34:57,245 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:34:57,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:34:57,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:34:57,253 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:34:57,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:34:57,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:34:57,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:34:57,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:34:57,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:34:57,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:34:57,254 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:34:57,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:34:57,255 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:34:57,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:34:57,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:34:57,255 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:34:57,256 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:34:57,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:34:57,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:34:57,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:34:57,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:34:57,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:34:57,257 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-08 23:34:57,638 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:34:57,654 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:34:57,659 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:34:57,661 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:34:57,662 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:34:57,663 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/brs3f.c [2020-07-08 23:34:57,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d996c79de/65a259ee55fa4bfeab2b10c9a8f70e98/FLAG38e32c131 [2020-07-08 23:34:58,441 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:34:58,442 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs3f.c [2020-07-08 23:34:58,452 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d996c79de/65a259ee55fa4bfeab2b10c9a8f70e98/FLAG38e32c131 [2020-07-08 23:34:58,760 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d996c79de/65a259ee55fa4bfeab2b10c9a8f70e98 [2020-07-08 23:34:58,773 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:34:58,775 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:34:58,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:34:58,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:34:58,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:34:58,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:34:58" (1/1) ... [2020-07-08 23:34:58,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@374e8111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:34:58, skipping insertion in model container [2020-07-08 23:34:58,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:34:58" (1/1) ... [2020-07-08 23:34:58,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:34:58,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:34:59,101 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:34:59,117 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:34:59,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:34:59,171 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:34:59,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:34:59 WrapperNode [2020-07-08 23:34:59,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:34:59,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:34:59,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:34:59,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:34:59,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:34:59" (1/1) ... [2020-07-08 23:34:59,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:34:59" (1/1) ... [2020-07-08 23:34:59,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:34:59" (1/1) ... [2020-07-08 23:34:59,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:34:59" (1/1) ... [2020-07-08 23:34:59,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:34:59" (1/1) ... [2020-07-08 23:34:59,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:34:59" (1/1) ... [2020-07-08 23:34:59,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:34:59" (1/1) ... [2020-07-08 23:34:59,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:34:59,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:34:59,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:34:59,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:34:59,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:34:59" (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-08 23:34:59,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:34:59,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:34:59,435 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 23:34:59,435 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 23:34:59,436 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:34:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:34:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 23:34:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 23:34:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 23:34:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 23:34:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 23:34:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:34:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 23:34:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 23:34:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 23:34:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 23:34:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 23:34:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:34:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:34:59,994 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:34:59,995 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-08 23:35:00,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:35:00 BoogieIcfgContainer [2020-07-08 23:35:00,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:35:00,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:35:00,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:35:00,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:35:00,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:34:58" (1/3) ... [2020-07-08 23:35:00,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492ca93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:35:00, skipping insertion in model container [2020-07-08 23:35:00,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:34:59" (2/3) ... [2020-07-08 23:35:00,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492ca93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:35:00, skipping insertion in model container [2020-07-08 23:35:00,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:35:00" (3/3) ... [2020-07-08 23:35:00,011 INFO L109 eAbstractionObserver]: Analyzing ICFG brs3f.c [2020-07-08 23:35:00,025 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:35:00,035 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:35:00,050 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:35:00,079 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:35:00,080 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:35:00,080 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:35:00,080 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:35:00,080 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:35:00,080 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:35:00,080 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:35:00,080 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:35:00,096 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2020-07-08 23:35:00,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-08 23:35:00,110 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:35:00,111 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:35:00,112 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:35:00,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:35:00,119 INFO L82 PathProgramCache]: Analyzing trace with hash 221259408, now seen corresponding path program 1 times [2020-07-08 23:35:00,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:35:00,128 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1569932894] [2020-07-08 23:35:00,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:35:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:00,508 INFO L280 TraceCheckUtils]: 0: Hoare triple {74#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {62#true} is VALID [2020-07-08 23:35:00,509 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} #valid := #valid[0 := 0]; {62#true} is VALID [2020-07-08 23:35:00,509 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} assume 0 < #StackHeapBarrier; {62#true} is VALID [2020-07-08 23:35:00,510 INFO L280 TraceCheckUtils]: 3: Hoare triple {62#true} ~N~0 := 0; {62#true} is VALID [2020-07-08 23:35:00,511 INFO L280 TraceCheckUtils]: 4: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-08 23:35:00,513 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {62#true} {62#true} #103#return; {62#true} is VALID [2020-07-08 23:35:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:00,548 INFO L280 TraceCheckUtils]: 0: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2020-07-08 23:35:00,549 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} assume !(0 == ~cond); {62#true} is VALID [2020-07-08 23:35:00,549 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-08 23:35:00,550 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {62#true} {62#true} #99#return; {62#true} is VALID [2020-07-08 23:35:00,553 INFO L263 TraceCheckUtils]: 0: Hoare triple {62#true} call ULTIMATE.init(); {74#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:35:00,554 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {62#true} is VALID [2020-07-08 23:35:00,554 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} #valid := #valid[0 := 0]; {62#true} is VALID [2020-07-08 23:35:00,555 INFO L280 TraceCheckUtils]: 3: Hoare triple {62#true} assume 0 < #StackHeapBarrier; {62#true} is VALID [2020-07-08 23:35:00,555 INFO L280 TraceCheckUtils]: 4: Hoare triple {62#true} ~N~0 := 0; {62#true} is VALID [2020-07-08 23:35:00,556 INFO L280 TraceCheckUtils]: 5: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-08 23:35:00,556 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {62#true} {62#true} #103#return; {62#true} is VALID [2020-07-08 23:35:00,557 INFO L263 TraceCheckUtils]: 7: Hoare triple {62#true} call #t~ret7 := main(); {62#true} is VALID [2020-07-08 23:35:00,558 INFO L280 TraceCheckUtils]: 8: Hoare triple {62#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {62#true} is VALID [2020-07-08 23:35:00,559 INFO L280 TraceCheckUtils]: 9: Hoare triple {62#true} ~N~0 := #t~nondet0; {62#true} is VALID [2020-07-08 23:35:00,559 INFO L280 TraceCheckUtils]: 10: Hoare triple {62#true} havoc #t~nondet0; {62#true} is VALID [2020-07-08 23:35:00,563 INFO L280 TraceCheckUtils]: 11: Hoare triple {62#true} assume !(~N~0 <= 0); {62#true} is VALID [2020-07-08 23:35:00,564 INFO L263 TraceCheckUtils]: 12: Hoare triple {62#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {62#true} is VALID [2020-07-08 23:35:00,565 INFO L280 TraceCheckUtils]: 13: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2020-07-08 23:35:00,566 INFO L280 TraceCheckUtils]: 14: Hoare triple {62#true} assume !(0 == ~cond); {62#true} is VALID [2020-07-08 23:35:00,566 INFO L280 TraceCheckUtils]: 15: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-08 23:35:00,568 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {62#true} {62#true} #99#return; {62#true} is VALID [2020-07-08 23:35:00,569 INFO L280 TraceCheckUtils]: 17: Hoare triple {62#true} havoc ~i~0; {62#true} is VALID [2020-07-08 23:35:00,570 INFO L280 TraceCheckUtils]: 18: Hoare triple {62#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {62#true} is VALID [2020-07-08 23:35:00,570 INFO L280 TraceCheckUtils]: 19: Hoare triple {62#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {62#true} is VALID [2020-07-08 23:35:00,571 INFO L280 TraceCheckUtils]: 20: Hoare triple {62#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {62#true} is VALID [2020-07-08 23:35:00,572 INFO L280 TraceCheckUtils]: 21: Hoare triple {62#true} ~i~0 := 0; {62#true} is VALID [2020-07-08 23:35:00,573 INFO L280 TraceCheckUtils]: 22: Hoare triple {62#true} assume !true; {63#false} is VALID [2020-07-08 23:35:00,574 INFO L280 TraceCheckUtils]: 23: Hoare triple {63#false} ~i~0 := 0; {63#false} is VALID [2020-07-08 23:35:00,575 INFO L280 TraceCheckUtils]: 24: Hoare triple {63#false} assume !(~i~0 < ~N~0); {63#false} is VALID [2020-07-08 23:35:00,575 INFO L280 TraceCheckUtils]: 25: Hoare triple {63#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {63#false} is VALID [2020-07-08 23:35:00,576 INFO L263 TraceCheckUtils]: 26: Hoare triple {63#false} call __VERIFIER_assert((if #t~mem6 <= 3 * ~N~0 then 1 else 0)); {63#false} is VALID [2020-07-08 23:35:00,577 INFO L280 TraceCheckUtils]: 27: Hoare triple {63#false} ~cond := #in~cond; {63#false} is VALID [2020-07-08 23:35:00,578 INFO L280 TraceCheckUtils]: 28: Hoare triple {63#false} assume 0 == ~cond; {63#false} is VALID [2020-07-08 23:35:00,578 INFO L280 TraceCheckUtils]: 29: Hoare triple {63#false} assume !false; {63#false} is VALID [2020-07-08 23:35:00,593 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-08 23:35:00,594 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1569932894] [2020-07-08 23:35:00,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:35:00,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 23:35:00,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884229695] [2020-07-08 23:35:00,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-08 23:35:00,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:35:00,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 23:35:00,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:00,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 23:35:00,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:35:00,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 23:35:00,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 23:35:00,731 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2020-07-08 23:35:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:01,307 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2020-07-08 23:35:01,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 23:35:01,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-08 23:35:01,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:35:01,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:35:01,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2020-07-08 23:35:01,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:35:01,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2020-07-08 23:35:01,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 116 transitions. [2020-07-08 23:35:01,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:01,538 INFO L225 Difference]: With dead ends: 101 [2020-07-08 23:35:01,538 INFO L226 Difference]: Without dead ends: 47 [2020-07-08 23:35:01,544 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 23:35:01,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-08 23:35:01,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-08 23:35:01,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:35:01,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2020-07-08 23:35:01,676 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-08 23:35:01,677 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-08 23:35:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:01,683 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-07-08 23:35:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-08 23:35:01,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:01,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:01,685 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-08 23:35:01,685 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-08 23:35:01,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:01,692 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-07-08 23:35:01,692 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-08 23:35:01,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:01,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:01,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:35:01,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:35:01,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-08 23:35:01,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2020-07-08 23:35:01,701 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 30 [2020-07-08 23:35:01,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:35:01,702 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2020-07-08 23:35:01,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 23:35:01,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2020-07-08 23:35:01,773 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:01,773 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-08 23:35:01,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-08 23:35:01,775 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:35:01,775 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:35:01,776 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:35:01,776 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:35:01,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:35:01,777 INFO L82 PathProgramCache]: Analyzing trace with hash -151091841, now seen corresponding path program 1 times [2020-07-08 23:35:01,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:35:01,777 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [499830676] [2020-07-08 23:35:01,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:35:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:01,977 INFO L280 TraceCheckUtils]: 0: Hoare triple {481#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {467#true} is VALID [2020-07-08 23:35:01,978 INFO L280 TraceCheckUtils]: 1: Hoare triple {467#true} #valid := #valid[0 := 0]; {467#true} is VALID [2020-07-08 23:35:01,979 INFO L280 TraceCheckUtils]: 2: Hoare triple {467#true} assume 0 < #StackHeapBarrier; {467#true} is VALID [2020-07-08 23:35:01,979 INFO L280 TraceCheckUtils]: 3: Hoare triple {467#true} ~N~0 := 0; {467#true} is VALID [2020-07-08 23:35:01,979 INFO L280 TraceCheckUtils]: 4: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-08 23:35:01,980 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {467#true} {467#true} #103#return; {467#true} is VALID [2020-07-08 23:35:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:02,009 INFO L280 TraceCheckUtils]: 0: Hoare triple {467#true} ~cond := #in~cond; {467#true} is VALID [2020-07-08 23:35:02,010 INFO L280 TraceCheckUtils]: 1: Hoare triple {467#true} assume !(0 == ~cond); {467#true} is VALID [2020-07-08 23:35:02,010 INFO L280 TraceCheckUtils]: 2: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-08 23:35:02,013 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {467#true} {475#(<= 1 ~N~0)} #99#return; {475#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:02,019 INFO L263 TraceCheckUtils]: 0: Hoare triple {467#true} call ULTIMATE.init(); {481#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:35:02,019 INFO L280 TraceCheckUtils]: 1: Hoare triple {481#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {467#true} is VALID [2020-07-08 23:35:02,020 INFO L280 TraceCheckUtils]: 2: Hoare triple {467#true} #valid := #valid[0 := 0]; {467#true} is VALID [2020-07-08 23:35:02,020 INFO L280 TraceCheckUtils]: 3: Hoare triple {467#true} assume 0 < #StackHeapBarrier; {467#true} is VALID [2020-07-08 23:35:02,021 INFO L280 TraceCheckUtils]: 4: Hoare triple {467#true} ~N~0 := 0; {467#true} is VALID [2020-07-08 23:35:02,021 INFO L280 TraceCheckUtils]: 5: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-08 23:35:02,021 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {467#true} {467#true} #103#return; {467#true} is VALID [2020-07-08 23:35:02,022 INFO L263 TraceCheckUtils]: 7: Hoare triple {467#true} call #t~ret7 := main(); {467#true} is VALID [2020-07-08 23:35:02,022 INFO L280 TraceCheckUtils]: 8: Hoare triple {467#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {467#true} is VALID [2020-07-08 23:35:02,022 INFO L280 TraceCheckUtils]: 9: Hoare triple {467#true} ~N~0 := #t~nondet0; {467#true} is VALID [2020-07-08 23:35:02,023 INFO L280 TraceCheckUtils]: 10: Hoare triple {467#true} havoc #t~nondet0; {467#true} is VALID [2020-07-08 23:35:02,024 INFO L280 TraceCheckUtils]: 11: Hoare triple {467#true} assume !(~N~0 <= 0); {475#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:02,025 INFO L263 TraceCheckUtils]: 12: Hoare triple {475#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {467#true} is VALID [2020-07-08 23:35:02,025 INFO L280 TraceCheckUtils]: 13: Hoare triple {467#true} ~cond := #in~cond; {467#true} is VALID [2020-07-08 23:35:02,026 INFO L280 TraceCheckUtils]: 14: Hoare triple {467#true} assume !(0 == ~cond); {467#true} is VALID [2020-07-08 23:35:02,026 INFO L280 TraceCheckUtils]: 15: Hoare triple {467#true} assume true; {467#true} is VALID [2020-07-08 23:35:02,031 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {467#true} {475#(<= 1 ~N~0)} #99#return; {475#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:02,033 INFO L280 TraceCheckUtils]: 17: Hoare triple {475#(<= 1 ~N~0)} havoc ~i~0; {475#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:02,034 INFO L280 TraceCheckUtils]: 18: Hoare triple {475#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {475#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:02,035 INFO L280 TraceCheckUtils]: 19: Hoare triple {475#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {475#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:02,036 INFO L280 TraceCheckUtils]: 20: Hoare triple {475#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {475#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:02,037 INFO L280 TraceCheckUtils]: 21: Hoare triple {475#(<= 1 ~N~0)} ~i~0 := 0; {480#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-08 23:35:02,039 INFO L280 TraceCheckUtils]: 22: Hoare triple {480#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {468#false} is VALID [2020-07-08 23:35:02,039 INFO L280 TraceCheckUtils]: 23: Hoare triple {468#false} ~i~0 := 0; {468#false} is VALID [2020-07-08 23:35:02,040 INFO L280 TraceCheckUtils]: 24: Hoare triple {468#false} assume !(~i~0 < ~N~0); {468#false} is VALID [2020-07-08 23:35:02,040 INFO L280 TraceCheckUtils]: 25: Hoare triple {468#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {468#false} is VALID [2020-07-08 23:35:02,041 INFO L263 TraceCheckUtils]: 26: Hoare triple {468#false} call __VERIFIER_assert((if #t~mem6 <= 3 * ~N~0 then 1 else 0)); {468#false} is VALID [2020-07-08 23:35:02,042 INFO L280 TraceCheckUtils]: 27: Hoare triple {468#false} ~cond := #in~cond; {468#false} is VALID [2020-07-08 23:35:02,042 INFO L280 TraceCheckUtils]: 28: Hoare triple {468#false} assume 0 == ~cond; {468#false} is VALID [2020-07-08 23:35:02,043 INFO L280 TraceCheckUtils]: 29: Hoare triple {468#false} assume !false; {468#false} is VALID [2020-07-08 23:35:02,046 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-08 23:35:02,047 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [499830676] [2020-07-08 23:35:02,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:35:02,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 23:35:02,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530809970] [2020-07-08 23:35:02,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-08 23:35:02,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:35:02,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 23:35:02,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:02,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 23:35:02,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:35:02,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 23:35:02,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 23:35:02,132 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 5 states. [2020-07-08 23:35:02,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:02,735 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2020-07-08 23:35:02,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 23:35:02,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-08 23:35:02,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:35:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:35:02,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2020-07-08 23:35:02,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:35:02,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2020-07-08 23:35:02,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 91 transitions. [2020-07-08 23:35:02,918 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:02,922 INFO L225 Difference]: With dead ends: 81 [2020-07-08 23:35:02,922 INFO L226 Difference]: Without dead ends: 56 [2020-07-08 23:35:02,924 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-08 23:35:02,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-08 23:35:03,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2020-07-08 23:35:03,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:35:03,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 51 states. [2020-07-08 23:35:03,020 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 51 states. [2020-07-08 23:35:03,020 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 51 states. [2020-07-08 23:35:03,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:03,030 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2020-07-08 23:35:03,031 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-07-08 23:35:03,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:03,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:03,032 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 56 states. [2020-07-08 23:35:03,034 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 56 states. [2020-07-08 23:35:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:03,038 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2020-07-08 23:35:03,038 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-07-08 23:35:03,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:03,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:03,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:35:03,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:35:03,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-08 23:35:03,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2020-07-08 23:35:03,051 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 30 [2020-07-08 23:35:03,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:35:03,053 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2020-07-08 23:35:03,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 23:35:03,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 54 transitions. [2020-07-08 23:35:03,140 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:03,140 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-07-08 23:35:03,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-08 23:35:03,142 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:35:03,142 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-08 23:35:03,142 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:35:03,143 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:35:03,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:35:03,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1707000309, now seen corresponding path program 1 times [2020-07-08 23:35:03,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:35:03,144 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [987048343] [2020-07-08 23:35:03,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:35:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:03,369 INFO L280 TraceCheckUtils]: 0: Hoare triple {880#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {863#true} is VALID [2020-07-08 23:35:03,369 INFO L280 TraceCheckUtils]: 1: Hoare triple {863#true} #valid := #valid[0 := 0]; {863#true} is VALID [2020-07-08 23:35:03,370 INFO L280 TraceCheckUtils]: 2: Hoare triple {863#true} assume 0 < #StackHeapBarrier; {863#true} is VALID [2020-07-08 23:35:03,370 INFO L280 TraceCheckUtils]: 3: Hoare triple {863#true} ~N~0 := 0; {863#true} is VALID [2020-07-08 23:35:03,370 INFO L280 TraceCheckUtils]: 4: Hoare triple {863#true} assume true; {863#true} is VALID [2020-07-08 23:35:03,371 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {863#true} {863#true} #103#return; {863#true} is VALID [2020-07-08 23:35:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:03,386 INFO L280 TraceCheckUtils]: 0: Hoare triple {863#true} ~cond := #in~cond; {863#true} is VALID [2020-07-08 23:35:03,387 INFO L280 TraceCheckUtils]: 1: Hoare triple {863#true} assume !(0 == ~cond); {863#true} is VALID [2020-07-08 23:35:03,387 INFO L280 TraceCheckUtils]: 2: Hoare triple {863#true} assume true; {863#true} is VALID [2020-07-08 23:35:03,388 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {863#true} {871#(<= 1 ~N~0)} #99#return; {871#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,390 INFO L263 TraceCheckUtils]: 0: Hoare triple {863#true} call ULTIMATE.init(); {880#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:35:03,390 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {863#true} is VALID [2020-07-08 23:35:03,390 INFO L280 TraceCheckUtils]: 2: Hoare triple {863#true} #valid := #valid[0 := 0]; {863#true} is VALID [2020-07-08 23:35:03,391 INFO L280 TraceCheckUtils]: 3: Hoare triple {863#true} assume 0 < #StackHeapBarrier; {863#true} is VALID [2020-07-08 23:35:03,391 INFO L280 TraceCheckUtils]: 4: Hoare triple {863#true} ~N~0 := 0; {863#true} is VALID [2020-07-08 23:35:03,391 INFO L280 TraceCheckUtils]: 5: Hoare triple {863#true} assume true; {863#true} is VALID [2020-07-08 23:35:03,391 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {863#true} {863#true} #103#return; {863#true} is VALID [2020-07-08 23:35:03,392 INFO L263 TraceCheckUtils]: 7: Hoare triple {863#true} call #t~ret7 := main(); {863#true} is VALID [2020-07-08 23:35:03,392 INFO L280 TraceCheckUtils]: 8: Hoare triple {863#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {863#true} is VALID [2020-07-08 23:35:03,392 INFO L280 TraceCheckUtils]: 9: Hoare triple {863#true} ~N~0 := #t~nondet0; {863#true} is VALID [2020-07-08 23:35:03,393 INFO L280 TraceCheckUtils]: 10: Hoare triple {863#true} havoc #t~nondet0; {863#true} is VALID [2020-07-08 23:35:03,394 INFO L280 TraceCheckUtils]: 11: Hoare triple {863#true} assume !(~N~0 <= 0); {871#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,395 INFO L263 TraceCheckUtils]: 12: Hoare triple {871#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {863#true} is VALID [2020-07-08 23:35:03,395 INFO L280 TraceCheckUtils]: 13: Hoare triple {863#true} ~cond := #in~cond; {863#true} is VALID [2020-07-08 23:35:03,396 INFO L280 TraceCheckUtils]: 14: Hoare triple {863#true} assume !(0 == ~cond); {863#true} is VALID [2020-07-08 23:35:03,396 INFO L280 TraceCheckUtils]: 15: Hoare triple {863#true} assume true; {863#true} is VALID [2020-07-08 23:35:03,398 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {863#true} {871#(<= 1 ~N~0)} #99#return; {871#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,399 INFO L280 TraceCheckUtils]: 17: Hoare triple {871#(<= 1 ~N~0)} havoc ~i~0; {871#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,400 INFO L280 TraceCheckUtils]: 18: Hoare triple {871#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {871#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,401 INFO L280 TraceCheckUtils]: 19: Hoare triple {871#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {871#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,402 INFO L280 TraceCheckUtils]: 20: Hoare triple {871#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {871#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,404 INFO L280 TraceCheckUtils]: 21: Hoare triple {871#(<= 1 ~N~0)} ~i~0 := 0; {871#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,405 INFO L280 TraceCheckUtils]: 22: Hoare triple {871#(<= 1 ~N~0)} assume !!(~i~0 < ~N~0); {871#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,406 INFO L280 TraceCheckUtils]: 23: Hoare triple {871#(<= 1 ~N~0)} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 3 then ~i~0 % 3 - 3 else ~i~0 % 3); {871#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,407 INFO L280 TraceCheckUtils]: 24: Hoare triple {871#(<= 1 ~N~0)} SUMMARY for call write~int(3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L32 {871#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,407 INFO L280 TraceCheckUtils]: 25: Hoare triple {871#(<= 1 ~N~0)} #t~post2 := ~i~0; {871#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,408 INFO L280 TraceCheckUtils]: 26: Hoare triple {871#(<= 1 ~N~0)} ~i~0 := 1 + #t~post2; {871#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,409 INFO L280 TraceCheckUtils]: 27: Hoare triple {871#(<= 1 ~N~0)} havoc #t~post2; {871#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,410 INFO L280 TraceCheckUtils]: 28: Hoare triple {871#(<= 1 ~N~0)} assume !(~i~0 < ~N~0); {871#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,411 INFO L280 TraceCheckUtils]: 29: Hoare triple {871#(<= 1 ~N~0)} ~i~0 := 0; {871#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,412 INFO L280 TraceCheckUtils]: 30: Hoare triple {871#(<= 1 ~N~0)} assume !!(~i~0 < ~N~0); {871#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,413 INFO L280 TraceCheckUtils]: 31: Hoare triple {871#(<= 1 ~N~0)} assume 0 == ~i~0; {871#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,415 INFO L280 TraceCheckUtils]: 32: Hoare triple {871#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L41 {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-08 23:35:03,416 INFO L280 TraceCheckUtils]: 33: Hoare triple {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} #t~post3 := ~i~0; {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-08 23:35:03,417 INFO L280 TraceCheckUtils]: 34: Hoare triple {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} ~i~0 := 1 + #t~post3; {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-08 23:35:03,419 INFO L280 TraceCheckUtils]: 35: Hoare triple {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} havoc #t~post3; {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-08 23:35:03,421 INFO L280 TraceCheckUtils]: 36: Hoare triple {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} assume !(~i~0 < ~N~0); {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-08 23:35:03,422 INFO L280 TraceCheckUtils]: 37: Hoare triple {876#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {877#(and (= 0 |main_#t~mem6|) (<= 1 ~N~0))} is VALID [2020-07-08 23:35:03,425 INFO L263 TraceCheckUtils]: 38: Hoare triple {877#(and (= 0 |main_#t~mem6|) (<= 1 ~N~0))} call __VERIFIER_assert((if #t~mem6 <= 3 * ~N~0 then 1 else 0)); {878#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:35:03,426 INFO L280 TraceCheckUtils]: 39: Hoare triple {878#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {879#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:35:03,426 INFO L280 TraceCheckUtils]: 40: Hoare triple {879#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {864#false} is VALID [2020-07-08 23:35:03,427 INFO L280 TraceCheckUtils]: 41: Hoare triple {864#false} assume !false; {864#false} is VALID [2020-07-08 23:35:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 23:35:03,432 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [987048343] [2020-07-08 23:35:03,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:35:03,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 23:35:03,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303445091] [2020-07-08 23:35:03,434 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2020-07-08 23:35:03,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:35:03,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 23:35:03,492 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-08 23:35:03,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 23:35:03,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:35:03,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 23:35:03,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-08 23:35:03,494 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 8 states. [2020-07-08 23:35:04,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:04,334 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2020-07-08 23:35:04,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 23:35:04,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2020-07-08 23:35:04,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:35:04,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:35:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2020-07-08 23:35:04,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:35:04,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2020-07-08 23:35:04,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 66 transitions. [2020-07-08 23:35:04,440 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:04,444 INFO L225 Difference]: With dead ends: 66 [2020-07-08 23:35:04,445 INFO L226 Difference]: Without dead ends: 60 [2020-07-08 23:35:04,446 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-07-08 23:35:04,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-08 23:35:04,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2020-07-08 23:35:04,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:35:04,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 55 states. [2020-07-08 23:35:04,554 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 55 states. [2020-07-08 23:35:04,554 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 55 states. [2020-07-08 23:35:04,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:04,559 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-08 23:35:04,559 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-07-08 23:35:04,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:04,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:04,560 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 60 states. [2020-07-08 23:35:04,560 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 60 states. [2020-07-08 23:35:04,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:04,564 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-08 23:35:04,564 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-07-08 23:35:04,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:04,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:04,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:35:04,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:35:04,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-08 23:35:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2020-07-08 23:35:04,570 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 42 [2020-07-08 23:35:04,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:35:04,573 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2020-07-08 23:35:04,573 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 23:35:04,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 58 transitions. [2020-07-08 23:35:04,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:04,663 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-08 23:35:04,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-08 23:35:04,666 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:35:04,666 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:35:04,667 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:35:04,667 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:35:04,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:35:04,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1747495296, now seen corresponding path program 1 times [2020-07-08 23:35:04,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:35:04,668 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [448913934] [2020-07-08 23:35:04,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:35:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:04,911 INFO L280 TraceCheckUtils]: 0: Hoare triple {1273#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1254#true} is VALID [2020-07-08 23:35:04,911 INFO L280 TraceCheckUtils]: 1: Hoare triple {1254#true} #valid := #valid[0 := 0]; {1254#true} is VALID [2020-07-08 23:35:04,912 INFO L280 TraceCheckUtils]: 2: Hoare triple {1254#true} assume 0 < #StackHeapBarrier; {1254#true} is VALID [2020-07-08 23:35:04,912 INFO L280 TraceCheckUtils]: 3: Hoare triple {1254#true} ~N~0 := 0; {1254#true} is VALID [2020-07-08 23:35:04,912 INFO L280 TraceCheckUtils]: 4: Hoare triple {1254#true} assume true; {1254#true} is VALID [2020-07-08 23:35:04,912 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1254#true} {1254#true} #103#return; {1254#true} is VALID [2020-07-08 23:35:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:04,924 INFO L280 TraceCheckUtils]: 0: Hoare triple {1254#true} ~cond := #in~cond; {1254#true} is VALID [2020-07-08 23:35:04,924 INFO L280 TraceCheckUtils]: 1: Hoare triple {1254#true} assume !(0 == ~cond); {1254#true} is VALID [2020-07-08 23:35:04,925 INFO L280 TraceCheckUtils]: 2: Hoare triple {1254#true} assume true; {1254#true} is VALID [2020-07-08 23:35:04,925 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1254#true} {1254#true} #99#return; {1254#true} is VALID [2020-07-08 23:35:04,929 INFO L263 TraceCheckUtils]: 0: Hoare triple {1254#true} call ULTIMATE.init(); {1273#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:35:04,929 INFO L280 TraceCheckUtils]: 1: Hoare triple {1273#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1254#true} is VALID [2020-07-08 23:35:04,929 INFO L280 TraceCheckUtils]: 2: Hoare triple {1254#true} #valid := #valid[0 := 0]; {1254#true} is VALID [2020-07-08 23:35:04,930 INFO L280 TraceCheckUtils]: 3: Hoare triple {1254#true} assume 0 < #StackHeapBarrier; {1254#true} is VALID [2020-07-08 23:35:04,930 INFO L280 TraceCheckUtils]: 4: Hoare triple {1254#true} ~N~0 := 0; {1254#true} is VALID [2020-07-08 23:35:04,930 INFO L280 TraceCheckUtils]: 5: Hoare triple {1254#true} assume true; {1254#true} is VALID [2020-07-08 23:35:04,930 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1254#true} {1254#true} #103#return; {1254#true} is VALID [2020-07-08 23:35:04,931 INFO L263 TraceCheckUtils]: 7: Hoare triple {1254#true} call #t~ret7 := main(); {1254#true} is VALID [2020-07-08 23:35:04,931 INFO L280 TraceCheckUtils]: 8: Hoare triple {1254#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1254#true} is VALID [2020-07-08 23:35:04,931 INFO L280 TraceCheckUtils]: 9: Hoare triple {1254#true} ~N~0 := #t~nondet0; {1254#true} is VALID [2020-07-08 23:35:04,931 INFO L280 TraceCheckUtils]: 10: Hoare triple {1254#true} havoc #t~nondet0; {1254#true} is VALID [2020-07-08 23:35:04,932 INFO L280 TraceCheckUtils]: 11: Hoare triple {1254#true} assume !(~N~0 <= 0); {1254#true} is VALID [2020-07-08 23:35:04,932 INFO L263 TraceCheckUtils]: 12: Hoare triple {1254#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1254#true} is VALID [2020-07-08 23:35:04,932 INFO L280 TraceCheckUtils]: 13: Hoare triple {1254#true} ~cond := #in~cond; {1254#true} is VALID [2020-07-08 23:35:04,932 INFO L280 TraceCheckUtils]: 14: Hoare triple {1254#true} assume !(0 == ~cond); {1254#true} is VALID [2020-07-08 23:35:04,933 INFO L280 TraceCheckUtils]: 15: Hoare triple {1254#true} assume true; {1254#true} is VALID [2020-07-08 23:35:04,933 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1254#true} {1254#true} #99#return; {1254#true} is VALID [2020-07-08 23:35:04,933 INFO L280 TraceCheckUtils]: 17: Hoare triple {1254#true} havoc ~i~0; {1254#true} is VALID [2020-07-08 23:35:04,933 INFO L280 TraceCheckUtils]: 18: Hoare triple {1254#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {1254#true} is VALID [2020-07-08 23:35:04,934 INFO L280 TraceCheckUtils]: 19: Hoare triple {1254#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {1254#true} is VALID [2020-07-08 23:35:04,934 INFO L280 TraceCheckUtils]: 20: Hoare triple {1254#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {1254#true} is VALID [2020-07-08 23:35:04,936 INFO L280 TraceCheckUtils]: 21: Hoare triple {1254#true} ~i~0 := 0; {1266#(= 0 main_~i~0)} is VALID [2020-07-08 23:35:04,937 INFO L280 TraceCheckUtils]: 22: Hoare triple {1266#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0); {1266#(= 0 main_~i~0)} is VALID [2020-07-08 23:35:04,939 INFO L280 TraceCheckUtils]: 23: Hoare triple {1266#(= 0 main_~i~0)} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 3 then ~i~0 % 3 - 3 else ~i~0 % 3); {1266#(= 0 main_~i~0)} is VALID [2020-07-08 23:35:04,940 INFO L280 TraceCheckUtils]: 24: Hoare triple {1266#(= 0 main_~i~0)} SUMMARY for call write~int(3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L32 {1266#(= 0 main_~i~0)} is VALID [2020-07-08 23:35:04,943 INFO L280 TraceCheckUtils]: 25: Hoare triple {1266#(= 0 main_~i~0)} #t~post2 := ~i~0; {1267#(= |main_#t~post2| 0)} is VALID [2020-07-08 23:35:04,948 INFO L280 TraceCheckUtils]: 26: Hoare triple {1267#(= |main_#t~post2| 0)} ~i~0 := 1 + #t~post2; {1268#(<= main_~i~0 1)} is VALID [2020-07-08 23:35:04,950 INFO L280 TraceCheckUtils]: 27: Hoare triple {1268#(<= main_~i~0 1)} havoc #t~post2; {1268#(<= main_~i~0 1)} is VALID [2020-07-08 23:35:04,951 INFO L280 TraceCheckUtils]: 28: Hoare triple {1268#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {1269#(<= ~N~0 1)} is VALID [2020-07-08 23:35:04,951 INFO L280 TraceCheckUtils]: 29: Hoare triple {1269#(<= ~N~0 1)} ~i~0 := 0; {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-08 23:35:04,952 INFO L280 TraceCheckUtils]: 30: Hoare triple {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0); {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-08 23:35:04,953 INFO L280 TraceCheckUtils]: 31: Hoare triple {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} assume 0 == ~i~0; {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-08 23:35:04,954 INFO L280 TraceCheckUtils]: 32: Hoare triple {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L41 {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-08 23:35:04,957 INFO L280 TraceCheckUtils]: 33: Hoare triple {1270#(and (<= ~N~0 1) (= 0 main_~i~0))} #t~post3 := ~i~0; {1271#(and (= |main_#t~post3| 0) (<= ~N~0 1))} is VALID [2020-07-08 23:35:04,959 INFO L280 TraceCheckUtils]: 34: Hoare triple {1271#(and (= |main_#t~post3| 0) (<= ~N~0 1))} ~i~0 := 1 + #t~post3; {1272#(<= ~N~0 main_~i~0)} is VALID [2020-07-08 23:35:04,961 INFO L280 TraceCheckUtils]: 35: Hoare triple {1272#(<= ~N~0 main_~i~0)} havoc #t~post3; {1272#(<= ~N~0 main_~i~0)} is VALID [2020-07-08 23:35:04,962 INFO L280 TraceCheckUtils]: 36: Hoare triple {1272#(<= ~N~0 main_~i~0)} assume !!(~i~0 < ~N~0); {1255#false} is VALID [2020-07-08 23:35:04,963 INFO L280 TraceCheckUtils]: 37: Hoare triple {1255#false} assume !(0 == ~i~0); {1255#false} is VALID [2020-07-08 23:35:04,963 INFO L280 TraceCheckUtils]: 38: Hoare triple {1255#false} SUMMARY for call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L43 {1255#false} is VALID [2020-07-08 23:35:04,964 INFO L280 TraceCheckUtils]: 39: Hoare triple {1255#false} SUMMARY for call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L43-1 {1255#false} is VALID [2020-07-08 23:35:04,964 INFO L280 TraceCheckUtils]: 40: Hoare triple {1255#false} SUMMARY for call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L43-2 {1255#false} is VALID [2020-07-08 23:35:04,964 INFO L280 TraceCheckUtils]: 41: Hoare triple {1255#false} havoc #t~mem5; {1255#false} is VALID [2020-07-08 23:35:04,965 INFO L280 TraceCheckUtils]: 42: Hoare triple {1255#false} havoc #t~mem4; {1255#false} is VALID [2020-07-08 23:35:04,965 INFO L280 TraceCheckUtils]: 43: Hoare triple {1255#false} #t~post3 := ~i~0; {1255#false} is VALID [2020-07-08 23:35:04,965 INFO L280 TraceCheckUtils]: 44: Hoare triple {1255#false} ~i~0 := 1 + #t~post3; {1255#false} is VALID [2020-07-08 23:35:04,966 INFO L280 TraceCheckUtils]: 45: Hoare triple {1255#false} havoc #t~post3; {1255#false} is VALID [2020-07-08 23:35:04,966 INFO L280 TraceCheckUtils]: 46: Hoare triple {1255#false} assume !(~i~0 < ~N~0); {1255#false} is VALID [2020-07-08 23:35:04,966 INFO L280 TraceCheckUtils]: 47: Hoare triple {1255#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {1255#false} is VALID [2020-07-08 23:35:04,967 INFO L263 TraceCheckUtils]: 48: Hoare triple {1255#false} call __VERIFIER_assert((if #t~mem6 <= 3 * ~N~0 then 1 else 0)); {1255#false} is VALID [2020-07-08 23:35:04,967 INFO L280 TraceCheckUtils]: 49: Hoare triple {1255#false} ~cond := #in~cond; {1255#false} is VALID [2020-07-08 23:35:04,967 INFO L280 TraceCheckUtils]: 50: Hoare triple {1255#false} assume 0 == ~cond; {1255#false} is VALID [2020-07-08 23:35:04,968 INFO L280 TraceCheckUtils]: 51: Hoare triple {1255#false} assume !false; {1255#false} is VALID [2020-07-08 23:35:04,972 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:35:04,973 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [448913934] [2020-07-08 23:35:04,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:35:04,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-08 23:35:04,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673883396] [2020-07-08 23:35:04,974 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2020-07-08 23:35:04,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:35:04,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 23:35:05,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:05,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 23:35:05,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:35:05,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 23:35:05,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-08 23:35:05,066 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 10 states. [2020-07-08 23:35:05,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:05,992 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2020-07-08 23:35:05,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-08 23:35:05,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2020-07-08 23:35:05,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:35:05,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 23:35:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 94 transitions. [2020-07-08 23:35:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 23:35:06,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 94 transitions. [2020-07-08 23:35:06,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 94 transitions. [2020-07-08 23:35:06,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:06,127 INFO L225 Difference]: With dead ends: 94 [2020-07-08 23:35:06,127 INFO L226 Difference]: Without dead ends: 65 [2020-07-08 23:35:06,129 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2020-07-08 23:35:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-08 23:35:06,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2020-07-08 23:35:06,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:35:06,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 60 states. [2020-07-08 23:35:06,257 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 60 states. [2020-07-08 23:35:06,257 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 60 states. [2020-07-08 23:35:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:06,262 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-07-08 23:35:06,263 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-07-08 23:35:06,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:06,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:06,264 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 65 states. [2020-07-08 23:35:06,265 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 65 states. [2020-07-08 23:35:06,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:06,269 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-07-08 23:35:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-07-08 23:35:06,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:06,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:06,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:35:06,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:35:06,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-08 23:35:06,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2020-07-08 23:35:06,276 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 52 [2020-07-08 23:35:06,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:35:06,277 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2020-07-08 23:35:06,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 23:35:06,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states and 63 transitions. [2020-07-08 23:35:06,392 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-08 23:35:06,393 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2020-07-08 23:35:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-08 23:35:06,395 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:35:06,396 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:35:06,396 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 23:35:06,396 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:35:06,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:35:06,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1872706551, now seen corresponding path program 2 times [2020-07-08 23:35:06,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:35:06,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [980499238] [2020-07-08 23:35:06,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:35:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:06,697 INFO L280 TraceCheckUtils]: 0: Hoare triple {1741#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1726#true} is VALID [2020-07-08 23:35:06,697 INFO L280 TraceCheckUtils]: 1: Hoare triple {1726#true} #valid := #valid[0 := 0]; {1726#true} is VALID [2020-07-08 23:35:06,698 INFO L280 TraceCheckUtils]: 2: Hoare triple {1726#true} assume 0 < #StackHeapBarrier; {1726#true} is VALID [2020-07-08 23:35:06,698 INFO L280 TraceCheckUtils]: 3: Hoare triple {1726#true} ~N~0 := 0; {1726#true} is VALID [2020-07-08 23:35:06,698 INFO L280 TraceCheckUtils]: 4: Hoare triple {1726#true} assume true; {1726#true} is VALID [2020-07-08 23:35:06,698 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1726#true} {1726#true} #103#return; {1726#true} is VALID [2020-07-08 23:35:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:06,708 INFO L280 TraceCheckUtils]: 0: Hoare triple {1726#true} ~cond := #in~cond; {1726#true} is VALID [2020-07-08 23:35:06,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {1726#true} assume !(0 == ~cond); {1726#true} is VALID [2020-07-08 23:35:06,708 INFO L280 TraceCheckUtils]: 2: Hoare triple {1726#true} assume true; {1726#true} is VALID [2020-07-08 23:35:06,709 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1726#true} {1726#true} #99#return; {1726#true} is VALID [2020-07-08 23:35:06,711 INFO L263 TraceCheckUtils]: 0: Hoare triple {1726#true} call ULTIMATE.init(); {1741#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:35:06,712 INFO L280 TraceCheckUtils]: 1: Hoare triple {1741#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1726#true} is VALID [2020-07-08 23:35:06,712 INFO L280 TraceCheckUtils]: 2: Hoare triple {1726#true} #valid := #valid[0 := 0]; {1726#true} is VALID [2020-07-08 23:35:06,713 INFO L280 TraceCheckUtils]: 3: Hoare triple {1726#true} assume 0 < #StackHeapBarrier; {1726#true} is VALID [2020-07-08 23:35:06,713 INFO L280 TraceCheckUtils]: 4: Hoare triple {1726#true} ~N~0 := 0; {1726#true} is VALID [2020-07-08 23:35:06,713 INFO L280 TraceCheckUtils]: 5: Hoare triple {1726#true} assume true; {1726#true} is VALID [2020-07-08 23:35:06,714 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1726#true} {1726#true} #103#return; {1726#true} is VALID [2020-07-08 23:35:06,714 INFO L263 TraceCheckUtils]: 7: Hoare triple {1726#true} call #t~ret7 := main(); {1726#true} is VALID [2020-07-08 23:35:06,714 INFO L280 TraceCheckUtils]: 8: Hoare triple {1726#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1726#true} is VALID [2020-07-08 23:35:06,715 INFO L280 TraceCheckUtils]: 9: Hoare triple {1726#true} ~N~0 := #t~nondet0; {1726#true} is VALID [2020-07-08 23:35:06,715 INFO L280 TraceCheckUtils]: 10: Hoare triple {1726#true} havoc #t~nondet0; {1726#true} is VALID [2020-07-08 23:35:06,715 INFO L280 TraceCheckUtils]: 11: Hoare triple {1726#true} assume !(~N~0 <= 0); {1726#true} is VALID [2020-07-08 23:35:06,715 INFO L263 TraceCheckUtils]: 12: Hoare triple {1726#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1726#true} is VALID [2020-07-08 23:35:06,716 INFO L280 TraceCheckUtils]: 13: Hoare triple {1726#true} ~cond := #in~cond; {1726#true} is VALID [2020-07-08 23:35:06,716 INFO L280 TraceCheckUtils]: 14: Hoare triple {1726#true} assume !(0 == ~cond); {1726#true} is VALID [2020-07-08 23:35:06,716 INFO L280 TraceCheckUtils]: 15: Hoare triple {1726#true} assume true; {1726#true} is VALID [2020-07-08 23:35:06,716 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1726#true} {1726#true} #99#return; {1726#true} is VALID [2020-07-08 23:35:06,717 INFO L280 TraceCheckUtils]: 17: Hoare triple {1726#true} havoc ~i~0; {1726#true} is VALID [2020-07-08 23:35:06,717 INFO L280 TraceCheckUtils]: 18: Hoare triple {1726#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {1726#true} is VALID [2020-07-08 23:35:06,717 INFO L280 TraceCheckUtils]: 19: Hoare triple {1726#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {1726#true} is VALID [2020-07-08 23:35:06,717 INFO L280 TraceCheckUtils]: 20: Hoare triple {1726#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {1726#true} is VALID [2020-07-08 23:35:06,719 INFO L280 TraceCheckUtils]: 21: Hoare triple {1726#true} ~i~0 := 0; {1738#(= 0 main_~i~0)} is VALID [2020-07-08 23:35:06,721 INFO L280 TraceCheckUtils]: 22: Hoare triple {1738#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0); {1738#(= 0 main_~i~0)} is VALID [2020-07-08 23:35:06,723 INFO L280 TraceCheckUtils]: 23: Hoare triple {1738#(= 0 main_~i~0)} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 3 then ~i~0 % 3 - 3 else ~i~0 % 3); {1738#(= 0 main_~i~0)} is VALID [2020-07-08 23:35:06,725 INFO L280 TraceCheckUtils]: 24: Hoare triple {1738#(= 0 main_~i~0)} SUMMARY for call write~int(3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L32 {1738#(= 0 main_~i~0)} is VALID [2020-07-08 23:35:06,727 INFO L280 TraceCheckUtils]: 25: Hoare triple {1738#(= 0 main_~i~0)} #t~post2 := ~i~0; {1739#(= |main_#t~post2| 0)} is VALID [2020-07-08 23:35:06,729 INFO L280 TraceCheckUtils]: 26: Hoare triple {1739#(= |main_#t~post2| 0)} ~i~0 := 1 + #t~post2; {1740#(not (= main_~i~0 (* 3 (div main_~i~0 3))))} is VALID [2020-07-08 23:35:06,731 INFO L280 TraceCheckUtils]: 27: Hoare triple {1740#(not (= main_~i~0 (* 3 (div main_~i~0 3))))} havoc #t~post2; {1740#(not (= main_~i~0 (* 3 (div main_~i~0 3))))} is VALID [2020-07-08 23:35:06,733 INFO L280 TraceCheckUtils]: 28: Hoare triple {1740#(not (= main_~i~0 (* 3 (div main_~i~0 3))))} assume !!(~i~0 < ~N~0); {1740#(not (= main_~i~0 (* 3 (div main_~i~0 3))))} is VALID [2020-07-08 23:35:06,736 INFO L280 TraceCheckUtils]: 29: Hoare triple {1740#(not (= main_~i~0 (* 3 (div main_~i~0 3))))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 3 then ~i~0 % 3 - 3 else ~i~0 % 3); {1727#false} is VALID [2020-07-08 23:35:06,736 INFO L280 TraceCheckUtils]: 30: Hoare triple {1727#false} SUMMARY for call write~int(3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L32 {1727#false} is VALID [2020-07-08 23:35:06,737 INFO L280 TraceCheckUtils]: 31: Hoare triple {1727#false} #t~post2 := ~i~0; {1727#false} is VALID [2020-07-08 23:35:06,737 INFO L280 TraceCheckUtils]: 32: Hoare triple {1727#false} ~i~0 := 1 + #t~post2; {1727#false} is VALID [2020-07-08 23:35:06,737 INFO L280 TraceCheckUtils]: 33: Hoare triple {1727#false} havoc #t~post2; {1727#false} is VALID [2020-07-08 23:35:06,738 INFO L280 TraceCheckUtils]: 34: Hoare triple {1727#false} assume !(~i~0 < ~N~0); {1727#false} is VALID [2020-07-08 23:35:06,738 INFO L280 TraceCheckUtils]: 35: Hoare triple {1727#false} ~i~0 := 0; {1727#false} is VALID [2020-07-08 23:35:06,738 INFO L280 TraceCheckUtils]: 36: Hoare triple {1727#false} assume !!(~i~0 < ~N~0); {1727#false} is VALID [2020-07-08 23:35:06,739 INFO L280 TraceCheckUtils]: 37: Hoare triple {1727#false} assume 0 == ~i~0; {1727#false} is VALID [2020-07-08 23:35:06,739 INFO L280 TraceCheckUtils]: 38: Hoare triple {1727#false} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L41 {1727#false} is VALID [2020-07-08 23:35:06,739 INFO L280 TraceCheckUtils]: 39: Hoare triple {1727#false} #t~post3 := ~i~0; {1727#false} is VALID [2020-07-08 23:35:06,739 INFO L280 TraceCheckUtils]: 40: Hoare triple {1727#false} ~i~0 := 1 + #t~post3; {1727#false} is VALID [2020-07-08 23:35:06,740 INFO L280 TraceCheckUtils]: 41: Hoare triple {1727#false} havoc #t~post3; {1727#false} is VALID [2020-07-08 23:35:06,740 INFO L280 TraceCheckUtils]: 42: Hoare triple {1727#false} assume !!(~i~0 < ~N~0); {1727#false} is VALID [2020-07-08 23:35:06,740 INFO L280 TraceCheckUtils]: 43: Hoare triple {1727#false} assume !(0 == ~i~0); {1727#false} is VALID [2020-07-08 23:35:06,740 INFO L280 TraceCheckUtils]: 44: Hoare triple {1727#false} SUMMARY for call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L43 {1727#false} is VALID [2020-07-08 23:35:06,741 INFO L280 TraceCheckUtils]: 45: Hoare triple {1727#false} SUMMARY for call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L43-1 {1727#false} is VALID [2020-07-08 23:35:06,741 INFO L280 TraceCheckUtils]: 46: Hoare triple {1727#false} SUMMARY for call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L43-2 {1727#false} is VALID [2020-07-08 23:35:06,741 INFO L280 TraceCheckUtils]: 47: Hoare triple {1727#false} havoc #t~mem5; {1727#false} is VALID [2020-07-08 23:35:06,742 INFO L280 TraceCheckUtils]: 48: Hoare triple {1727#false} havoc #t~mem4; {1727#false} is VALID [2020-07-08 23:35:06,742 INFO L280 TraceCheckUtils]: 49: Hoare triple {1727#false} #t~post3 := ~i~0; {1727#false} is VALID [2020-07-08 23:35:06,742 INFO L280 TraceCheckUtils]: 50: Hoare triple {1727#false} ~i~0 := 1 + #t~post3; {1727#false} is VALID [2020-07-08 23:35:06,742 INFO L280 TraceCheckUtils]: 51: Hoare triple {1727#false} havoc #t~post3; {1727#false} is VALID [2020-07-08 23:35:06,743 INFO L280 TraceCheckUtils]: 52: Hoare triple {1727#false} assume !(~i~0 < ~N~0); {1727#false} is VALID [2020-07-08 23:35:06,743 INFO L280 TraceCheckUtils]: 53: Hoare triple {1727#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-6 {1727#false} is VALID [2020-07-08 23:35:06,743 INFO L263 TraceCheckUtils]: 54: Hoare triple {1727#false} call __VERIFIER_assert((if #t~mem6 <= 3 * ~N~0 then 1 else 0)); {1727#false} is VALID [2020-07-08 23:35:06,743 INFO L280 TraceCheckUtils]: 55: Hoare triple {1727#false} ~cond := #in~cond; {1727#false} is VALID [2020-07-08 23:35:06,744 INFO L280 TraceCheckUtils]: 56: Hoare triple {1727#false} assume 0 == ~cond; {1727#false} is VALID [2020-07-08 23:35:06,744 INFO L280 TraceCheckUtils]: 57: Hoare triple {1727#false} assume !false; {1727#false} is VALID [2020-07-08 23:35:06,748 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 23:35:06,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [980499238] [2020-07-08 23:35:06,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:35:06,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-08 23:35:06,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884814908] [2020-07-08 23:35:06,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2020-07-08 23:35:06,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:35:06,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 23:35:06,814 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:06,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 23:35:06,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:35:06,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 23:35:06,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 23:35:06,815 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 6 states. [2020-07-08 23:35:07,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:07,435 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2020-07-08 23:35:07,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 23:35:07,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2020-07-08 23:35:07,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:35:07,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 23:35:07,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2020-07-08 23:35:07,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 23:35:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2020-07-08 23:35:07,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 93 transitions. [2020-07-08 23:35:07,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:07,563 INFO L225 Difference]: With dead ends: 94 [2020-07-08 23:35:07,564 INFO L226 Difference]: Without dead ends: 63 [2020-07-08 23:35:07,565 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-08 23:35:07,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-08 23:35:07,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2020-07-08 23:35:07,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:35:07,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 61 states. [2020-07-08 23:35:07,697 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 61 states. [2020-07-08 23:35:07,697 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 61 states. [2020-07-08 23:35:07,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:07,700 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2020-07-08 23:35:07,700 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2020-07-08 23:35:07,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:07,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:07,701 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 63 states. [2020-07-08 23:35:07,701 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 63 states. [2020-07-08 23:35:07,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:07,704 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2020-07-08 23:35:07,705 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2020-07-08 23:35:07,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:07,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:07,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:35:07,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:35:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-08 23:35:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2020-07-08 23:35:07,709 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 58 [2020-07-08 23:35:07,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:35:07,709 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2020-07-08 23:35:07,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 23:35:07,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states and 64 transitions. [2020-07-08 23:35:07,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:07,823 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2020-07-08 23:35:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-08 23:35:07,824 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:35:07,824 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:35:07,825 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 23:35:07,825 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:35:07,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:35:07,825 INFO L82 PathProgramCache]: Analyzing trace with hash -557611095, now seen corresponding path program 1 times [2020-07-08 23:35:07,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:35:07,826 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1682894858] [2020-07-08 23:35:07,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:35:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:35:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:35:08,019 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-08 23:35:08,020 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 23:35:08,020 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 23:35:08,091 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 23:35:08,091 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:35:08,091 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:35:08,092 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 23:35:08,092 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 23:35:08,092 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 23:35:08,092 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:35:08,092 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:35:08,092 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:35:08,093 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 23:35:08,093 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 23:35:08,093 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 23:35:08,093 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 23:35:08,096 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 23:35:08,097 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-08 23:35:08,097 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 23:35:08,097 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-08 23:35:08,097 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-08 23:35:08,097 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-08 23:35:08,097 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 23:35:08,097 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 23:35:08,098 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 23:35:08,098 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 23:35:08,098 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-08 23:35:08,098 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 23:35:08,098 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 23:35:08,098 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 23:35:08,098 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 23:35:08,098 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 23:35:08,099 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-08 23:35:08,099 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 23:35:08,099 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 23:35:08,099 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2020-07-08 23:35:08,103 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 23:35:08,104 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-08 23:35:08,104 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 23:35:08,104 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-08 23:35:08,104 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-08 23:35:08,104 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 23:35:08,104 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-08 23:35:08,105 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-08 23:35:08,105 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-08 23:35:08,105 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-08 23:35:08,105 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2020-07-08 23:35:08,105 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2020-07-08 23:35:08,105 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2020-07-08 23:35:08,106 WARN L170 areAnnotationChecker]: L29-6 has no Hoare annotation [2020-07-08 23:35:08,106 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-08 23:35:08,106 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-08 23:35:08,107 WARN L170 areAnnotationChecker]: L38-5 has no Hoare annotation [2020-07-08 23:35:08,107 WARN L170 areAnnotationChecker]: L38-5 has no Hoare annotation [2020-07-08 23:35:08,107 WARN L170 areAnnotationChecker]: L38-5 has no Hoare annotation [2020-07-08 23:35:08,108 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-08 23:35:08,108 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-08 23:35:08,108 WARN L170 areAnnotationChecker]: L38-6 has no Hoare annotation [2020-07-08 23:35:08,108 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-08 23:35:08,108 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-08 23:35:08,109 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-08 23:35:08,109 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-08 23:35:08,109 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-08 23:35:08,109 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-08 23:35:08,109 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-08 23:35:08,109 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-08 23:35:08,110 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-08 23:35:08,110 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2020-07-08 23:35:08,110 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2020-07-08 23:35:08,110 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-08 23:35:08,110 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2020-07-08 23:35:08,110 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2020-07-08 23:35:08,110 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2020-07-08 23:35:08,111 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2020-07-08 23:35:08,111 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 23:35:08,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:35:08 BoogieIcfgContainer [2020-07-08 23:35:08,127 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 23:35:08,132 INFO L168 Benchmark]: Toolchain (without parser) took 9355.13 ms. Allocated memory was 142.6 MB in the beginning and 323.5 MB in the end (delta: 180.9 MB). Free memory was 99.6 MB in the beginning and 295.4 MB in the end (delta: -195.7 MB). Peak memory consumption was 166.7 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:08,134 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 142.6 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 23:35:08,144 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.88 ms. Allocated memory is still 142.6 MB. Free memory was 99.4 MB in the beginning and 88.4 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:08,149 INFO L168 Benchmark]: Boogie Preprocessor took 179.63 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 88.4 MB in the beginning and 177.7 MB in the end (delta: -89.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:08,150 INFO L168 Benchmark]: RCFGBuilder took 647.77 ms. Allocated memory is still 200.3 MB. Free memory was 177.7 MB in the beginning and 149.6 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:08,151 INFO L168 Benchmark]: TraceAbstraction took 8125.18 ms. Allocated memory was 200.3 MB in the beginning and 323.5 MB in the end (delta: 123.2 MB). Free memory was 149.6 MB in the beginning and 295.4 MB in the end (delta: -145.8 MB). Peak memory consumption was 158.9 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:08,163 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.43 ms. Allocated memory is still 142.6 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 395.88 ms. Allocated memory is still 142.6 MB. Free memory was 99.4 MB in the beginning and 88.4 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 179.63 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 88.4 MB in the beginning and 177.7 MB in the end (delta: -89.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 647.77 ms. Allocated memory is still 200.3 MB. Free memory was 177.7 MB in the beginning and 149.6 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8125.18 ms. Allocated memory was 200.3 MB in the beginning and 323.5 MB in the end (delta: 123.2 MB). Free memory was 149.6 MB in the beginning and 295.4 MB in the end (delta: -145.8 MB). Peak memory consumption was 158.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=32, N=0] [L21] N = __VERIFIER_nondet_int() VAL [\old(N)=0, __VERIFIER_nondet_int()=2, N=2] [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=2] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=2] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=2] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=2] [L25] int i; VAL [\old(N)=0, N=2] [L26] long long sum[1]; VAL [\old(N)=0, N=2, sum={2:0}] [L27] int *a = malloc(sizeof(int)*N); VAL [\old(N)=0, a={-1:0}, malloc(sizeof(int)*N)={-1:0}, N=2, sum={2:0}] [L29] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=2, sum={2:0}] [L29] COND TRUE i