/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/ldv-regression/oomInt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 19:01:05,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 19:01:05,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 19:01:05,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 19:01:05,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 19:01:05,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 19:01:05,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 19:01:05,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 19:01:05,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 19:01:05,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 19:01:05,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 19:01:05,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 19:01:05,853 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 19:01:05,854 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 19:01:05,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 19:01:05,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 19:01:05,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 19:01:05,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 19:01:05,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 19:01:05,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 19:01:05,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 19:01:05,863 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 19:01:05,864 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 19:01:05,865 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 19:01:05,867 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 19:01:05,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 19:01:05,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 19:01:05,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 19:01:05,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 19:01:05,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 19:01:05,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 19:01:05,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 19:01:05,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 19:01:05,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 19:01:05,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 19:01:05,874 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 19:01:05,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 19:01:05,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 19:01:05,875 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 19:01:05,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 19:01:05,876 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 19:01:05,877 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 19:01:05,886 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 19:01:05,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 19:01:05,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 19:01:05,888 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 19:01:05,888 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 19:01:05,888 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 19:01:05,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 19:01:05,889 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 19:01:05,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 19:01:05,889 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 19:01:05,889 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 19:01:05,889 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 19:01:05,890 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 19:01:05,890 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 19:01:05,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 19:01:05,890 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 19:01:05,891 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 19:01:05,891 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 19:01:05,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:01:05,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 19:01:05,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 19:01:05,891 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 19:01:05,892 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 19:01:06,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 19:01:06,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 19:01:06,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 19:01:06,178 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 19:01:06,179 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 19:01:06,180 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/oomInt.i [2020-07-10 19:01:06,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41e80f4a8/ee0cd96d90574da2a913306157cde38c/FLAG5250e1df4 [2020-07-10 19:01:06,691 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 19:01:06,691 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/oomInt.i [2020-07-10 19:01:06,697 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41e80f4a8/ee0cd96d90574da2a913306157cde38c/FLAG5250e1df4 [2020-07-10 19:01:07,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41e80f4a8/ee0cd96d90574da2a913306157cde38c [2020-07-10 19:01:07,139 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 19:01:07,143 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 19:01:07,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 19:01:07,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 19:01:07,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 19:01:07,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:01:07" (1/1) ... [2020-07-10 19:01:07,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@476c127c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:07, skipping insertion in model container [2020-07-10 19:01:07,155 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:01:07" (1/1) ... [2020-07-10 19:01:07,163 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 19:01:07,182 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 19:01:07,376 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:01:07,381 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 19:01:07,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:01:07,411 INFO L208 MainTranslator]: Completed translation [2020-07-10 19:01:07,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:07 WrapperNode [2020-07-10 19:01:07,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 19:01:07,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 19:01:07,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 19:01:07,413 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 19:01:07,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:07" (1/1) ... [2020-07-10 19:01:07,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:07" (1/1) ... [2020-07-10 19:01:07,427 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:07" (1/1) ... [2020-07-10 19:01:07,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:07" (1/1) ... [2020-07-10 19:01:07,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:07" (1/1) ... [2020-07-10 19:01:07,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:07" (1/1) ... [2020-07-10 19:01:07,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:07" (1/1) ... [2020-07-10 19:01:07,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 19:01:07,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 19:01:07,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 19:01:07,436 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 19:01:07,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:07" (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 19:01:07,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 19:01:07,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 19:01:07,589 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 19:01:07,589 INFO L138 BoogieDeclarations]: Found implementation of procedure abs_int [2020-07-10 19:01:07,589 INFO L138 BoogieDeclarations]: Found implementation of procedure firstFunction [2020-07-10 19:01:07,589 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 19:01:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 19:01:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 19:01:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure abs_int [2020-07-10 19:01:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure firstFunction [2020-07-10 19:01:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 19:01:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 19:01:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 19:01:07,817 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 19:01:07,818 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 19:01:07,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:01:07 BoogieIcfgContainer [2020-07-10 19:01:07,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 19:01:07,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 19:01:07,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 19:01:07,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 19:01:07,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 07:01:07" (1/3) ... [2020-07-10 19:01:07,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754ce8f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:01:07, skipping insertion in model container [2020-07-10 19:01:07,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:01:07" (2/3) ... [2020-07-10 19:01:07,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754ce8f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:01:07, skipping insertion in model container [2020-07-10 19:01:07,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:01:07" (3/3) ... [2020-07-10 19:01:07,832 INFO L109 eAbstractionObserver]: Analyzing ICFG oomInt.i [2020-07-10 19:01:07,844 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 19:01:07,852 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 19:01:07,868 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 19:01:07,895 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 19:01:07,895 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 19:01:07,895 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 19:01:07,895 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 19:01:07,896 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 19:01:07,896 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 19:01:07,896 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 19:01:07,896 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 19:01:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-07-10 19:01:07,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 19:01:07,923 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:01:07,924 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:01:07,925 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:01:07,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:01:07,931 INFO L82 PathProgramCache]: Analyzing trace with hash 531924990, now seen corresponding path program 1 times [2020-07-10 19:01:07,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:01:07,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [745338282] [2020-07-10 19:01:07,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:01:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:01:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:01:08,261 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#(= ~p~0 |old(~p~0)|)} ~p~0 := 0; {32#true} is VALID [2020-07-10 19:01:08,261 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-10 19:01:08,262 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #33#return; {32#true} is VALID [2020-07-10 19:01:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:01:08,357 INFO L280 TraceCheckUtils]: 0: Hoare triple {32#true} ~i := #in~i; {47#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} is VALID [2020-07-10 19:01:08,359 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} assume ~i < 0; {47#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} is VALID [2020-07-10 19:01:08,360 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} #res := -~i; {48#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} is VALID [2020-07-10 19:01:08,361 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} assume true; {48#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} is VALID [2020-07-10 19:01:08,364 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {48#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} {32#true} #37#return; {42#(<= 1 |firstFunction_#t~ret0|)} is VALID [2020-07-10 19:01:08,366 INFO L263 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {46#(= ~p~0 |old(~p~0)|)} is VALID [2020-07-10 19:01:08,366 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#(= ~p~0 |old(~p~0)|)} ~p~0 := 0; {32#true} is VALID [2020-07-10 19:01:08,367 INFO L280 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-10 19:01:08,367 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #33#return; {32#true} is VALID [2020-07-10 19:01:08,367 INFO L263 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret1 := main(); {32#true} is VALID [2020-07-10 19:01:08,368 INFO L263 TraceCheckUtils]: 5: Hoare triple {32#true} call firstFunction(); {32#true} is VALID [2020-07-10 19:01:08,368 INFO L263 TraceCheckUtils]: 6: Hoare triple {32#true} call #t~ret0 := abs_int(-3); {32#true} is VALID [2020-07-10 19:01:08,370 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#true} ~i := #in~i; {47#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} is VALID [2020-07-10 19:01:08,371 INFO L280 TraceCheckUtils]: 8: Hoare triple {47#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} assume ~i < 0; {47#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} is VALID [2020-07-10 19:01:08,372 INFO L280 TraceCheckUtils]: 9: Hoare triple {47#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} #res := -~i; {48#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} is VALID [2020-07-10 19:01:08,373 INFO L280 TraceCheckUtils]: 10: Hoare triple {48#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} assume true; {48#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} is VALID [2020-07-10 19:01:08,377 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {48#(or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|))} {32#true} #37#return; {42#(<= 1 |firstFunction_#t~ret0|)} is VALID [2020-07-10 19:01:08,378 INFO L280 TraceCheckUtils]: 12: Hoare triple {42#(<= 1 |firstFunction_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {42#(<= 1 |firstFunction_#t~ret0|)} is VALID [2020-07-10 19:01:08,379 INFO L280 TraceCheckUtils]: 13: Hoare triple {42#(<= 1 |firstFunction_#t~ret0|)} ~p~0 := #t~ret0; {43#(<= 1 ~p~0)} is VALID [2020-07-10 19:01:08,380 INFO L280 TraceCheckUtils]: 14: Hoare triple {43#(<= 1 ~p~0)} havoc #t~ret0; {43#(<= 1 ~p~0)} is VALID [2020-07-10 19:01:08,382 INFO L263 TraceCheckUtils]: 15: Hoare triple {43#(<= 1 ~p~0)} call __VERIFIER_assert((if ~p~0 >= 0 then 1 else 0)); {44#(not (= 0 |__VERIFIER_assert_#in~i|))} is VALID [2020-07-10 19:01:08,383 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#(not (= 0 |__VERIFIER_assert_#in~i|))} ~i := #in~i; {45#(not (= 0 __VERIFIER_assert_~i))} is VALID [2020-07-10 19:01:08,384 INFO L280 TraceCheckUtils]: 17: Hoare triple {45#(not (= 0 __VERIFIER_assert_~i))} assume 0 == ~i; {33#false} is VALID [2020-07-10 19:01:08,384 INFO L280 TraceCheckUtils]: 18: Hoare triple {33#false} assume !false; {33#false} is VALID [2020-07-10 19:01:08,388 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 19:01:08,388 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:01:08,390 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [745338282] [2020-07-10 19:01:08,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:01:08,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 19:01:08,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334601627] [2020-07-10 19:01:08,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-07-10 19:01:08,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:01:08,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 19:01:08,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:01:08,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 19:01:08,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:01:08,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 19:01:08,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-07-10 19:01:08,470 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 9 states. [2020-07-10 19:01:09,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:01:09,211 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2020-07-10 19:01:09,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 19:01:09,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-07-10 19:01:09,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:01:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 19:01:09,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2020-07-10 19:01:09,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 19:01:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2020-07-10 19:01:09,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 56 transitions. [2020-07-10 19:01:09,305 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:01:09,316 INFO L225 Difference]: With dead ends: 55 [2020-07-10 19:01:09,316 INFO L226 Difference]: Without dead ends: 20 [2020-07-10 19:01:09,320 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-07-10 19:01:09,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-10 19:01:09,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-10 19:01:09,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:01:09,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-10 19:01:09,381 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-10 19:01:09,381 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-10 19:01:09,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:01:09,385 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2020-07-10 19:01:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2020-07-10 19:01:09,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:01:09,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:01:09,386 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-10 19:01:09,386 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-10 19:01:09,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:01:09,389 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2020-07-10 19:01:09,389 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2020-07-10 19:01:09,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:01:09,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:01:09,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:01:09,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:01:09,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 19:01:09,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2020-07-10 19:01:09,394 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 19 [2020-07-10 19:01:09,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:01:09,394 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2020-07-10 19:01:09,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 19:01:09,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 19 transitions. [2020-07-10 19:01:09,420 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:01:09,420 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2020-07-10 19:01:09,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 19:01:09,421 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:01:09,421 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:01:09,422 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 19:01:09,422 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:01:09,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:01:09,423 INFO L82 PathProgramCache]: Analyzing trace with hash 839962558, now seen corresponding path program 1 times [2020-07-10 19:01:09,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:01:09,423 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1381198193] [2020-07-10 19:01:09,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:01:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:01:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:01:09,473 INFO L280 TraceCheckUtils]: 0: Hoare triple {265#(= ~p~0 |old(~p~0)|)} ~p~0 := 0; {255#true} is VALID [2020-07-10 19:01:09,473 INFO L280 TraceCheckUtils]: 1: Hoare triple {255#true} assume true; {255#true} is VALID [2020-07-10 19:01:09,474 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {255#true} {255#true} #33#return; {255#true} is VALID [2020-07-10 19:01:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:01:09,533 INFO L280 TraceCheckUtils]: 0: Hoare triple {255#true} ~i := #in~i; {266#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} is VALID [2020-07-10 19:01:09,535 INFO L280 TraceCheckUtils]: 1: Hoare triple {266#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} assume !(~i < 0); {267#(not (= 0 (+ |abs_int_#in~i| 3)))} is VALID [2020-07-10 19:01:09,536 INFO L280 TraceCheckUtils]: 2: Hoare triple {267#(not (= 0 (+ |abs_int_#in~i| 3)))} #res := ~i; {267#(not (= 0 (+ |abs_int_#in~i| 3)))} is VALID [2020-07-10 19:01:09,537 INFO L280 TraceCheckUtils]: 3: Hoare triple {267#(not (= 0 (+ |abs_int_#in~i| 3)))} assume true; {267#(not (= 0 (+ |abs_int_#in~i| 3)))} is VALID [2020-07-10 19:01:09,538 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {267#(not (= 0 (+ |abs_int_#in~i| 3)))} {255#true} #37#return; {256#false} is VALID [2020-07-10 19:01:09,540 INFO L263 TraceCheckUtils]: 0: Hoare triple {255#true} call ULTIMATE.init(); {265#(= ~p~0 |old(~p~0)|)} is VALID [2020-07-10 19:01:09,540 INFO L280 TraceCheckUtils]: 1: Hoare triple {265#(= ~p~0 |old(~p~0)|)} ~p~0 := 0; {255#true} is VALID [2020-07-10 19:01:09,540 INFO L280 TraceCheckUtils]: 2: Hoare triple {255#true} assume true; {255#true} is VALID [2020-07-10 19:01:09,541 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {255#true} {255#true} #33#return; {255#true} is VALID [2020-07-10 19:01:09,542 INFO L263 TraceCheckUtils]: 4: Hoare triple {255#true} call #t~ret1 := main(); {255#true} is VALID [2020-07-10 19:01:09,542 INFO L263 TraceCheckUtils]: 5: Hoare triple {255#true} call firstFunction(); {255#true} is VALID [2020-07-10 19:01:09,543 INFO L263 TraceCheckUtils]: 6: Hoare triple {255#true} call #t~ret0 := abs_int(-3); {255#true} is VALID [2020-07-10 19:01:09,544 INFO L280 TraceCheckUtils]: 7: Hoare triple {255#true} ~i := #in~i; {266#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} is VALID [2020-07-10 19:01:09,545 INFO L280 TraceCheckUtils]: 8: Hoare triple {266#(or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))} assume !(~i < 0); {267#(not (= 0 (+ |abs_int_#in~i| 3)))} is VALID [2020-07-10 19:01:09,546 INFO L280 TraceCheckUtils]: 9: Hoare triple {267#(not (= 0 (+ |abs_int_#in~i| 3)))} #res := ~i; {267#(not (= 0 (+ |abs_int_#in~i| 3)))} is VALID [2020-07-10 19:01:09,547 INFO L280 TraceCheckUtils]: 10: Hoare triple {267#(not (= 0 (+ |abs_int_#in~i| 3)))} assume true; {267#(not (= 0 (+ |abs_int_#in~i| 3)))} is VALID [2020-07-10 19:01:09,548 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {267#(not (= 0 (+ |abs_int_#in~i| 3)))} {255#true} #37#return; {256#false} is VALID [2020-07-10 19:01:09,548 INFO L280 TraceCheckUtils]: 12: Hoare triple {256#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {256#false} is VALID [2020-07-10 19:01:09,549 INFO L280 TraceCheckUtils]: 13: Hoare triple {256#false} ~p~0 := #t~ret0; {256#false} is VALID [2020-07-10 19:01:09,549 INFO L280 TraceCheckUtils]: 14: Hoare triple {256#false} havoc #t~ret0; {256#false} is VALID [2020-07-10 19:01:09,550 INFO L263 TraceCheckUtils]: 15: Hoare triple {256#false} call __VERIFIER_assert((if ~p~0 >= 0 then 1 else 0)); {256#false} is VALID [2020-07-10 19:01:09,550 INFO L280 TraceCheckUtils]: 16: Hoare triple {256#false} ~i := #in~i; {256#false} is VALID [2020-07-10 19:01:09,552 INFO L280 TraceCheckUtils]: 17: Hoare triple {256#false} assume 0 == ~i; {256#false} is VALID [2020-07-10 19:01:09,552 INFO L280 TraceCheckUtils]: 18: Hoare triple {256#false} assume !false; {256#false} is VALID [2020-07-10 19:01:09,554 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 19:01:09,554 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:01:09,554 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1381198193] [2020-07-10 19:01:09,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:01:09,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 19:01:09,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468146372] [2020-07-10 19:01:09,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-10 19:01:09,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:01:09,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 19:01:09,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:01:09,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 19:01:09,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:01:09,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 19:01:09,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 19:01:09,584 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand 5 states. [2020-07-10 19:01:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:01:09,696 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2020-07-10 19:01:09,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 19:01:09,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-10 19:01:09,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:01:09,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 19:01:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-10 19:01:09,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 19:01:09,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-10 19:01:09,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2020-07-10 19:01:09,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:01:09,740 INFO L225 Difference]: With dead ends: 20 [2020-07-10 19:01:09,740 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 19:01:09,742 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-10 19:01:09,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 19:01:09,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 19:01:09,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:01:09,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 19:01:09,743 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 19:01:09,744 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 19:01:09,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:01:09,744 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 19:01:09,744 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:01:09,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:01:09,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:01:09,745 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 19:01:09,745 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 19:01:09,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:01:09,746 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 19:01:09,746 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:01:09,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:01:09,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:01:09,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:01:09,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:01:09,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 19:01:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 19:01:09,748 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2020-07-10 19:01:09,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:01:09,748 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 19:01:09,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 19:01:09,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 19:01:09,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:01:09,749 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:01:09,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:01:09,749 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 19:01:09,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 19:01:10,028 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 19:01:10,028 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~p~0 |old(~p~0)|) [2020-07-10 19:01:10,028 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 19:01:10,028 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 19:01:10,028 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 19:01:10,029 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 19:01:10,029 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 19:01:10,029 INFO L264 CegarLoopResult]: At program point abs_intEXIT(lines 16 25) the Hoare annotation is: (and (or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|)) (or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))) [2020-07-10 19:01:10,029 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (and (not (= 0 (+ |abs_int_#in~i| 3))) (or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))) [2020-07-10 19:01:10,029 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3))) [2020-07-10 19:01:10,030 INFO L271 CegarLoopResult]: At program point abs_intENTRY(lines 16 25) the Hoare annotation is: true [2020-07-10 19:01:10,030 INFO L264 CegarLoopResult]: At program point L18(lines 18 24) the Hoare annotation is: (or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3))) [2020-07-10 19:01:10,030 INFO L264 CegarLoopResult]: At program point abs_intFINAL(lines 16 25) the Hoare annotation is: (and (or (not (= 0 (+ |abs_int_#in~i| 3))) (<= 3 |abs_int_#res|)) (or (= |abs_int_#in~i| abs_int_~i) (= 0 (+ abs_int_~i 3)))) [2020-07-10 19:01:10,030 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (<= 1 ~p~0) [2020-07-10 19:01:10,030 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (= ~p~0 |old(~p~0)|) (<= 1 |firstFunction_#t~ret0|)) [2020-07-10 19:01:10,031 INFO L264 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: (and (= ~p~0 |old(~p~0)|) (<= 1 |firstFunction_#t~ret0|)) [2020-07-10 19:01:10,031 INFO L264 CegarLoopResult]: At program point firstFunctionENTRY(lines 27 31) the Hoare annotation is: (= ~p~0 |old(~p~0)|) [2020-07-10 19:01:10,031 INFO L264 CegarLoopResult]: At program point L29-2(line 29) the Hoare annotation is: (and (<= 1 |firstFunction_#t~ret0|) (<= 1 ~p~0)) [2020-07-10 19:01:10,031 INFO L271 CegarLoopResult]: At program point firstFunctionFINAL(lines 27 31) the Hoare annotation is: true [2020-07-10 19:01:10,031 INFO L271 CegarLoopResult]: At program point firstFunctionEXIT(lines 27 31) the Hoare annotation is: true [2020-07-10 19:01:10,031 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 33 36) the Hoare annotation is: (= ~p~0 |old(~p~0)|) [2020-07-10 19:01:10,032 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 33 36) the Hoare annotation is: true [2020-07-10 19:01:10,032 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 33 36) the Hoare annotation is: true [2020-07-10 19:01:10,032 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 12) the Hoare annotation is: true [2020-07-10 19:01:10,032 INFO L264 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: (or (not (<= 1 ~p~0)) (= 0 |__VERIFIER_assert_#in~i|)) [2020-07-10 19:01:10,032 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 12) the Hoare annotation is: (or (not (<= 1 ~p~0)) (not (= 0 __VERIFIER_assert_~i)) (= 0 |__VERIFIER_assert_#in~i|)) [2020-07-10 19:01:10,033 INFO L264 CegarLoopResult]: At program point L8(lines 8 11) the Hoare annotation is: (or (not (<= 1 ~p~0)) (not (= 0 __VERIFIER_assert_~i)) (= 0 |__VERIFIER_assert_#in~i|)) [2020-07-10 19:01:10,033 INFO L264 CegarLoopResult]: At program point L8-2(lines 6 12) the Hoare annotation is: (or (not (<= 1 ~p~0)) (not (= 0 __VERIFIER_assert_~i)) (= 0 |__VERIFIER_assert_#in~i|)) [2020-07-10 19:01:10,033 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) the Hoare annotation is: (or (not (<= 1 ~p~0)) (= 0 |__VERIFIER_assert_#in~i|)) [2020-07-10 19:01:10,048 INFO L163 areAnnotationChecker]: CFG has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 19:01:10,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 07:01:10 BoogieIcfgContainer [2020-07-10 19:01:10,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 19:01:10,065 INFO L168 Benchmark]: Toolchain (without parser) took 2921.15 ms. Allocated memory was 142.6 MB in the beginning and 252.2 MB in the end (delta: 109.6 MB). Free memory was 101.2 MB in the beginning and 184.8 MB in the end (delta: -83.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2020-07-10 19:01:10,066 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 142.6 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 19:01:10,066 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.12 ms. Allocated memory is still 142.6 MB. Free memory was 101.0 MB in the beginning and 91.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-10 19:01:10,067 INFO L168 Benchmark]: Boogie Preprocessor took 22.83 ms. Allocated memory is still 142.6 MB. Free memory was 91.1 MB in the beginning and 89.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-10 19:01:10,068 INFO L168 Benchmark]: RCFGBuilder took 387.43 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 89.8 MB in the beginning and 163.1 MB in the end (delta: -73.4 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-10 19:01:10,069 INFO L168 Benchmark]: TraceAbstraction took 2236.32 ms. Allocated memory was 199.8 MB in the beginning and 252.2 MB in the end (delta: 52.4 MB). Free memory was 162.4 MB in the beginning and 184.8 MB in the end (delta: -22.4 MB). Peak memory consumption was 30.0 MB. Max. memory is 7.1 GB. [2020-07-10 19:01:10,073 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 142.6 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 267.12 ms. Allocated memory is still 142.6 MB. Free memory was 101.0 MB in the beginning and 91.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.83 ms. Allocated memory is still 142.6 MB. Free memory was 91.1 MB in the beginning and 89.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 387.43 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 89.8 MB in the beginning and 163.1 MB in the end (delta: -73.4 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2236.32 ms. Allocated memory was 199.8 MB in the beginning and 252.2 MB in the end (delta: 52.4 MB). Free memory was 162.4 MB in the beginning and 184.8 MB in the end (delta: -22.4 MB). Peak memory consumption was 30.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 16]: Procedure Contract for abs_int Derived contract for procedure abs_int: (!(0 == \old(i) + 3) || 3 <= \result) && (\old(i) == i || 0 == i + 3) - ProcedureContractResult [Line: 27]: Procedure Contract for firstFunction Derived contract for procedure firstFunction: 1 - ProcedureContractResult [Line: 33]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (!(1 <= p) || !(0 == i)) || 0 == \old(i) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.8s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 29 SDtfs, 42 SDslu, 102 SDs, 0 SdLazy, 109 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 35 PreInvPairs, 57 NumberOfFragments, 171 HoareAnnotationTreeSize, 35 FomulaSimplifications, 50 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 70 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...