/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/ss3f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:21:42,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:21:42,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:21:42,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:21:42,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:21:42,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:21:42,647 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:21:42,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:21:42,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:21:42,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:21:42,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:21:42,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:21:42,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:21:42,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:21:42,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:21:42,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:21:42,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:21:42,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:21:42,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:21:42,681 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:21:42,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:21:42,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:21:42,688 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:21:42,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:21:42,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:21:42,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:21:42,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:21:42,695 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:21:42,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:21:42,698 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:21:42,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:21:42,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:21:42,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:21:42,702 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:21:42,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:21:42,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:21:42,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:21:42,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:21:42,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:21:42,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:21:42,709 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:21:42,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-10 20:21:42,732 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:21:42,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:21:42,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:21:42,735 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:21:42,735 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:21:42,735 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:21:42,736 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:21:42,736 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:21:42,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:21:42,736 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:21:42,737 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:21:42,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:21:42,738 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:21:42,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:21:42,738 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:21:42,739 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:21:42,739 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:21:42,739 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:21:42,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:42,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:21:42,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:21:42,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:21:42,740 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:21:43,010 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:21:43,023 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:21:43,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:21:43,028 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:21:43,028 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:21:43,029 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ss3f.c [2020-07-10 20:21:43,094 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70b70991e/0d1dc0b602c54a5884f14a42ba08183b/FLAG6a63fe8b2 [2020-07-10 20:21:43,565 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:21:43,566 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ss3f.c [2020-07-10 20:21:43,573 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70b70991e/0d1dc0b602c54a5884f14a42ba08183b/FLAG6a63fe8b2 [2020-07-10 20:21:43,918 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70b70991e/0d1dc0b602c54a5884f14a42ba08183b [2020-07-10 20:21:43,929 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:21:43,931 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:21:43,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:43,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:21:43,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:21:43,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:43" (1/1) ... [2020-07-10 20:21:43,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25505679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:43, skipping insertion in model container [2020-07-10 20:21:43,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:43" (1/1) ... [2020-07-10 20:21:43,951 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:21:43,973 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:21:44,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:44,173 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:21:44,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:44,221 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:21:44,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:44 WrapperNode [2020-07-10 20:21:44,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:44,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:21:44,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:21:44,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:21:44,323 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:44" (1/1) ... [2020-07-10 20:21:44,323 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:44" (1/1) ... [2020-07-10 20:21:44,344 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:44" (1/1) ... [2020-07-10 20:21:44,345 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:44" (1/1) ... [2020-07-10 20:21:44,369 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:44" (1/1) ... [2020-07-10 20:21:44,381 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:44" (1/1) ... [2020-07-10 20:21:44,385 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:44" (1/1) ... [2020-07-10 20:21:44,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:21:44,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:21:44,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:21:44,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:21:44,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:44" (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:44,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:21:44,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:21:44,453 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:21:44,453 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:21:44,453 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:21:44,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:21:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:21:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:21:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:21:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:21:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 20:21:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:21:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:21:44,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 20:21:44,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:21:44,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:21:44,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:21:44,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:21:44,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:21:44,993 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:21:44,994 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-10 20:21:44,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:44 BoogieIcfgContainer [2020-07-10 20:21:44,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:21:45,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:21:45,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:21:45,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:21:45,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:21:43" (1/3) ... [2020-07-10 20:21:45,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72608041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:45, skipping insertion in model container [2020-07-10 20:21:45,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:44" (2/3) ... [2020-07-10 20:21:45,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72608041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:45, skipping insertion in model container [2020-07-10 20:21:45,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:44" (3/3) ... [2020-07-10 20:21:45,009 INFO L109 eAbstractionObserver]: Analyzing ICFG ss3f.c [2020-07-10 20:21:45,020 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:21:45,029 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:21:45,044 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:21:45,069 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:21:45,069 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:21:45,069 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:21:45,070 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:21:45,070 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:21:45,070 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:21:45,071 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:21:45,071 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:21:45,088 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2020-07-10 20:21:45,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 20:21:45,102 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:45,103 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-10 20:21:45,104 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:45,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:45,111 INFO L82 PathProgramCache]: Analyzing trace with hash -464195749, now seen corresponding path program 1 times [2020-07-10 20:21:45,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:45,122 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1663497871] [2020-07-10 20:21:45,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:45,366 INFO L280 TraceCheckUtils]: 0: Hoare triple {97#(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; {85#true} is VALID [2020-07-10 20:21:45,367 INFO L280 TraceCheckUtils]: 1: Hoare triple {85#true} #valid := #valid[0 := 0]; {85#true} is VALID [2020-07-10 20:21:45,367 INFO L280 TraceCheckUtils]: 2: Hoare triple {85#true} assume 0 < #StackHeapBarrier; {85#true} is VALID [2020-07-10 20:21:45,368 INFO L280 TraceCheckUtils]: 3: Hoare triple {85#true} ~N~0 := 0; {85#true} is VALID [2020-07-10 20:21:45,369 INFO L280 TraceCheckUtils]: 4: Hoare triple {85#true} assume true; {85#true} is VALID [2020-07-10 20:21:45,369 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {85#true} {85#true} #151#return; {85#true} is VALID [2020-07-10 20:21:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:45,383 INFO L280 TraceCheckUtils]: 0: Hoare triple {85#true} ~cond := #in~cond; {85#true} is VALID [2020-07-10 20:21:45,383 INFO L280 TraceCheckUtils]: 1: Hoare triple {85#true} assume !(0 == ~cond); {85#true} is VALID [2020-07-10 20:21:45,384 INFO L280 TraceCheckUtils]: 2: Hoare triple {85#true} assume true; {85#true} is VALID [2020-07-10 20:21:45,385 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {85#true} {85#true} #147#return; {85#true} is VALID [2020-07-10 20:21:45,387 INFO L263 TraceCheckUtils]: 0: Hoare triple {85#true} call ULTIMATE.init(); {97#(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:45,387 INFO L280 TraceCheckUtils]: 1: Hoare triple {97#(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; {85#true} is VALID [2020-07-10 20:21:45,388 INFO L280 TraceCheckUtils]: 2: Hoare triple {85#true} #valid := #valid[0 := 0]; {85#true} is VALID [2020-07-10 20:21:45,389 INFO L280 TraceCheckUtils]: 3: Hoare triple {85#true} assume 0 < #StackHeapBarrier; {85#true} is VALID [2020-07-10 20:21:45,389 INFO L280 TraceCheckUtils]: 4: Hoare triple {85#true} ~N~0 := 0; {85#true} is VALID [2020-07-10 20:21:45,390 INFO L280 TraceCheckUtils]: 5: Hoare triple {85#true} assume true; {85#true} is VALID [2020-07-10 20:21:45,390 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {85#true} {85#true} #151#return; {85#true} is VALID [2020-07-10 20:21:45,391 INFO L263 TraceCheckUtils]: 7: Hoare triple {85#true} call #t~ret14 := main(); {85#true} is VALID [2020-07-10 20:21:45,391 INFO L280 TraceCheckUtils]: 8: Hoare triple {85#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {85#true} is VALID [2020-07-10 20:21:45,392 INFO L280 TraceCheckUtils]: 9: Hoare triple {85#true} ~N~0 := #t~nondet0; {85#true} is VALID [2020-07-10 20:21:45,392 INFO L280 TraceCheckUtils]: 10: Hoare triple {85#true} havoc #t~nondet0; {85#true} is VALID [2020-07-10 20:21:45,393 INFO L280 TraceCheckUtils]: 11: Hoare triple {85#true} assume !(~N~0 <= 0); {85#true} is VALID [2020-07-10 20:21:45,393 INFO L263 TraceCheckUtils]: 12: Hoare triple {85#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {85#true} is VALID [2020-07-10 20:21:45,393 INFO L280 TraceCheckUtils]: 13: Hoare triple {85#true} ~cond := #in~cond; {85#true} is VALID [2020-07-10 20:21:45,394 INFO L280 TraceCheckUtils]: 14: Hoare triple {85#true} assume !(0 == ~cond); {85#true} is VALID [2020-07-10 20:21:45,394 INFO L280 TraceCheckUtils]: 15: Hoare triple {85#true} assume true; {85#true} is VALID [2020-07-10 20:21:45,395 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {85#true} {85#true} #147#return; {85#true} is VALID [2020-07-10 20:21:45,395 INFO L280 TraceCheckUtils]: 17: Hoare triple {85#true} havoc ~i~0; {85#true} is VALID [2020-07-10 20:21:45,396 INFO L280 TraceCheckUtils]: 18: Hoare triple {85#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {85#true} is VALID [2020-07-10 20:21:45,396 INFO L280 TraceCheckUtils]: 19: Hoare triple {85#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {85#true} is VALID [2020-07-10 20:21:45,397 INFO L280 TraceCheckUtils]: 20: Hoare triple {85#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {85#true} is VALID [2020-07-10 20:21:45,397 INFO L280 TraceCheckUtils]: 21: Hoare triple {85#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {85#true} is VALID [2020-07-10 20:21:45,397 INFO L280 TraceCheckUtils]: 22: Hoare triple {85#true} ~i~0 := 0; {85#true} is VALID [2020-07-10 20:21:45,399 INFO L280 TraceCheckUtils]: 23: Hoare triple {85#true} assume !true; {86#false} is VALID [2020-07-10 20:21:45,399 INFO L280 TraceCheckUtils]: 24: Hoare triple {86#false} ~i~0 := 0; {86#false} is VALID [2020-07-10 20:21:45,399 INFO L280 TraceCheckUtils]: 25: Hoare triple {86#false} assume !true; {86#false} is VALID [2020-07-10 20:21:45,400 INFO L280 TraceCheckUtils]: 26: Hoare triple {86#false} ~i~0 := 0; {86#false} is VALID [2020-07-10 20:21:45,400 INFO L280 TraceCheckUtils]: 27: Hoare triple {86#false} assume !(~i~0 < ~N~0); {86#false} is VALID [2020-07-10 20:21:45,401 INFO L280 TraceCheckUtils]: 28: Hoare triple {86#false} ~i~0 := 0; {86#false} is VALID [2020-07-10 20:21:45,401 INFO L280 TraceCheckUtils]: 29: Hoare triple {86#false} assume !true; {86#false} is VALID [2020-07-10 20:21:45,401 INFO L280 TraceCheckUtils]: 30: Hoare triple {86#false} ~i~0 := 0; {86#false} is VALID [2020-07-10 20:21:45,402 INFO L280 TraceCheckUtils]: 31: Hoare triple {86#false} assume !true; {86#false} is VALID [2020-07-10 20:21:45,403 INFO L280 TraceCheckUtils]: 32: Hoare triple {86#false} SUMMARY for call #t~mem13 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L50-6 {86#false} is VALID [2020-07-10 20:21:45,403 INFO L263 TraceCheckUtils]: 33: Hoare triple {86#false} call __VERIFIER_assert((if #t~mem13 == ~N~0 * (1 + ~N~0) then 1 else 0)); {86#false} is VALID [2020-07-10 20:21:45,404 INFO L280 TraceCheckUtils]: 34: Hoare triple {86#false} ~cond := #in~cond; {86#false} is VALID [2020-07-10 20:21:45,404 INFO L280 TraceCheckUtils]: 35: Hoare triple {86#false} assume 0 == ~cond; {86#false} is VALID [2020-07-10 20:21:45,404 INFO L280 TraceCheckUtils]: 36: Hoare triple {86#false} assume !false; {86#false} is VALID [2020-07-10 20:21:45,410 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:45,411 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:45,413 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1663497871] [2020-07-10 20:21:45,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:45,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:21:45,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787514703] [2020-07-10 20:21:45,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-10 20:21:45,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:45,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:21:45,495 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-10 20:21:45,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:21:45,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:45,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:21:45,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:21:45,510 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2020-07-10 20:21:46,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:46,004 INFO L93 Difference]: Finished difference Result 147 states and 170 transitions. [2020-07-10 20:21:46,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:21:46,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-10 20:21:46,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:46,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:46,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2020-07-10 20:21:46,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2020-07-10 20:21:46,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 170 transitions. [2020-07-10 20:21:46,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:46,376 INFO L225 Difference]: With dead ends: 147 [2020-07-10 20:21:46,376 INFO L226 Difference]: Without dead ends: 70 [2020-07-10 20:21:46,383 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:46,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-10 20:21:46,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-10 20:21:46,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:46,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2020-07-10 20:21:46,509 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-10 20:21:46,509 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-10 20:21:46,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:46,524 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2020-07-10 20:21:46,524 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2020-07-10 20:21:46,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:46,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:46,527 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-10 20:21:46,527 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-10 20:21:46,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:46,547 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2020-07-10 20:21:46,549 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2020-07-10 20:21:46,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:46,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:46,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:46,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:46,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-10 20:21:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2020-07-10 20:21:46,569 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 37 [2020-07-10 20:21:46,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:46,571 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2020-07-10 20:21:46,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:21:46,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 74 transitions. [2020-07-10 20:21:46,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:46,674 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2020-07-10 20:21:46,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 20:21:46,677 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:46,677 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-10 20:21:46,678 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:21:46,678 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:46,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:46,679 INFO L82 PathProgramCache]: Analyzing trace with hash 853879691, now seen corresponding path program 1 times [2020-07-10 20:21:46,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:46,680 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1330467668] [2020-07-10 20:21:46,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:46,828 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#(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; {674#true} is VALID [2020-07-10 20:21:46,829 INFO L280 TraceCheckUtils]: 1: Hoare triple {674#true} #valid := #valid[0 := 0]; {674#true} is VALID [2020-07-10 20:21:46,829 INFO L280 TraceCheckUtils]: 2: Hoare triple {674#true} assume 0 < #StackHeapBarrier; {674#true} is VALID [2020-07-10 20:21:46,829 INFO L280 TraceCheckUtils]: 3: Hoare triple {674#true} ~N~0 := 0; {674#true} is VALID [2020-07-10 20:21:46,830 INFO L280 TraceCheckUtils]: 4: Hoare triple {674#true} assume true; {674#true} is VALID [2020-07-10 20:21:46,830 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {674#true} {674#true} #151#return; {674#true} is VALID [2020-07-10 20:21:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:46,839 INFO L280 TraceCheckUtils]: 0: Hoare triple {674#true} ~cond := #in~cond; {674#true} is VALID [2020-07-10 20:21:46,840 INFO L280 TraceCheckUtils]: 1: Hoare triple {674#true} assume !(0 == ~cond); {674#true} is VALID [2020-07-10 20:21:46,840 INFO L280 TraceCheckUtils]: 2: Hoare triple {674#true} assume true; {674#true} is VALID [2020-07-10 20:21:46,841 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {674#true} {682#(<= 1 ~N~0)} #147#return; {682#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:46,843 INFO L263 TraceCheckUtils]: 0: Hoare triple {674#true} call ULTIMATE.init(); {688#(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:46,843 INFO L280 TraceCheckUtils]: 1: Hoare triple {688#(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; {674#true} is VALID [2020-07-10 20:21:46,844 INFO L280 TraceCheckUtils]: 2: Hoare triple {674#true} #valid := #valid[0 := 0]; {674#true} is VALID [2020-07-10 20:21:46,844 INFO L280 TraceCheckUtils]: 3: Hoare triple {674#true} assume 0 < #StackHeapBarrier; {674#true} is VALID [2020-07-10 20:21:46,845 INFO L280 TraceCheckUtils]: 4: Hoare triple {674#true} ~N~0 := 0; {674#true} is VALID [2020-07-10 20:21:46,845 INFO L280 TraceCheckUtils]: 5: Hoare triple {674#true} assume true; {674#true} is VALID [2020-07-10 20:21:46,845 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {674#true} {674#true} #151#return; {674#true} is VALID [2020-07-10 20:21:46,846 INFO L263 TraceCheckUtils]: 7: Hoare triple {674#true} call #t~ret14 := main(); {674#true} is VALID [2020-07-10 20:21:46,846 INFO L280 TraceCheckUtils]: 8: Hoare triple {674#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {674#true} is VALID [2020-07-10 20:21:46,846 INFO L280 TraceCheckUtils]: 9: Hoare triple {674#true} ~N~0 := #t~nondet0; {674#true} is VALID [2020-07-10 20:21:46,847 INFO L280 TraceCheckUtils]: 10: Hoare triple {674#true} havoc #t~nondet0; {674#true} is VALID [2020-07-10 20:21:46,848 INFO L280 TraceCheckUtils]: 11: Hoare triple {674#true} assume !(~N~0 <= 0); {682#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:46,848 INFO L263 TraceCheckUtils]: 12: Hoare triple {682#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {674#true} is VALID [2020-07-10 20:21:46,849 INFO L280 TraceCheckUtils]: 13: Hoare triple {674#true} ~cond := #in~cond; {674#true} is VALID [2020-07-10 20:21:46,849 INFO L280 TraceCheckUtils]: 14: Hoare triple {674#true} assume !(0 == ~cond); {674#true} is VALID [2020-07-10 20:21:46,850 INFO L280 TraceCheckUtils]: 15: Hoare triple {674#true} assume true; {674#true} is VALID [2020-07-10 20:21:46,851 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {674#true} {682#(<= 1 ~N~0)} #147#return; {682#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:46,852 INFO L280 TraceCheckUtils]: 17: Hoare triple {682#(<= 1 ~N~0)} havoc ~i~0; {682#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:46,853 INFO L280 TraceCheckUtils]: 18: Hoare triple {682#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {682#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:46,854 INFO L280 TraceCheckUtils]: 19: Hoare triple {682#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {682#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:46,854 INFO L280 TraceCheckUtils]: 20: Hoare triple {682#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {682#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:46,855 INFO L280 TraceCheckUtils]: 21: Hoare triple {682#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {682#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:46,856 INFO L280 TraceCheckUtils]: 22: Hoare triple {682#(<= 1 ~N~0)} ~i~0 := 0; {687#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 20:21:46,858 INFO L280 TraceCheckUtils]: 23: Hoare triple {687#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {675#false} is VALID [2020-07-10 20:21:46,858 INFO L280 TraceCheckUtils]: 24: Hoare triple {675#false} ~i~0 := 0; {675#false} is VALID [2020-07-10 20:21:46,858 INFO L280 TraceCheckUtils]: 25: Hoare triple {675#false} assume !(~i~0 < ~N~0); {675#false} is VALID [2020-07-10 20:21:46,859 INFO L280 TraceCheckUtils]: 26: Hoare triple {675#false} ~i~0 := 0; {675#false} is VALID [2020-07-10 20:21:46,859 INFO L280 TraceCheckUtils]: 27: Hoare triple {675#false} assume !(~i~0 < ~N~0); {675#false} is VALID [2020-07-10 20:21:46,859 INFO L280 TraceCheckUtils]: 28: Hoare triple {675#false} ~i~0 := 0; {675#false} is VALID [2020-07-10 20:21:46,860 INFO L280 TraceCheckUtils]: 29: Hoare triple {675#false} assume !(~i~0 < ~N~0); {675#false} is VALID [2020-07-10 20:21:46,860 INFO L280 TraceCheckUtils]: 30: Hoare triple {675#false} ~i~0 := 0; {675#false} is VALID [2020-07-10 20:21:46,861 INFO L280 TraceCheckUtils]: 31: Hoare triple {675#false} assume !(~i~0 < ~N~0); {675#false} is VALID [2020-07-10 20:21:46,861 INFO L280 TraceCheckUtils]: 32: Hoare triple {675#false} SUMMARY for call #t~mem13 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L50-6 {675#false} is VALID [2020-07-10 20:21:46,861 INFO L263 TraceCheckUtils]: 33: Hoare triple {675#false} call __VERIFIER_assert((if #t~mem13 == ~N~0 * (1 + ~N~0) then 1 else 0)); {675#false} is VALID [2020-07-10 20:21:46,862 INFO L280 TraceCheckUtils]: 34: Hoare triple {675#false} ~cond := #in~cond; {675#false} is VALID [2020-07-10 20:21:46,862 INFO L280 TraceCheckUtils]: 35: Hoare triple {675#false} assume 0 == ~cond; {675#false} is VALID [2020-07-10 20:21:46,862 INFO L280 TraceCheckUtils]: 36: Hoare triple {675#false} assume !false; {675#false} is VALID [2020-07-10 20:21:46,866 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:46,866 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:46,867 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1330467668] [2020-07-10 20:21:46,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:46,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:21:46,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809909430] [2020-07-10 20:21:46,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-07-10 20:21:46,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:46,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:21:46,931 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-10 20:21:46,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:21:46,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:46,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:21:46,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:21:46,932 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 5 states. [2020-07-10 20:21:47,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:47,563 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2020-07-10 20:21:47,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:21:47,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-07-10 20:21:47,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2020-07-10 20:21:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2020-07-10 20:21:47,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 156 transitions. [2020-07-10 20:21:47,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:47,797 INFO L225 Difference]: With dead ends: 144 [2020-07-10 20:21:47,797 INFO L226 Difference]: Without dead ends: 102 [2020-07-10 20:21:47,799 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:47,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-07-10 20:21:47,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2020-07-10 20:21:47,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:47,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 75 states. [2020-07-10 20:21:47,932 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 75 states. [2020-07-10 20:21:47,932 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 75 states. [2020-07-10 20:21:47,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:47,937 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2020-07-10 20:21:47,937 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2020-07-10 20:21:47,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:47,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:47,939 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 102 states. [2020-07-10 20:21:47,939 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 102 states. [2020-07-10 20:21:47,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:47,944 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2020-07-10 20:21:47,945 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2020-07-10 20:21:47,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:47,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:47,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:47,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:47,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-10 20:21:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2020-07-10 20:21:47,950 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 37 [2020-07-10 20:21:47,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:47,951 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2020-07-10 20:21:47,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:21:47,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 75 states and 79 transitions. [2020-07-10 20:21:48,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2020-07-10 20:21:48,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-07-10 20:21:48,064 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:48,064 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, 1, 1, 1, 1, 1] [2020-07-10 20:21:48,064 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:21:48,064 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:48,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:48,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1805527949, now seen corresponding path program 1 times [2020-07-10 20:21:48,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:48,069 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1958820085] [2020-07-10 20:21:48,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:48,108 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:21:48,109 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:48,116 INFO L168 Benchmark]: Toolchain (without parser) took 4184.36 ms. Allocated memory was 138.9 MB in the beginning and 245.4 MB in the end (delta: 106.4 MB). Free memory was 102.4 MB in the beginning and 169.8 MB in the end (delta: -67.4 MB). Peak memory consumption was 39.1 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:48,117 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 20:21:48,117 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.59 ms. Allocated memory is still 138.9 MB. Free memory was 102.2 MB in the beginning and 90.7 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:48,118 INFO L168 Benchmark]: Boogie Preprocessor took 165.18 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 90.7 MB in the beginning and 180.5 MB in the end (delta: -89.8 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:48,119 INFO L168 Benchmark]: RCFGBuilder took 610.68 ms. Allocated memory is still 203.9 MB. Free memory was 180.5 MB in the beginning and 146.6 MB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:48,120 INFO L168 Benchmark]: TraceAbstraction took 3112.28 ms. Allocated memory was 203.9 MB in the beginning and 245.4 MB in the end (delta: 41.4 MB). Free memory was 146.0 MB in the beginning and 169.8 MB in the end (delta: -23.8 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:48,124 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 138.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 289.59 ms. Allocated memory is still 138.9 MB. Free memory was 102.2 MB in the beginning and 90.7 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 165.18 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 90.7 MB in the beginning and 180.5 MB in the end (delta: -89.8 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 610.68 ms. Allocated memory is still 203.9 MB. Free memory was 180.5 MB in the beginning and 146.6 MB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3112.28 ms. Allocated memory was 203.9 MB in the beginning and 245.4 MB in the end (delta: 41.4 MB). Free memory was 146.0 MB in the beginning and 169.8 MB in the end (delta: -23.8 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...