/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/array-fpi/sina4f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:21:38,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:21:38,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:21:38,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:21:38,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:21:38,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:21:38,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:21:38,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:21:38,561 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:21:38,562 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:21:38,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:21:38,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:21:38,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:21:38,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:21:38,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:21:38,569 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:21:38,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:21:38,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:21:38,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:21:38,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:21:38,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:21:38,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:21:38,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:21:38,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:21:38,584 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:21:38,585 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:21:38,585 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:21:38,586 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:21:38,587 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:21:38,588 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:21:38,588 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:21:38,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:21:38,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:21:38,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:21:38,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:21:38,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:21:38,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:21:38,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:21:38,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:21:38,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:21:38,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:21:38,597 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:21:38,610 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:21:38,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:21:38,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:21:38,613 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:21:38,613 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:21:38,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:21:38,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:21:38,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:21:38,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:21:38,615 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:21:38,615 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:21:38,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:21:38,615 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:21:38,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:21:38,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:21:38,616 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:21:38,616 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:21:38,618 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:21:38,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:38,618 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:21:38,618 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:21:38,619 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:21:38,619 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:21:38,948 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:21:38,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:21:38,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:21:38,973 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:21:38,974 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:21:38,975 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/sina4f.c [2020-07-10 20:21:39,070 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef8958f57/8cfe83f23fb9436a968e067cb41ac70e/FLAGd973dd8f8 [2020-07-10 20:21:39,609 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:21:39,609 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina4f.c [2020-07-10 20:21:39,619 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef8958f57/8cfe83f23fb9436a968e067cb41ac70e/FLAGd973dd8f8 [2020-07-10 20:21:39,963 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef8958f57/8cfe83f23fb9436a968e067cb41ac70e [2020-07-10 20:21:39,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:21:39,977 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:21:39,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:39,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:21:39,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:21:39,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:39" (1/1) ... [2020-07-10 20:21:39,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@86cfd43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:39, skipping insertion in model container [2020-07-10 20:21:39,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:39" (1/1) ... [2020-07-10 20:21:40,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:21:40,023 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:21:40,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:40,276 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:21:40,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:40,330 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:21:40,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:40 WrapperNode [2020-07-10 20:21:40,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:40,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:21:40,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:21:40,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:21:40,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:40" (1/1) ... [2020-07-10 20:21:40,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:40" (1/1) ... [2020-07-10 20:21:40,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:40" (1/1) ... [2020-07-10 20:21:40,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:40" (1/1) ... [2020-07-10 20:21:40,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:40" (1/1) ... [2020-07-10 20:21:40,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:40" (1/1) ... [2020-07-10 20:21:40,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:40" (1/1) ... [2020-07-10 20:21:40,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:21:40,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:21:40,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:21:40,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:21:40,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:40" (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 20:21:40,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:21:40,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:21:40,560 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:21:40,560 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:21:40,560 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:21:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:21:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:21:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:21:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:21:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:21:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 20:21:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:21:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:21:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 20:21:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:21:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:21:40,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:21:40,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:21:40,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:21:41,157 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:21:41,158 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-10 20:21:41,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:41 BoogieIcfgContainer [2020-07-10 20:21:41,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:21:41,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:21:41,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:21:41,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:21:41,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:21:39" (1/3) ... [2020-07-10 20:21:41,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2115b901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:41, skipping insertion in model container [2020-07-10 20:21:41,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:40" (2/3) ... [2020-07-10 20:21:41,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2115b901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:41, skipping insertion in model container [2020-07-10 20:21:41,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:41" (3/3) ... [2020-07-10 20:21:41,187 INFO L109 eAbstractionObserver]: Analyzing ICFG sina4f.c [2020-07-10 20:21:41,201 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:21:41,213 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:21:41,233 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:21:41,265 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:21:41,266 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:21:41,266 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:21:41,266 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:21:41,267 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:21:41,267 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:21:41,267 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:21:41,268 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:21:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2020-07-10 20:21:41,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-10 20:21:41,310 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:41,311 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] [2020-07-10 20:21:41,312 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:41,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:41,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1015859133, now seen corresponding path program 1 times [2020-07-10 20:21:41,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:41,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1260996619] [2020-07-10 20:21:41,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:41,664 INFO L280 TraceCheckUtils]: 0: Hoare triple {96#(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; {84#true} is VALID [2020-07-10 20:21:41,665 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} #valid := #valid[0 := 0]; {84#true} is VALID [2020-07-10 20:21:41,665 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} assume 0 < #StackHeapBarrier; {84#true} is VALID [2020-07-10 20:21:41,666 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#true} ~N~0 := 0; {84#true} is VALID [2020-07-10 20:21:41,667 INFO L280 TraceCheckUtils]: 4: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-10 20:21:41,667 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {84#true} {84#true} #150#return; {84#true} is VALID [2020-07-10 20:21:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:41,680 INFO L280 TraceCheckUtils]: 0: Hoare triple {84#true} ~cond := #in~cond; {84#true} is VALID [2020-07-10 20:21:41,681 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} assume !(0 == ~cond); {84#true} is VALID [2020-07-10 20:21:41,681 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-10 20:21:41,682 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {84#true} {84#true} #146#return; {84#true} is VALID [2020-07-10 20:21:41,685 INFO L263 TraceCheckUtils]: 0: Hoare triple {84#true} call ULTIMATE.init(); {96#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:21:41,685 INFO L280 TraceCheckUtils]: 1: Hoare triple {96#(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; {84#true} is VALID [2020-07-10 20:21:41,686 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} #valid := #valid[0 := 0]; {84#true} is VALID [2020-07-10 20:21:41,686 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#true} assume 0 < #StackHeapBarrier; {84#true} is VALID [2020-07-10 20:21:41,686 INFO L280 TraceCheckUtils]: 4: Hoare triple {84#true} ~N~0 := 0; {84#true} is VALID [2020-07-10 20:21:41,687 INFO L280 TraceCheckUtils]: 5: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-10 20:21:41,687 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {84#true} {84#true} #150#return; {84#true} is VALID [2020-07-10 20:21:41,688 INFO L263 TraceCheckUtils]: 7: Hoare triple {84#true} call #t~ret14 := main(); {84#true} is VALID [2020-07-10 20:21:41,688 INFO L280 TraceCheckUtils]: 8: Hoare triple {84#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {84#true} is VALID [2020-07-10 20:21:41,689 INFO L280 TraceCheckUtils]: 9: Hoare triple {84#true} ~N~0 := #t~nondet0; {84#true} is VALID [2020-07-10 20:21:41,689 INFO L280 TraceCheckUtils]: 10: Hoare triple {84#true} havoc #t~nondet0; {84#true} is VALID [2020-07-10 20:21:41,690 INFO L280 TraceCheckUtils]: 11: Hoare triple {84#true} assume !(~N~0 <= 0); {84#true} is VALID [2020-07-10 20:21:41,690 INFO L263 TraceCheckUtils]: 12: Hoare triple {84#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {84#true} is VALID [2020-07-10 20:21:41,691 INFO L280 TraceCheckUtils]: 13: Hoare triple {84#true} ~cond := #in~cond; {84#true} is VALID [2020-07-10 20:21:41,691 INFO L280 TraceCheckUtils]: 14: Hoare triple {84#true} assume !(0 == ~cond); {84#true} is VALID [2020-07-10 20:21:41,692 INFO L280 TraceCheckUtils]: 15: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-10 20:21:41,692 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {84#true} {84#true} #146#return; {84#true} is VALID [2020-07-10 20:21:41,693 INFO L280 TraceCheckUtils]: 17: Hoare triple {84#true} havoc ~i~0; {84#true} is VALID [2020-07-10 20:21:41,693 INFO L280 TraceCheckUtils]: 18: Hoare triple {84#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {84#true} is VALID [2020-07-10 20:21:41,694 INFO L280 TraceCheckUtils]: 19: Hoare triple {84#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {84#true} is VALID [2020-07-10 20:21:41,694 INFO L280 TraceCheckUtils]: 20: Hoare triple {84#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {84#true} is VALID [2020-07-10 20:21:41,694 INFO L280 TraceCheckUtils]: 21: Hoare triple {84#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L28 {84#true} is VALID [2020-07-10 20:21:41,695 INFO L280 TraceCheckUtils]: 22: Hoare triple {84#true} ~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset; {84#true} is VALID [2020-07-10 20:21:41,695 INFO L280 TraceCheckUtils]: 23: Hoare triple {84#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L30 {84#true} is VALID [2020-07-10 20:21:41,695 INFO L280 TraceCheckUtils]: 24: Hoare triple {84#true} ~i~0 := 0; {84#true} is VALID [2020-07-10 20:21:41,697 INFO L280 TraceCheckUtils]: 25: Hoare triple {84#true} assume !true; {85#false} is VALID [2020-07-10 20:21:41,698 INFO L280 TraceCheckUtils]: 26: Hoare triple {85#false} ~i~0 := 0; {85#false} is VALID [2020-07-10 20:21:41,698 INFO L280 TraceCheckUtils]: 27: Hoare triple {85#false} assume !(~i~0 < ~N~0); {85#false} is VALID [2020-07-10 20:21:41,699 INFO L280 TraceCheckUtils]: 28: Hoare triple {85#false} ~i~0 := 0; {85#false} is VALID [2020-07-10 20:21:41,699 INFO L280 TraceCheckUtils]: 29: Hoare triple {85#false} assume !true; {85#false} is VALID [2020-07-10 20:21:41,700 INFO L280 TraceCheckUtils]: 30: Hoare triple {85#false} ~i~0 := 0; {85#false} is VALID [2020-07-10 20:21:41,700 INFO L280 TraceCheckUtils]: 31: Hoare triple {85#false} assume !true; {85#false} is VALID [2020-07-10 20:21:41,701 INFO L280 TraceCheckUtils]: 32: Hoare triple {85#false} ~i~0 := 0; {85#false} is VALID [2020-07-10 20:21:41,701 INFO L280 TraceCheckUtils]: 33: Hoare triple {85#false} assume !!(~i~0 < ~N~0); {85#false} is VALID [2020-07-10 20:21:41,702 INFO L280 TraceCheckUtils]: 34: Hoare triple {85#false} SUMMARY for call #t~mem13 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); srcloc: L53 {85#false} is VALID [2020-07-10 20:21:41,702 INFO L263 TraceCheckUtils]: 35: Hoare triple {85#false} call __VERIFIER_assert((if #t~mem13 == ~N~0 then 1 else 0)); {85#false} is VALID [2020-07-10 20:21:41,702 INFO L280 TraceCheckUtils]: 36: Hoare triple {85#false} ~cond := #in~cond; {85#false} is VALID [2020-07-10 20:21:41,703 INFO L280 TraceCheckUtils]: 37: Hoare triple {85#false} assume 0 == ~cond; {85#false} is VALID [2020-07-10 20:21:41,703 INFO L280 TraceCheckUtils]: 38: Hoare triple {85#false} assume !false; {85#false} is VALID [2020-07-10 20:21:41,711 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 20:21:41,712 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:41,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1260996619] [2020-07-10 20:21:41,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:41,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:21:41,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540913259] [2020-07-10 20:21:41,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-07-10 20:21:41,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:41,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:21:41,816 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 20:21:41,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:21:41,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:41,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:21:41,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:21:41,833 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 3 states. [2020-07-10 20:21:42,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:42,389 INFO L93 Difference]: Finished difference Result 145 states and 168 transitions. [2020-07-10 20:21:42,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:21:42,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-07-10 20:21:42,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:42,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-10 20:21:42,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-10 20:21:42,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2020-07-10 20:21:42,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:42,673 INFO L225 Difference]: With dead ends: 145 [2020-07-10 20:21:42,673 INFO L226 Difference]: Without dead ends: 72 [2020-07-10 20:21:42,678 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-10 20:21:42,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-10 20:21:42,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-07-10 20:21:42,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:42,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2020-07-10 20:21:42,798 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2020-07-10 20:21:42,798 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2020-07-10 20:21:42,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:42,806 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2020-07-10 20:21:42,806 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2020-07-10 20:21:42,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:42,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:42,808 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2020-07-10 20:21:42,808 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2020-07-10 20:21:42,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:42,815 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2020-07-10 20:21:42,815 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2020-07-10 20:21:42,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:42,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:42,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:42,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:42,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-10 20:21:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2020-07-10 20:21:42,824 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 39 [2020-07-10 20:21:42,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:42,825 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2020-07-10 20:21:42,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:21:42,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 76 transitions. [2020-07-10 20:21:42,936 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:42,936 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2020-07-10 20:21:42,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-10 20:21:42,938 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:42,939 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] [2020-07-10 20:21:42,939 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:21:42,940 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:42,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:42,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1834550526, now seen corresponding path program 1 times [2020-07-10 20:21:42,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:42,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [667525359] [2020-07-10 20:21:42,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:43,144 INFO L280 TraceCheckUtils]: 0: Hoare triple {691#(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; {677#true} is VALID [2020-07-10 20:21:43,145 INFO L280 TraceCheckUtils]: 1: Hoare triple {677#true} #valid := #valid[0 := 0]; {677#true} is VALID [2020-07-10 20:21:43,146 INFO L280 TraceCheckUtils]: 2: Hoare triple {677#true} assume 0 < #StackHeapBarrier; {677#true} is VALID [2020-07-10 20:21:43,146 INFO L280 TraceCheckUtils]: 3: Hoare triple {677#true} ~N~0 := 0; {677#true} is VALID [2020-07-10 20:21:43,147 INFO L280 TraceCheckUtils]: 4: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-10 20:21:43,147 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {677#true} {677#true} #150#return; {677#true} is VALID [2020-07-10 20:21:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:43,156 INFO L280 TraceCheckUtils]: 0: Hoare triple {677#true} ~cond := #in~cond; {677#true} is VALID [2020-07-10 20:21:43,157 INFO L280 TraceCheckUtils]: 1: Hoare triple {677#true} assume !(0 == ~cond); {677#true} is VALID [2020-07-10 20:21:43,158 INFO L280 TraceCheckUtils]: 2: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-10 20:21:43,159 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {677#true} {685#(<= 1 ~N~0)} #146#return; {685#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:43,160 INFO L263 TraceCheckUtils]: 0: Hoare triple {677#true} call ULTIMATE.init(); {691#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:21:43,161 INFO L280 TraceCheckUtils]: 1: Hoare triple {691#(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; {677#true} is VALID [2020-07-10 20:21:43,161 INFO L280 TraceCheckUtils]: 2: Hoare triple {677#true} #valid := #valid[0 := 0]; {677#true} is VALID [2020-07-10 20:21:43,162 INFO L280 TraceCheckUtils]: 3: Hoare triple {677#true} assume 0 < #StackHeapBarrier; {677#true} is VALID [2020-07-10 20:21:43,162 INFO L280 TraceCheckUtils]: 4: Hoare triple {677#true} ~N~0 := 0; {677#true} is VALID [2020-07-10 20:21:43,163 INFO L280 TraceCheckUtils]: 5: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-10 20:21:43,163 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {677#true} {677#true} #150#return; {677#true} is VALID [2020-07-10 20:21:43,163 INFO L263 TraceCheckUtils]: 7: Hoare triple {677#true} call #t~ret14 := main(); {677#true} is VALID [2020-07-10 20:21:43,164 INFO L280 TraceCheckUtils]: 8: Hoare triple {677#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {677#true} is VALID [2020-07-10 20:21:43,164 INFO L280 TraceCheckUtils]: 9: Hoare triple {677#true} ~N~0 := #t~nondet0; {677#true} is VALID [2020-07-10 20:21:43,165 INFO L280 TraceCheckUtils]: 10: Hoare triple {677#true} havoc #t~nondet0; {677#true} is VALID [2020-07-10 20:21:43,166 INFO L280 TraceCheckUtils]: 11: Hoare triple {677#true} assume !(~N~0 <= 0); {685#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:43,167 INFO L263 TraceCheckUtils]: 12: Hoare triple {685#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {677#true} is VALID [2020-07-10 20:21:43,167 INFO L280 TraceCheckUtils]: 13: Hoare triple {677#true} ~cond := #in~cond; {677#true} is VALID [2020-07-10 20:21:43,167 INFO L280 TraceCheckUtils]: 14: Hoare triple {677#true} assume !(0 == ~cond); {677#true} is VALID [2020-07-10 20:21:43,168 INFO L280 TraceCheckUtils]: 15: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-10 20:21:43,169 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {677#true} {685#(<= 1 ~N~0)} #146#return; {685#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:43,170 INFO L280 TraceCheckUtils]: 17: Hoare triple {685#(<= 1 ~N~0)} havoc ~i~0; {685#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:43,171 INFO L280 TraceCheckUtils]: 18: Hoare triple {685#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {685#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:43,172 INFO L280 TraceCheckUtils]: 19: Hoare triple {685#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {685#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:43,173 INFO L280 TraceCheckUtils]: 20: Hoare triple {685#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {685#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:43,174 INFO L280 TraceCheckUtils]: 21: Hoare triple {685#(<= 1 ~N~0)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L28 {685#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:43,175 INFO L280 TraceCheckUtils]: 22: Hoare triple {685#(<= 1 ~N~0)} ~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset; {685#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:43,176 INFO L280 TraceCheckUtils]: 23: Hoare triple {685#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L30 {685#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:43,178 INFO L280 TraceCheckUtils]: 24: Hoare triple {685#(<= 1 ~N~0)} ~i~0 := 0; {690#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 20:21:43,179 INFO L280 TraceCheckUtils]: 25: Hoare triple {690#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {678#false} is VALID [2020-07-10 20:21:43,180 INFO L280 TraceCheckUtils]: 26: Hoare triple {678#false} ~i~0 := 0; {678#false} is VALID [2020-07-10 20:21:43,180 INFO L280 TraceCheckUtils]: 27: Hoare triple {678#false} assume !(~i~0 < ~N~0); {678#false} is VALID [2020-07-10 20:21:43,181 INFO L280 TraceCheckUtils]: 28: Hoare triple {678#false} ~i~0 := 0; {678#false} is VALID [2020-07-10 20:21:43,181 INFO L280 TraceCheckUtils]: 29: Hoare triple {678#false} assume !(~i~0 < ~N~0); {678#false} is VALID [2020-07-10 20:21:43,181 INFO L280 TraceCheckUtils]: 30: Hoare triple {678#false} ~i~0 := 0; {678#false} is VALID [2020-07-10 20:21:43,182 INFO L280 TraceCheckUtils]: 31: Hoare triple {678#false} assume !(~i~0 < ~N~0); {678#false} is VALID [2020-07-10 20:21:43,182 INFO L280 TraceCheckUtils]: 32: Hoare triple {678#false} ~i~0 := 0; {678#false} is VALID [2020-07-10 20:21:43,183 INFO L280 TraceCheckUtils]: 33: Hoare triple {678#false} assume !!(~i~0 < ~N~0); {678#false} is VALID [2020-07-10 20:21:43,183 INFO L280 TraceCheckUtils]: 34: Hoare triple {678#false} SUMMARY for call #t~mem13 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); srcloc: L53 {678#false} is VALID [2020-07-10 20:21:43,183 INFO L263 TraceCheckUtils]: 35: Hoare triple {678#false} call __VERIFIER_assert((if #t~mem13 == ~N~0 then 1 else 0)); {678#false} is VALID [2020-07-10 20:21:43,184 INFO L280 TraceCheckUtils]: 36: Hoare triple {678#false} ~cond := #in~cond; {678#false} is VALID [2020-07-10 20:21:43,184 INFO L280 TraceCheckUtils]: 37: Hoare triple {678#false} assume 0 == ~cond; {678#false} is VALID [2020-07-10 20:21:43,185 INFO L280 TraceCheckUtils]: 38: Hoare triple {678#false} assume !false; {678#false} is VALID [2020-07-10 20:21:43,189 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 20:21:43,189 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:43,190 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [667525359] [2020-07-10 20:21:43,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:43,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:21:43,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441144621] [2020-07-10 20:21:43,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-07-10 20:21:43,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:43,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:21:43,256 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 20:21:43,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:21:43,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:43,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:21:43,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:21:43,257 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 5 states. [2020-07-10 20:21:44,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:44,012 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2020-07-10 20:21:44,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:21:44,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-07-10 20:21:44,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:44,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2020-07-10 20:21:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2020-07-10 20:21:44,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 158 transitions. [2020-07-10 20:21:44,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:44,243 INFO L225 Difference]: With dead ends: 146 [2020-07-10 20:21:44,243 INFO L226 Difference]: Without dead ends: 104 [2020-07-10 20:21:44,245 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 20:21:44,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-07-10 20:21:44,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 76. [2020-07-10 20:21:44,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:44,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 76 states. [2020-07-10 20:21:44,391 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 76 states. [2020-07-10 20:21:44,392 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 76 states. [2020-07-10 20:21:44,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:44,398 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2020-07-10 20:21:44,398 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2020-07-10 20:21:44,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:44,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:44,404 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 104 states. [2020-07-10 20:21:44,405 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 104 states. [2020-07-10 20:21:44,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:44,411 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2020-07-10 20:21:44,411 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2020-07-10 20:21:44,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:44,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:44,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:44,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-10 20:21:44,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2020-07-10 20:21:44,417 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 39 [2020-07-10 20:21:44,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:44,417 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2020-07-10 20:21:44,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:21:44,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 80 transitions. [2020-07-10 20:21:44,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:44,527 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2020-07-10 20:21:44,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-10 20:21:44,530 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:44,530 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:44,530 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:21:44,531 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:44,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:44,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1779508689, now seen corresponding path program 1 times [2020-07-10 20:21:44,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:44,532 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [259457380] [2020-07-10 20:21:44,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:44,569 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:21:44,570 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 20:21:44,577 INFO L168 Benchmark]: Toolchain (without parser) took 4599.74 ms. Allocated memory was 137.9 MB in the beginning and 248.0 MB in the end (delta: 110.1 MB). Free memory was 102.9 MB in the beginning and 173.0 MB in the end (delta: -70.0 MB). Peak memory consumption was 40.1 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:44,578 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 20:21:44,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.73 ms. Allocated memory is still 137.9 MB. Free memory was 102.7 MB in the beginning and 91.2 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:44,580 INFO L168 Benchmark]: Boogie Preprocessor took 149.11 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 91.2 MB in the beginning and 180.4 MB in the end (delta: -89.2 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:44,581 INFO L168 Benchmark]: RCFGBuilder took 691.64 ms. Allocated memory is still 202.9 MB. Free memory was 179.7 MB in the beginning and 145.5 MB in the end (delta: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:44,582 INFO L168 Benchmark]: TraceAbstraction took 3398.06 ms. Allocated memory was 202.9 MB in the beginning and 248.0 MB in the end (delta: 45.1 MB). Free memory was 144.8 MB in the beginning and 173.0 MB in the end (delta: -28.1 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:44,587 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.37 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 352.73 ms. Allocated memory is still 137.9 MB. Free memory was 102.7 MB in the beginning and 91.2 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 149.11 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 91.2 MB in the beginning and 180.4 MB in the end (delta: -89.2 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 691.64 ms. Allocated memory is still 202.9 MB. Free memory was 179.7 MB in the beginning and 145.5 MB in the end (delta: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3398.06 ms. Allocated memory was 202.9 MB in the beginning and 248.0 MB in the end (delta: 45.1 MB). Free memory was 144.8 MB in the beginning and 173.0 MB in the end (delta: -28.1 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...