/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/ss1f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:21:40,179 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:21:40,181 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:21:40,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:21:40,195 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:21:40,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:21:40,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:21:40,199 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:21:40,201 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:21:40,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:21:40,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:21:40,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:21:40,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:21:40,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:21:40,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:21:40,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:21:40,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:21:40,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:21:40,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:21:40,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:21:40,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:21:40,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:21:40,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:21:40,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:21:40,236 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:21:40,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:21:40,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:21:40,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:21:40,238 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:21:40,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:21:40,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:21:40,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:21:40,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:21:40,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:21:40,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:21:40,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:21:40,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:21:40,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:21:40,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:21:40,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:21:40,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:21:40,254 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:40,270 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:21:40,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:21:40,272 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:21:40,272 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:21:40,273 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:21:40,273 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:21:40,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:21:40,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:21:40,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:21:40,274 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:21:40,275 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:21:40,275 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:21:40,275 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:21:40,275 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:21:40,276 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:21:40,276 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:21:40,276 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:21:40,276 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:21:40,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:40,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:21:40,277 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:21:40,277 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:21:40,277 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:21:40,584 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:21:40,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:21:40,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:21:40,604 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:21:40,605 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:21:40,605 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ss1f.c [2020-07-10 20:21:40,671 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d0790ec8/49cc771447e44a4a8c5dc61079cd1b22/FLAGd42bcc8f2 [2020-07-10 20:21:41,092 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:21:41,093 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ss1f.c [2020-07-10 20:21:41,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d0790ec8/49cc771447e44a4a8c5dc61079cd1b22/FLAGd42bcc8f2 [2020-07-10 20:21:41,487 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d0790ec8/49cc771447e44a4a8c5dc61079cd1b22 [2020-07-10 20:21:41,498 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:21:41,501 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:21:41,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:41,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:21:41,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:21:41,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:41" (1/1) ... [2020-07-10 20:21:41,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@704c966c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:41, skipping insertion in model container [2020-07-10 20:21:41,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:41" (1/1) ... [2020-07-10 20:21:41,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:21:41,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:21:41,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:41,776 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:21:41,805 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:41,922 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:21:41,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:41 WrapperNode [2020-07-10 20:21:41,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:41,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:21:41,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:21:41,924 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:21:41,937 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:41" (1/1) ... [2020-07-10 20:21:41,937 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:41" (1/1) ... [2020-07-10 20:21:41,945 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:41" (1/1) ... [2020-07-10 20:21:41,945 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:41" (1/1) ... [2020-07-10 20:21:41,959 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:41" (1/1) ... [2020-07-10 20:21:41,969 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:41" (1/1) ... [2020-07-10 20:21:41,974 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:41" (1/1) ... [2020-07-10 20:21:41,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:21:41,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:21:41,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:21:41,980 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:21:41,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:41" (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:42,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:21:42,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:21:42,058 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:21:42,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:21:42,059 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:21:42,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:21:42,059 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:21:42,059 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:21:42,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:21:42,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:21:42,060 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 20:21:42,060 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:21:42,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:21:42,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 20:21:42,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:21:42,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:21:42,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:21:42,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:21:42,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:21:42,542 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:21:42,543 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 20:21:42,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:42 BoogieIcfgContainer [2020-07-10 20:21:42,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:21:42,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:21:42,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:21:42,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:21:42,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:21:41" (1/3) ... [2020-07-10 20:21:42,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35db82c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:42, skipping insertion in model container [2020-07-10 20:21:42,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:41" (2/3) ... [2020-07-10 20:21:42,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35db82c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:42, skipping insertion in model container [2020-07-10 20:21:42,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:42" (3/3) ... [2020-07-10 20:21:42,559 INFO L109 eAbstractionObserver]: Analyzing ICFG ss1f.c [2020-07-10 20:21:42,572 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:21:42,582 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:21:42,597 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:21:42,621 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:21:42,622 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:21:42,622 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:21:42,622 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:21:42,622 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:21:42,623 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:21:42,623 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:21:42,623 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:21:42,645 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2020-07-10 20:21:42,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-10 20:21:42,664 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:42,665 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] [2020-07-10 20:21:42,665 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:42,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:42,673 INFO L82 PathProgramCache]: Analyzing trace with hash 441507982, now seen corresponding path program 1 times [2020-07-10 20:21:42,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:42,684 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [786197078] [2020-07-10 20:21:42,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:43,060 INFO L280 TraceCheckUtils]: 0: Hoare triple {91#(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; {79#true} is VALID [2020-07-10 20:21:43,060 INFO L280 TraceCheckUtils]: 1: Hoare triple {79#true} #valid := #valid[0 := 0]; {79#true} is VALID [2020-07-10 20:21:43,061 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} assume 0 < #StackHeapBarrier; {79#true} is VALID [2020-07-10 20:21:43,063 INFO L280 TraceCheckUtils]: 3: Hoare triple {79#true} ~N~0 := 0; {79#true} is VALID [2020-07-10 20:21:43,063 INFO L280 TraceCheckUtils]: 4: Hoare triple {79#true} assume true; {79#true} is VALID [2020-07-10 20:21:43,064 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {79#true} {79#true} #134#return; {79#true} is VALID [2020-07-10 20:21:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:43,087 INFO L280 TraceCheckUtils]: 0: Hoare triple {79#true} ~cond := #in~cond; {79#true} is VALID [2020-07-10 20:21:43,088 INFO L280 TraceCheckUtils]: 1: Hoare triple {79#true} assume !(0 == ~cond); {79#true} is VALID [2020-07-10 20:21:43,089 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} assume true; {79#true} is VALID [2020-07-10 20:21:43,090 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {79#true} {79#true} #130#return; {79#true} is VALID [2020-07-10 20:21:43,093 INFO L263 TraceCheckUtils]: 0: Hoare triple {79#true} call ULTIMATE.init(); {91#(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,093 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#(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; {79#true} is VALID [2020-07-10 20:21:43,094 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} #valid := #valid[0 := 0]; {79#true} is VALID [2020-07-10 20:21:43,094 INFO L280 TraceCheckUtils]: 3: Hoare triple {79#true} assume 0 < #StackHeapBarrier; {79#true} is VALID [2020-07-10 20:21:43,095 INFO L280 TraceCheckUtils]: 4: Hoare triple {79#true} ~N~0 := 0; {79#true} is VALID [2020-07-10 20:21:43,095 INFO L280 TraceCheckUtils]: 5: Hoare triple {79#true} assume true; {79#true} is VALID [2020-07-10 20:21:43,096 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {79#true} {79#true} #134#return; {79#true} is VALID [2020-07-10 20:21:43,097 INFO L263 TraceCheckUtils]: 7: Hoare triple {79#true} call #t~ret13 := main(); {79#true} is VALID [2020-07-10 20:21:43,097 INFO L280 TraceCheckUtils]: 8: Hoare triple {79#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {79#true} is VALID [2020-07-10 20:21:43,098 INFO L280 TraceCheckUtils]: 9: Hoare triple {79#true} ~N~0 := #t~nondet0; {79#true} is VALID [2020-07-10 20:21:43,098 INFO L280 TraceCheckUtils]: 10: Hoare triple {79#true} havoc #t~nondet0; {79#true} is VALID [2020-07-10 20:21:43,098 INFO L280 TraceCheckUtils]: 11: Hoare triple {79#true} assume !(~N~0 <= 0); {79#true} is VALID [2020-07-10 20:21:43,099 INFO L263 TraceCheckUtils]: 12: Hoare triple {79#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {79#true} is VALID [2020-07-10 20:21:43,100 INFO L280 TraceCheckUtils]: 13: Hoare triple {79#true} ~cond := #in~cond; {79#true} is VALID [2020-07-10 20:21:43,101 INFO L280 TraceCheckUtils]: 14: Hoare triple {79#true} assume !(0 == ~cond); {79#true} is VALID [2020-07-10 20:21:43,101 INFO L280 TraceCheckUtils]: 15: Hoare triple {79#true} assume true; {79#true} is VALID [2020-07-10 20:21:43,102 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {79#true} {79#true} #130#return; {79#true} is VALID [2020-07-10 20:21:43,102 INFO L280 TraceCheckUtils]: 17: Hoare triple {79#true} havoc ~i~0; {79#true} is VALID [2020-07-10 20:21:43,103 INFO L280 TraceCheckUtils]: 18: Hoare triple {79#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {79#true} is VALID [2020-07-10 20:21:43,103 INFO L280 TraceCheckUtils]: 19: Hoare triple {79#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {79#true} is VALID [2020-07-10 20:21:43,104 INFO L280 TraceCheckUtils]: 20: Hoare triple {79#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {79#true} is VALID [2020-07-10 20:21:43,104 INFO L280 TraceCheckUtils]: 21: Hoare triple {79#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {79#true} is VALID [2020-07-10 20:21:43,105 INFO L280 TraceCheckUtils]: 22: Hoare triple {79#true} ~i~0 := 0; {79#true} is VALID [2020-07-10 20:21:43,107 INFO L280 TraceCheckUtils]: 23: Hoare triple {79#true} assume !true; {80#false} is VALID [2020-07-10 20:21:43,107 INFO L280 TraceCheckUtils]: 24: Hoare triple {80#false} ~i~0 := 0; {80#false} is VALID [2020-07-10 20:21:43,108 INFO L280 TraceCheckUtils]: 25: Hoare triple {80#false} assume !true; {80#false} is VALID [2020-07-10 20:21:43,108 INFO L280 TraceCheckUtils]: 26: Hoare triple {80#false} ~i~0 := 0; {80#false} is VALID [2020-07-10 20:21:43,109 INFO L280 TraceCheckUtils]: 27: Hoare triple {80#false} assume !true; {80#false} is VALID [2020-07-10 20:21:43,109 INFO L280 TraceCheckUtils]: 28: Hoare triple {80#false} ~i~0 := 0; {80#false} is VALID [2020-07-10 20:21:43,110 INFO L280 TraceCheckUtils]: 29: Hoare triple {80#false} assume !true; {80#false} is VALID [2020-07-10 20:21:43,110 INFO L280 TraceCheckUtils]: 30: Hoare triple {80#false} SUMMARY for call #t~mem12 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L44-6 {80#false} is VALID [2020-07-10 20:21:43,110 INFO L263 TraceCheckUtils]: 31: Hoare triple {80#false} call __VERIFIER_assert((if #t~mem12 == ~N~0 * (2 + ~N~0) then 1 else 0)); {80#false} is VALID [2020-07-10 20:21:43,111 INFO L280 TraceCheckUtils]: 32: Hoare triple {80#false} ~cond := #in~cond; {80#false} is VALID [2020-07-10 20:21:43,114 INFO L280 TraceCheckUtils]: 33: Hoare triple {80#false} assume 0 == ~cond; {80#false} is VALID [2020-07-10 20:21:43,114 INFO L280 TraceCheckUtils]: 34: Hoare triple {80#false} assume !false; {80#false} is VALID [2020-07-10 20:21:43,124 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,124 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:43,127 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [786197078] [2020-07-10 20:21:43,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:43,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:21:43,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519567403] [2020-07-10 20:21:43,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-07-10 20:21:43,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:43,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:21:43,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:43,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:21:43,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:43,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:21:43,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:21:43,248 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2020-07-10 20:21:43,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:43,735 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2020-07-10 20:21:43,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:21:43,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-07-10 20:21:43,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:43,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2020-07-10 20:21:43,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:43,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2020-07-10 20:21:43,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 154 transitions. [2020-07-10 20:21:43,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:43,963 INFO L225 Difference]: With dead ends: 135 [2020-07-10 20:21:43,964 INFO L226 Difference]: Without dead ends: 64 [2020-07-10 20:21:43,968 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:43,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-10 20:21:44,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-07-10 20:21:44,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:44,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2020-07-10 20:21:44,068 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2020-07-10 20:21:44,069 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2020-07-10 20:21:44,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:44,075 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2020-07-10 20:21:44,075 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2020-07-10 20:21:44,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:44,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:44,077 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2020-07-10 20:21:44,077 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2020-07-10 20:21:44,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:44,083 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2020-07-10 20:21:44,084 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2020-07-10 20:21:44,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:44,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:44,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:44,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:44,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-10 20:21:44,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2020-07-10 20:21:44,092 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 35 [2020-07-10 20:21:44,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:44,092 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2020-07-10 20:21:44,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:21:44,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 67 transitions. [2020-07-10 20:21:44,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:44,174 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2020-07-10 20:21:44,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-10 20:21:44,176 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:44,176 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:44,176 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:21:44,177 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:44,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:44,177 INFO L82 PathProgramCache]: Analyzing trace with hash 280562238, now seen corresponding path program 1 times [2020-07-10 20:21:44,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:44,178 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1933508471] [2020-07-10 20:21:44,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:44,311 INFO L280 TraceCheckUtils]: 0: Hoare triple {634#(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; {620#true} is VALID [2020-07-10 20:21:44,312 INFO L280 TraceCheckUtils]: 1: Hoare triple {620#true} #valid := #valid[0 := 0]; {620#true} is VALID [2020-07-10 20:21:44,312 INFO L280 TraceCheckUtils]: 2: Hoare triple {620#true} assume 0 < #StackHeapBarrier; {620#true} is VALID [2020-07-10 20:21:44,313 INFO L280 TraceCheckUtils]: 3: Hoare triple {620#true} ~N~0 := 0; {620#true} is VALID [2020-07-10 20:21:44,313 INFO L280 TraceCheckUtils]: 4: Hoare triple {620#true} assume true; {620#true} is VALID [2020-07-10 20:21:44,314 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {620#true} {620#true} #134#return; {620#true} is VALID [2020-07-10 20:21:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:44,322 INFO L280 TraceCheckUtils]: 0: Hoare triple {620#true} ~cond := #in~cond; {620#true} is VALID [2020-07-10 20:21:44,323 INFO L280 TraceCheckUtils]: 1: Hoare triple {620#true} assume !(0 == ~cond); {620#true} is VALID [2020-07-10 20:21:44,323 INFO L280 TraceCheckUtils]: 2: Hoare triple {620#true} assume true; {620#true} is VALID [2020-07-10 20:21:44,324 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {620#true} {628#(<= 1 ~N~0)} #130#return; {628#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:44,326 INFO L263 TraceCheckUtils]: 0: Hoare triple {620#true} call ULTIMATE.init(); {634#(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:44,326 INFO L280 TraceCheckUtils]: 1: Hoare triple {634#(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; {620#true} is VALID [2020-07-10 20:21:44,326 INFO L280 TraceCheckUtils]: 2: Hoare triple {620#true} #valid := #valid[0 := 0]; {620#true} is VALID [2020-07-10 20:21:44,327 INFO L280 TraceCheckUtils]: 3: Hoare triple {620#true} assume 0 < #StackHeapBarrier; {620#true} is VALID [2020-07-10 20:21:44,327 INFO L280 TraceCheckUtils]: 4: Hoare triple {620#true} ~N~0 := 0; {620#true} is VALID [2020-07-10 20:21:44,328 INFO L280 TraceCheckUtils]: 5: Hoare triple {620#true} assume true; {620#true} is VALID [2020-07-10 20:21:44,328 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {620#true} {620#true} #134#return; {620#true} is VALID [2020-07-10 20:21:44,328 INFO L263 TraceCheckUtils]: 7: Hoare triple {620#true} call #t~ret13 := main(); {620#true} is VALID [2020-07-10 20:21:44,329 INFO L280 TraceCheckUtils]: 8: Hoare triple {620#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {620#true} is VALID [2020-07-10 20:21:44,329 INFO L280 TraceCheckUtils]: 9: Hoare triple {620#true} ~N~0 := #t~nondet0; {620#true} is VALID [2020-07-10 20:21:44,329 INFO L280 TraceCheckUtils]: 10: Hoare triple {620#true} havoc #t~nondet0; {620#true} is VALID [2020-07-10 20:21:44,331 INFO L280 TraceCheckUtils]: 11: Hoare triple {620#true} assume !(~N~0 <= 0); {628#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:44,331 INFO L263 TraceCheckUtils]: 12: Hoare triple {628#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {620#true} is VALID [2020-07-10 20:21:44,332 INFO L280 TraceCheckUtils]: 13: Hoare triple {620#true} ~cond := #in~cond; {620#true} is VALID [2020-07-10 20:21:44,332 INFO L280 TraceCheckUtils]: 14: Hoare triple {620#true} assume !(0 == ~cond); {620#true} is VALID [2020-07-10 20:21:44,332 INFO L280 TraceCheckUtils]: 15: Hoare triple {620#true} assume true; {620#true} is VALID [2020-07-10 20:21:44,334 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {620#true} {628#(<= 1 ~N~0)} #130#return; {628#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:44,335 INFO L280 TraceCheckUtils]: 17: Hoare triple {628#(<= 1 ~N~0)} havoc ~i~0; {628#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:44,336 INFO L280 TraceCheckUtils]: 18: Hoare triple {628#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {628#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:44,337 INFO L280 TraceCheckUtils]: 19: Hoare triple {628#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {628#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:44,337 INFO L280 TraceCheckUtils]: 20: Hoare triple {628#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {628#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:44,338 INFO L280 TraceCheckUtils]: 21: Hoare triple {628#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {628#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:44,340 INFO L280 TraceCheckUtils]: 22: Hoare triple {628#(<= 1 ~N~0)} ~i~0 := 0; {633#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 20:21:44,341 INFO L280 TraceCheckUtils]: 23: Hoare triple {633#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {621#false} is VALID [2020-07-10 20:21:44,341 INFO L280 TraceCheckUtils]: 24: Hoare triple {621#false} ~i~0 := 0; {621#false} is VALID [2020-07-10 20:21:44,342 INFO L280 TraceCheckUtils]: 25: Hoare triple {621#false} assume !(~i~0 < ~N~0); {621#false} is VALID [2020-07-10 20:21:44,342 INFO L280 TraceCheckUtils]: 26: Hoare triple {621#false} ~i~0 := 0; {621#false} is VALID [2020-07-10 20:21:44,343 INFO L280 TraceCheckUtils]: 27: Hoare triple {621#false} assume !(~i~0 < ~N~0); {621#false} is VALID [2020-07-10 20:21:44,343 INFO L280 TraceCheckUtils]: 28: Hoare triple {621#false} ~i~0 := 0; {621#false} is VALID [2020-07-10 20:21:44,343 INFO L280 TraceCheckUtils]: 29: Hoare triple {621#false} assume !(~i~0 < ~N~0); {621#false} is VALID [2020-07-10 20:21:44,344 INFO L280 TraceCheckUtils]: 30: Hoare triple {621#false} SUMMARY for call #t~mem12 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L44-6 {621#false} is VALID [2020-07-10 20:21:44,344 INFO L263 TraceCheckUtils]: 31: Hoare triple {621#false} call __VERIFIER_assert((if #t~mem12 == ~N~0 * (2 + ~N~0) then 1 else 0)); {621#false} is VALID [2020-07-10 20:21:44,344 INFO L280 TraceCheckUtils]: 32: Hoare triple {621#false} ~cond := #in~cond; {621#false} is VALID [2020-07-10 20:21:44,345 INFO L280 TraceCheckUtils]: 33: Hoare triple {621#false} assume 0 == ~cond; {621#false} is VALID [2020-07-10 20:21:44,345 INFO L280 TraceCheckUtils]: 34: Hoare triple {621#false} assume !false; {621#false} is VALID [2020-07-10 20:21:44,348 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:44,349 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:44,349 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1933508471] [2020-07-10 20:21:44,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:44,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:21:44,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948634545] [2020-07-10 20:21:44,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-07-10 20:21:44,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:44,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:21:44,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:44,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:21:44,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:44,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:21:44,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:21:44,405 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 5 states. [2020-07-10 20:21:44,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:44,981 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2020-07-10 20:21:44,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:21:44,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-07-10 20:21:44,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:44,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:44,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2020-07-10 20:21:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:44,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2020-07-10 20:21:44,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 137 transitions. [2020-07-10 20:21:45,172 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:45,178 INFO L225 Difference]: With dead ends: 128 [2020-07-10 20:21:45,178 INFO L226 Difference]: Without dead ends: 92 [2020-07-10 20:21:45,180 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:45,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-10 20:21:45,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 68. [2020-07-10 20:21:45,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:45,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 68 states. [2020-07-10 20:21:45,285 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 68 states. [2020-07-10 20:21:45,285 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 68 states. [2020-07-10 20:21:45,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:45,291 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2020-07-10 20:21:45,291 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2020-07-10 20:21:45,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:45,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:45,292 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 92 states. [2020-07-10 20:21:45,292 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 92 states. [2020-07-10 20:21:45,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:45,297 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2020-07-10 20:21:45,298 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2020-07-10 20:21:45,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:45,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:45,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:45,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:45,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-10 20:21:45,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2020-07-10 20:21:45,303 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 35 [2020-07-10 20:21:45,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:45,303 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2020-07-10 20:21:45,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:21:45,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states and 71 transitions. [2020-07-10 20:21:45,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:45,402 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2020-07-10 20:21:45,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-10 20:21:45,407 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:45,407 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] [2020-07-10 20:21:45,407 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:21:45,408 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:45,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:45,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1152052174, now seen corresponding path program 1 times [2020-07-10 20:21:45,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:45,409 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2109130142] [2020-07-10 20:21:45,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:45,450 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:21:45,451 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:45,458 INFO L168 Benchmark]: Toolchain (without parser) took 3957.25 ms. Allocated memory was 144.7 MB in the beginning and 247.5 MB in the end (delta: 102.8 MB). Free memory was 102.9 MB in the beginning and 212.4 MB in the end (delta: -109.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 20:21:45,459 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.7 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:45,460 INFO L168 Benchmark]: CACSL2BoogieTranslator took 421.30 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 102.7 MB in the beginning and 180.6 MB in the end (delta: -77.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:45,461 INFO L168 Benchmark]: Boogie Preprocessor took 56.23 ms. Allocated memory is still 201.9 MB. Free memory was 180.6 MB in the beginning and 178.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:45,462 INFO L168 Benchmark]: RCFGBuilder took 567.80 ms. Allocated memory is still 201.9 MB. Free memory was 178.1 MB in the beginning and 145.8 MB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:45,463 INFO L168 Benchmark]: TraceAbstraction took 2905.57 ms. Allocated memory was 201.9 MB in the beginning and 247.5 MB in the end (delta: 45.6 MB). Free memory was 145.1 MB in the beginning and 212.4 MB in the end (delta: -67.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 20:21:45,467 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 144.7 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 421.30 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 102.7 MB in the beginning and 180.6 MB in the end (delta: -77.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.23 ms. Allocated memory is still 201.9 MB. Free memory was 180.6 MB in the beginning and 178.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 567.80 ms. Allocated memory is still 201.9 MB. Free memory was 178.1 MB in the beginning and 145.8 MB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2905.57 ms. Allocated memory was 201.9 MB in the beginning and 247.5 MB in the end (delta: 45.6 MB). Free memory was 145.1 MB in the beginning and 212.4 MB in the end (delta: -67.3 MB). There was no memory consumed. 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...