/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/condaf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:26:03,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:26:03,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:26:03,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:26:03,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:26:03,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:26:03,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:26:03,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:26:03,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:26:03,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:26:03,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:26:03,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:26:03,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:26:03,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:26:03,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:26:03,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:26:03,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:26:03,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:26:03,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:26:03,398 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:26:03,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:26:03,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:26:03,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:26:03,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:26:03,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:26:03,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:26:03,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:26:03,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:26:03,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:26:03,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:26:03,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:26:03,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:26:03,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:26:03,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:26:03,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:26:03,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:26:03,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:26:03,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:26:03,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:26:03,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:26:03,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:26:03,414 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:26:03,428 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:26:03,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:26:03,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:26:03,430 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:26:03,430 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:26:03,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:26:03,430 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:26:03,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:26:03,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:26:03,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:26:03,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:26:03,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:26:03,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:26:03,432 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:26:03,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:26:03,432 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:26:03,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:26:03,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:26:03,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:26:03,433 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:26:03,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:26:03,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:03,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:26:03,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:26:03,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:26:03,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:26:03,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:26:03,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:26:03,435 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:26:03,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:26:03,716 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:26:03,730 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:26:03,733 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:26:03,734 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:26:03,735 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:26:03,735 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/condaf.c [2020-07-10 15:26:03,814 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2d167dee/aa49c048baa5469dbb9f3d392b1304bc/FLAG0d0443cd8 [2020-07-10 15:26:04,262 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:26:04,263 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condaf.c [2020-07-10 15:26:04,269 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2d167dee/aa49c048baa5469dbb9f3d392b1304bc/FLAG0d0443cd8 [2020-07-10 15:26:04,640 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2d167dee/aa49c048baa5469dbb9f3d392b1304bc [2020-07-10 15:26:04,648 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:26:04,650 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:26:04,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:04,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:26:04,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:26:04,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:04" (1/1) ... [2020-07-10 15:26:04,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41be3f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:04, skipping insertion in model container [2020-07-10 15:26:04,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:04" (1/1) ... [2020-07-10 15:26:04,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:26:04,687 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:26:04,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:04,908 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:26:04,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:04,977 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:26:04,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:04 WrapperNode [2020-07-10 15:26:04,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:04,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:26:04,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:26:04,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:26:05,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:04" (1/1) ... [2020-07-10 15:26:05,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:04" (1/1) ... [2020-07-10 15:26:05,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:04" (1/1) ... [2020-07-10 15:26:05,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:04" (1/1) ... [2020-07-10 15:26:05,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:04" (1/1) ... [2020-07-10 15:26:05,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:04" (1/1) ... [2020-07-10 15:26:05,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:04" (1/1) ... [2020-07-10 15:26:05,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:26:05,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:26:05,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:26:05,214 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:26:05,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:04" (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-10 15:26:05,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:26:05,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:26:05,295 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:26:05,295 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:26:05,296 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:26:05,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:26:05,296 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:26:05,296 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:26:05,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:26:05,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:26:05,296 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:26:05,297 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:26:05,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:26:05,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:26:05,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:26:05,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:26:05,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:26:05,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:26:05,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:26:05,705 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:26:05,705 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 15:26:05,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:05 BoogieIcfgContainer [2020-07-10 15:26:05,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:26:05,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:26:05,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:26:05,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:26:05,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:26:04" (1/3) ... [2020-07-10 15:26:05,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a0b8e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:05, skipping insertion in model container [2020-07-10 15:26:05,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:04" (2/3) ... [2020-07-10 15:26:05,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a0b8e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:05, skipping insertion in model container [2020-07-10 15:26:05,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:05" (3/3) ... [2020-07-10 15:26:05,717 INFO L109 eAbstractionObserver]: Analyzing ICFG condaf.c [2020-07-10 15:26:05,727 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:26:05,734 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:26:05,747 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:26:05,767 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:26:05,767 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:26:05,767 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:26:05,767 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:26:05,768 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:26:05,768 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:26:05,768 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:26:05,768 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:26:05,784 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-10 15:26:05,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:26:05,791 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:05,792 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] [2020-07-10 15:26:05,792 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:05,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:05,797 INFO L82 PathProgramCache]: Analyzing trace with hash -88121349, now seen corresponding path program 1 times [2020-07-10 15:26:05,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:05,807 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10606284] [2020-07-10 15:26:05,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,027 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {38#true} is VALID [2020-07-10 15:26:06,027 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-10 15:26:06,028 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #86#return; {38#true} is VALID [2020-07-10 15:26:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,037 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2020-07-10 15:26:06,039 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2020-07-10 15:26:06,039 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2020-07-10 15:26:06,039 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} #82#return; {39#false} is VALID [2020-07-10 15:26:06,041 INFO L263 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {47#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:06,042 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {38#true} is VALID [2020-07-10 15:26:06,042 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-10 15:26:06,043 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #86#return; {38#true} is VALID [2020-07-10 15:26:06,043 INFO L263 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret11 := main(); {38#true} is VALID [2020-07-10 15:26:06,044 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {38#true} is VALID [2020-07-10 15:26:06,044 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#true} assume !(~N~0 <= 0); {38#true} is VALID [2020-07-10 15:26:06,045 INFO L263 TraceCheckUtils]: 7: Hoare triple {38#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {38#true} is VALID [2020-07-10 15:26:06,045 INFO L280 TraceCheckUtils]: 8: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2020-07-10 15:26:06,046 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2020-07-10 15:26:06,047 INFO L280 TraceCheckUtils]: 10: Hoare triple {39#false} assume true; {39#false} is VALID [2020-07-10 15:26:06,047 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {39#false} {38#true} #82#return; {39#false} is VALID [2020-07-10 15:26:06,048 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#false} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 4);~i~0 := 0; {39#false} is VALID [2020-07-10 15:26:06,048 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID [2020-07-10 15:26:06,048 INFO L280 TraceCheckUtils]: 14: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2020-07-10 15:26:06,049 INFO L280 TraceCheckUtils]: 15: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID [2020-07-10 15:26:06,049 INFO L280 TraceCheckUtils]: 16: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2020-07-10 15:26:06,050 INFO L280 TraceCheckUtils]: 17: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID [2020-07-10 15:26:06,050 INFO L280 TraceCheckUtils]: 18: Hoare triple {39#false} call #t~mem10 := read~int(~#sum~0.base, ~#sum~0.offset, 4); {39#false} is VALID [2020-07-10 15:26:06,051 INFO L263 TraceCheckUtils]: 19: Hoare triple {39#false} call __VERIFIER_assert((if #t~mem10 == 2 * ~N~0 then 1 else 0)); {39#false} is VALID [2020-07-10 15:26:06,051 INFO L280 TraceCheckUtils]: 20: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2020-07-10 15:26:06,051 INFO L280 TraceCheckUtils]: 21: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2020-07-10 15:26:06,052 INFO L280 TraceCheckUtils]: 22: Hoare triple {39#false} assume !false; {39#false} is VALID [2020-07-10 15:26:06,055 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-10 15:26:06,056 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10606284] [2020-07-10 15:26:06,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:06,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:26:06,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239547309] [2020-07-10 15:26:06,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:26:06,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:06,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:26:06,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:06,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:26:06,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:06,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:26:06,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:06,132 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-07-10 15:26:06,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:06,329 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2020-07-10 15:26:06,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:26:06,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:26:06,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:06,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:06,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-10 15:26:06,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:06,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-10 15:26:06,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2020-07-10 15:26:06,486 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-10 15:26:06,498 INFO L225 Difference]: With dead ends: 60 [2020-07-10 15:26:06,498 INFO L226 Difference]: Without dead ends: 28 [2020-07-10 15:26:06,502 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-10 15:26:06,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-10 15:26:06,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-10 15:26:06,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:06,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-10 15:26:06,552 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-10 15:26:06,552 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-10 15:26:06,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:06,557 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-10 15:26:06,557 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-10 15:26:06,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:06,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:06,558 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-10 15:26:06,558 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-10 15:26:06,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:06,562 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-10 15:26:06,562 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-10 15:26:06,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:06,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:06,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:06,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:06,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 15:26:06,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2020-07-10 15:26:06,568 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 23 [2020-07-10 15:26:06,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:06,569 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2020-07-10 15:26:06,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:26:06,569 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-10 15:26:06,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:26:06,570 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:06,570 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] [2020-07-10 15:26:06,571 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:26:06,571 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:06,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:06,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1099238599, now seen corresponding path program 1 times [2020-07-10 15:26:06,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:06,572 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039455787] [2020-07-10 15:26:06,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,702 INFO L280 TraceCheckUtils]: 0: Hoare triple {232#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {221#true} is VALID [2020-07-10 15:26:06,702 INFO L280 TraceCheckUtils]: 1: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-10 15:26:06,703 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {221#true} {221#true} #86#return; {221#true} is VALID [2020-07-10 15:26:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,722 INFO L280 TraceCheckUtils]: 0: Hoare triple {221#true} ~cond := #in~cond; {221#true} is VALID [2020-07-10 15:26:06,722 INFO L280 TraceCheckUtils]: 1: Hoare triple {221#true} assume !(0 == ~cond); {221#true} is VALID [2020-07-10 15:26:06,723 INFO L280 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-10 15:26:06,724 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {221#true} {226#(<= 1 ~N~0)} #82#return; {226#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:06,725 INFO L263 TraceCheckUtils]: 0: Hoare triple {221#true} call ULTIMATE.init(); {232#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:06,725 INFO L280 TraceCheckUtils]: 1: Hoare triple {232#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {221#true} is VALID [2020-07-10 15:26:06,725 INFO L280 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-10 15:26:06,726 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {221#true} {221#true} #86#return; {221#true} is VALID [2020-07-10 15:26:06,727 INFO L263 TraceCheckUtils]: 4: Hoare triple {221#true} call #t~ret11 := main(); {221#true} is VALID [2020-07-10 15:26:06,728 INFO L280 TraceCheckUtils]: 5: Hoare triple {221#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {221#true} is VALID [2020-07-10 15:26:06,729 INFO L280 TraceCheckUtils]: 6: Hoare triple {221#true} assume !(~N~0 <= 0); {226#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:06,730 INFO L263 TraceCheckUtils]: 7: Hoare triple {226#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {221#true} is VALID [2020-07-10 15:26:06,730 INFO L280 TraceCheckUtils]: 8: Hoare triple {221#true} ~cond := #in~cond; {221#true} is VALID [2020-07-10 15:26:06,730 INFO L280 TraceCheckUtils]: 9: Hoare triple {221#true} assume !(0 == ~cond); {221#true} is VALID [2020-07-10 15:26:06,731 INFO L280 TraceCheckUtils]: 10: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-10 15:26:06,732 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {221#true} {226#(<= 1 ~N~0)} #82#return; {226#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:06,734 INFO L280 TraceCheckUtils]: 12: Hoare triple {226#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 4);~i~0 := 0; {231#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 15:26:06,738 INFO L280 TraceCheckUtils]: 13: Hoare triple {231#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {222#false} is VALID [2020-07-10 15:26:06,738 INFO L280 TraceCheckUtils]: 14: Hoare triple {222#false} ~i~0 := 0; {222#false} is VALID [2020-07-10 15:26:06,739 INFO L280 TraceCheckUtils]: 15: Hoare triple {222#false} assume !(~i~0 < ~N~0); {222#false} is VALID [2020-07-10 15:26:06,739 INFO L280 TraceCheckUtils]: 16: Hoare triple {222#false} ~i~0 := 0; {222#false} is VALID [2020-07-10 15:26:06,739 INFO L280 TraceCheckUtils]: 17: Hoare triple {222#false} assume !(~i~0 < ~N~0); {222#false} is VALID [2020-07-10 15:26:06,740 INFO L280 TraceCheckUtils]: 18: Hoare triple {222#false} call #t~mem10 := read~int(~#sum~0.base, ~#sum~0.offset, 4); {222#false} is VALID [2020-07-10 15:26:06,740 INFO L263 TraceCheckUtils]: 19: Hoare triple {222#false} call __VERIFIER_assert((if #t~mem10 == 2 * ~N~0 then 1 else 0)); {222#false} is VALID [2020-07-10 15:26:06,740 INFO L280 TraceCheckUtils]: 20: Hoare triple {222#false} ~cond := #in~cond; {222#false} is VALID [2020-07-10 15:26:06,740 INFO L280 TraceCheckUtils]: 21: Hoare triple {222#false} assume 0 == ~cond; {222#false} is VALID [2020-07-10 15:26:06,741 INFO L280 TraceCheckUtils]: 22: Hoare triple {222#false} assume !false; {222#false} is VALID [2020-07-10 15:26:06,742 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-10 15:26:06,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039455787] [2020-07-10 15:26:06,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:06,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:26:06,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771880019] [2020-07-10 15:26:06,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-10 15:26:06,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:06,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:26:06,778 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:06,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:26:06,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:06,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:26:06,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:06,780 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2020-07-10 15:26:07,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:07,041 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2020-07-10 15:26:07,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:26:07,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-10 15:26:07,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:07,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:07,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-10 15:26:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:07,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-10 15:26:07,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2020-07-10 15:26:07,125 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-10 15:26:07,127 INFO L225 Difference]: With dead ends: 48 [2020-07-10 15:26:07,128 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 15:26:07,129 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-10 15:26:07,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 15:26:07,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2020-07-10 15:26:07,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:07,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 31 states. [2020-07-10 15:26:07,161 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 31 states. [2020-07-10 15:26:07,161 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 31 states. [2020-07-10 15:26:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:07,165 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-10 15:26:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 15:26:07,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:07,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:07,166 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 35 states. [2020-07-10 15:26:07,167 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 35 states. [2020-07-10 15:26:07,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:07,170 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-10 15:26:07,170 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 15:26:07,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:07,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:07,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:07,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-10 15:26:07,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2020-07-10 15:26:07,174 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2020-07-10 15:26:07,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:07,174 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2020-07-10 15:26:07,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:26:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-10 15:26:07,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:26:07,176 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:07,176 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-10 15:26:07,176 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:26:07,176 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:07,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:07,177 INFO L82 PathProgramCache]: Analyzing trace with hash 188437731, now seen corresponding path program 1 times [2020-07-10 15:26:07,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:07,178 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866290347] [2020-07-10 15:26:07,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:07,635 INFO L280 TraceCheckUtils]: 0: Hoare triple {434#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {419#true} is VALID [2020-07-10 15:26:07,636 INFO L280 TraceCheckUtils]: 1: Hoare triple {419#true} assume true; {419#true} is VALID [2020-07-10 15:26:07,636 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {419#true} {419#true} #86#return; {419#true} is VALID [2020-07-10 15:26:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:07,644 INFO L280 TraceCheckUtils]: 0: Hoare triple {419#true} ~cond := #in~cond; {419#true} is VALID [2020-07-10 15:26:07,644 INFO L280 TraceCheckUtils]: 1: Hoare triple {419#true} assume !(0 == ~cond); {419#true} is VALID [2020-07-10 15:26:07,644 INFO L280 TraceCheckUtils]: 2: Hoare triple {419#true} assume true; {419#true} is VALID [2020-07-10 15:26:07,645 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {419#true} {419#true} #82#return; {419#true} is VALID [2020-07-10 15:26:07,646 INFO L263 TraceCheckUtils]: 0: Hoare triple {419#true} call ULTIMATE.init(); {434#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:07,646 INFO L280 TraceCheckUtils]: 1: Hoare triple {434#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {419#true} is VALID [2020-07-10 15:26:07,646 INFO L280 TraceCheckUtils]: 2: Hoare triple {419#true} assume true; {419#true} is VALID [2020-07-10 15:26:07,646 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {419#true} {419#true} #86#return; {419#true} is VALID [2020-07-10 15:26:07,646 INFO L263 TraceCheckUtils]: 4: Hoare triple {419#true} call #t~ret11 := main(); {419#true} is VALID [2020-07-10 15:26:07,647 INFO L280 TraceCheckUtils]: 5: Hoare triple {419#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {419#true} is VALID [2020-07-10 15:26:07,647 INFO L280 TraceCheckUtils]: 6: Hoare triple {419#true} assume !(~N~0 <= 0); {419#true} is VALID [2020-07-10 15:26:07,647 INFO L263 TraceCheckUtils]: 7: Hoare triple {419#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {419#true} is VALID [2020-07-10 15:26:07,647 INFO L280 TraceCheckUtils]: 8: Hoare triple {419#true} ~cond := #in~cond; {419#true} is VALID [2020-07-10 15:26:07,648 INFO L280 TraceCheckUtils]: 9: Hoare triple {419#true} assume !(0 == ~cond); {419#true} is VALID [2020-07-10 15:26:07,648 INFO L280 TraceCheckUtils]: 10: Hoare triple {419#true} assume true; {419#true} is VALID [2020-07-10 15:26:07,648 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {419#true} {419#true} #82#return; {419#true} is VALID [2020-07-10 15:26:07,659 INFO L280 TraceCheckUtils]: 12: Hoare triple {419#true} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 4);~i~0 := 0; {428#(and (= 0 main_~a~0.offset) (= 0 main_~i~0))} is VALID [2020-07-10 15:26:07,660 INFO L280 TraceCheckUtils]: 13: Hoare triple {428#(and (= 0 main_~a~0.offset) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0);call write~int(1, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {429#(and (or (< 536870911 ~N~0) (not (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))))) (= 0 main_~a~0.offset) (= 0 main_~i~0))} is VALID [2020-07-10 15:26:07,661 INFO L280 TraceCheckUtils]: 14: Hoare triple {429#(and (or (< 536870911 ~N~0) (not (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))))) (= 0 main_~a~0.offset) (= 0 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {430#(and (or (< 536870911 ~N~0) (not (= 0 (select (select |#memory_int| main_~a~0.base) 0)))) (= 0 main_~a~0.offset) (or (<= (+ main_~i~0 536870911) ~N~0) (<= ~N~0 536870911)))} is VALID [2020-07-10 15:26:07,663 INFO L280 TraceCheckUtils]: 15: Hoare triple {430#(and (or (< 536870911 ~N~0) (not (= 0 (select (select |#memory_int| main_~a~0.base) 0)))) (= 0 main_~a~0.offset) (or (<= (+ main_~i~0 536870911) ~N~0) (<= ~N~0 536870911)))} assume !(~i~0 < ~N~0); {431#(and (not (= 0 (select (select |#memory_int| main_~a~0.base) 0))) (= 0 main_~a~0.offset))} is VALID [2020-07-10 15:26:07,664 INFO L280 TraceCheckUtils]: 16: Hoare triple {431#(and (not (= 0 (select (select |#memory_int| main_~a~0.base) 0))) (= 0 main_~a~0.offset))} ~i~0 := 0; {432#(and (= 0 main_~a~0.offset) (= 0 main_~i~0) (not (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)))))} is VALID [2020-07-10 15:26:07,665 INFO L280 TraceCheckUtils]: 17: Hoare triple {432#(and (= 0 main_~a~0.offset) (= 0 main_~i~0) (not (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)))))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {433#(not (= 0 |main_#t~mem4|))} is VALID [2020-07-10 15:26:07,666 INFO L280 TraceCheckUtils]: 18: Hoare triple {433#(not (= 0 |main_#t~mem4|))} assume 0 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(1 + #t~mem5, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {420#false} is VALID [2020-07-10 15:26:07,666 INFO L280 TraceCheckUtils]: 19: Hoare triple {420#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {420#false} is VALID [2020-07-10 15:26:07,666 INFO L280 TraceCheckUtils]: 20: Hoare triple {420#false} assume !(~i~0 < ~N~0); {420#false} is VALID [2020-07-10 15:26:07,667 INFO L280 TraceCheckUtils]: 21: Hoare triple {420#false} ~i~0 := 0; {420#false} is VALID [2020-07-10 15:26:07,667 INFO L280 TraceCheckUtils]: 22: Hoare triple {420#false} assume !!(~i~0 < ~N~0);call #t~mem8 := read~int(~#sum~0.base, ~#sum~0.offset, 4);call #t~mem9 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 4);havoc #t~mem9;havoc #t~mem8; {420#false} is VALID [2020-07-10 15:26:07,667 INFO L280 TraceCheckUtils]: 23: Hoare triple {420#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {420#false} is VALID [2020-07-10 15:26:07,668 INFO L280 TraceCheckUtils]: 24: Hoare triple {420#false} assume !(~i~0 < ~N~0); {420#false} is VALID [2020-07-10 15:26:07,668 INFO L280 TraceCheckUtils]: 25: Hoare triple {420#false} call #t~mem10 := read~int(~#sum~0.base, ~#sum~0.offset, 4); {420#false} is VALID [2020-07-10 15:26:07,668 INFO L263 TraceCheckUtils]: 26: Hoare triple {420#false} call __VERIFIER_assert((if #t~mem10 == 2 * ~N~0 then 1 else 0)); {420#false} is VALID [2020-07-10 15:26:07,669 INFO L280 TraceCheckUtils]: 27: Hoare triple {420#false} ~cond := #in~cond; {420#false} is VALID [2020-07-10 15:26:07,669 INFO L280 TraceCheckUtils]: 28: Hoare triple {420#false} assume 0 == ~cond; {420#false} is VALID [2020-07-10 15:26:07,669 INFO L280 TraceCheckUtils]: 29: Hoare triple {420#false} assume !false; {420#false} is VALID [2020-07-10 15:26:07,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:26:07,672 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866290347] [2020-07-10 15:26:07,672 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563821816] [2020-07-10 15:26:07,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:07,722 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 15:26:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:07,741 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:07,828 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-10 15:26:07,828 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:07,833 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:07,833 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:07,833 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-07-10 15:26:07,895 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-10 15:26:07,897 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:07,900 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:07,900 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:07,901 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-10 15:26:07,904 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:07,904 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~a~0.base, main_~a~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (and (= 1 .cse0) (<= .cse0 |main_#t~mem4|))) [2020-07-10 15:26:07,904 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 1 |main_#t~mem4|) [2020-07-10 15:26:07,938 INFO L263 TraceCheckUtils]: 0: Hoare triple {419#true} call ULTIMATE.init(); {419#true} is VALID [2020-07-10 15:26:07,938 INFO L280 TraceCheckUtils]: 1: Hoare triple {419#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {419#true} is VALID [2020-07-10 15:26:07,939 INFO L280 TraceCheckUtils]: 2: Hoare triple {419#true} assume true; {419#true} is VALID [2020-07-10 15:26:07,939 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {419#true} {419#true} #86#return; {419#true} is VALID [2020-07-10 15:26:07,939 INFO L263 TraceCheckUtils]: 4: Hoare triple {419#true} call #t~ret11 := main(); {419#true} is VALID [2020-07-10 15:26:07,940 INFO L280 TraceCheckUtils]: 5: Hoare triple {419#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {419#true} is VALID [2020-07-10 15:26:07,940 INFO L280 TraceCheckUtils]: 6: Hoare triple {419#true} assume !(~N~0 <= 0); {419#true} is VALID [2020-07-10 15:26:07,940 INFO L263 TraceCheckUtils]: 7: Hoare triple {419#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {419#true} is VALID [2020-07-10 15:26:07,941 INFO L280 TraceCheckUtils]: 8: Hoare triple {419#true} ~cond := #in~cond; {419#true} is VALID [2020-07-10 15:26:07,941 INFO L280 TraceCheckUtils]: 9: Hoare triple {419#true} assume !(0 == ~cond); {419#true} is VALID [2020-07-10 15:26:07,941 INFO L280 TraceCheckUtils]: 10: Hoare triple {419#true} assume true; {419#true} is VALID [2020-07-10 15:26:07,942 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {419#true} {419#true} #82#return; {419#true} is VALID [2020-07-10 15:26:07,943 INFO L280 TraceCheckUtils]: 12: Hoare triple {419#true} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 4);~i~0 := 0; {474#(= 0 main_~i~0)} is VALID [2020-07-10 15:26:07,944 INFO L280 TraceCheckUtils]: 13: Hoare triple {474#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0);call write~int(1, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {478#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-10 15:26:07,945 INFO L280 TraceCheckUtils]: 14: Hoare triple {478#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {478#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-10 15:26:07,946 INFO L280 TraceCheckUtils]: 15: Hoare triple {478#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} assume !(~i~0 < ~N~0); {478#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-10 15:26:07,947 INFO L280 TraceCheckUtils]: 16: Hoare triple {478#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} ~i~0 := 0; {488#(and (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~i~0))} is VALID [2020-07-10 15:26:07,948 INFO L280 TraceCheckUtils]: 17: Hoare triple {488#(and (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {492#(<= 1 |main_#t~mem4|)} is VALID [2020-07-10 15:26:07,949 INFO L280 TraceCheckUtils]: 18: Hoare triple {492#(<= 1 |main_#t~mem4|)} assume 0 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(1 + #t~mem5, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {420#false} is VALID [2020-07-10 15:26:07,949 INFO L280 TraceCheckUtils]: 19: Hoare triple {420#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {420#false} is VALID [2020-07-10 15:26:07,950 INFO L280 TraceCheckUtils]: 20: Hoare triple {420#false} assume !(~i~0 < ~N~0); {420#false} is VALID [2020-07-10 15:26:07,950 INFO L280 TraceCheckUtils]: 21: Hoare triple {420#false} ~i~0 := 0; {420#false} is VALID [2020-07-10 15:26:07,951 INFO L280 TraceCheckUtils]: 22: Hoare triple {420#false} assume !!(~i~0 < ~N~0);call #t~mem8 := read~int(~#sum~0.base, ~#sum~0.offset, 4);call #t~mem9 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 4);havoc #t~mem9;havoc #t~mem8; {420#false} is VALID [2020-07-10 15:26:07,951 INFO L280 TraceCheckUtils]: 23: Hoare triple {420#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {420#false} is VALID [2020-07-10 15:26:07,951 INFO L280 TraceCheckUtils]: 24: Hoare triple {420#false} assume !(~i~0 < ~N~0); {420#false} is VALID [2020-07-10 15:26:07,952 INFO L280 TraceCheckUtils]: 25: Hoare triple {420#false} call #t~mem10 := read~int(~#sum~0.base, ~#sum~0.offset, 4); {420#false} is VALID [2020-07-10 15:26:07,952 INFO L263 TraceCheckUtils]: 26: Hoare triple {420#false} call __VERIFIER_assert((if #t~mem10 == 2 * ~N~0 then 1 else 0)); {420#false} is VALID [2020-07-10 15:26:07,952 INFO L280 TraceCheckUtils]: 27: Hoare triple {420#false} ~cond := #in~cond; {420#false} is VALID [2020-07-10 15:26:07,952 INFO L280 TraceCheckUtils]: 28: Hoare triple {420#false} assume 0 == ~cond; {420#false} is VALID [2020-07-10 15:26:07,953 INFO L280 TraceCheckUtils]: 29: Hoare triple {420#false} assume !false; {420#false} is VALID [2020-07-10 15:26:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:26:07,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:26:07,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2020-07-10 15:26:07,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199587004] [2020-07-10 15:26:07,956 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-07-10 15:26:07,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:07,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 15:26:08,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:08,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 15:26:08,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:08,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 15:26:08,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:26:08,019 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 13 states. [2020-07-10 15:26:08,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:08,745 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2020-07-10 15:26:08,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:26:08,748 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-07-10 15:26:08,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:08,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:26:08,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2020-07-10 15:26:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:26:08,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2020-07-10 15:26:08,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2020-07-10 15:26:08,829 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-10 15:26:08,830 INFO L225 Difference]: With dead ends: 51 [2020-07-10 15:26:08,831 INFO L226 Difference]: Without dead ends: 38 [2020-07-10 15:26:08,832 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2020-07-10 15:26:08,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-10 15:26:08,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2020-07-10 15:26:08,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:08,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 32 states. [2020-07-10 15:26:08,863 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 32 states. [2020-07-10 15:26:08,863 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 32 states. [2020-07-10 15:26:08,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:08,866 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-10 15:26:08,866 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-10 15:26:08,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:08,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:08,867 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 38 states. [2020-07-10 15:26:08,867 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 38 states. [2020-07-10 15:26:08,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:08,869 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-10 15:26:08,869 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-10 15:26:08,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:08,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:08,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:08,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:08,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 15:26:08,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-07-10 15:26:08,873 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 30 [2020-07-10 15:26:08,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:08,873 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-07-10 15:26:08,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 15:26:08,873 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-10 15:26:08,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:26:08,874 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:08,875 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-10 15:26:09,090 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 15:26:09,091 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:09,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:09,092 INFO L82 PathProgramCache]: Analyzing trace with hash 446603169, now seen corresponding path program 1 times [2020-07-10 15:26:09,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:09,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865140187] [2020-07-10 15:26:09,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:09,172 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:26:09,172 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:26:09,172 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:26:09,208 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:26:09,208 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:09,208 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:09,209 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:26:09,209 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:26:09,209 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:26:09,209 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:09,209 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:09,209 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:09,209 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:09,209 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:09,210 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:09,210 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:09,210 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:09,210 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:09,210 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:26:09,210 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:09,210 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:26:09,210 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:26:09,210 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:09,211 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:09,211 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:09,211 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:09,211 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:26:09,211 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:26:09,211 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:26:09,211 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:26:09,211 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:26:09,212 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:09,212 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:09,212 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:09,212 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-10 15:26:09,212 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-10 15:26:09,212 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-10 15:26:09,212 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:09,212 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:09,212 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:09,213 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-10 15:26:09,213 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 15:26:09,213 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 15:26:09,213 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:26:09,213 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:26:09,213 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:26:09,213 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-10 15:26:09,213 WARN L170 areAnnotationChecker]: L44-4 has no Hoare annotation [2020-07-10 15:26:09,213 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-10 15:26:09,214 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-10 15:26:09,214 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-10 15:26:09,214 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-10 15:26:09,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:26:09 BoogieIcfgContainer [2020-07-10 15:26:09,216 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:26:09,219 INFO L168 Benchmark]: Toolchain (without parser) took 4569.32 ms. Allocated memory was 145.2 MB in the beginning and 243.3 MB in the end (delta: 98.0 MB). Free memory was 102.6 MB in the beginning and 123.9 MB in the end (delta: -21.3 MB). Peak memory consumption was 76.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:09,220 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-10 15:26:09,221 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.81 ms. Allocated memory is still 145.2 MB. Free memory was 102.4 MB in the beginning and 91.3 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:09,222 INFO L168 Benchmark]: Boogie Preprocessor took 234.09 ms. Allocated memory was 145.2 MB in the beginning and 205.5 MB in the end (delta: 60.3 MB). Free memory was 91.3 MB in the beginning and 182.8 MB in the end (delta: -91.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:09,222 INFO L168 Benchmark]: RCFGBuilder took 495.52 ms. Allocated memory is still 205.5 MB. Free memory was 182.8 MB in the beginning and 156.4 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:09,223 INFO L168 Benchmark]: TraceAbstraction took 3506.49 ms. Allocated memory was 205.5 MB in the beginning and 243.3 MB in the end (delta: 37.7 MB). Free memory was 155.7 MB in the beginning and 123.9 MB in the end (delta: 31.8 MB). Peak memory consumption was 69.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:09,227 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.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 327.81 ms. Allocated memory is still 145.2 MB. Free memory was 102.4 MB in the beginning and 91.3 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 234.09 ms. Allocated memory was 145.2 MB in the beginning and 205.5 MB in the end (delta: 60.3 MB). Free memory was 91.3 MB in the beginning and 182.8 MB in the end (delta: -91.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 495.52 ms. Allocated memory is still 205.5 MB. Free memory was 182.8 MB in the beginning and 156.4 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3506.49 ms. Allocated memory was 205.5 MB in the beginning and 243.3 MB in the end (delta: 37.7 MB). Free memory was 155.7 MB in the beginning and 123.9 MB in the end (delta: 31.8 MB). Peak memory consumption was 69.6 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)=6, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=1] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=1] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=1] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=1] [L25] int i; [L26] int sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L29] sum[0] = 0 [L30] i=0 VAL [\old(N)=0, a={-2:0}, i=0, malloc(sizeof(int)*N)={-2:0}, N=1, sum={3:0}] [L30] COND TRUE i