/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/modnf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:26:37,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:26:37,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:26:37,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:26:37,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:26:37,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:26:37,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:26:37,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:26:37,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:26:37,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:26:37,557 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:26:37,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:26:37,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:26:37,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:26:37,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:26:37,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:26:37,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:26:37,568 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:26:37,569 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:26:37,574 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:26:37,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:26:37,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:26:37,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:26:37,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:26:37,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:26:37,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:26:37,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:26:37,589 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:26:37,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:26:37,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:26:37,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:26:37,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:26:37,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:26:37,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:26:37,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:26:37,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:26:37,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:26:37,596 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:26:37,596 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:26:37,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:26:37,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:26:37,599 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:26:37,625 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:26:37,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:26:37,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:26:37,632 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:26:37,633 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:26:37,633 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:26:37,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:26:37,633 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:26:37,633 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:26:37,634 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:26:37,634 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:26:37,634 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:26:37,634 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:26:37,636 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:26:37,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:26:37,636 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:26:37,636 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:26:37,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:26:37,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:26:37,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:26:37,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:26:37,638 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:26:37,638 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 02:26:37,936 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:26:37,953 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:26:37,958 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:26:37,959 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:26:37,960 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:26:37,960 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/modnf.c [2020-07-11 02:26:38,043 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f928a0a3c/8ce79aa757b6491ebaa841473846f2ea/FLAGe961d7106 [2020-07-11 02:26:38,533 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:26:38,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/modnf.c [2020-07-11 02:26:38,540 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f928a0a3c/8ce79aa757b6491ebaa841473846f2ea/FLAGe961d7106 [2020-07-11 02:26:38,868 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f928a0a3c/8ce79aa757b6491ebaa841473846f2ea [2020-07-11 02:26:38,877 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:26:38,879 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:26:38,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:26:38,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:26:38,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:26:38,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:26:38" (1/1) ... [2020-07-11 02:26:38,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@252e6470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:38, skipping insertion in model container [2020-07-11 02:26:38,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:26:38" (1/1) ... [2020-07-11 02:26:38,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:26:38,916 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:26:39,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:26:39,126 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:26:39,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:26:39,175 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:26:39,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:39 WrapperNode [2020-07-11 02:26:39,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:26:39,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:26:39,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:26:39,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:26:39,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:39" (1/1) ... [2020-07-11 02:26:39,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:39" (1/1) ... [2020-07-11 02:26:39,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:39" (1/1) ... [2020-07-11 02:26:39,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:39" (1/1) ... [2020-07-11 02:26:39,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:39" (1/1) ... [2020-07-11 02:26:39,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:39" (1/1) ... [2020-07-11 02:26:39,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:39" (1/1) ... [2020-07-11 02:26:39,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:26:39,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:26:39,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:26:39,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:26:39,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:26:39,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:26:39,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:26:39,441 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 02:26:39,441 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:26:39,441 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:26:39,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:26:39,441 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 02:26:39,441 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 02:26:39,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:26:39,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:26:39,442 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-11 02:26:39,442 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:26:39,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-11 02:26:39,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-11 02:26:39,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 02:26:39,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 02:26:39,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 02:26:39,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:26:39,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:26:39,907 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:26:39,908 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-11 02:26:39,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:26:39 BoogieIcfgContainer [2020-07-11 02:26:39,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:26:39,913 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:26:39,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:26:39,917 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:26:39,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:26:38" (1/3) ... [2020-07-11 02:26:39,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f8f0c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:26:39, skipping insertion in model container [2020-07-11 02:26:39,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:39" (2/3) ... [2020-07-11 02:26:39,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f8f0c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:26:39, skipping insertion in model container [2020-07-11 02:26:39,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:26:39" (3/3) ... [2020-07-11 02:26:39,921 INFO L109 eAbstractionObserver]: Analyzing ICFG modnf.c [2020-07-11 02:26:39,931 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:26:39,939 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:26:39,952 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:26:39,976 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:26:39,976 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:26:39,976 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:26:39,976 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:26:39,977 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:26:39,977 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:26:39,977 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:26:39,977 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:26:39,995 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2020-07-11 02:26:40,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-11 02:26:40,007 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:26:40,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:26:40,009 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:26:40,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:26:40,016 INFO L82 PathProgramCache]: Analyzing trace with hash 864246722, now seen corresponding path program 1 times [2020-07-11 02:26:40,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:26:40,026 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1409687111] [2020-07-11 02:26:40,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:26:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:40,272 INFO L280 TraceCheckUtils]: 0: Hoare triple {76#(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; {64#true} is VALID [2020-07-11 02:26:40,272 INFO L280 TraceCheckUtils]: 1: Hoare triple {64#true} #valid := #valid[0 := 0]; {64#true} is VALID [2020-07-11 02:26:40,273 INFO L280 TraceCheckUtils]: 2: Hoare triple {64#true} assume 0 < #StackHeapBarrier; {64#true} is VALID [2020-07-11 02:26:40,273 INFO L280 TraceCheckUtils]: 3: Hoare triple {64#true} ~N~0 := 0; {64#true} is VALID [2020-07-11 02:26:40,274 INFO L280 TraceCheckUtils]: 4: Hoare triple {64#true} assume true; {64#true} is VALID [2020-07-11 02:26:40,275 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {64#true} {64#true} #108#return; {64#true} is VALID [2020-07-11 02:26:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:40,285 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#true} ~cond := #in~cond; {64#true} is VALID [2020-07-11 02:26:40,286 INFO L280 TraceCheckUtils]: 1: Hoare triple {64#true} assume !(0 == ~cond); {64#true} is VALID [2020-07-11 02:26:40,286 INFO L280 TraceCheckUtils]: 2: Hoare triple {64#true} assume true; {64#true} is VALID [2020-07-11 02:26:40,287 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {64#true} {64#true} #104#return; {64#true} is VALID [2020-07-11 02:26:40,289 INFO L263 TraceCheckUtils]: 0: Hoare triple {64#true} call ULTIMATE.init(); {76#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:26:40,290 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#(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; {64#true} is VALID [2020-07-11 02:26:40,290 INFO L280 TraceCheckUtils]: 2: Hoare triple {64#true} #valid := #valid[0 := 0]; {64#true} is VALID [2020-07-11 02:26:40,291 INFO L280 TraceCheckUtils]: 3: Hoare triple {64#true} assume 0 < #StackHeapBarrier; {64#true} is VALID [2020-07-11 02:26:40,291 INFO L280 TraceCheckUtils]: 4: Hoare triple {64#true} ~N~0 := 0; {64#true} is VALID [2020-07-11 02:26:40,291 INFO L280 TraceCheckUtils]: 5: Hoare triple {64#true} assume true; {64#true} is VALID [2020-07-11 02:26:40,292 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {64#true} {64#true} #108#return; {64#true} is VALID [2020-07-11 02:26:40,292 INFO L263 TraceCheckUtils]: 7: Hoare triple {64#true} call #t~ret8 := main(); {64#true} is VALID [2020-07-11 02:26:40,292 INFO L280 TraceCheckUtils]: 8: Hoare triple {64#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {64#true} is VALID [2020-07-11 02:26:40,293 INFO L280 TraceCheckUtils]: 9: Hoare triple {64#true} ~N~0 := #t~nondet0; {64#true} is VALID [2020-07-11 02:26:40,293 INFO L280 TraceCheckUtils]: 10: Hoare triple {64#true} havoc #t~nondet0; {64#true} is VALID [2020-07-11 02:26:40,294 INFO L280 TraceCheckUtils]: 11: Hoare triple {64#true} assume !(~N~0 <= 0); {64#true} is VALID [2020-07-11 02:26:40,294 INFO L263 TraceCheckUtils]: 12: Hoare triple {64#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {64#true} is VALID [2020-07-11 02:26:40,295 INFO L280 TraceCheckUtils]: 13: Hoare triple {64#true} ~cond := #in~cond; {64#true} is VALID [2020-07-11 02:26:40,295 INFO L280 TraceCheckUtils]: 14: Hoare triple {64#true} assume !(0 == ~cond); {64#true} is VALID [2020-07-11 02:26:40,295 INFO L280 TraceCheckUtils]: 15: Hoare triple {64#true} assume true; {64#true} is VALID [2020-07-11 02:26:40,296 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {64#true} {64#true} #104#return; {64#true} is VALID [2020-07-11 02:26:40,296 INFO L280 TraceCheckUtils]: 17: Hoare triple {64#true} havoc ~i~0; {64#true} is VALID [2020-07-11 02:26:40,297 INFO L280 TraceCheckUtils]: 18: Hoare triple {64#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4); srcloc: L26 {64#true} is VALID [2020-07-11 02:26:40,297 INFO L280 TraceCheckUtils]: 19: Hoare triple {64#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {64#true} is VALID [2020-07-11 02:26:40,297 INFO L280 TraceCheckUtils]: 20: Hoare triple {64#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {64#true} is VALID [2020-07-11 02:26:40,298 INFO L280 TraceCheckUtils]: 21: Hoare triple {64#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 4); srcloc: L29 {64#true} is VALID [2020-07-11 02:26:40,298 INFO L280 TraceCheckUtils]: 22: Hoare triple {64#true} ~i~0 := 0; {64#true} is VALID [2020-07-11 02:26:40,300 INFO L280 TraceCheckUtils]: 23: Hoare triple {64#true} assume !true; {65#false} is VALID [2020-07-11 02:26:40,300 INFO L280 TraceCheckUtils]: 24: Hoare triple {65#false} ~i~0 := 0; {65#false} is VALID [2020-07-11 02:26:40,301 INFO L280 TraceCheckUtils]: 25: Hoare triple {65#false} assume !(~i~0 < ~N~0); {65#false} is VALID [2020-07-11 02:26:40,301 INFO L280 TraceCheckUtils]: 26: Hoare triple {65#false} ~i~0 := 0; {65#false} is VALID [2020-07-11 02:26:40,301 INFO L280 TraceCheckUtils]: 27: Hoare triple {65#false} assume !!(~i~0 < ~N~0); {65#false} is VALID [2020-07-11 02:26:40,302 INFO L280 TraceCheckUtils]: 28: Hoare triple {65#false} SUMMARY for call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L42 {65#false} is VALID [2020-07-11 02:26:40,302 INFO L263 TraceCheckUtils]: 29: Hoare triple {65#false} call __VERIFIER_assert((if 1 == #t~mem7 then 1 else 0)); {65#false} is VALID [2020-07-11 02:26:40,303 INFO L280 TraceCheckUtils]: 30: Hoare triple {65#false} ~cond := #in~cond; {65#false} is VALID [2020-07-11 02:26:40,303 INFO L280 TraceCheckUtils]: 31: Hoare triple {65#false} assume 0 == ~cond; {65#false} is VALID [2020-07-11 02:26:40,304 INFO L280 TraceCheckUtils]: 32: Hoare triple {65#false} assume !false; {65#false} is VALID [2020-07-11 02:26:40,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:26:40,310 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1409687111] [2020-07-11 02:26:40,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:26:40,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 02:26:40,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129590534] [2020-07-11 02:26:40,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-11 02:26:40,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:26:40,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 02:26:40,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:40,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 02:26:40,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:26:40,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 02:26:40,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 02:26:40,406 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2020-07-11 02:26:40,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:40,778 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2020-07-11 02:26:40,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 02:26:40,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-11 02:26:40,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:26:40,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:26:40,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2020-07-11 02:26:40,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:26:40,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2020-07-11 02:26:40,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 120 transitions. [2020-07-11 02:26:40,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:40,978 INFO L225 Difference]: With dead ends: 105 [2020-07-11 02:26:40,978 INFO L226 Difference]: Without dead ends: 52 [2020-07-11 02:26:40,982 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-11 02:26:41,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-11 02:26:41,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-11 02:26:41,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:26:41,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2020-07-11 02:26:41,074 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-11 02:26:41,074 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-11 02:26:41,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:41,080 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-11 02:26:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-11 02:26:41,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:26:41,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:26:41,081 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-11 02:26:41,082 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-11 02:26:41,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:41,087 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-11 02:26:41,087 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-11 02:26:41,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:26:41,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:26:41,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:26:41,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:26:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-11 02:26:41,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2020-07-11 02:26:41,094 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 33 [2020-07-11 02:26:41,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:26:41,094 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2020-07-11 02:26:41,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 02:26:41,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2020-07-11 02:26:41,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:41,169 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-11 02:26:41,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-11 02:26:41,171 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:26:41,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:26:41,172 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:26:41,172 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:26:41,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:26:41,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1269072019, now seen corresponding path program 1 times [2020-07-11 02:26:41,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:26:41,173 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1963779708] [2020-07-11 02:26:41,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:26:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:41,298 INFO L280 TraceCheckUtils]: 0: Hoare triple {511#(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; {497#true} is VALID [2020-07-11 02:26:41,298 INFO L280 TraceCheckUtils]: 1: Hoare triple {497#true} #valid := #valid[0 := 0]; {497#true} is VALID [2020-07-11 02:26:41,299 INFO L280 TraceCheckUtils]: 2: Hoare triple {497#true} assume 0 < #StackHeapBarrier; {497#true} is VALID [2020-07-11 02:26:41,299 INFO L280 TraceCheckUtils]: 3: Hoare triple {497#true} ~N~0 := 0; {497#true} is VALID [2020-07-11 02:26:41,299 INFO L280 TraceCheckUtils]: 4: Hoare triple {497#true} assume true; {497#true} is VALID [2020-07-11 02:26:41,300 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {497#true} {497#true} #108#return; {497#true} is VALID [2020-07-11 02:26:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:41,309 INFO L280 TraceCheckUtils]: 0: Hoare triple {497#true} ~cond := #in~cond; {497#true} is VALID [2020-07-11 02:26:41,309 INFO L280 TraceCheckUtils]: 1: Hoare triple {497#true} assume !(0 == ~cond); {497#true} is VALID [2020-07-11 02:26:41,310 INFO L280 TraceCheckUtils]: 2: Hoare triple {497#true} assume true; {497#true} is VALID [2020-07-11 02:26:41,311 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {497#true} {505#(<= 1 ~N~0)} #104#return; {505#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:41,312 INFO L263 TraceCheckUtils]: 0: Hoare triple {497#true} call ULTIMATE.init(); {511#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:26:41,312 INFO L280 TraceCheckUtils]: 1: Hoare triple {511#(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; {497#true} is VALID [2020-07-11 02:26:41,313 INFO L280 TraceCheckUtils]: 2: Hoare triple {497#true} #valid := #valid[0 := 0]; {497#true} is VALID [2020-07-11 02:26:41,313 INFO L280 TraceCheckUtils]: 3: Hoare triple {497#true} assume 0 < #StackHeapBarrier; {497#true} is VALID [2020-07-11 02:26:41,313 INFO L280 TraceCheckUtils]: 4: Hoare triple {497#true} ~N~0 := 0; {497#true} is VALID [2020-07-11 02:26:41,314 INFO L280 TraceCheckUtils]: 5: Hoare triple {497#true} assume true; {497#true} is VALID [2020-07-11 02:26:41,314 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {497#true} {497#true} #108#return; {497#true} is VALID [2020-07-11 02:26:41,314 INFO L263 TraceCheckUtils]: 7: Hoare triple {497#true} call #t~ret8 := main(); {497#true} is VALID [2020-07-11 02:26:41,315 INFO L280 TraceCheckUtils]: 8: Hoare triple {497#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {497#true} is VALID [2020-07-11 02:26:41,315 INFO L280 TraceCheckUtils]: 9: Hoare triple {497#true} ~N~0 := #t~nondet0; {497#true} is VALID [2020-07-11 02:26:41,315 INFO L280 TraceCheckUtils]: 10: Hoare triple {497#true} havoc #t~nondet0; {497#true} is VALID [2020-07-11 02:26:41,317 INFO L280 TraceCheckUtils]: 11: Hoare triple {497#true} assume !(~N~0 <= 0); {505#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:41,317 INFO L263 TraceCheckUtils]: 12: Hoare triple {505#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {497#true} is VALID [2020-07-11 02:26:41,317 INFO L280 TraceCheckUtils]: 13: Hoare triple {497#true} ~cond := #in~cond; {497#true} is VALID [2020-07-11 02:26:41,318 INFO L280 TraceCheckUtils]: 14: Hoare triple {497#true} assume !(0 == ~cond); {497#true} is VALID [2020-07-11 02:26:41,318 INFO L280 TraceCheckUtils]: 15: Hoare triple {497#true} assume true; {497#true} is VALID [2020-07-11 02:26:41,319 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {497#true} {505#(<= 1 ~N~0)} #104#return; {505#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:41,320 INFO L280 TraceCheckUtils]: 17: Hoare triple {505#(<= 1 ~N~0)} havoc ~i~0; {505#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:41,321 INFO L280 TraceCheckUtils]: 18: Hoare triple {505#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4); srcloc: L26 {505#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:41,321 INFO L280 TraceCheckUtils]: 19: Hoare triple {505#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {505#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:41,322 INFO L280 TraceCheckUtils]: 20: Hoare triple {505#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {505#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:41,323 INFO L280 TraceCheckUtils]: 21: Hoare triple {505#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 4); srcloc: L29 {505#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:41,324 INFO L280 TraceCheckUtils]: 22: Hoare triple {505#(<= 1 ~N~0)} ~i~0 := 0; {510#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-11 02:26:41,325 INFO L280 TraceCheckUtils]: 23: Hoare triple {510#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {498#false} is VALID [2020-07-11 02:26:41,325 INFO L280 TraceCheckUtils]: 24: Hoare triple {498#false} ~i~0 := 0; {498#false} is VALID [2020-07-11 02:26:41,326 INFO L280 TraceCheckUtils]: 25: Hoare triple {498#false} assume !(~i~0 < ~N~0); {498#false} is VALID [2020-07-11 02:26:41,326 INFO L280 TraceCheckUtils]: 26: Hoare triple {498#false} ~i~0 := 0; {498#false} is VALID [2020-07-11 02:26:41,326 INFO L280 TraceCheckUtils]: 27: Hoare triple {498#false} assume !!(~i~0 < ~N~0); {498#false} is VALID [2020-07-11 02:26:41,327 INFO L280 TraceCheckUtils]: 28: Hoare triple {498#false} SUMMARY for call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L42 {498#false} is VALID [2020-07-11 02:26:41,327 INFO L263 TraceCheckUtils]: 29: Hoare triple {498#false} call __VERIFIER_assert((if 1 == #t~mem7 then 1 else 0)); {498#false} is VALID [2020-07-11 02:26:41,327 INFO L280 TraceCheckUtils]: 30: Hoare triple {498#false} ~cond := #in~cond; {498#false} is VALID [2020-07-11 02:26:41,327 INFO L280 TraceCheckUtils]: 31: Hoare triple {498#false} assume 0 == ~cond; {498#false} is VALID [2020-07-11 02:26:41,328 INFO L280 TraceCheckUtils]: 32: Hoare triple {498#false} assume !false; {498#false} is VALID [2020-07-11 02:26:41,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:26:41,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1963779708] [2020-07-11 02:26:41,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:26:41,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 02:26:41,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947783215] [2020-07-11 02:26:41,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-07-11 02:26:41,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:26:41,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:26:41,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:41,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:26:41,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:26:41,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:26:41,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:26:41,380 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 5 states. [2020-07-11 02:26:41,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:41,935 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2020-07-11 02:26:41,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 02:26:41,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-07-11 02:26:41,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:26:41,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:26:41,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2020-07-11 02:26:41,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:26:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2020-07-11 02:26:41,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 98 transitions. [2020-07-11 02:26:42,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:42,071 INFO L225 Difference]: With dead ends: 92 [2020-07-11 02:26:42,071 INFO L226 Difference]: Without dead ends: 70 [2020-07-11 02:26:42,072 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-11 02:26:42,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-11 02:26:42,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2020-07-11 02:26:42,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:26:42,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 54 states. [2020-07-11 02:26:42,155 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 54 states. [2020-07-11 02:26:42,156 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 54 states. [2020-07-11 02:26:42,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:42,161 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2020-07-11 02:26:42,161 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2020-07-11 02:26:42,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:26:42,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:26:42,163 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 70 states. [2020-07-11 02:26:42,163 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 70 states. [2020-07-11 02:26:42,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:42,167 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2020-07-11 02:26:42,167 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2020-07-11 02:26:42,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:26:42,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:26:42,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:26:42,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:26:42,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-11 02:26:42,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2020-07-11 02:26:42,172 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 33 [2020-07-11 02:26:42,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:26:42,172 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2020-07-11 02:26:42,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:26:42,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 56 transitions. [2020-07-11 02:26:42,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:42,246 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2020-07-11 02:26:42,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-11 02:26:42,247 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:26:42,248 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] [2020-07-11 02:26:42,248 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:26:42,248 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:26:42,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:26:42,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1661969402, now seen corresponding path program 1 times [2020-07-11 02:26:42,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:26:42,249 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2054261847] [2020-07-11 02:26:42,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:26:42,273 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-11 02:26:42,274 WARN L168 FreeRefinementEngine]: Strategy FIXED_PREFERENCES was unsuccessful and could not determine trace feasibility [2020-07-11 02:26:42,274 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 02:26:42,279 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:26:42,296 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-11 02:26:42,297 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:26:42,297 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:26:42,297 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-11 02:26:42,297 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 02:26:42,297 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-11 02:26:42,297 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:26:42,298 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:26:42,298 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:26:42,298 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-11 02:26:42,298 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-11 02:26:42,298 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-11 02:26:42,298 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 02:26:42,298 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 02:26:42,298 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-11 02:26:42,299 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 02:26:42,299 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-11 02:26:42,299 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-11 02:26:42,299 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-11 02:26:42,299 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-11 02:26:42,299 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-11 02:26:42,299 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-11 02:26:42,300 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-11 02:26:42,300 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-11 02:26:42,300 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-11 02:26:42,300 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-11 02:26:42,300 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-11 02:26:42,300 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 02:26:42,301 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-11 02:26:42,301 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-11 02:26:42,301 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-11 02:26:42,301 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-11 02:26:42,301 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-11 02:26:42,301 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 02:26:42,301 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-11 02:26:42,301 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 02:26:42,302 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-11 02:26:42,302 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-11 02:26:42,302 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 02:26:42,302 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-11 02:26:42,302 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-11 02:26:42,302 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-11 02:26:42,302 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-11 02:26:42,302 WARN L170 areAnnotationChecker]: L40-5 has no Hoare annotation [2020-07-11 02:26:42,303 WARN L170 areAnnotationChecker]: L40-5 has no Hoare annotation [2020-07-11 02:26:42,303 WARN L170 areAnnotationChecker]: L40-5 has no Hoare annotation [2020-07-11 02:26:42,303 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-11 02:26:42,303 WARN L170 areAnnotationChecker]: L40-6 has no Hoare annotation [2020-07-11 02:26:42,303 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-11 02:26:42,303 WARN L170 areAnnotationChecker]: L30-5 has no Hoare annotation [2020-07-11 02:26:42,303 WARN L170 areAnnotationChecker]: L30-5 has no Hoare annotation [2020-07-11 02:26:42,303 WARN L170 areAnnotationChecker]: L30-5 has no Hoare annotation [2020-07-11 02:26:42,304 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-11 02:26:42,304 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-11 02:26:42,304 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-11 02:26:42,304 WARN L170 areAnnotationChecker]: L30-6 has no Hoare annotation [2020-07-11 02:26:42,304 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-11 02:26:42,304 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-11 02:26:42,304 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-11 02:26:42,305 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-11 02:26:42,305 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-11 02:26:42,305 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-11 02:26:42,305 WARN L170 areAnnotationChecker]: L35-6 has no Hoare annotation [2020-07-11 02:26:42,305 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-11 02:26:42,305 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2020-07-11 02:26:42,305 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-11 02:26:42,305 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-11 02:26:42,306 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-11 02:26:42,306 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-11 02:26:42,306 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-11 02:26:42,306 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-11 02:26:42,306 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-11 02:26:42,306 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-11 02:26:42,306 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-11 02:26:42,309 WARN L231 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-07-11 02:26:42,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:26:42 BoogieIcfgContainer [2020-07-11 02:26:42,310 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:26:42,314 INFO L168 Benchmark]: Toolchain (without parser) took 3434.21 ms. Allocated memory was 146.3 MB in the beginning and 243.3 MB in the end (delta: 97.0 MB). Free memory was 104.8 MB in the beginning and 116.3 MB in the end (delta: -11.5 MB). Peak memory consumption was 85.5 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:42,315 INFO L168 Benchmark]: CDTParser took 0.85 ms. Allocated memory is still 146.3 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 02:26:42,316 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.61 ms. Allocated memory is still 146.3 MB. Free memory was 104.6 MB in the beginning and 93.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:42,316 INFO L168 Benchmark]: Boogie Preprocessor took 191.47 ms. Allocated memory was 146.3 MB in the beginning and 207.1 MB in the end (delta: 60.8 MB). Free memory was 93.6 MB in the beginning and 184.6 MB in the end (delta: -91.0 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:42,320 INFO L168 Benchmark]: RCFGBuilder took 543.52 ms. Allocated memory is still 207.1 MB. Free memory was 184.6 MB in the beginning and 156.1 MB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:42,324 INFO L168 Benchmark]: TraceAbstraction took 2396.95 ms. Allocated memory was 207.1 MB in the beginning and 243.3 MB in the end (delta: 36.2 MB). Free memory was 156.1 MB in the beginning and 116.3 MB in the end (delta: 39.8 MB). Peak memory consumption was 76.0 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:42,327 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.85 ms. Allocated memory is still 146.3 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 296.61 ms. Allocated memory is still 146.3 MB. Free memory was 104.6 MB in the beginning and 93.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 191.47 ms. Allocated memory was 146.3 MB in the beginning and 207.1 MB in the end (delta: 60.8 MB). Free memory was 93.6 MB in the beginning and 184.6 MB in the end (delta: -91.0 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 543.52 ms. Allocated memory is still 207.1 MB. Free memory was 184.6 MB in the beginning and 156.1 MB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2396.95 ms. Allocated memory was 207.1 MB in the beginning and 243.3 MB in the end (delta: 36.2 MB). Free memory was 156.1 MB in the beginning and 116.3 MB in the end (delta: 39.8 MB). Peak memory consumption was 76.0 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] int sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L29] sum[0] = 0 [L30] i=0 [L30] COND TRUE i