/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/s3iff.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 23:36:01,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:36:01,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:36:01,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:36:01,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:36:01,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:36:01,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:36:01,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:36:01,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:36:01,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:36:01,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:36:01,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:36:01,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:36:01,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:36:01,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:36:01,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:36:01,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:36:01,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:36:01,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:36:01,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:36:01,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:36:01,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:36:01,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:36:01,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:36:01,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:36:01,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:36:01,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:36:01,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:36:01,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:36:01,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:36:01,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:36:01,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:36:01,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:36:01,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:36:01,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:36:01,337 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:36:01,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:36:01,340 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:36:01,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:36:01,341 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:36:01,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:36:01,344 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:36:01,369 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:36:01,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:36:01,374 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:36:01,374 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:36:01,374 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:36:01,375 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:36:01,375 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:36:01,375 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:36:01,375 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:36:01,375 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:36:01,377 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:36:01,377 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:36:01,377 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:36:01,377 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:36:01,378 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:36:01,378 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:36:01,379 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:36:01,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:36:01,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:36:01,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:36:01,380 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:36:01,380 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:36:01,380 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:36:01,727 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:36:01,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:36:01,753 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:36:01,755 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:36:01,756 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:36:01,757 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s3iff.c [2020-07-08 23:36:01,859 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e64ae4e36/953dd85fb11a446080537de5aa4403bf/FLAGa3ce34f6c [2020-07-08 23:36:02,407 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:36:02,408 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s3iff.c [2020-07-08 23:36:02,418 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e64ae4e36/953dd85fb11a446080537de5aa4403bf/FLAGa3ce34f6c [2020-07-08 23:36:02,750 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e64ae4e36/953dd85fb11a446080537de5aa4403bf [2020-07-08 23:36:02,765 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:36:02,768 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:36:02,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:36:02,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:36:02,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:36:02,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:36:02" (1/1) ... [2020-07-08 23:36:02,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3be51f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:02, skipping insertion in model container [2020-07-08 23:36:02,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:36:02" (1/1) ... [2020-07-08 23:36:02,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:36:02,816 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:36:03,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:36:03,071 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:36:03,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:36:03,119 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:36:03,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:03 WrapperNode [2020-07-08 23:36:03,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:36:03,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:36:03,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:36:03,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:36:03,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:03" (1/1) ... [2020-07-08 23:36:03,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:03" (1/1) ... [2020-07-08 23:36:03,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:03" (1/1) ... [2020-07-08 23:36:03,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:03" (1/1) ... [2020-07-08 23:36:03,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:03" (1/1) ... [2020-07-08 23:36:03,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:03" (1/1) ... [2020-07-08 23:36:03,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:03" (1/1) ... [2020-07-08 23:36:03,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:36:03,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:36:03,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:36:03,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:36:03,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:03" (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:36:03,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:36:03,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:36:03,365 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 23:36:03,366 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 23:36:03,366 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:36:03,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:36:03,366 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 23:36:03,366 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 23:36:03,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 23:36:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 23:36:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 23:36:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:36:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 23:36:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 23:36:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 23:36:03,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 23:36:03,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 23:36:03,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:36:03,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:36:03,916 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:36:03,916 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-08 23:36:03,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:36:03 BoogieIcfgContainer [2020-07-08 23:36:03,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:36:03,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:36:03,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:36:03,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:36:03,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:36:02" (1/3) ... [2020-07-08 23:36:03,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b4ce5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:36:03, skipping insertion in model container [2020-07-08 23:36:03,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:03" (2/3) ... [2020-07-08 23:36:03,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b4ce5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:36:03, skipping insertion in model container [2020-07-08 23:36:03,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:36:03" (3/3) ... [2020-07-08 23:36:03,943 INFO L109 eAbstractionObserver]: Analyzing ICFG s3iff.c [2020-07-08 23:36:03,953 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:36:03,962 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:36:03,977 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:36:04,003 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:36:04,003 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:36:04,003 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:36:04,003 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:36:04,006 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:36:04,006 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:36:04,006 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:36:04,007 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:36:04,024 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2020-07-08 23:36:04,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 23:36:04,038 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:04,040 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] [2020-07-08 23:36:04,040 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:04,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:04,047 INFO L82 PathProgramCache]: Analyzing trace with hash 171473808, now seen corresponding path program 1 times [2020-07-08 23:36:04,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:04,056 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1166974012] [2020-07-08 23:36:04,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:04,339 INFO L280 TraceCheckUtils]: 0: Hoare triple {80#(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; {68#true} is VALID [2020-07-08 23:36:04,340 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#true} #valid := #valid[0 := 0]; {68#true} is VALID [2020-07-08 23:36:04,341 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} assume 0 < #StackHeapBarrier; {68#true} is VALID [2020-07-08 23:36:04,341 INFO L280 TraceCheckUtils]: 3: Hoare triple {68#true} ~N~0 := 0; {68#true} is VALID [2020-07-08 23:36:04,342 INFO L280 TraceCheckUtils]: 4: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-08 23:36:04,342 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {68#true} {68#true} #105#return; {68#true} is VALID [2020-07-08 23:36:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:04,356 INFO L280 TraceCheckUtils]: 0: Hoare triple {68#true} ~cond := #in~cond; {68#true} is VALID [2020-07-08 23:36:04,357 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#true} assume !(0 == ~cond); {68#true} is VALID [2020-07-08 23:36:04,358 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-08 23:36:04,358 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {68#true} {68#true} #101#return; {68#true} is VALID [2020-07-08 23:36:04,361 INFO L263 TraceCheckUtils]: 0: Hoare triple {68#true} call ULTIMATE.init(); {80#(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:36:04,361 INFO L280 TraceCheckUtils]: 1: Hoare triple {80#(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; {68#true} is VALID [2020-07-08 23:36:04,362 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} #valid := #valid[0 := 0]; {68#true} is VALID [2020-07-08 23:36:04,362 INFO L280 TraceCheckUtils]: 3: Hoare triple {68#true} assume 0 < #StackHeapBarrier; {68#true} is VALID [2020-07-08 23:36:04,363 INFO L280 TraceCheckUtils]: 4: Hoare triple {68#true} ~N~0 := 0; {68#true} is VALID [2020-07-08 23:36:04,363 INFO L280 TraceCheckUtils]: 5: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-08 23:36:04,363 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {68#true} {68#true} #105#return; {68#true} is VALID [2020-07-08 23:36:04,364 INFO L263 TraceCheckUtils]: 7: Hoare triple {68#true} call #t~ret10 := main(); {68#true} is VALID [2020-07-08 23:36:04,364 INFO L280 TraceCheckUtils]: 8: Hoare triple {68#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {68#true} is VALID [2020-07-08 23:36:04,365 INFO L280 TraceCheckUtils]: 9: Hoare triple {68#true} ~N~0 := #t~nondet0; {68#true} is VALID [2020-07-08 23:36:04,365 INFO L280 TraceCheckUtils]: 10: Hoare triple {68#true} havoc #t~nondet0; {68#true} is VALID [2020-07-08 23:36:04,366 INFO L280 TraceCheckUtils]: 11: Hoare triple {68#true} assume !(~N~0 <= 0); {68#true} is VALID [2020-07-08 23:36:04,366 INFO L263 TraceCheckUtils]: 12: Hoare triple {68#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {68#true} is VALID [2020-07-08 23:36:04,367 INFO L280 TraceCheckUtils]: 13: Hoare triple {68#true} ~cond := #in~cond; {68#true} is VALID [2020-07-08 23:36:04,367 INFO L280 TraceCheckUtils]: 14: Hoare triple {68#true} assume !(0 == ~cond); {68#true} is VALID [2020-07-08 23:36:04,368 INFO L280 TraceCheckUtils]: 15: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-08 23:36:04,368 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {68#true} {68#true} #101#return; {68#true} is VALID [2020-07-08 23:36:04,368 INFO L280 TraceCheckUtils]: 17: Hoare triple {68#true} havoc ~i~0; {68#true} is VALID [2020-07-08 23:36:04,369 INFO L280 TraceCheckUtils]: 18: Hoare triple {68#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {68#true} is VALID [2020-07-08 23:36:04,369 INFO L280 TraceCheckUtils]: 19: Hoare triple {68#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {68#true} is VALID [2020-07-08 23:36:04,370 INFO L280 TraceCheckUtils]: 20: Hoare triple {68#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {68#true} is VALID [2020-07-08 23:36:04,370 INFO L280 TraceCheckUtils]: 21: Hoare triple {68#true} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {68#true} is VALID [2020-07-08 23:36:04,371 INFO L280 TraceCheckUtils]: 22: Hoare triple {68#true} ~i~0 := 0; {68#true} is VALID [2020-07-08 23:36:04,372 INFO L280 TraceCheckUtils]: 23: Hoare triple {68#true} assume !true; {69#false} is VALID [2020-07-08 23:36:04,373 INFO L280 TraceCheckUtils]: 24: Hoare triple {69#false} ~i~0 := 0; {69#false} is VALID [2020-07-08 23:36:04,373 INFO L280 TraceCheckUtils]: 25: Hoare triple {69#false} assume !true; {69#false} is VALID [2020-07-08 23:36:04,373 INFO L280 TraceCheckUtils]: 26: Hoare triple {69#false} SUMMARY for call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L35-6 {69#false} is VALID [2020-07-08 23:36:04,374 INFO L263 TraceCheckUtils]: 27: Hoare triple {69#false} call __VERIFIER_assert((if #t~mem9 == 4 * ~N~0 then 1 else 0)); {69#false} is VALID [2020-07-08 23:36:04,374 INFO L280 TraceCheckUtils]: 28: Hoare triple {69#false} ~cond := #in~cond; {69#false} is VALID [2020-07-08 23:36:04,375 INFO L280 TraceCheckUtils]: 29: Hoare triple {69#false} assume 0 == ~cond; {69#false} is VALID [2020-07-08 23:36:04,375 INFO L280 TraceCheckUtils]: 30: Hoare triple {69#false} assume !false; {69#false} is VALID [2020-07-08 23:36:04,381 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:36:04,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1166974012] [2020-07-08 23:36:04,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:36:04,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 23:36:04,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388881108] [2020-07-08 23:36:04,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-08 23:36:04,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:36:04,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 23:36:04,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:04,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 23:36:04,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:36:04,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 23:36:04,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 23:36:04,498 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2020-07-08 23:36:05,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:05,012 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2020-07-08 23:36:05,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 23:36:05,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-08 23:36:05,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:36:05,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:36:05,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-08 23:36:05,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:36:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-08 23:36:05,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2020-07-08 23:36:05,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:05,285 INFO L225 Difference]: With dead ends: 113 [2020-07-08 23:36:05,286 INFO L226 Difference]: Without dead ends: 53 [2020-07-08 23:36:05,292 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 23:36:05,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-08 23:36:05,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-07-08 23:36:05,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:36:05,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2020-07-08 23:36:05,401 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-08 23:36:05,401 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-08 23:36:05,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:05,409 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-07-08 23:36:05,409 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-08 23:36:05,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:05,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:05,411 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-08 23:36:05,411 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-08 23:36:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:05,417 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-07-08 23:36:05,417 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-08 23:36:05,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:05,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:05,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:36:05,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:36:05,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-08 23:36:05,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2020-07-08 23:36:05,426 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 31 [2020-07-08 23:36:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:36:05,427 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2020-07-08 23:36:05,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 23:36:05,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 55 transitions. [2020-07-08 23:36:05,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-08 23:36:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 23:36:05,510 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:05,510 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] [2020-07-08 23:36:05,510 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:36:05,511 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:05,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:05,512 INFO L82 PathProgramCache]: Analyzing trace with hash 921692051, now seen corresponding path program 1 times [2020-07-08 23:36:05,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:05,512 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1661684706] [2020-07-08 23:36:05,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:05,701 INFO L280 TraceCheckUtils]: 0: Hoare triple {535#(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; {521#true} is VALID [2020-07-08 23:36:05,702 INFO L280 TraceCheckUtils]: 1: Hoare triple {521#true} #valid := #valid[0 := 0]; {521#true} is VALID [2020-07-08 23:36:05,703 INFO L280 TraceCheckUtils]: 2: Hoare triple {521#true} assume 0 < #StackHeapBarrier; {521#true} is VALID [2020-07-08 23:36:05,703 INFO L280 TraceCheckUtils]: 3: Hoare triple {521#true} ~N~0 := 0; {521#true} is VALID [2020-07-08 23:36:05,703 INFO L280 TraceCheckUtils]: 4: Hoare triple {521#true} assume true; {521#true} is VALID [2020-07-08 23:36:05,704 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {521#true} {521#true} #105#return; {521#true} is VALID [2020-07-08 23:36:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:05,718 INFO L280 TraceCheckUtils]: 0: Hoare triple {521#true} ~cond := #in~cond; {521#true} is VALID [2020-07-08 23:36:05,718 INFO L280 TraceCheckUtils]: 1: Hoare triple {521#true} assume !(0 == ~cond); {521#true} is VALID [2020-07-08 23:36:05,719 INFO L280 TraceCheckUtils]: 2: Hoare triple {521#true} assume true; {521#true} is VALID [2020-07-08 23:36:05,720 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {521#true} {529#(<= 1 ~N~0)} #101#return; {529#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:05,722 INFO L263 TraceCheckUtils]: 0: Hoare triple {521#true} call ULTIMATE.init(); {535#(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:36:05,722 INFO L280 TraceCheckUtils]: 1: Hoare triple {535#(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; {521#true} is VALID [2020-07-08 23:36:05,723 INFO L280 TraceCheckUtils]: 2: Hoare triple {521#true} #valid := #valid[0 := 0]; {521#true} is VALID [2020-07-08 23:36:05,723 INFO L280 TraceCheckUtils]: 3: Hoare triple {521#true} assume 0 < #StackHeapBarrier; {521#true} is VALID [2020-07-08 23:36:05,723 INFO L280 TraceCheckUtils]: 4: Hoare triple {521#true} ~N~0 := 0; {521#true} is VALID [2020-07-08 23:36:05,724 INFO L280 TraceCheckUtils]: 5: Hoare triple {521#true} assume true; {521#true} is VALID [2020-07-08 23:36:05,724 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {521#true} {521#true} #105#return; {521#true} is VALID [2020-07-08 23:36:05,725 INFO L263 TraceCheckUtils]: 7: Hoare triple {521#true} call #t~ret10 := main(); {521#true} is VALID [2020-07-08 23:36:05,725 INFO L280 TraceCheckUtils]: 8: Hoare triple {521#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {521#true} is VALID [2020-07-08 23:36:05,725 INFO L280 TraceCheckUtils]: 9: Hoare triple {521#true} ~N~0 := #t~nondet0; {521#true} is VALID [2020-07-08 23:36:05,726 INFO L280 TraceCheckUtils]: 10: Hoare triple {521#true} havoc #t~nondet0; {521#true} is VALID [2020-07-08 23:36:05,727 INFO L280 TraceCheckUtils]: 11: Hoare triple {521#true} assume !(~N~0 <= 0); {529#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:05,728 INFO L263 TraceCheckUtils]: 12: Hoare triple {529#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {521#true} is VALID [2020-07-08 23:36:05,728 INFO L280 TraceCheckUtils]: 13: Hoare triple {521#true} ~cond := #in~cond; {521#true} is VALID [2020-07-08 23:36:05,728 INFO L280 TraceCheckUtils]: 14: Hoare triple {521#true} assume !(0 == ~cond); {521#true} is VALID [2020-07-08 23:36:05,729 INFO L280 TraceCheckUtils]: 15: Hoare triple {521#true} assume true; {521#true} is VALID [2020-07-08 23:36:05,730 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {521#true} {529#(<= 1 ~N~0)} #101#return; {529#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:05,731 INFO L280 TraceCheckUtils]: 17: Hoare triple {529#(<= 1 ~N~0)} havoc ~i~0; {529#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:05,733 INFO L280 TraceCheckUtils]: 18: Hoare triple {529#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {529#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:05,734 INFO L280 TraceCheckUtils]: 19: Hoare triple {529#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {529#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:05,735 INFO L280 TraceCheckUtils]: 20: Hoare triple {529#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {529#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:05,737 INFO L280 TraceCheckUtils]: 21: Hoare triple {529#(<= 1 ~N~0)} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {529#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:05,738 INFO L280 TraceCheckUtils]: 22: Hoare triple {529#(<= 1 ~N~0)} ~i~0 := 0; {534#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-08 23:36:05,740 INFO L280 TraceCheckUtils]: 23: Hoare triple {534#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {522#false} is VALID [2020-07-08 23:36:05,741 INFO L280 TraceCheckUtils]: 24: Hoare triple {522#false} ~i~0 := 0; {522#false} is VALID [2020-07-08 23:36:05,741 INFO L280 TraceCheckUtils]: 25: Hoare triple {522#false} assume !(~i~0 < ~N~0); {522#false} is VALID [2020-07-08 23:36:05,742 INFO L280 TraceCheckUtils]: 26: Hoare triple {522#false} SUMMARY for call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L35-6 {522#false} is VALID [2020-07-08 23:36:05,742 INFO L263 TraceCheckUtils]: 27: Hoare triple {522#false} call __VERIFIER_assert((if #t~mem9 == 4 * ~N~0 then 1 else 0)); {522#false} is VALID [2020-07-08 23:36:05,743 INFO L280 TraceCheckUtils]: 28: Hoare triple {522#false} ~cond := #in~cond; {522#false} is VALID [2020-07-08 23:36:05,743 INFO L280 TraceCheckUtils]: 29: Hoare triple {522#false} assume 0 == ~cond; {522#false} is VALID [2020-07-08 23:36:05,744 INFO L280 TraceCheckUtils]: 30: Hoare triple {522#false} assume !false; {522#false} is VALID [2020-07-08 23:36:05,746 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:36:05,747 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1661684706] [2020-07-08 23:36:05,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:36:05,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 23:36:05,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492493861] [2020-07-08 23:36:05,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-07-08 23:36:05,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:36:05,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 23:36:05,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:05,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 23:36:05,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:36:05,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 23:36:05,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 23:36:05,804 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 5 states. [2020-07-08 23:36:06,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:06,435 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2020-07-08 23:36:06,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 23:36:06,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-07-08 23:36:06,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:36:06,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:36:06,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2020-07-08 23:36:06,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:36:06,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2020-07-08 23:36:06,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 105 transitions. [2020-07-08 23:36:06,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:06,590 INFO L225 Difference]: With dead ends: 99 [2020-07-08 23:36:06,591 INFO L226 Difference]: Without dead ends: 74 [2020-07-08 23:36:06,592 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:36:06,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-08 23:36:06,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2020-07-08 23:36:06,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:36:06,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 55 states. [2020-07-08 23:36:06,694 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 55 states. [2020-07-08 23:36:06,694 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 55 states. [2020-07-08 23:36:06,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:06,698 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2020-07-08 23:36:06,699 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-07-08 23:36:06,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:06,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:06,700 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 74 states. [2020-07-08 23:36:06,700 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 74 states. [2020-07-08 23:36:06,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:06,705 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2020-07-08 23:36:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-07-08 23:36:06,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:06,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:06,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:36:06,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:36:06,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-08 23:36:06,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2020-07-08 23:36:06,711 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 31 [2020-07-08 23:36:06,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:36:06,712 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2020-07-08 23:36:06,712 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 23:36:06,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 57 transitions. [2020-07-08 23:36:06,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:06,798 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-07-08 23:36:06,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-08 23:36:06,800 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:06,800 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, 1, 1, 1, 1, 1, 1] [2020-07-08 23:36:06,800 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:36:06,801 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:06,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:06,801 INFO L82 PathProgramCache]: Analyzing trace with hash -827220298, now seen corresponding path program 1 times [2020-07-08 23:36:06,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:06,802 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1201126966] [2020-07-08 23:36:06,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:07,968 INFO L280 TraceCheckUtils]: 0: Hoare triple {1026#(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; {997#true} is VALID [2020-07-08 23:36:07,969 INFO L280 TraceCheckUtils]: 1: Hoare triple {997#true} #valid := #valid[0 := 0]; {997#true} is VALID [2020-07-08 23:36:07,969 INFO L280 TraceCheckUtils]: 2: Hoare triple {997#true} assume 0 < #StackHeapBarrier; {997#true} is VALID [2020-07-08 23:36:07,969 INFO L280 TraceCheckUtils]: 3: Hoare triple {997#true} ~N~0 := 0; {997#true} is VALID [2020-07-08 23:36:07,970 INFO L280 TraceCheckUtils]: 4: Hoare triple {997#true} assume true; {997#true} is VALID [2020-07-08 23:36:07,974 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {997#true} {997#true} #105#return; {997#true} is VALID [2020-07-08 23:36:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:07,989 INFO L280 TraceCheckUtils]: 0: Hoare triple {997#true} ~cond := #in~cond; {997#true} is VALID [2020-07-08 23:36:07,989 INFO L280 TraceCheckUtils]: 1: Hoare triple {997#true} assume !(0 == ~cond); {997#true} is VALID [2020-07-08 23:36:07,990 INFO L280 TraceCheckUtils]: 2: Hoare triple {997#true} assume true; {997#true} is VALID [2020-07-08 23:36:07,991 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {997#true} {1005#(<= 1 ~N~0)} #101#return; {1005#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:07,992 INFO L263 TraceCheckUtils]: 0: Hoare triple {997#true} call ULTIMATE.init(); {1026#(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:36:07,993 INFO L280 TraceCheckUtils]: 1: Hoare triple {1026#(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; {997#true} is VALID [2020-07-08 23:36:07,993 INFO L280 TraceCheckUtils]: 2: Hoare triple {997#true} #valid := #valid[0 := 0]; {997#true} is VALID [2020-07-08 23:36:07,993 INFO L280 TraceCheckUtils]: 3: Hoare triple {997#true} assume 0 < #StackHeapBarrier; {997#true} is VALID [2020-07-08 23:36:07,994 INFO L280 TraceCheckUtils]: 4: Hoare triple {997#true} ~N~0 := 0; {997#true} is VALID [2020-07-08 23:36:07,994 INFO L280 TraceCheckUtils]: 5: Hoare triple {997#true} assume true; {997#true} is VALID [2020-07-08 23:36:07,994 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {997#true} {997#true} #105#return; {997#true} is VALID [2020-07-08 23:36:07,995 INFO L263 TraceCheckUtils]: 7: Hoare triple {997#true} call #t~ret10 := main(); {997#true} is VALID [2020-07-08 23:36:07,995 INFO L280 TraceCheckUtils]: 8: Hoare triple {997#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {997#true} is VALID [2020-07-08 23:36:07,995 INFO L280 TraceCheckUtils]: 9: Hoare triple {997#true} ~N~0 := #t~nondet0; {997#true} is VALID [2020-07-08 23:36:07,996 INFO L280 TraceCheckUtils]: 10: Hoare triple {997#true} havoc #t~nondet0; {997#true} is VALID [2020-07-08 23:36:07,997 INFO L280 TraceCheckUtils]: 11: Hoare triple {997#true} assume !(~N~0 <= 0); {1005#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:07,998 INFO L263 TraceCheckUtils]: 12: Hoare triple {1005#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {997#true} is VALID [2020-07-08 23:36:07,998 INFO L280 TraceCheckUtils]: 13: Hoare triple {997#true} ~cond := #in~cond; {997#true} is VALID [2020-07-08 23:36:07,999 INFO L280 TraceCheckUtils]: 14: Hoare triple {997#true} assume !(0 == ~cond); {997#true} is VALID [2020-07-08 23:36:07,999 INFO L280 TraceCheckUtils]: 15: Hoare triple {997#true} assume true; {997#true} is VALID [2020-07-08 23:36:08,000 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {997#true} {1005#(<= 1 ~N~0)} #101#return; {1005#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:08,001 INFO L280 TraceCheckUtils]: 17: Hoare triple {1005#(<= 1 ~N~0)} havoc ~i~0; {1005#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:08,003 INFO L280 TraceCheckUtils]: 18: Hoare triple {1005#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {1010#(and (or (< 536870911 ~N~0) (not (= 0 (select |#valid| |main_~#sum~0.base|)))) (<= 1 ~N~0))} is VALID [2020-07-08 23:36:08,005 INFO L280 TraceCheckUtils]: 19: Hoare triple {1010#(and (or (< 536870911 ~N~0) (not (= 0 (select |#valid| |main_~#sum~0.base|)))) (<= 1 ~N~0))} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {1011#(and (or (< 536870911 ~N~0) (not (= |main_#t~malloc1.base| |main_~#sum~0.base|))) (<= 1 ~N~0))} is VALID [2020-07-08 23:36:08,006 INFO L280 TraceCheckUtils]: 20: Hoare triple {1011#(and (or (< 536870911 ~N~0) (not (= |main_#t~malloc1.base| |main_~#sum~0.base|))) (<= 1 ~N~0))} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {1012#(and (<= 1 ~N~0) (or (<= 536870912 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} is VALID [2020-07-08 23:36:08,008 INFO L280 TraceCheckUtils]: 21: Hoare triple {1012#(and (<= 1 ~N~0) (or (<= 536870912 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {1013#(and (or (= main_~a~0.base |main_~#sum~0.base|) (and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))) (or (<= 536870912 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} is VALID [2020-07-08 23:36:08,010 INFO L280 TraceCheckUtils]: 22: Hoare triple {1013#(and (or (= main_~a~0.base |main_~#sum~0.base|) (and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))) (or (<= 536870912 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} ~i~0 := 0; {1014#(and (or (= main_~a~0.base |main_~#sum~0.base|) (and (= 1 (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 3)) |main_~#sum~0.base|) |main_~#sum~0.offset|)) (<= 1 ~N~0))) (= 0 main_~i~0) (or (<= 536870912 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} is VALID [2020-07-08 23:36:08,012 INFO L280 TraceCheckUtils]: 23: Hoare triple {1014#(and (or (= main_~a~0.base |main_~#sum~0.base|) (and (= 1 (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 3)) |main_~#sum~0.base|) |main_~#sum~0.offset|)) (<= 1 ~N~0))) (= 0 main_~i~0) (or (<= 536870912 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} assume !!(~i~0 < ~N~0); {1014#(and (or (= main_~a~0.base |main_~#sum~0.base|) (and (= 1 (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 3)) |main_~#sum~0.base|) |main_~#sum~0.offset|)) (<= 1 ~N~0))) (= 0 main_~i~0) (or (<= 536870912 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} is VALID [2020-07-08 23:36:08,015 INFO L280 TraceCheckUtils]: 24: Hoare triple {1014#(and (or (= main_~a~0.base |main_~#sum~0.base|) (and (= 1 (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 3)) |main_~#sum~0.base|) |main_~#sum~0.offset|)) (<= 1 ~N~0))) (= 0 main_~i~0) (or (<= 536870912 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} SUMMARY for call write~int(3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L32 {1014#(and (or (= main_~a~0.base |main_~#sum~0.base|) (and (= 1 (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 3)) |main_~#sum~0.base|) |main_~#sum~0.offset|)) (<= 1 ~N~0))) (= 0 main_~i~0) (or (<= 536870912 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} is VALID [2020-07-08 23:36:08,017 INFO L280 TraceCheckUtils]: 25: Hoare triple {1014#(and (or (= main_~a~0.base |main_~#sum~0.base|) (and (= 1 (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 3)) |main_~#sum~0.base|) |main_~#sum~0.offset|)) (<= 1 ~N~0))) (= 0 main_~i~0) (or (<= 536870912 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} #t~post2 := ~i~0; {1015#(and (or (= main_~a~0.base |main_~#sum~0.base|) (and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))) (= |main_#t~post2| 0) (or (<= 536870912 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} is VALID [2020-07-08 23:36:08,019 INFO L280 TraceCheckUtils]: 26: Hoare triple {1015#(and (or (= main_~a~0.base |main_~#sum~0.base|) (and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))) (= |main_#t~post2| 0) (or (<= 536870912 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} ~i~0 := 1 + #t~post2; {1016#(and (or (and (<= (+ main_~i~0 536870911) ~N~0) (< 536870911 ~N~0)) (not (= main_~a~0.base |main_~#sum~0.base|))) (or (= main_~a~0.base |main_~#sum~0.base|) (and (<= 1 ~N~0) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))))} is VALID [2020-07-08 23:36:08,020 INFO L280 TraceCheckUtils]: 27: Hoare triple {1016#(and (or (and (<= (+ main_~i~0 536870911) ~N~0) (< 536870911 ~N~0)) (not (= main_~a~0.base |main_~#sum~0.base|))) (or (= main_~a~0.base |main_~#sum~0.base|) (and (<= 1 ~N~0) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))))} havoc #t~post2; {1016#(and (or (and (<= (+ main_~i~0 536870911) ~N~0) (< 536870911 ~N~0)) (not (= main_~a~0.base |main_~#sum~0.base|))) (or (= main_~a~0.base |main_~#sum~0.base|) (and (<= 1 ~N~0) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))))} is VALID [2020-07-08 23:36:08,022 INFO L280 TraceCheckUtils]: 28: Hoare triple {1016#(and (or (and (<= (+ main_~i~0 536870911) ~N~0) (< 536870911 ~N~0)) (not (= main_~a~0.base |main_~#sum~0.base|))) (or (= main_~a~0.base |main_~#sum~0.base|) (and (<= 1 ~N~0) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))))} assume !(~i~0 < ~N~0); {1017#(and (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-08 23:36:08,024 INFO L280 TraceCheckUtils]: 29: Hoare triple {1017#(and (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} ~i~0 := 0; {1017#(and (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-08 23:36:08,026 INFO L280 TraceCheckUtils]: 30: Hoare triple {1017#(and (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} assume !!(~i~0 < ~N~0); {1017#(and (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-08 23:36:08,028 INFO L280 TraceCheckUtils]: 31: Hoare triple {1017#(and (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} SUMMARY for call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L37 {1018#(and (= |main_#t~mem4| (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-08 23:36:08,030 INFO L280 TraceCheckUtils]: 32: Hoare triple {1018#(and (= |main_#t~mem4| (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} assume 3 == #t~mem4; {1019#(and (<= ~N~0 1) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-08 23:36:08,032 INFO L280 TraceCheckUtils]: 33: Hoare triple {1019#(and (<= ~N~0 1) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} havoc #t~mem4; {1019#(and (<= ~N~0 1) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-08 23:36:08,034 INFO L280 TraceCheckUtils]: 34: Hoare triple {1019#(and (<= ~N~0 1) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} SUMMARY for call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38 {1020#(and (= 1 |main_#t~mem5|) (<= ~N~0 1) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} is VALID [2020-07-08 23:36:08,036 INFO L280 TraceCheckUtils]: 35: Hoare triple {1020#(and (= 1 |main_#t~mem5|) (<= ~N~0 1) (= 3 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} SUMMARY for call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L38-1 {1021#(and (= 3 |main_#t~mem6|) (= 1 |main_#t~mem5|) (= (* 4 ~N~0) (+ |main_#t~mem6| |main_#t~mem5|)))} is VALID [2020-07-08 23:36:08,039 INFO L280 TraceCheckUtils]: 36: Hoare triple {1021#(and (= 3 |main_#t~mem6|) (= 1 |main_#t~mem5|) (= (* 4 ~N~0) (+ |main_#t~mem6| |main_#t~mem5|)))} SUMMARY for call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-2 {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 4 ~N~0))} is VALID [2020-07-08 23:36:08,041 INFO L280 TraceCheckUtils]: 37: Hoare triple {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 4 ~N~0))} havoc #t~mem6; {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 4 ~N~0))} is VALID [2020-07-08 23:36:08,044 INFO L280 TraceCheckUtils]: 38: Hoare triple {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 4 ~N~0))} havoc #t~mem5; {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 4 ~N~0))} is VALID [2020-07-08 23:36:08,046 INFO L280 TraceCheckUtils]: 39: Hoare triple {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 4 ~N~0))} #t~post3 := ~i~0; {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 4 ~N~0))} is VALID [2020-07-08 23:36:08,047 INFO L280 TraceCheckUtils]: 40: Hoare triple {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 4 ~N~0))} ~i~0 := 1 + #t~post3; {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 4 ~N~0))} is VALID [2020-07-08 23:36:08,048 INFO L280 TraceCheckUtils]: 41: Hoare triple {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 4 ~N~0))} havoc #t~post3; {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 4 ~N~0))} is VALID [2020-07-08 23:36:08,049 INFO L280 TraceCheckUtils]: 42: Hoare triple {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 4 ~N~0))} assume !(~i~0 < ~N~0); {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 4 ~N~0))} is VALID [2020-07-08 23:36:08,051 INFO L280 TraceCheckUtils]: 43: Hoare triple {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 4 ~N~0))} SUMMARY for call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L35-6 {1023#(= (* 4 ~N~0) |main_#t~mem9|)} is VALID [2020-07-08 23:36:08,052 INFO L263 TraceCheckUtils]: 44: Hoare triple {1023#(= (* 4 ~N~0) |main_#t~mem9|)} call __VERIFIER_assert((if #t~mem9 == 4 * ~N~0 then 1 else 0)); {1024#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:36:08,053 INFO L280 TraceCheckUtils]: 45: Hoare triple {1024#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1025#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:36:08,054 INFO L280 TraceCheckUtils]: 46: Hoare triple {1025#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {998#false} is VALID [2020-07-08 23:36:08,055 INFO L280 TraceCheckUtils]: 47: Hoare triple {998#false} assume !false; {998#false} is VALID [2020-07-08 23:36:08,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:36:08,069 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1201126966] [2020-07-08 23:36:08,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:36:08,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-07-08 23:36:08,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900433854] [2020-07-08 23:36:08,071 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2020-07-08 23:36:08,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:36:08,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-08 23:36:08,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:08,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-08 23:36:08,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:36:08,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-08 23:36:08,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2020-07-08 23:36:08,152 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 20 states. [2020-07-08 23:36:12,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:12,389 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2020-07-08 23:36:12,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-08 23:36:12,390 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2020-07-08 23:36:12,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:36:12,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-08 23:36:12,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 113 transitions. [2020-07-08 23:36:12,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-08 23:36:12,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 113 transitions. [2020-07-08 23:36:12,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 113 transitions. [2020-07-08 23:36:12,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:12,639 INFO L225 Difference]: With dead ends: 107 [2020-07-08 23:36:12,640 INFO L226 Difference]: Without dead ends: 101 [2020-07-08 23:36:12,641 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=330, Invalid=1310, Unknown=0, NotChecked=0, Total=1640 [2020-07-08 23:36:12,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-08 23:36:12,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 73. [2020-07-08 23:36:12,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:36:12,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 73 states. [2020-07-08 23:36:12,901 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 73 states. [2020-07-08 23:36:12,902 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 73 states. [2020-07-08 23:36:12,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:12,907 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2020-07-08 23:36:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2020-07-08 23:36:12,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:12,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:12,909 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 101 states. [2020-07-08 23:36:12,910 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 101 states. [2020-07-08 23:36:12,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:12,915 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2020-07-08 23:36:12,915 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2020-07-08 23:36:12,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:12,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:12,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:36:12,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:36:12,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-08 23:36:12,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2020-07-08 23:36:12,921 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 48 [2020-07-08 23:36:12,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:36:12,921 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2020-07-08 23:36:12,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-08 23:36:12,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 73 states and 77 transitions. [2020-07-08 23:36:13,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:13,098 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2020-07-08 23:36:13,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-08 23:36:13,100 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:13,101 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, 1, 1, 1, 1, 1, 1] [2020-07-08 23:36:13,101 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:36:13,101 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:13,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:13,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1272927570, now seen corresponding path program 1 times [2020-07-08 23:36:13,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:13,103 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1229393056] [2020-07-08 23:36:13,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:13,123 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 23:36:13,123 WARN L168 FreeRefinementEngine]: Strategy FIXED_PREFERENCES was unsuccessful and could not determine trace feasibility [2020-07-08 23:36:13,123 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 23:36:13,130 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 23:36:13,148 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 23:36:13,148 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:36:13,149 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:36:13,149 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 23:36:13,149 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 23:36:13,149 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 23:36:13,149 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:36:13,149 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:36:13,149 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:36:13,149 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 23:36:13,149 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 23:36:13,150 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 23:36:13,150 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 23:36:13,150 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 23:36:13,150 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-08 23:36:13,150 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 23:36:13,150 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-08 23:36:13,150 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-08 23:36:13,150 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-08 23:36:13,151 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 23:36:13,151 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 23:36:13,151 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 23:36:13,151 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 23:36:13,151 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-08 23:36:13,151 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 23:36:13,151 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 23:36:13,151 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 23:36:13,151 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 23:36:13,151 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 23:36:13,151 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-08 23:36:13,151 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 23:36:13,152 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 23:36:13,152 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-08 23:36:13,152 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 23:36:13,152 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-08 23:36:13,152 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 23:36:13,152 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-08 23:36:13,152 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-08 23:36:13,152 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 23:36:13,152 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-08 23:36:13,152 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-08 23:36:13,153 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-08 23:36:13,153 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-08 23:36:13,153 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-08 23:36:13,153 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-08 23:36:13,153 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-08 23:36:13,153 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-08 23:36:13,153 WARN L170 areAnnotationChecker]: L30-5 has no Hoare annotation [2020-07-08 23:36:13,153 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-08 23:36:13,153 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-08 23:36:13,153 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-08 23:36:13,153 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-08 23:36:13,153 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-08 23:36:13,154 WARN L170 areAnnotationChecker]: L35-6 has no Hoare annotation [2020-07-08 23:36:13,154 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-08 23:36:13,154 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-08 23:36:13,154 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-08 23:36:13,154 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-08 23:36:13,154 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-08 23:36:13,154 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-08 23:36:13,155 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 23:36:13,155 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-08 23:36:13,155 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-08 23:36:13,155 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-08 23:36:13,155 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-08 23:36:13,155 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-08 23:36:13,155 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-08 23:36:13,155 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-08 23:36:13,156 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-08 23:36:13,156 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-08 23:36:13,156 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-08 23:36:13,156 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2020-07-08 23:36:13,156 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-08 23:36:13,156 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-08 23:36:13,156 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-08 23:36:13,156 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-08 23:36:13,157 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:36:13,160 WARN L231 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-07-08 23:36:13,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:36:13 BoogieIcfgContainer [2020-07-08 23:36:13,161 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 23:36:13,166 INFO L168 Benchmark]: Toolchain (without parser) took 10397.34 ms. Allocated memory was 145.8 MB in the beginning and 305.7 MB in the end (delta: 159.9 MB). Free memory was 104.0 MB in the beginning and 125.1 MB in the end (delta: -21.2 MB). Peak memory consumption was 138.8 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:13,167 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 145.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 23:36:13,168 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.94 ms. Allocated memory is still 145.8 MB. Free memory was 103.8 MB in the beginning and 92.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:13,169 INFO L168 Benchmark]: Boogie Preprocessor took 163.65 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 92.7 MB in the beginning and 179.7 MB in the end (delta: -87.0 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:13,170 INFO L168 Benchmark]: RCFGBuilder took 645.74 ms. Allocated memory is still 202.4 MB. Free memory was 179.7 MB in the beginning and 150.9 MB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:13,171 INFO L168 Benchmark]: TraceAbstraction took 9228.21 ms. Allocated memory was 202.4 MB in the beginning and 305.7 MB in the end (delta: 103.3 MB). Free memory was 150.2 MB in the beginning and 125.1 MB in the end (delta: 25.1 MB). Peak memory consumption was 128.4 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:13,175 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.35 ms. Allocated memory is still 145.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 350.94 ms. Allocated memory is still 145.8 MB. Free memory was 103.8 MB in the beginning and 92.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 163.65 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 92.7 MB in the beginning and 179.7 MB in the end (delta: -87.0 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 645.74 ms. Allocated memory is still 202.4 MB. Free memory was 179.7 MB in the beginning and 150.9 MB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9228.21 ms. Allocated memory was 202.4 MB in the beginning and 305.7 MB in the end (delta: 103.3 MB). Free memory was 150.2 MB in the beginning and 125.1 MB in the end (delta: 25.1 MB). Peak memory consumption was 128.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 13]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L17] int N; [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) [L11] COND FALSE !(!cond) [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) [L25] int i; [L26] long long sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L29] sum[0] = 1 [L30] i=0 [L30] COND TRUE i