/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/condaf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:47:11,754 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:47:11,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:47:11,775 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:47:11,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:47:11,776 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:47:11,778 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:47:11,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:47:11,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:47:11,795 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:47:11,797 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:47:11,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:47:11,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:47:11,801 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:47:11,803 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:47:11,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:47:11,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:47:11,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:47:11,808 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:47:11,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:47:11,817 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:47:11,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:47:11,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:47:11,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:47:11,825 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:47:11,825 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:47:11,825 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:47:11,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:47:11,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:47:11,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:47:11,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:47:11,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:47:11,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:47:11,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:47:11,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:47:11,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:47:11,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:47:11,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:47:11,835 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:47:11,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:47:11,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:47:11,838 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:47:11,861 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:47:11,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:47:11,869 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:47:11,869 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:47:11,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:47:11,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:47:11,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:47:11,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:47:11,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:47:11,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:47:11,871 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:47:11,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:47:11,871 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:47:11,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:47:11,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:47:11,872 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:47:11,872 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:47:11,872 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:47:11,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:11,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:47:11,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:47:11,873 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:47:11,873 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:47:12,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:47:12,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:47:12,200 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:47:12,202 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:47:12,202 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:47:12,203 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/condaf.c [2020-07-18 00:47:12,275 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3dbaeff1/d5bb076fd5b443e6b9c7ef2ef1c6d823/FLAG03f1a97f9 [2020-07-18 00:47:12,724 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:47:12,725 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condaf.c [2020-07-18 00:47:12,733 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3dbaeff1/d5bb076fd5b443e6b9c7ef2ef1c6d823/FLAG03f1a97f9 [2020-07-18 00:47:13,111 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3dbaeff1/d5bb076fd5b443e6b9c7ef2ef1c6d823 [2020-07-18 00:47:13,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:47:13,123 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:47:13,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:13,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:47:13,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:47:13,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:13" (1/1) ... [2020-07-18 00:47:13,134 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6902f5b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:13, skipping insertion in model container [2020-07-18 00:47:13,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:13" (1/1) ... [2020-07-18 00:47:13,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:47:13,165 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:47:13,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:13,416 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:47:13,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:13,557 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:47:13,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:13 WrapperNode [2020-07-18 00:47:13,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:13,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:47:13,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:47:13,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:47:13,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:13" (1/1) ... [2020-07-18 00:47:13,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:13" (1/1) ... [2020-07-18 00:47:13,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:13" (1/1) ... [2020-07-18 00:47:13,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:13" (1/1) ... [2020-07-18 00:47:13,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:13" (1/1) ... [2020-07-18 00:47:13,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:13" (1/1) ... [2020-07-18 00:47:13,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:13" (1/1) ... [2020-07-18 00:47:13,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:47:13,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:47:13,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:47:13,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:47:13,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:13,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:47:13,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:47:13,674 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 00:47:13,674 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:47:13,674 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:47:13,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:47:13,675 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:47:13,675 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 00:47:13,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:47:13,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:47:13,675 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 00:47:13,675 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:47:13,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 00:47:13,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 00:47:13,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:47:13,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:47:13,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:47:13,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:47:13,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:47:14,143 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:47:14,143 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-18 00:47:14,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:14 BoogieIcfgContainer [2020-07-18 00:47:14,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:47:14,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:47:14,149 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:47:14,153 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:47:14,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:47:13" (1/3) ... [2020-07-18 00:47:14,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256646a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:14, skipping insertion in model container [2020-07-18 00:47:14,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:13" (2/3) ... [2020-07-18 00:47:14,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256646a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:14, skipping insertion in model container [2020-07-18 00:47:14,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:14" (3/3) ... [2020-07-18 00:47:14,157 INFO L109 eAbstractionObserver]: Analyzing ICFG condaf.c [2020-07-18 00:47:14,168 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:47:14,176 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:47:14,191 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:47:14,215 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:47:14,215 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:47:14,215 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:47:14,215 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:47:14,216 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:47:14,216 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:47:14,216 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:47:14,216 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:47:14,233 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2020-07-18 00:47:14,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-18 00:47:14,244 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:14,245 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] [2020-07-18 00:47:14,245 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:14,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:14,251 INFO L82 PathProgramCache]: Analyzing trace with hash -2050446892, now seen corresponding path program 1 times [2020-07-18 00:47:14,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:14,259 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1355710978] [2020-07-18 00:47:14,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:14,501 INFO L280 TraceCheckUtils]: 0: Hoare triple {86#(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; {74#true} is VALID [2020-07-18 00:47:14,502 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#true} #valid := #valid[0 := 0]; {74#true} is VALID [2020-07-18 00:47:14,503 INFO L280 TraceCheckUtils]: 2: Hoare triple {74#true} assume 0 < #StackHeapBarrier; {74#true} is VALID [2020-07-18 00:47:14,503 INFO L280 TraceCheckUtils]: 3: Hoare triple {74#true} ~N~0 := 0; {74#true} is VALID [2020-07-18 00:47:14,504 INFO L280 TraceCheckUtils]: 4: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-18 00:47:14,504 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {74#true} {74#true} #122#return; {74#true} is VALID [2020-07-18 00:47:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:14,519 INFO L280 TraceCheckUtils]: 0: Hoare triple {74#true} ~cond := #in~cond; {74#true} is VALID [2020-07-18 00:47:14,519 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#true} assume !(0 == ~cond); {74#true} is VALID [2020-07-18 00:47:14,520 INFO L280 TraceCheckUtils]: 2: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-18 00:47:14,520 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {74#true} {74#true} #118#return; {74#true} is VALID [2020-07-18 00:47:14,523 INFO L263 TraceCheckUtils]: 0: Hoare triple {74#true} call ULTIMATE.init(); {86#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:47:14,523 INFO L280 TraceCheckUtils]: 1: Hoare triple {86#(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; {74#true} is VALID [2020-07-18 00:47:14,524 INFO L280 TraceCheckUtils]: 2: Hoare triple {74#true} #valid := #valid[0 := 0]; {74#true} is VALID [2020-07-18 00:47:14,524 INFO L280 TraceCheckUtils]: 3: Hoare triple {74#true} assume 0 < #StackHeapBarrier; {74#true} is VALID [2020-07-18 00:47:14,525 INFO L280 TraceCheckUtils]: 4: Hoare triple {74#true} ~N~0 := 0; {74#true} is VALID [2020-07-18 00:47:14,525 INFO L280 TraceCheckUtils]: 5: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-18 00:47:14,525 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {74#true} {74#true} #122#return; {74#true} is VALID [2020-07-18 00:47:14,526 INFO L263 TraceCheckUtils]: 7: Hoare triple {74#true} call #t~ret11 := main(); {74#true} is VALID [2020-07-18 00:47:14,526 INFO L280 TraceCheckUtils]: 8: Hoare triple {74#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {74#true} is VALID [2020-07-18 00:47:14,527 INFO L280 TraceCheckUtils]: 9: Hoare triple {74#true} ~N~0 := #t~nondet0; {74#true} is VALID [2020-07-18 00:47:14,527 INFO L280 TraceCheckUtils]: 10: Hoare triple {74#true} havoc #t~nondet0; {74#true} is VALID [2020-07-18 00:47:14,528 INFO L280 TraceCheckUtils]: 11: Hoare triple {74#true} assume !(~N~0 <= 0); {74#true} is VALID [2020-07-18 00:47:14,528 INFO L263 TraceCheckUtils]: 12: Hoare triple {74#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {74#true} is VALID [2020-07-18 00:47:14,528 INFO L280 TraceCheckUtils]: 13: Hoare triple {74#true} ~cond := #in~cond; {74#true} is VALID [2020-07-18 00:47:14,529 INFO L280 TraceCheckUtils]: 14: Hoare triple {74#true} assume !(0 == ~cond); {74#true} is VALID [2020-07-18 00:47:14,529 INFO L280 TraceCheckUtils]: 15: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-18 00:47:14,530 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {74#true} {74#true} #118#return; {74#true} is VALID [2020-07-18 00:47:14,530 INFO L280 TraceCheckUtils]: 17: Hoare triple {74#true} havoc ~i~0; {74#true} is VALID [2020-07-18 00:47:14,531 INFO L280 TraceCheckUtils]: 18: Hoare triple {74#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4); srcloc: L26 {74#true} is VALID [2020-07-18 00:47:14,531 INFO L280 TraceCheckUtils]: 19: Hoare triple {74#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {74#true} is VALID [2020-07-18 00:47:14,531 INFO L280 TraceCheckUtils]: 20: Hoare triple {74#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {74#true} is VALID [2020-07-18 00:47:14,532 INFO L280 TraceCheckUtils]: 21: Hoare triple {74#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 4); srcloc: L29 {74#true} is VALID [2020-07-18 00:47:14,532 INFO L280 TraceCheckUtils]: 22: Hoare triple {74#true} ~i~0 := 0; {74#true} is VALID [2020-07-18 00:47:14,533 INFO L280 TraceCheckUtils]: 23: Hoare triple {74#true} assume !true; {75#false} is VALID [2020-07-18 00:47:14,534 INFO L280 TraceCheckUtils]: 24: Hoare triple {75#false} ~i~0 := 0; {75#false} is VALID [2020-07-18 00:47:14,534 INFO L280 TraceCheckUtils]: 25: Hoare triple {75#false} assume !true; {75#false} is VALID [2020-07-18 00:47:14,535 INFO L280 TraceCheckUtils]: 26: Hoare triple {75#false} ~i~0 := 0; {75#false} is VALID [2020-07-18 00:47:14,535 INFO L280 TraceCheckUtils]: 27: Hoare triple {75#false} assume !true; {75#false} is VALID [2020-07-18 00:47:14,536 INFO L280 TraceCheckUtils]: 28: Hoare triple {75#false} SUMMARY for call #t~mem10 := read~int(~#sum~0.base, ~#sum~0.offset, 4); srcloc: L44-6 {75#false} is VALID [2020-07-18 00:47:14,536 INFO L263 TraceCheckUtils]: 29: Hoare triple {75#false} call __VERIFIER_assert((if #t~mem10 == 2 * ~N~0 then 1 else 0)); {75#false} is VALID [2020-07-18 00:47:14,536 INFO L280 TraceCheckUtils]: 30: Hoare triple {75#false} ~cond := #in~cond; {75#false} is VALID [2020-07-18 00:47:14,537 INFO L280 TraceCheckUtils]: 31: Hoare triple {75#false} assume 0 == ~cond; {75#false} is VALID [2020-07-18 00:47:14,537 INFO L280 TraceCheckUtils]: 32: Hoare triple {75#false} assume !false; {75#false} is VALID [2020-07-18 00:47:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:47:14,545 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:14,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1355710978] [2020-07-18 00:47:14,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:14,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:47:14,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279082648] [2020-07-18 00:47:14,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-18 00:47:14,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:14,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:47:14,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:14,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:47:14,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:14,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:47:14,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:47:14,681 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 3 states. [2020-07-18 00:47:15,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:15,185 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2020-07-18 00:47:15,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:47:15,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-18 00:47:15,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:15,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:47:15,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2020-07-18 00:47:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:47:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2020-07-18 00:47:15,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 142 transitions. [2020-07-18 00:47:15,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:15,425 INFO L225 Difference]: With dead ends: 125 [2020-07-18 00:47:15,426 INFO L226 Difference]: Without dead ends: 59 [2020-07-18 00:47:15,431 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:47:15,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-18 00:47:15,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-07-18 00:47:15,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:15,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2020-07-18 00:47:15,523 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-18 00:47:15,524 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-18 00:47:15,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:15,530 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2020-07-18 00:47:15,530 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2020-07-18 00:47:15,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:15,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:15,531 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-18 00:47:15,532 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-18 00:47:15,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:15,537 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2020-07-18 00:47:15,537 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2020-07-18 00:47:15,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:15,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:15,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:15,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:15,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-18 00:47:15,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2020-07-18 00:47:15,545 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 33 [2020-07-18 00:47:15,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:15,546 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2020-07-18 00:47:15,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:47:15,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 62 transitions. [2020-07-18 00:47:15,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2020-07-18 00:47:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-18 00:47:15,621 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:15,621 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] [2020-07-18 00:47:15,622 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:47:15,622 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:15,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:15,623 INFO L82 PathProgramCache]: Analyzing trace with hash -341126016, now seen corresponding path program 1 times [2020-07-18 00:47:15,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:15,623 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [759129593] [2020-07-18 00:47:15,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:15,766 INFO L280 TraceCheckUtils]: 0: Hoare triple {589#(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; {575#true} is VALID [2020-07-18 00:47:15,767 INFO L280 TraceCheckUtils]: 1: Hoare triple {575#true} #valid := #valid[0 := 0]; {575#true} is VALID [2020-07-18 00:47:15,767 INFO L280 TraceCheckUtils]: 2: Hoare triple {575#true} assume 0 < #StackHeapBarrier; {575#true} is VALID [2020-07-18 00:47:15,767 INFO L280 TraceCheckUtils]: 3: Hoare triple {575#true} ~N~0 := 0; {575#true} is VALID [2020-07-18 00:47:15,768 INFO L280 TraceCheckUtils]: 4: Hoare triple {575#true} assume true; {575#true} is VALID [2020-07-18 00:47:15,768 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {575#true} {575#true} #122#return; {575#true} is VALID [2020-07-18 00:47:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:15,780 INFO L280 TraceCheckUtils]: 0: Hoare triple {575#true} ~cond := #in~cond; {575#true} is VALID [2020-07-18 00:47:15,780 INFO L280 TraceCheckUtils]: 1: Hoare triple {575#true} assume !(0 == ~cond); {575#true} is VALID [2020-07-18 00:47:15,781 INFO L280 TraceCheckUtils]: 2: Hoare triple {575#true} assume true; {575#true} is VALID [2020-07-18 00:47:15,782 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {575#true} {583#(<= 1 ~N~0)} #118#return; {583#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:15,783 INFO L263 TraceCheckUtils]: 0: Hoare triple {575#true} call ULTIMATE.init(); {589#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:47:15,784 INFO L280 TraceCheckUtils]: 1: Hoare triple {589#(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; {575#true} is VALID [2020-07-18 00:47:15,784 INFO L280 TraceCheckUtils]: 2: Hoare triple {575#true} #valid := #valid[0 := 0]; {575#true} is VALID [2020-07-18 00:47:15,785 INFO L280 TraceCheckUtils]: 3: Hoare triple {575#true} assume 0 < #StackHeapBarrier; {575#true} is VALID [2020-07-18 00:47:15,785 INFO L280 TraceCheckUtils]: 4: Hoare triple {575#true} ~N~0 := 0; {575#true} is VALID [2020-07-18 00:47:15,785 INFO L280 TraceCheckUtils]: 5: Hoare triple {575#true} assume true; {575#true} is VALID [2020-07-18 00:47:15,786 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {575#true} {575#true} #122#return; {575#true} is VALID [2020-07-18 00:47:15,786 INFO L263 TraceCheckUtils]: 7: Hoare triple {575#true} call #t~ret11 := main(); {575#true} is VALID [2020-07-18 00:47:15,787 INFO L280 TraceCheckUtils]: 8: Hoare triple {575#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {575#true} is VALID [2020-07-18 00:47:15,787 INFO L280 TraceCheckUtils]: 9: Hoare triple {575#true} ~N~0 := #t~nondet0; {575#true} is VALID [2020-07-18 00:47:15,787 INFO L280 TraceCheckUtils]: 10: Hoare triple {575#true} havoc #t~nondet0; {575#true} is VALID [2020-07-18 00:47:15,788 INFO L280 TraceCheckUtils]: 11: Hoare triple {575#true} assume !(~N~0 <= 0); {583#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:15,789 INFO L263 TraceCheckUtils]: 12: Hoare triple {583#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {575#true} is VALID [2020-07-18 00:47:15,789 INFO L280 TraceCheckUtils]: 13: Hoare triple {575#true} ~cond := #in~cond; {575#true} is VALID [2020-07-18 00:47:15,790 INFO L280 TraceCheckUtils]: 14: Hoare triple {575#true} assume !(0 == ~cond); {575#true} is VALID [2020-07-18 00:47:15,790 INFO L280 TraceCheckUtils]: 15: Hoare triple {575#true} assume true; {575#true} is VALID [2020-07-18 00:47:15,791 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {575#true} {583#(<= 1 ~N~0)} #118#return; {583#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:15,792 INFO L280 TraceCheckUtils]: 17: Hoare triple {583#(<= 1 ~N~0)} havoc ~i~0; {583#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:15,793 INFO L280 TraceCheckUtils]: 18: Hoare triple {583#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4); srcloc: L26 {583#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:15,794 INFO L280 TraceCheckUtils]: 19: Hoare triple {583#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {583#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:15,795 INFO L280 TraceCheckUtils]: 20: Hoare triple {583#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {583#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:15,795 INFO L280 TraceCheckUtils]: 21: Hoare triple {583#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 4); srcloc: L29 {583#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:15,796 INFO L280 TraceCheckUtils]: 22: Hoare triple {583#(<= 1 ~N~0)} ~i~0 := 0; {588#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-18 00:47:15,798 INFO L280 TraceCheckUtils]: 23: Hoare triple {588#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {576#false} is VALID [2020-07-18 00:47:15,798 INFO L280 TraceCheckUtils]: 24: Hoare triple {576#false} ~i~0 := 0; {576#false} is VALID [2020-07-18 00:47:15,799 INFO L280 TraceCheckUtils]: 25: Hoare triple {576#false} assume !(~i~0 < ~N~0); {576#false} is VALID [2020-07-18 00:47:15,799 INFO L280 TraceCheckUtils]: 26: Hoare triple {576#false} ~i~0 := 0; {576#false} is VALID [2020-07-18 00:47:15,799 INFO L280 TraceCheckUtils]: 27: Hoare triple {576#false} assume !(~i~0 < ~N~0); {576#false} is VALID [2020-07-18 00:47:15,800 INFO L280 TraceCheckUtils]: 28: Hoare triple {576#false} SUMMARY for call #t~mem10 := read~int(~#sum~0.base, ~#sum~0.offset, 4); srcloc: L44-6 {576#false} is VALID [2020-07-18 00:47:15,800 INFO L263 TraceCheckUtils]: 29: Hoare triple {576#false} call __VERIFIER_assert((if #t~mem10 == 2 * ~N~0 then 1 else 0)); {576#false} is VALID [2020-07-18 00:47:15,800 INFO L280 TraceCheckUtils]: 30: Hoare triple {576#false} ~cond := #in~cond; {576#false} is VALID [2020-07-18 00:47:15,801 INFO L280 TraceCheckUtils]: 31: Hoare triple {576#false} assume 0 == ~cond; {576#false} is VALID [2020-07-18 00:47:15,801 INFO L280 TraceCheckUtils]: 32: Hoare triple {576#false} assume !false; {576#false} is VALID [2020-07-18 00:47:15,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:47:15,809 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:15,810 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [759129593] [2020-07-18 00:47:15,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:15,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:47:15,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539177248] [2020-07-18 00:47:15,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-07-18 00:47:15,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:15,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:47:15,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:15,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:47:15,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:15,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:47:15,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:47:15,854 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 5 states. [2020-07-18 00:47:16,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:16,366 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2020-07-18 00:47:16,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:47:16,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-07-18 00:47:16,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:16,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2020-07-18 00:47:16,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:16,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2020-07-18 00:47:16,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 124 transitions. [2020-07-18 00:47:16,512 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:16,517 INFO L225 Difference]: With dead ends: 115 [2020-07-18 00:47:16,517 INFO L226 Difference]: Without dead ends: 84 [2020-07-18 00:47:16,519 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:47:16,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-07-18 00:47:16,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2020-07-18 00:47:16,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:16,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 62 states. [2020-07-18 00:47:16,625 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 62 states. [2020-07-18 00:47:16,625 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 62 states. [2020-07-18 00:47:16,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:16,629 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2020-07-18 00:47:16,629 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2020-07-18 00:47:16,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:16,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:16,631 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 84 states. [2020-07-18 00:47:16,631 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 84 states. [2020-07-18 00:47:16,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:16,636 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2020-07-18 00:47:16,636 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2020-07-18 00:47:16,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:16,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:16,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:16,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:16,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-18 00:47:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2020-07-18 00:47:16,640 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 33 [2020-07-18 00:47:16,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:16,641 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2020-07-18 00:47:16,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:47:16,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2020-07-18 00:47:16,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:16,726 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2020-07-18 00:47:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-18 00:47:16,729 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:16,730 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] [2020-07-18 00:47:16,730 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:47:16,730 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:16,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:16,730 INFO L82 PathProgramCache]: Analyzing trace with hash 746418975, now seen corresponding path program 1 times [2020-07-18 00:47:16,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:16,731 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1649443405] [2020-07-18 00:47:16,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:16,768 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:47:16,769 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:458) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:290) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-18 00:47:16,776 INFO L168 Benchmark]: Toolchain (without parser) took 3653.28 ms. Allocated memory was 146.8 MB in the beginning and 244.8 MB in the end (delta: 98.0 MB). Free memory was 103.8 MB in the beginning and 214.4 MB in the end (delta: -110.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 00:47:16,777 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 146.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 00:47:16,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 434.08 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 103.4 MB in the beginning and 183.6 MB in the end (delta: -80.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:16,778 INFO L168 Benchmark]: Boogie Preprocessor took 62.00 ms. Allocated memory is still 204.5 MB. Free memory was 183.6 MB in the beginning and 181.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:16,779 INFO L168 Benchmark]: RCFGBuilder took 527.49 ms. Allocated memory is still 204.5 MB. Free memory was 181.3 MB in the beginning and 150.6 MB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:16,780 INFO L168 Benchmark]: TraceAbstraction took 2623.02 ms. Allocated memory was 204.5 MB in the beginning and 244.8 MB in the end (delta: 40.4 MB). Free memory was 149.9 MB in the beginning and 214.4 MB in the end (delta: -64.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 00:47:16,784 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 146.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 434.08 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 103.4 MB in the beginning and 183.6 MB in the end (delta: -80.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.00 ms. Allocated memory is still 204.5 MB. Free memory was 183.6 MB in the beginning and 181.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 527.49 ms. Allocated memory is still 204.5 MB. Free memory was 181.3 MB in the beginning and 150.6 MB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2623.02 ms. Allocated memory was 204.5 MB in the beginning and 244.8 MB in the end (delta: 40.4 MB). Free memory was 149.9 MB in the beginning and 214.4 MB in the end (delta: -64.5 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...