/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/modsf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:47:23,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:47:23,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:47:23,660 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:47:23,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:47:23,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:47:23,663 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:47:23,665 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:47:23,667 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:47:23,667 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:47:23,668 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:47:23,669 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:47:23,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:47:23,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:47:23,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:47:23,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:47:23,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:47:23,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:47:23,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:47:23,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:47:23,680 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:47:23,681 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:47:23,682 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:47:23,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:47:23,689 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:47:23,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:47:23,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:47:23,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:47:23,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:47:23,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:47:23,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:47:23,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:47:23,698 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:47:23,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:47:23,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:47:23,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:47:23,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:47:23,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:47:23,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:47:23,707 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:47:23,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:47:23,710 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:47:23,725 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:47:23,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:47:23,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:47:23,728 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:47:23,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:47:23,729 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:47:23,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:47:23,729 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:47:23,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:47:23,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:47:23,730 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:47:23,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:47:23,731 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:47:23,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:47:23,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:47:23,732 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:47:23,732 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:47:23,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:47:23,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:23,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:47:23,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:47:23,733 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:47:23,733 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:47:24,089 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:47:24,108 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:47:24,112 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:47:24,114 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:47:24,115 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:47:24,116 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/modsf.c [2020-07-18 00:47:24,196 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c31a89f7d/96bd3426fc0f4ac99e5c962ad02ebe05/FLAG11e6a751d [2020-07-18 00:47:24,693 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:47:24,695 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/modsf.c [2020-07-18 00:47:24,701 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c31a89f7d/96bd3426fc0f4ac99e5c962ad02ebe05/FLAG11e6a751d [2020-07-18 00:47:25,036 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c31a89f7d/96bd3426fc0f4ac99e5c962ad02ebe05 [2020-07-18 00:47:25,045 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:47:25,048 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:47:25,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:25,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:47:25,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:47:25,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:25" (1/1) ... [2020-07-18 00:47:25,058 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 18.07 12:47:25, skipping insertion in model container [2020-07-18 00:47:25,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:25" (1/1) ... [2020-07-18 00:47:25,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:47:25,087 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:47:25,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:25,289 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:47:25,320 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:25,343 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:47:25,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:25 WrapperNode [2020-07-18 00:47:25,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:25,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:47:25,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:47:25,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:47:25,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:25" (1/1) ... [2020-07-18 00:47:25,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:25" (1/1) ... [2020-07-18 00:47:25,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:25" (1/1) ... [2020-07-18 00:47:25,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:25" (1/1) ... [2020-07-18 00:47:25,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:25" (1/1) ... [2020-07-18 00:47:25,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:25" (1/1) ... [2020-07-18 00:47:25,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:25" (1/1) ... [2020-07-18 00:47:25,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:47:25,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:47:25,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:47:25,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:47:25,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:25" (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-18 00:47:25,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:47:25,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:47:25,651 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 00:47:25,651 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:47:25,652 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:47:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:47:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:47:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 00:47:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:47:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:47:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 00:47:25,653 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:47:25,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 00:47:25,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 00:47:25,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:47:25,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:47:25,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:47:25,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:47:25,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:47:26,218 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:47:26,219 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-18 00:47:26,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:26 BoogieIcfgContainer [2020-07-18 00:47:26,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:47:26,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:47:26,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:47:26,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:47:26,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:47:25" (1/3) ... [2020-07-18 00:47:26,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f2df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:26, skipping insertion in model container [2020-07-18 00:47:26,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:25" (2/3) ... [2020-07-18 00:47:26,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f2df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:26, skipping insertion in model container [2020-07-18 00:47:26,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:26" (3/3) ... [2020-07-18 00:47:26,235 INFO L109 eAbstractionObserver]: Analyzing ICFG modsf.c [2020-07-18 00:47:26,247 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:47:26,256 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:47:26,271 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:47:26,297 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:47:26,297 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:47:26,297 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:47:26,297 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:47:26,298 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:47:26,298 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:47:26,299 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:47:26,299 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:47:26,317 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2020-07-18 00:47:26,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-18 00:47:26,331 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:26,332 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] [2020-07-18 00:47:26,333 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:26,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:26,340 INFO L82 PathProgramCache]: Analyzing trace with hash 731228111, now seen corresponding path program 1 times [2020-07-18 00:47:26,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:26,351 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [425882481] [2020-07-18 00:47:26,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:26,618 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-18 00:47:26,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} #valid := #valid[0 := 0]; {84#true} is VALID [2020-07-18 00:47:26,619 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} assume 0 < #StackHeapBarrier; {84#true} is VALID [2020-07-18 00:47:26,620 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#true} ~N~0 := 0; {84#true} is VALID [2020-07-18 00:47:26,620 INFO L280 TraceCheckUtils]: 4: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-18 00:47:26,621 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {84#true} {84#true} #150#return; {84#true} is VALID [2020-07-18 00:47:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:26,641 INFO L280 TraceCheckUtils]: 0: Hoare triple {84#true} ~cond := #in~cond; {84#true} is VALID [2020-07-18 00:47:26,642 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} assume !(0 == ~cond); {84#true} is VALID [2020-07-18 00:47:26,643 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-18 00:47:26,644 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {84#true} {84#true} #146#return; {84#true} is VALID [2020-07-18 00:47:26,647 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-18 00:47:26,648 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-18 00:47:26,648 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} #valid := #valid[0 := 0]; {84#true} is VALID [2020-07-18 00:47:26,648 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#true} assume 0 < #StackHeapBarrier; {84#true} is VALID [2020-07-18 00:47:26,649 INFO L280 TraceCheckUtils]: 4: Hoare triple {84#true} ~N~0 := 0; {84#true} is VALID [2020-07-18 00:47:26,649 INFO L280 TraceCheckUtils]: 5: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-18 00:47:26,649 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {84#true} {84#true} #150#return; {84#true} is VALID [2020-07-18 00:47:26,650 INFO L263 TraceCheckUtils]: 7: Hoare triple {84#true} call #t~ret14 := main(); {84#true} is VALID [2020-07-18 00:47:26,650 INFO L280 TraceCheckUtils]: 8: Hoare triple {84#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {84#true} is VALID [2020-07-18 00:47:26,650 INFO L280 TraceCheckUtils]: 9: Hoare triple {84#true} ~N~0 := #t~nondet0; {84#true} is VALID [2020-07-18 00:47:26,651 INFO L280 TraceCheckUtils]: 10: Hoare triple {84#true} havoc #t~nondet0; {84#true} is VALID [2020-07-18 00:47:26,651 INFO L280 TraceCheckUtils]: 11: Hoare triple {84#true} assume !(~N~0 <= 0); {84#true} is VALID [2020-07-18 00:47:26,652 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-18 00:47:26,652 INFO L280 TraceCheckUtils]: 13: Hoare triple {84#true} ~cond := #in~cond; {84#true} is VALID [2020-07-18 00:47:26,652 INFO L280 TraceCheckUtils]: 14: Hoare triple {84#true} assume !(0 == ~cond); {84#true} is VALID [2020-07-18 00:47:26,653 INFO L280 TraceCheckUtils]: 15: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-18 00:47:26,653 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {84#true} {84#true} #146#return; {84#true} is VALID [2020-07-18 00:47:26,654 INFO L280 TraceCheckUtils]: 17: Hoare triple {84#true} havoc ~i~0; {84#true} is VALID [2020-07-18 00:47:26,654 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-18 00:47:26,655 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-18 00:47:26,655 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-18 00:47:26,655 INFO L280 TraceCheckUtils]: 21: Hoare triple {84#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {84#true} is VALID [2020-07-18 00:47:26,656 INFO L280 TraceCheckUtils]: 22: Hoare triple {84#true} ~i~0 := 0; {84#true} is VALID [2020-07-18 00:47:26,657 INFO L280 TraceCheckUtils]: 23: Hoare triple {84#true} assume !true; {85#false} is VALID [2020-07-18 00:47:26,657 INFO L280 TraceCheckUtils]: 24: Hoare triple {85#false} ~i~0 := 0; {85#false} is VALID [2020-07-18 00:47:26,657 INFO L280 TraceCheckUtils]: 25: Hoare triple {85#false} assume !true; {85#false} is VALID [2020-07-18 00:47:26,658 INFO L280 TraceCheckUtils]: 26: Hoare triple {85#false} ~i~0 := 0; {85#false} is VALID [2020-07-18 00:47:26,658 INFO L280 TraceCheckUtils]: 27: Hoare triple {85#false} assume !true; {85#false} is VALID [2020-07-18 00:47:26,658 INFO L280 TraceCheckUtils]: 28: Hoare triple {85#false} ~i~0 := 0; {85#false} is VALID [2020-07-18 00:47:26,659 INFO L280 TraceCheckUtils]: 29: Hoare triple {85#false} assume !true; {85#false} is VALID [2020-07-18 00:47:26,659 INFO L280 TraceCheckUtils]: 30: Hoare triple {85#false} ~i~0 := 0; {85#false} is VALID [2020-07-18 00:47:26,659 INFO L280 TraceCheckUtils]: 31: Hoare triple {85#false} assume !!(~i~0 < ~N~0); {85#false} is VALID [2020-07-18 00:47:26,660 INFO L280 TraceCheckUtils]: 32: Hoare triple {85#false} SUMMARY for call #t~mem13 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); srcloc: L52 {85#false} is VALID [2020-07-18 00:47:26,660 INFO L263 TraceCheckUtils]: 33: Hoare triple {85#false} call __VERIFIER_assert((if 1 == #t~mem13 then 1 else 0)); {85#false} is VALID [2020-07-18 00:47:26,661 INFO L280 TraceCheckUtils]: 34: Hoare triple {85#false} ~cond := #in~cond; {85#false} is VALID [2020-07-18 00:47:26,661 INFO L280 TraceCheckUtils]: 35: Hoare triple {85#false} assume 0 == ~cond; {85#false} is VALID [2020-07-18 00:47:26,661 INFO L280 TraceCheckUtils]: 36: Hoare triple {85#false} assume !false; {85#false} is VALID [2020-07-18 00:47:26,668 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-18 00:47:26,671 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:26,673 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [425882481] [2020-07-18 00:47:26,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:26,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:47:26,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800186553] [2020-07-18 00:47:26,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-18 00:47:26,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:26,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:47:26,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:26,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:47:26,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:26,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:47:26,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:47:26,766 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 3 states. [2020-07-18 00:47:27,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:27,229 INFO L93 Difference]: Finished difference Result 145 states and 168 transitions. [2020-07-18 00:47:27,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:47:27,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-18 00:47:27,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:27,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:47:27,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-18 00:47:27,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:47:27,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-18 00:47:27,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2020-07-18 00:47:27,459 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-18 00:47:27,476 INFO L225 Difference]: With dead ends: 145 [2020-07-18 00:47:27,477 INFO L226 Difference]: Without dead ends: 72 [2020-07-18 00:47:27,481 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-18 00:47:27,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-18 00:47:27,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-07-18 00:47:27,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:27,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2020-07-18 00:47:27,588 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2020-07-18 00:47:27,589 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2020-07-18 00:47:27,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:27,597 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2020-07-18 00:47:27,597 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2020-07-18 00:47:27,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:27,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:27,599 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2020-07-18 00:47:27,599 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2020-07-18 00:47:27,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:27,606 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2020-07-18 00:47:27,606 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2020-07-18 00:47:27,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:27,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:27,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:27,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:27,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-18 00:47:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2020-07-18 00:47:27,615 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 37 [2020-07-18 00:47:27,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:27,616 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2020-07-18 00:47:27,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:47:27,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 76 transitions. [2020-07-18 00:47:27,718 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-18 00:47:27,719 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2020-07-18 00:47:27,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-18 00:47:27,721 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:27,721 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] [2020-07-18 00:47:27,721 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:47:27,721 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:27,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:27,722 INFO L82 PathProgramCache]: Analyzing trace with hash 681190783, now seen corresponding path program 1 times [2020-07-18 00:47:27,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:27,723 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1319710318] [2020-07-18 00:47:27,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:27,847 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-18 00:47:27,847 INFO L280 TraceCheckUtils]: 1: Hoare triple {677#true} #valid := #valid[0 := 0]; {677#true} is VALID [2020-07-18 00:47:27,848 INFO L280 TraceCheckUtils]: 2: Hoare triple {677#true} assume 0 < #StackHeapBarrier; {677#true} is VALID [2020-07-18 00:47:27,848 INFO L280 TraceCheckUtils]: 3: Hoare triple {677#true} ~N~0 := 0; {677#true} is VALID [2020-07-18 00:47:27,848 INFO L280 TraceCheckUtils]: 4: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-18 00:47:27,849 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {677#true} {677#true} #150#return; {677#true} is VALID [2020-07-18 00:47:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:27,856 INFO L280 TraceCheckUtils]: 0: Hoare triple {677#true} ~cond := #in~cond; {677#true} is VALID [2020-07-18 00:47:27,857 INFO L280 TraceCheckUtils]: 1: Hoare triple {677#true} assume !(0 == ~cond); {677#true} is VALID [2020-07-18 00:47:27,857 INFO L280 TraceCheckUtils]: 2: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-18 00:47:27,858 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {677#true} {685#(<= 1 ~N~0)} #146#return; {685#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:27,859 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-18 00:47:27,860 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-18 00:47:27,860 INFO L280 TraceCheckUtils]: 2: Hoare triple {677#true} #valid := #valid[0 := 0]; {677#true} is VALID [2020-07-18 00:47:27,860 INFO L280 TraceCheckUtils]: 3: Hoare triple {677#true} assume 0 < #StackHeapBarrier; {677#true} is VALID [2020-07-18 00:47:27,861 INFO L280 TraceCheckUtils]: 4: Hoare triple {677#true} ~N~0 := 0; {677#true} is VALID [2020-07-18 00:47:27,861 INFO L280 TraceCheckUtils]: 5: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-18 00:47:27,861 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {677#true} {677#true} #150#return; {677#true} is VALID [2020-07-18 00:47:27,861 INFO L263 TraceCheckUtils]: 7: Hoare triple {677#true} call #t~ret14 := main(); {677#true} is VALID [2020-07-18 00:47:27,862 INFO L280 TraceCheckUtils]: 8: Hoare triple {677#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {677#true} is VALID [2020-07-18 00:47:27,862 INFO L280 TraceCheckUtils]: 9: Hoare triple {677#true} ~N~0 := #t~nondet0; {677#true} is VALID [2020-07-18 00:47:27,862 INFO L280 TraceCheckUtils]: 10: Hoare triple {677#true} havoc #t~nondet0; {677#true} is VALID [2020-07-18 00:47:27,864 INFO L280 TraceCheckUtils]: 11: Hoare triple {677#true} assume !(~N~0 <= 0); {685#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:27,864 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-18 00:47:27,864 INFO L280 TraceCheckUtils]: 13: Hoare triple {677#true} ~cond := #in~cond; {677#true} is VALID [2020-07-18 00:47:27,865 INFO L280 TraceCheckUtils]: 14: Hoare triple {677#true} assume !(0 == ~cond); {677#true} is VALID [2020-07-18 00:47:27,865 INFO L280 TraceCheckUtils]: 15: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-18 00:47:27,866 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {677#true} {685#(<= 1 ~N~0)} #146#return; {685#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:27,867 INFO L280 TraceCheckUtils]: 17: Hoare triple {685#(<= 1 ~N~0)} havoc ~i~0; {685#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:27,867 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-18 00:47:27,868 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-18 00:47:27,869 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-18 00:47:27,870 INFO L280 TraceCheckUtils]: 21: Hoare triple {685#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {685#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:27,871 INFO L280 TraceCheckUtils]: 22: Hoare triple {685#(<= 1 ~N~0)} ~i~0 := 0; {690#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-18 00:47:27,872 INFO L280 TraceCheckUtils]: 23: Hoare triple {690#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {678#false} is VALID [2020-07-18 00:47:27,872 INFO L280 TraceCheckUtils]: 24: Hoare triple {678#false} ~i~0 := 0; {678#false} is VALID [2020-07-18 00:47:27,873 INFO L280 TraceCheckUtils]: 25: Hoare triple {678#false} assume !(~i~0 < ~N~0); {678#false} is VALID [2020-07-18 00:47:27,873 INFO L280 TraceCheckUtils]: 26: Hoare triple {678#false} ~i~0 := 0; {678#false} is VALID [2020-07-18 00:47:27,873 INFO L280 TraceCheckUtils]: 27: Hoare triple {678#false} assume !(~i~0 < ~N~0); {678#false} is VALID [2020-07-18 00:47:27,873 INFO L280 TraceCheckUtils]: 28: Hoare triple {678#false} ~i~0 := 0; {678#false} is VALID [2020-07-18 00:47:27,874 INFO L280 TraceCheckUtils]: 29: Hoare triple {678#false} assume !(~i~0 < ~N~0); {678#false} is VALID [2020-07-18 00:47:27,874 INFO L280 TraceCheckUtils]: 30: Hoare triple {678#false} ~i~0 := 0; {678#false} is VALID [2020-07-18 00:47:27,874 INFO L280 TraceCheckUtils]: 31: Hoare triple {678#false} assume !!(~i~0 < ~N~0); {678#false} is VALID [2020-07-18 00:47:27,875 INFO L280 TraceCheckUtils]: 32: Hoare triple {678#false} SUMMARY for call #t~mem13 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); srcloc: L52 {678#false} is VALID [2020-07-18 00:47:27,875 INFO L263 TraceCheckUtils]: 33: Hoare triple {678#false} call __VERIFIER_assert((if 1 == #t~mem13 then 1 else 0)); {678#false} is VALID [2020-07-18 00:47:27,875 INFO L280 TraceCheckUtils]: 34: Hoare triple {678#false} ~cond := #in~cond; {678#false} is VALID [2020-07-18 00:47:27,876 INFO L280 TraceCheckUtils]: 35: Hoare triple {678#false} assume 0 == ~cond; {678#false} is VALID [2020-07-18 00:47:27,876 INFO L280 TraceCheckUtils]: 36: Hoare triple {678#false} assume !false; {678#false} is VALID [2020-07-18 00:47:27,879 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-18 00:47:27,883 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:27,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1319710318] [2020-07-18 00:47:27,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:27,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:47:27,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381672359] [2020-07-18 00:47:27,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-07-18 00:47:27,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:27,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:47:27,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:27,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:47:27,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:27,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:47:27,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:47:27,948 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 5 states. [2020-07-18 00:47:28,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:28,673 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2020-07-18 00:47:28,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:47:28,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-07-18 00:47:28,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:28,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2020-07-18 00:47:28,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:28,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2020-07-18 00:47:28,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 162 transitions. [2020-07-18 00:47:28,890 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:28,894 INFO L225 Difference]: With dead ends: 150 [2020-07-18 00:47:28,895 INFO L226 Difference]: Without dead ends: 106 [2020-07-18 00:47:28,897 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:47:28,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-07-18 00:47:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2020-07-18 00:47:29,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:29,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 76 states. [2020-07-18 00:47:29,031 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 76 states. [2020-07-18 00:47:29,031 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 76 states. [2020-07-18 00:47:29,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:29,041 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2020-07-18 00:47:29,043 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2020-07-18 00:47:29,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:29,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:29,047 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 106 states. [2020-07-18 00:47:29,047 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 106 states. [2020-07-18 00:47:29,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:29,058 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2020-07-18 00:47:29,058 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2020-07-18 00:47:29,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:29,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:29,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:29,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-18 00:47:29,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2020-07-18 00:47:29,067 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 37 [2020-07-18 00:47:29,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:29,070 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2020-07-18 00:47:29,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:47:29,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 80 transitions. [2020-07-18 00:47:29,183 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-18 00:47:29,183 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2020-07-18 00:47:29,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-18 00:47:29,185 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:29,185 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-18 00:47:29,186 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:47:29,186 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:29,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:29,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1093467533, now seen corresponding path program 1 times [2020-07-18 00:47:29,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:29,187 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1915096599] [2020-07-18 00:47:29,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:29,237 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:47:29,237 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:458) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:290) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:191) 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-18 00:47:29,243 INFO L168 Benchmark]: Toolchain (without parser) took 4195.34 ms. Allocated memory was 149.4 MB in the beginning and 246.4 MB in the end (delta: 97.0 MB). Free memory was 107.3 MB in the beginning and 132.8 MB in the end (delta: -25.6 MB). Peak memory consumption was 71.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:29,244 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 149.4 MB. Free memory was 126.0 MB in the beginning and 125.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 00:47:29,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.13 ms. Allocated memory is still 149.4 MB. Free memory was 106.8 MB in the beginning and 95.5 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:29,246 INFO L168 Benchmark]: Boogie Preprocessor took 220.74 ms. Allocated memory was 149.4 MB in the beginning and 205.0 MB in the end (delta: 55.6 MB). Free memory was 95.5 MB in the beginning and 182.7 MB in the end (delta: -87.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:29,247 INFO L168 Benchmark]: RCFGBuilder took 658.51 ms. Allocated memory is still 205.0 MB. Free memory was 182.1 MB in the beginning and 148.2 MB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:29,247 INFO L168 Benchmark]: TraceAbstraction took 3014.60 ms. Allocated memory was 205.0 MB in the beginning and 246.4 MB in the end (delta: 41.4 MB). Free memory was 147.6 MB in the beginning and 132.8 MB in the end (delta: 14.7 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:29,251 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.21 ms. Allocated memory is still 149.4 MB. Free memory was 126.0 MB in the beginning and 125.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 295.13 ms. Allocated memory is still 149.4 MB. Free memory was 106.8 MB in the beginning and 95.5 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 220.74 ms. Allocated memory was 149.4 MB in the beginning and 205.0 MB in the end (delta: 55.6 MB). Free memory was 95.5 MB in the beginning and 182.7 MB in the end (delta: -87.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 658.51 ms. Allocated memory is still 205.0 MB. Free memory was 182.1 MB in the beginning and 148.2 MB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3014.60 ms. Allocated memory was 205.0 MB in the beginning and 246.4 MB in the end (delta: 41.4 MB). Free memory was 147.6 MB in the beginning and 132.8 MB in the end (delta: 14.7 MB). Peak memory consumption was 56.2 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:458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...