/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/ssinaf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:21:44,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:21:44,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:21:44,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:21:44,768 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:21:44,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:21:44,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:21:44,786 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:21:44,788 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:21:44,789 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:21:44,790 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:21:44,791 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:21:44,792 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:21:44,793 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:21:44,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:21:44,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:21:44,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:21:44,797 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:21:44,799 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:21:44,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:21:44,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:21:44,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:21:44,805 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:21:44,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:21:44,808 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:21:44,808 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:21:44,808 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:21:44,809 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:21:44,810 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:21:44,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:21:44,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:21:44,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:21:44,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:21:44,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:21:44,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:21:44,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:21:44,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:21:44,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:21:44,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:21:44,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:21:44,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:21:44,819 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:44,828 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:21:44,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:21:44,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:21:44,831 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:21:44,831 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:21:44,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:21:44,831 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:21:44,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:21:44,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:21:44,832 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:21:44,832 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:21:44,832 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:21:44,832 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:21:44,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:21:44,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:21:44,833 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:21:44,833 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:21:44,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:21:44,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:44,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:21:44,834 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:21:44,834 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:21:44,834 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:21:45,100 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:21:45,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:21:45,121 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:21:45,122 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:21:45,123 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:21:45,124 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ssinaf.c [2020-07-10 20:21:45,187 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03bda22b9/c854310611fe49b5ba1c39f6a2383b9a/FLAGd3e5d612b [2020-07-10 20:21:45,666 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:21:45,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ssinaf.c [2020-07-10 20:21:45,676 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03bda22b9/c854310611fe49b5ba1c39f6a2383b9a/FLAGd3e5d612b [2020-07-10 20:21:46,058 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03bda22b9/c854310611fe49b5ba1c39f6a2383b9a [2020-07-10 20:21:46,067 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:21:46,069 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:21:46,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:46,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:21:46,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:21:46,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:46" (1/1) ... [2020-07-10 20:21:46,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@713ad7b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:46, skipping insertion in model container [2020-07-10 20:21:46,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:46" (1/1) ... [2020-07-10 20:21:46,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:21:46,108 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:21:46,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:46,450 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:21:46,653 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:46,673 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:21:46,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:46 WrapperNode [2020-07-10 20:21:46,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:46,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:21:46,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:21:46,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:21:46,690 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:46" (1/1) ... [2020-07-10 20:21:46,691 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:46" (1/1) ... [2020-07-10 20:21:46,701 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:46" (1/1) ... [2020-07-10 20:21:46,702 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:46" (1/1) ... [2020-07-10 20:21:46,716 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:46" (1/1) ... [2020-07-10 20:21:46,724 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:46" (1/1) ... [2020-07-10 20:21:46,726 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:46" (1/1) ... [2020-07-10 20:21:46,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:21:46,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:21:46,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:21:46,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:21:46,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:46" (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:46,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:21:46,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:21:46,802 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:21:46,802 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:21:46,803 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:21:46,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:21:46,803 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:21:46,803 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:21:46,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:21:46,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:21:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 20:21:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:21:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:21:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 20:21:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:21:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:21:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:21:46,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:21:46,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:21:47,388 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:21:47,388 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-10 20:21:47,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:47 BoogieIcfgContainer [2020-07-10 20:21:47,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:21:47,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:21:47,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:21:47,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:21:47,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:21:46" (1/3) ... [2020-07-10 20:21:47,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f21abf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:47, skipping insertion in model container [2020-07-10 20:21:47,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:46" (2/3) ... [2020-07-10 20:21:47,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f21abf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:47, skipping insertion in model container [2020-07-10 20:21:47,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:47" (3/3) ... [2020-07-10 20:21:47,402 INFO L109 eAbstractionObserver]: Analyzing ICFG ssinaf.c [2020-07-10 20:21:47,414 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:21:47,422 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:21:47,435 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:21:47,457 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:21:47,458 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:21:47,458 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:21:47,458 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:21:47,459 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:21:47,459 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:21:47,459 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:21:47,459 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:21:47,477 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2020-07-10 20:21:47,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-10 20:21:47,490 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:47,491 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] [2020-07-10 20:21:47,492 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:47,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:47,498 INFO L82 PathProgramCache]: Analyzing trace with hash 2063962602, now seen corresponding path program 1 times [2020-07-10 20:21:47,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:47,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [662217547] [2020-07-10 20:21:47,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:47,747 INFO L280 TraceCheckUtils]: 0: Hoare triple {107#(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; {95#true} is VALID [2020-07-10 20:21:47,748 INFO L280 TraceCheckUtils]: 1: Hoare triple {95#true} #valid := #valid[0 := 0]; {95#true} is VALID [2020-07-10 20:21:47,749 INFO L280 TraceCheckUtils]: 2: Hoare triple {95#true} assume 0 < #StackHeapBarrier; {95#true} is VALID [2020-07-10 20:21:47,749 INFO L280 TraceCheckUtils]: 3: Hoare triple {95#true} ~N~0 := 0; {95#true} is VALID [2020-07-10 20:21:47,751 INFO L280 TraceCheckUtils]: 4: Hoare triple {95#true} assume true; {95#true} is VALID [2020-07-10 20:21:47,751 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {95#true} {95#true} #172#return; {95#true} is VALID [2020-07-10 20:21:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:47,764 INFO L280 TraceCheckUtils]: 0: Hoare triple {95#true} ~cond := #in~cond; {95#true} is VALID [2020-07-10 20:21:47,765 INFO L280 TraceCheckUtils]: 1: Hoare triple {95#true} assume !(0 == ~cond); {95#true} is VALID [2020-07-10 20:21:47,765 INFO L280 TraceCheckUtils]: 2: Hoare triple {95#true} assume true; {95#true} is VALID [2020-07-10 20:21:47,766 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {95#true} {95#true} #168#return; {95#true} is VALID [2020-07-10 20:21:47,768 INFO L263 TraceCheckUtils]: 0: Hoare triple {95#true} call ULTIMATE.init(); {107#(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:47,769 INFO L280 TraceCheckUtils]: 1: Hoare triple {107#(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; {95#true} is VALID [2020-07-10 20:21:47,769 INFO L280 TraceCheckUtils]: 2: Hoare triple {95#true} #valid := #valid[0 := 0]; {95#true} is VALID [2020-07-10 20:21:47,769 INFO L280 TraceCheckUtils]: 3: Hoare triple {95#true} assume 0 < #StackHeapBarrier; {95#true} is VALID [2020-07-10 20:21:47,770 INFO L280 TraceCheckUtils]: 4: Hoare triple {95#true} ~N~0 := 0; {95#true} is VALID [2020-07-10 20:21:47,770 INFO L280 TraceCheckUtils]: 5: Hoare triple {95#true} assume true; {95#true} is VALID [2020-07-10 20:21:47,770 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {95#true} {95#true} #172#return; {95#true} is VALID [2020-07-10 20:21:47,771 INFO L263 TraceCheckUtils]: 7: Hoare triple {95#true} call #t~ret17 := main(); {95#true} is VALID [2020-07-10 20:21:47,771 INFO L280 TraceCheckUtils]: 8: Hoare triple {95#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {95#true} is VALID [2020-07-10 20:21:47,771 INFO L280 TraceCheckUtils]: 9: Hoare triple {95#true} ~N~0 := #t~nondet0; {95#true} is VALID [2020-07-10 20:21:47,772 INFO L280 TraceCheckUtils]: 10: Hoare triple {95#true} havoc #t~nondet0; {95#true} is VALID [2020-07-10 20:21:47,772 INFO L280 TraceCheckUtils]: 11: Hoare triple {95#true} assume !(~N~0 <= 0); {95#true} is VALID [2020-07-10 20:21:47,773 INFO L263 TraceCheckUtils]: 12: Hoare triple {95#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {95#true} is VALID [2020-07-10 20:21:47,773 INFO L280 TraceCheckUtils]: 13: Hoare triple {95#true} ~cond := #in~cond; {95#true} is VALID [2020-07-10 20:21:47,773 INFO L280 TraceCheckUtils]: 14: Hoare triple {95#true} assume !(0 == ~cond); {95#true} is VALID [2020-07-10 20:21:47,774 INFO L280 TraceCheckUtils]: 15: Hoare triple {95#true} assume true; {95#true} is VALID [2020-07-10 20:21:47,774 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {95#true} {95#true} #168#return; {95#true} is VALID [2020-07-10 20:21:47,774 INFO L280 TraceCheckUtils]: 17: Hoare triple {95#true} havoc ~i~0; {95#true} is VALID [2020-07-10 20:21:47,775 INFO L280 TraceCheckUtils]: 18: Hoare triple {95#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {95#true} is VALID [2020-07-10 20:21:47,775 INFO L280 TraceCheckUtils]: 19: Hoare triple {95#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {95#true} is VALID [2020-07-10 20:21:47,775 INFO L280 TraceCheckUtils]: 20: Hoare triple {95#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {95#true} is VALID [2020-07-10 20:21:47,776 INFO L280 TraceCheckUtils]: 21: Hoare triple {95#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {95#true} is VALID [2020-07-10 20:21:47,776 INFO L280 TraceCheckUtils]: 22: Hoare triple {95#true} ~i~0 := 0; {95#true} is VALID [2020-07-10 20:21:47,777 INFO L280 TraceCheckUtils]: 23: Hoare triple {95#true} assume !true; {96#false} is VALID [2020-07-10 20:21:47,778 INFO L280 TraceCheckUtils]: 24: Hoare triple {96#false} ~i~0 := 0; {96#false} is VALID [2020-07-10 20:21:47,778 INFO L280 TraceCheckUtils]: 25: Hoare triple {96#false} assume !true; {96#false} is VALID [2020-07-10 20:21:47,778 INFO L280 TraceCheckUtils]: 26: Hoare triple {96#false} ~i~0 := 0; {96#false} is VALID [2020-07-10 20:21:47,779 INFO L280 TraceCheckUtils]: 27: Hoare triple {96#false} assume !true; {96#false} is VALID [2020-07-10 20:21:47,779 INFO L280 TraceCheckUtils]: 28: Hoare triple {96#false} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L40-6 {96#false} is VALID [2020-07-10 20:21:47,780 INFO L280 TraceCheckUtils]: 29: Hoare triple {96#false} ~i~0 := 0; {96#false} is VALID [2020-07-10 20:21:47,780 INFO L280 TraceCheckUtils]: 30: Hoare triple {96#false} assume !true; {96#false} is VALID [2020-07-10 20:21:47,780 INFO L280 TraceCheckUtils]: 31: Hoare triple {96#false} ~i~0 := 0; {96#false} is VALID [2020-07-10 20:21:47,781 INFO L280 TraceCheckUtils]: 32: Hoare triple {96#false} assume !true; {96#false} is VALID [2020-07-10 20:21:47,781 INFO L280 TraceCheckUtils]: 33: Hoare triple {96#false} ~i~0 := 0; {96#false} is VALID [2020-07-10 20:21:47,781 INFO L280 TraceCheckUtils]: 34: Hoare triple {96#false} assume !!(~i~0 < ~N~0); {96#false} is VALID [2020-07-10 20:21:47,782 INFO L280 TraceCheckUtils]: 35: Hoare triple {96#false} SUMMARY for call #t~mem16 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); srcloc: L58 {96#false} is VALID [2020-07-10 20:21:47,782 INFO L263 TraceCheckUtils]: 36: Hoare triple {96#false} call __VERIFIER_assert((if #t~mem16 == (1 + ~N~0) * (1 + ~N~0) then 1 else 0)); {96#false} is VALID [2020-07-10 20:21:47,782 INFO L280 TraceCheckUtils]: 37: Hoare triple {96#false} ~cond := #in~cond; {96#false} is VALID [2020-07-10 20:21:47,783 INFO L280 TraceCheckUtils]: 38: Hoare triple {96#false} assume 0 == ~cond; {96#false} is VALID [2020-07-10 20:21:47,783 INFO L280 TraceCheckUtils]: 39: Hoare triple {96#false} assume !false; {96#false} is VALID [2020-07-10 20:21:47,788 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:47,789 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:47,791 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [662217547] [2020-07-10 20:21:47,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:47,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:21:47,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345218713] [2020-07-10 20:21:47,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2020-07-10 20:21:47,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:47,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:21:47,877 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:47,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:21:47,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:47,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:21:47,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:21:47,890 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 3 states. [2020-07-10 20:21:48,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:48,428 INFO L93 Difference]: Finished difference Result 167 states and 194 transitions. [2020-07-10 20:21:48,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:21:48,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2020-07-10 20:21:48,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:48,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2020-07-10 20:21:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2020-07-10 20:21:48,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 194 transitions. [2020-07-10 20:21:48,715 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:48,746 INFO L225 Difference]: With dead ends: 167 [2020-07-10 20:21:48,746 INFO L226 Difference]: Without dead ends: 83 [2020-07-10 20:21:48,752 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:48,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-10 20:21:48,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2020-07-10 20:21:48,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:48,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 83 states. [2020-07-10 20:21:48,868 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2020-07-10 20:21:48,869 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2020-07-10 20:21:48,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:48,878 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2020-07-10 20:21:48,878 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2020-07-10 20:21:48,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:48,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:48,881 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2020-07-10 20:21:48,881 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2020-07-10 20:21:48,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:48,889 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2020-07-10 20:21:48,889 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2020-07-10 20:21:48,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:48,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:48,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:48,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:48,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-07-10 20:21:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2020-07-10 20:21:48,898 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 40 [2020-07-10 20:21:48,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:48,898 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2020-07-10 20:21:48,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:21:48,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 83 states and 88 transitions. [2020-07-10 20:21:49,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:49,014 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2020-07-10 20:21:49,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-10 20:21:49,016 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:49,016 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] [2020-07-10 20:21:49,017 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:21:49,017 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:49,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:49,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1243022369, now seen corresponding path program 1 times [2020-07-10 20:21:49,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:49,018 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1850013479] [2020-07-10 20:21:49,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:49,163 INFO L280 TraceCheckUtils]: 0: Hoare triple {790#(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; {776#true} is VALID [2020-07-10 20:21:49,164 INFO L280 TraceCheckUtils]: 1: Hoare triple {776#true} #valid := #valid[0 := 0]; {776#true} is VALID [2020-07-10 20:21:49,164 INFO L280 TraceCheckUtils]: 2: Hoare triple {776#true} assume 0 < #StackHeapBarrier; {776#true} is VALID [2020-07-10 20:21:49,165 INFO L280 TraceCheckUtils]: 3: Hoare triple {776#true} ~N~0 := 0; {776#true} is VALID [2020-07-10 20:21:49,165 INFO L280 TraceCheckUtils]: 4: Hoare triple {776#true} assume true; {776#true} is VALID [2020-07-10 20:21:49,165 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {776#true} {776#true} #172#return; {776#true} is VALID [2020-07-10 20:21:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:49,174 INFO L280 TraceCheckUtils]: 0: Hoare triple {776#true} ~cond := #in~cond; {776#true} is VALID [2020-07-10 20:21:49,175 INFO L280 TraceCheckUtils]: 1: Hoare triple {776#true} assume !(0 == ~cond); {776#true} is VALID [2020-07-10 20:21:49,175 INFO L280 TraceCheckUtils]: 2: Hoare triple {776#true} assume true; {776#true} is VALID [2020-07-10 20:21:49,176 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {776#true} {784#(<= 1 ~N~0)} #168#return; {784#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:49,178 INFO L263 TraceCheckUtils]: 0: Hoare triple {776#true} call ULTIMATE.init(); {790#(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:49,178 INFO L280 TraceCheckUtils]: 1: Hoare triple {790#(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; {776#true} is VALID [2020-07-10 20:21:49,178 INFO L280 TraceCheckUtils]: 2: Hoare triple {776#true} #valid := #valid[0 := 0]; {776#true} is VALID [2020-07-10 20:21:49,179 INFO L280 TraceCheckUtils]: 3: Hoare triple {776#true} assume 0 < #StackHeapBarrier; {776#true} is VALID [2020-07-10 20:21:49,179 INFO L280 TraceCheckUtils]: 4: Hoare triple {776#true} ~N~0 := 0; {776#true} is VALID [2020-07-10 20:21:49,179 INFO L280 TraceCheckUtils]: 5: Hoare triple {776#true} assume true; {776#true} is VALID [2020-07-10 20:21:49,180 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {776#true} {776#true} #172#return; {776#true} is VALID [2020-07-10 20:21:49,180 INFO L263 TraceCheckUtils]: 7: Hoare triple {776#true} call #t~ret17 := main(); {776#true} is VALID [2020-07-10 20:21:49,180 INFO L280 TraceCheckUtils]: 8: Hoare triple {776#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {776#true} is VALID [2020-07-10 20:21:49,180 INFO L280 TraceCheckUtils]: 9: Hoare triple {776#true} ~N~0 := #t~nondet0; {776#true} is VALID [2020-07-10 20:21:49,181 INFO L280 TraceCheckUtils]: 10: Hoare triple {776#true} havoc #t~nondet0; {776#true} is VALID [2020-07-10 20:21:49,182 INFO L280 TraceCheckUtils]: 11: Hoare triple {776#true} assume !(~N~0 <= 0); {784#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:49,182 INFO L263 TraceCheckUtils]: 12: Hoare triple {784#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {776#true} is VALID [2020-07-10 20:21:49,183 INFO L280 TraceCheckUtils]: 13: Hoare triple {776#true} ~cond := #in~cond; {776#true} is VALID [2020-07-10 20:21:49,183 INFO L280 TraceCheckUtils]: 14: Hoare triple {776#true} assume !(0 == ~cond); {776#true} is VALID [2020-07-10 20:21:49,183 INFO L280 TraceCheckUtils]: 15: Hoare triple {776#true} assume true; {776#true} is VALID [2020-07-10 20:21:49,184 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {776#true} {784#(<= 1 ~N~0)} #168#return; {784#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:49,185 INFO L280 TraceCheckUtils]: 17: Hoare triple {784#(<= 1 ~N~0)} havoc ~i~0; {784#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:49,186 INFO L280 TraceCheckUtils]: 18: Hoare triple {784#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {784#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:49,187 INFO L280 TraceCheckUtils]: 19: Hoare triple {784#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {784#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:49,187 INFO L280 TraceCheckUtils]: 20: Hoare triple {784#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {784#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:49,188 INFO L280 TraceCheckUtils]: 21: Hoare triple {784#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {784#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:49,189 INFO L280 TraceCheckUtils]: 22: Hoare triple {784#(<= 1 ~N~0)} ~i~0 := 0; {789#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 20:21:49,190 INFO L280 TraceCheckUtils]: 23: Hoare triple {789#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {777#false} is VALID [2020-07-10 20:21:49,191 INFO L280 TraceCheckUtils]: 24: Hoare triple {777#false} ~i~0 := 0; {777#false} is VALID [2020-07-10 20:21:49,191 INFO L280 TraceCheckUtils]: 25: Hoare triple {777#false} assume !(~i~0 < ~N~0); {777#false} is VALID [2020-07-10 20:21:49,191 INFO L280 TraceCheckUtils]: 26: Hoare triple {777#false} ~i~0 := 0; {777#false} is VALID [2020-07-10 20:21:49,192 INFO L280 TraceCheckUtils]: 27: Hoare triple {777#false} assume !(~i~0 < ~N~0); {777#false} is VALID [2020-07-10 20:21:49,192 INFO L280 TraceCheckUtils]: 28: Hoare triple {777#false} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L40-6 {777#false} is VALID [2020-07-10 20:21:49,192 INFO L280 TraceCheckUtils]: 29: Hoare triple {777#false} ~i~0 := 0; {777#false} is VALID [2020-07-10 20:21:49,193 INFO L280 TraceCheckUtils]: 30: Hoare triple {777#false} assume !(~i~0 < ~N~0); {777#false} is VALID [2020-07-10 20:21:49,193 INFO L280 TraceCheckUtils]: 31: Hoare triple {777#false} ~i~0 := 0; {777#false} is VALID [2020-07-10 20:21:49,193 INFO L280 TraceCheckUtils]: 32: Hoare triple {777#false} assume !(~i~0 < ~N~0); {777#false} is VALID [2020-07-10 20:21:49,193 INFO L280 TraceCheckUtils]: 33: Hoare triple {777#false} ~i~0 := 0; {777#false} is VALID [2020-07-10 20:21:49,194 INFO L280 TraceCheckUtils]: 34: Hoare triple {777#false} assume !!(~i~0 < ~N~0); {777#false} is VALID [2020-07-10 20:21:49,194 INFO L280 TraceCheckUtils]: 35: Hoare triple {777#false} SUMMARY for call #t~mem16 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); srcloc: L58 {777#false} is VALID [2020-07-10 20:21:49,194 INFO L263 TraceCheckUtils]: 36: Hoare triple {777#false} call __VERIFIER_assert((if #t~mem16 == (1 + ~N~0) * (1 + ~N~0) then 1 else 0)); {777#false} is VALID [2020-07-10 20:21:49,195 INFO L280 TraceCheckUtils]: 37: Hoare triple {777#false} ~cond := #in~cond; {777#false} is VALID [2020-07-10 20:21:49,195 INFO L280 TraceCheckUtils]: 38: Hoare triple {777#false} assume 0 == ~cond; {777#false} is VALID [2020-07-10 20:21:49,195 INFO L280 TraceCheckUtils]: 39: Hoare triple {777#false} assume !false; {777#false} is VALID [2020-07-10 20:21:49,198 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:49,198 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:49,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1850013479] [2020-07-10 20:21:49,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:49,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:21:49,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968822343] [2020-07-10 20:21:49,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2020-07-10 20:21:49,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:49,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:21:49,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:49,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:21:49,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:49,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:21:49,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:21:49,248 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 5 states. [2020-07-10 20:21:50,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:50,041 INFO L93 Difference]: Finished difference Result 180 states and 195 transitions. [2020-07-10 20:21:50,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:21:50,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2020-07-10 20:21:50,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:50,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:50,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2020-07-10 20:21:50,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:50,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2020-07-10 20:21:50,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 195 transitions. [2020-07-10 20:21:50,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:50,290 INFO L225 Difference]: With dead ends: 180 [2020-07-10 20:21:50,290 INFO L226 Difference]: Without dead ends: 125 [2020-07-10 20:21:50,292 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:50,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-07-10 20:21:50,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 88. [2020-07-10 20:21:50,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:50,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 88 states. [2020-07-10 20:21:50,455 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 88 states. [2020-07-10 20:21:50,455 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 88 states. [2020-07-10 20:21:50,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:50,467 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2020-07-10 20:21:50,468 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2020-07-10 20:21:50,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:50,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:50,477 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 125 states. [2020-07-10 20:21:50,477 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 125 states. [2020-07-10 20:21:50,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:50,490 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2020-07-10 20:21:50,490 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2020-07-10 20:21:50,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:50,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:50,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:50,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:50,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-07-10 20:21:50,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2020-07-10 20:21:50,500 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 40 [2020-07-10 20:21:50,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:50,500 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2020-07-10 20:21:50,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:21:50,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 88 states and 93 transitions. [2020-07-10 20:21:50,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:50,641 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2020-07-10 20:21:50,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-07-10 20:21:50,644 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:50,644 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:50,645 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:21:50,645 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:50,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:50,645 INFO L82 PathProgramCache]: Analyzing trace with hash -88576135, now seen corresponding path program 1 times [2020-07-10 20:21:50,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:50,646 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1155146970] [2020-07-10 20:21:50,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:50,677 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:21:50,678 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:50,683 INFO L168 Benchmark]: Toolchain (without parser) took 4614.12 ms. Allocated memory was 137.9 MB in the beginning and 247.5 MB in the end (delta: 109.6 MB). Free memory was 102.0 MB in the beginning and 123.4 MB in the end (delta: -21.4 MB). Peak memory consumption was 88.2 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:50,684 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 120.4 MB in the beginning and 120.2 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:50,686 INFO L168 Benchmark]: CACSL2BoogieTranslator took 604.40 ms. Allocated memory was 137.9 MB in the beginning and 205.0 MB in the end (delta: 67.1 MB). Free memory was 101.8 MB in the beginning and 182.4 MB in the end (delta: -80.6 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:50,686 INFO L168 Benchmark]: Boogie Preprocessor took 54.53 ms. Allocated memory is still 205.0 MB. Free memory was 182.4 MB in the beginning and 180.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:50,687 INFO L168 Benchmark]: RCFGBuilder took 664.23 ms. Allocated memory is still 205.0 MB. Free memory was 180.3 MB in the beginning and 142.8 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:50,688 INFO L168 Benchmark]: TraceAbstraction took 3285.47 ms. Allocated memory was 205.0 MB in the beginning and 247.5 MB in the end (delta: 42.5 MB). Free memory was 142.1 MB in the beginning and 123.4 MB in the end (delta: 18.7 MB). Peak memory consumption was 61.2 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:50,692 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.25 ms. Allocated memory is still 137.9 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 604.40 ms. Allocated memory was 137.9 MB in the beginning and 205.0 MB in the end (delta: 67.1 MB). Free memory was 101.8 MB in the beginning and 182.4 MB in the end (delta: -80.6 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.53 ms. Allocated memory is still 205.0 MB. Free memory was 182.4 MB in the beginning and 180.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 664.23 ms. Allocated memory is still 205.0 MB. Free memory was 180.3 MB in the beginning and 142.8 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3285.47 ms. Allocated memory was 205.0 MB in the beginning and 247.5 MB in the end (delta: 42.5 MB). Free memory was 142.1 MB in the beginning and 123.4 MB in the end (delta: 18.7 MB). Peak memory consumption was 61.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...