/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/recursive/McCarthy91-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:14:04,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:14:04,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:14:04,314 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:14:04,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:14:04,315 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:14:04,317 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:14:04,318 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:14:04,320 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:14:04,321 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:14:04,322 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:14:04,323 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:14:04,323 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:14:04,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:14:04,325 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:14:04,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:14:04,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:14:04,327 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:14:04,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:14:04,331 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:14:04,332 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:14:04,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:14:04,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:14:04,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:14:04,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:14:04,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:14:04,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:14:04,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:14:04,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:14:04,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:14:04,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:14:04,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:14:04,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:14:04,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:14:04,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:14:04,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:14:04,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:14:04,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:14:04,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:14:04,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:14:04,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:14:04,346 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:14:04,357 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:14:04,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:14:04,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:14:04,359 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:14:04,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:14:04,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:14:04,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:14:04,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:14:04,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:14:04,360 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:14:04,360 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:14:04,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:14:04,361 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:14:04,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:14:04,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:14:04,361 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:14:04,361 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:14:04,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:14:04,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:14:04,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:14:04,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:14:04,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:14:04,363 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:14:04,651 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:14:04,662 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:14:04,665 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:14:04,666 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:14:04,667 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:14:04,667 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/McCarthy91-2.c [2020-07-18 00:14:04,741 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af6a44604/283a9de19cd24058b48d20d2e799c53b/FLAG2b0bc855e [2020-07-18 00:14:05,222 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:14:05,223 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/McCarthy91-2.c [2020-07-18 00:14:05,230 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af6a44604/283a9de19cd24058b48d20d2e799c53b/FLAG2b0bc855e [2020-07-18 00:14:05,611 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af6a44604/283a9de19cd24058b48d20d2e799c53b [2020-07-18 00:14:05,621 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:14:05,625 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:14:05,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:14:05,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:14:05,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:14:05,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:14:05" (1/1) ... [2020-07-18 00:14:05,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28d0140a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:05, skipping insertion in model container [2020-07-18 00:14:05,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:14:05" (1/1) ... [2020-07-18 00:14:05,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:14:05,660 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:14:05,830 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:14:05,835 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:14:05,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:14:05,865 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:14:05,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:05 WrapperNode [2020-07-18 00:14:05,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:14:05,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:14:05,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:14:05,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:14:05,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:05" (1/1) ... [2020-07-18 00:14:05,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:05" (1/1) ... [2020-07-18 00:14:05,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:05" (1/1) ... [2020-07-18 00:14:05,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:05" (1/1) ... [2020-07-18 00:14:05,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:05" (1/1) ... [2020-07-18 00:14:05,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:05" (1/1) ... [2020-07-18 00:14:05,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:05" (1/1) ... [2020-07-18 00:14:05,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:14:05,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:14:05,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:14:05,978 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:14:05,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:05" (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:14:06,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:14:06,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:14:06,035 INFO L138 BoogieDeclarations]: Found implementation of procedure f91 [2020-07-18 00:14:06,035 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:14:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:14:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:14:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure f91 [2020-07-18 00:14:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:14:06,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:14:06,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:14:06,293 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:14:06,293 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 00:14:06,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:14:06 BoogieIcfgContainer [2020-07-18 00:14:06,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:14:06,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:14:06,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:14:06,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:14:06,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:14:05" (1/3) ... [2020-07-18 00:14:06,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b78211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:14:06, skipping insertion in model container [2020-07-18 00:14:06,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:05" (2/3) ... [2020-07-18 00:14:06,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b78211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:14:06, skipping insertion in model container [2020-07-18 00:14:06,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:14:06" (3/3) ... [2020-07-18 00:14:06,308 INFO L109 eAbstractionObserver]: Analyzing ICFG McCarthy91-2.c [2020-07-18 00:14:06,320 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:14:06,329 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:14:06,348 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:14:06,370 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:14:06,370 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:14:06,371 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:14:06,371 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:14:06,371 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:14:06,371 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:14:06,371 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:14:06,372 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:14:06,391 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2020-07-18 00:14:06,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-18 00:14:06,401 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:06,403 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:14:06,403 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:06,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:06,409 INFO L82 PathProgramCache]: Analyzing trace with hash 346555185, now seen corresponding path program 1 times [2020-07-18 00:14:06,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:06,419 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1543744311] [2020-07-18 00:14:06,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:06,739 INFO L280 TraceCheckUtils]: 0: Hoare triple {34#true} assume true; {34#true} is VALID [2020-07-18 00:14:06,739 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {34#true} {34#true} #35#return; {34#true} is VALID [2020-07-18 00:14:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:06,845 INFO L280 TraceCheckUtils]: 0: Hoare triple {34#true} ~x := #in~x; {45#(= f91_~x |f91_#in~x|)} is VALID [2020-07-18 00:14:06,847 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#(= f91_~x |f91_#in~x|)} assume ~x > 100; {46#(and (= f91_~x |f91_#in~x|) (<= 101 f91_~x))} is VALID [2020-07-18 00:14:06,849 INFO L280 TraceCheckUtils]: 2: Hoare triple {46#(and (= f91_~x |f91_#in~x|) (<= 101 f91_~x))} #res := ~x - 10; {47#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} is VALID [2020-07-18 00:14:06,850 INFO L280 TraceCheckUtils]: 3: Hoare triple {47#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} assume true; {47#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} is VALID [2020-07-18 00:14:06,852 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {47#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} {34#true} #39#return; {43#(and (<= main_~x~0 (+ |main_#t~ret3| 10)) (<= (+ |main_#t~ret3| 10) main_~x~0) (<= 91 |main_#t~ret3|))} is VALID [2020-07-18 00:14:06,853 INFO L263 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2020-07-18 00:14:06,854 INFO L280 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2020-07-18 00:14:06,854 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #35#return; {34#true} is VALID [2020-07-18 00:14:06,855 INFO L263 TraceCheckUtils]: 3: Hoare triple {34#true} call #t~ret4 := main(); {34#true} is VALID [2020-07-18 00:14:06,855 INFO L280 TraceCheckUtils]: 4: Hoare triple {34#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {34#true} is VALID [2020-07-18 00:14:06,856 INFO L280 TraceCheckUtils]: 5: Hoare triple {34#true} ~x~0 := #t~nondet2; {34#true} is VALID [2020-07-18 00:14:06,856 INFO L280 TraceCheckUtils]: 6: Hoare triple {34#true} havoc #t~nondet2; {34#true} is VALID [2020-07-18 00:14:06,857 INFO L263 TraceCheckUtils]: 7: Hoare triple {34#true} call #t~ret3 := f91(~x~0); {34#true} is VALID [2020-07-18 00:14:06,858 INFO L280 TraceCheckUtils]: 8: Hoare triple {34#true} ~x := #in~x; {45#(= f91_~x |f91_#in~x|)} is VALID [2020-07-18 00:14:06,859 INFO L280 TraceCheckUtils]: 9: Hoare triple {45#(= f91_~x |f91_#in~x|)} assume ~x > 100; {46#(and (= f91_~x |f91_#in~x|) (<= 101 f91_~x))} is VALID [2020-07-18 00:14:06,860 INFO L280 TraceCheckUtils]: 10: Hoare triple {46#(and (= f91_~x |f91_#in~x|) (<= 101 f91_~x))} #res := ~x - 10; {47#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} is VALID [2020-07-18 00:14:06,862 INFO L280 TraceCheckUtils]: 11: Hoare triple {47#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} assume true; {47#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} is VALID [2020-07-18 00:14:06,864 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {47#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} {34#true} #39#return; {43#(and (<= main_~x~0 (+ |main_#t~ret3| 10)) (<= (+ |main_#t~ret3| 10) main_~x~0) (<= 91 |main_#t~ret3|))} is VALID [2020-07-18 00:14:06,865 INFO L280 TraceCheckUtils]: 13: Hoare triple {43#(and (<= main_~x~0 (+ |main_#t~ret3| 10)) (<= (+ |main_#t~ret3| 10) main_~x~0) (<= 91 |main_#t~ret3|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {43#(and (<= main_~x~0 (+ |main_#t~ret3| 10)) (<= (+ |main_#t~ret3| 10) main_~x~0) (<= 91 |main_#t~ret3|))} is VALID [2020-07-18 00:14:06,867 INFO L280 TraceCheckUtils]: 14: Hoare triple {43#(and (<= main_~x~0 (+ |main_#t~ret3| 10)) (<= (+ |main_#t~ret3| 10) main_~x~0) (<= 91 |main_#t~ret3|))} ~result~0 := #t~ret3; {44#(and (<= main_~x~0 (+ main_~result~0 10)) (<= 91 main_~result~0) (<= (+ main_~result~0 10) main_~x~0))} is VALID [2020-07-18 00:14:06,869 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#(and (<= main_~x~0 (+ main_~result~0 10)) (<= 91 main_~result~0) (<= (+ main_~result~0 10) main_~x~0))} havoc #t~ret3; {44#(and (<= main_~x~0 (+ main_~result~0 10)) (<= 91 main_~result~0) (<= (+ main_~result~0 10) main_~x~0))} is VALID [2020-07-18 00:14:06,871 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#(and (<= main_~x~0 (+ main_~result~0 10)) (<= 91 main_~result~0) (<= (+ main_~result~0 10) main_~x~0))} assume !(91 == ~result~0 || (~x~0 > 101 && ~result~0 == ~x~0 - 10)); {35#false} is VALID [2020-07-18 00:14:06,871 INFO L280 TraceCheckUtils]: 17: Hoare triple {35#false} assume !false; {35#false} is VALID [2020-07-18 00:14:06,875 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:14:06,885 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:06,887 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1543744311] [2020-07-18 00:14:06,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:06,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-18 00:14:06,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984770225] [2020-07-18 00:14:06,896 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-18 00:14:06,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:06,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 00:14:06,939 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:06,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 00:14:06,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:06,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 00:14:06,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:14:06,952 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 7 states. [2020-07-18 00:14:07,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:07,430 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2020-07-18 00:14:07,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 00:14:07,430 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-18 00:14:07,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:14:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2020-07-18 00:14:07,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:14:07,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2020-07-18 00:14:07,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2020-07-18 00:14:07,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:07,547 INFO L225 Difference]: With dead ends: 46 [2020-07-18 00:14:07,547 INFO L226 Difference]: Without dead ends: 28 [2020-07-18 00:14:07,550 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-18 00:14:07,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-18 00:14:07,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-18 00:14:07,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:07,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-18 00:14:07,618 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-18 00:14:07,618 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-18 00:14:07,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:07,624 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-18 00:14:07,624 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-18 00:14:07,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:07,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:07,626 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-18 00:14:07,626 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-18 00:14:07,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:07,631 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-18 00:14:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-18 00:14:07,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:07,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:07,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:07,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:07,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-18 00:14:07,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2020-07-18 00:14:07,638 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 18 [2020-07-18 00:14:07,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:07,639 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2020-07-18 00:14:07,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 00:14:07,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 31 transitions. [2020-07-18 00:14:07,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:07,680 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-18 00:14:07,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-18 00:14:07,682 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:07,682 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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:14:07,682 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:14:07,683 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:07,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:07,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1167280018, now seen corresponding path program 1 times [2020-07-18 00:14:07,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:07,684 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [238385937] [2020-07-18 00:14:07,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:07,799 INFO L280 TraceCheckUtils]: 0: Hoare triple {258#true} assume true; {258#true} is VALID [2020-07-18 00:14:07,800 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {258#true} {258#true} #35#return; {258#true} is VALID [2020-07-18 00:14:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:07,956 INFO L280 TraceCheckUtils]: 0: Hoare triple {258#true} ~x := #in~x; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-18 00:14:07,958 INFO L280 TraceCheckUtils]: 1: Hoare triple {299#(= f91_~x |f91_#in~x|)} assume ~x > 100; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-18 00:14:07,959 INFO L280 TraceCheckUtils]: 2: Hoare triple {299#(= f91_~x |f91_#in~x|)} #res := ~x - 10; {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-18 00:14:07,960 INFO L280 TraceCheckUtils]: 3: Hoare triple {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} assume true; {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-18 00:14:07,961 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} {285#(<= f91_~x 100)} #41#return; {291#(<= |f91_#t~ret0| 101)} is VALID [2020-07-18 00:14:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:08,028 INFO L280 TraceCheckUtils]: 0: Hoare triple {258#true} ~x := #in~x; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-18 00:14:08,029 INFO L280 TraceCheckUtils]: 1: Hoare triple {299#(= f91_~x |f91_#in~x|)} assume ~x > 100; {301#(and (= f91_~x |f91_#in~x|) (<= 101 f91_~x))} is VALID [2020-07-18 00:14:08,030 INFO L280 TraceCheckUtils]: 2: Hoare triple {301#(and (= f91_~x |f91_#in~x|) (<= 101 f91_~x))} #res := ~x - 10; {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-18 00:14:08,031 INFO L280 TraceCheckUtils]: 3: Hoare triple {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} assume true; {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-18 00:14:08,033 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} {291#(<= |f91_#t~ret0| 101)} #43#return; {297#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} is VALID [2020-07-18 00:14:08,033 INFO L280 TraceCheckUtils]: 0: Hoare triple {258#true} ~x := #in~x; {258#true} is VALID [2020-07-18 00:14:08,034 INFO L280 TraceCheckUtils]: 1: Hoare triple {258#true} assume !(~x > 100); {285#(<= f91_~x 100)} is VALID [2020-07-18 00:14:08,035 INFO L263 TraceCheckUtils]: 2: Hoare triple {285#(<= f91_~x 100)} call #t~ret0 := f91(11 + ~x); {258#true} is VALID [2020-07-18 00:14:08,035 INFO L280 TraceCheckUtils]: 3: Hoare triple {258#true} ~x := #in~x; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-18 00:14:08,036 INFO L280 TraceCheckUtils]: 4: Hoare triple {299#(= f91_~x |f91_#in~x|)} assume ~x > 100; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-18 00:14:08,037 INFO L280 TraceCheckUtils]: 5: Hoare triple {299#(= f91_~x |f91_#in~x|)} #res := ~x - 10; {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-18 00:14:08,038 INFO L280 TraceCheckUtils]: 6: Hoare triple {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} assume true; {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-18 00:14:08,040 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} {285#(<= f91_~x 100)} #41#return; {291#(<= |f91_#t~ret0| 101)} is VALID [2020-07-18 00:14:08,040 INFO L280 TraceCheckUtils]: 8: Hoare triple {291#(<= |f91_#t~ret0| 101)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {291#(<= |f91_#t~ret0| 101)} is VALID [2020-07-18 00:14:08,041 INFO L263 TraceCheckUtils]: 9: Hoare triple {291#(<= |f91_#t~ret0| 101)} call #t~ret1 := f91(#t~ret0); {258#true} is VALID [2020-07-18 00:14:08,041 INFO L280 TraceCheckUtils]: 10: Hoare triple {258#true} ~x := #in~x; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-18 00:14:08,042 INFO L280 TraceCheckUtils]: 11: Hoare triple {299#(= f91_~x |f91_#in~x|)} assume ~x > 100; {301#(and (= f91_~x |f91_#in~x|) (<= 101 f91_~x))} is VALID [2020-07-18 00:14:08,043 INFO L280 TraceCheckUtils]: 12: Hoare triple {301#(and (= f91_~x |f91_#in~x|) (<= 101 f91_~x))} #res := ~x - 10; {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-18 00:14:08,044 INFO L280 TraceCheckUtils]: 13: Hoare triple {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} assume true; {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-18 00:14:08,046 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} {291#(<= |f91_#t~ret0| 101)} #43#return; {297#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} is VALID [2020-07-18 00:14:08,047 INFO L280 TraceCheckUtils]: 15: Hoare triple {297#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {297#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} is VALID [2020-07-18 00:14:08,048 INFO L280 TraceCheckUtils]: 16: Hoare triple {297#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} #res := #t~ret1; {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-18 00:14:08,049 INFO L280 TraceCheckUtils]: 17: Hoare triple {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} havoc #t~ret0; {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-18 00:14:08,049 INFO L280 TraceCheckUtils]: 18: Hoare triple {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} havoc #t~ret1; {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-18 00:14:08,050 INFO L280 TraceCheckUtils]: 19: Hoare triple {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} assume true; {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-18 00:14:08,051 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} {258#true} #39#return; {283#(and (<= |main_#t~ret3| 91) (<= 91 |main_#t~ret3|))} is VALID [2020-07-18 00:14:08,053 INFO L263 TraceCheckUtils]: 0: Hoare triple {258#true} call ULTIMATE.init(); {258#true} is VALID [2020-07-18 00:14:08,053 INFO L280 TraceCheckUtils]: 1: Hoare triple {258#true} assume true; {258#true} is VALID [2020-07-18 00:14:08,054 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {258#true} {258#true} #35#return; {258#true} is VALID [2020-07-18 00:14:08,054 INFO L263 TraceCheckUtils]: 3: Hoare triple {258#true} call #t~ret4 := main(); {258#true} is VALID [2020-07-18 00:14:08,054 INFO L280 TraceCheckUtils]: 4: Hoare triple {258#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {258#true} is VALID [2020-07-18 00:14:08,055 INFO L280 TraceCheckUtils]: 5: Hoare triple {258#true} ~x~0 := #t~nondet2; {258#true} is VALID [2020-07-18 00:14:08,055 INFO L280 TraceCheckUtils]: 6: Hoare triple {258#true} havoc #t~nondet2; {258#true} is VALID [2020-07-18 00:14:08,055 INFO L263 TraceCheckUtils]: 7: Hoare triple {258#true} call #t~ret3 := f91(~x~0); {258#true} is VALID [2020-07-18 00:14:08,055 INFO L280 TraceCheckUtils]: 8: Hoare triple {258#true} ~x := #in~x; {258#true} is VALID [2020-07-18 00:14:08,056 INFO L280 TraceCheckUtils]: 9: Hoare triple {258#true} assume !(~x > 100); {285#(<= f91_~x 100)} is VALID [2020-07-18 00:14:08,057 INFO L263 TraceCheckUtils]: 10: Hoare triple {285#(<= f91_~x 100)} call #t~ret0 := f91(11 + ~x); {258#true} is VALID [2020-07-18 00:14:08,057 INFO L280 TraceCheckUtils]: 11: Hoare triple {258#true} ~x := #in~x; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-18 00:14:08,058 INFO L280 TraceCheckUtils]: 12: Hoare triple {299#(= f91_~x |f91_#in~x|)} assume ~x > 100; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-18 00:14:08,059 INFO L280 TraceCheckUtils]: 13: Hoare triple {299#(= f91_~x |f91_#in~x|)} #res := ~x - 10; {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-18 00:14:08,060 INFO L280 TraceCheckUtils]: 14: Hoare triple {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} assume true; {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-18 00:14:08,061 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} {285#(<= f91_~x 100)} #41#return; {291#(<= |f91_#t~ret0| 101)} is VALID [2020-07-18 00:14:08,062 INFO L280 TraceCheckUtils]: 16: Hoare triple {291#(<= |f91_#t~ret0| 101)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {291#(<= |f91_#t~ret0| 101)} is VALID [2020-07-18 00:14:08,062 INFO L263 TraceCheckUtils]: 17: Hoare triple {291#(<= |f91_#t~ret0| 101)} call #t~ret1 := f91(#t~ret0); {258#true} is VALID [2020-07-18 00:14:08,063 INFO L280 TraceCheckUtils]: 18: Hoare triple {258#true} ~x := #in~x; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-18 00:14:08,064 INFO L280 TraceCheckUtils]: 19: Hoare triple {299#(= f91_~x |f91_#in~x|)} assume ~x > 100; {301#(and (= f91_~x |f91_#in~x|) (<= 101 f91_~x))} is VALID [2020-07-18 00:14:08,065 INFO L280 TraceCheckUtils]: 20: Hoare triple {301#(and (= f91_~x |f91_#in~x|) (<= 101 f91_~x))} #res := ~x - 10; {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-18 00:14:08,066 INFO L280 TraceCheckUtils]: 21: Hoare triple {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} assume true; {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-18 00:14:08,068 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} {291#(<= |f91_#t~ret0| 101)} #43#return; {297#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} is VALID [2020-07-18 00:14:08,069 INFO L280 TraceCheckUtils]: 23: Hoare triple {297#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {297#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} is VALID [2020-07-18 00:14:08,069 INFO L280 TraceCheckUtils]: 24: Hoare triple {297#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} #res := #t~ret1; {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-18 00:14:08,070 INFO L280 TraceCheckUtils]: 25: Hoare triple {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} havoc #t~ret0; {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-18 00:14:08,071 INFO L280 TraceCheckUtils]: 26: Hoare triple {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} havoc #t~ret1; {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-18 00:14:08,072 INFO L280 TraceCheckUtils]: 27: Hoare triple {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} assume true; {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-18 00:14:08,074 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} {258#true} #39#return; {283#(and (<= |main_#t~ret3| 91) (<= 91 |main_#t~ret3|))} is VALID [2020-07-18 00:14:08,075 INFO L280 TraceCheckUtils]: 29: Hoare triple {283#(and (<= |main_#t~ret3| 91) (<= 91 |main_#t~ret3|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {283#(and (<= |main_#t~ret3| 91) (<= 91 |main_#t~ret3|))} is VALID [2020-07-18 00:14:08,076 INFO L280 TraceCheckUtils]: 30: Hoare triple {283#(and (<= |main_#t~ret3| 91) (<= 91 |main_#t~ret3|))} ~result~0 := #t~ret3; {284#(and (<= main_~result~0 91) (<= 91 main_~result~0))} is VALID [2020-07-18 00:14:08,077 INFO L280 TraceCheckUtils]: 31: Hoare triple {284#(and (<= main_~result~0 91) (<= 91 main_~result~0))} havoc #t~ret3; {284#(and (<= main_~result~0 91) (<= 91 main_~result~0))} is VALID [2020-07-18 00:14:08,078 INFO L280 TraceCheckUtils]: 32: Hoare triple {284#(and (<= main_~result~0 91) (<= 91 main_~result~0))} assume !(91 == ~result~0 || (~x~0 > 101 && ~result~0 == ~x~0 - 10)); {259#false} is VALID [2020-07-18 00:14:08,078 INFO L280 TraceCheckUtils]: 33: Hoare triple {259#false} assume !false; {259#false} is VALID [2020-07-18 00:14:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-18 00:14:08,088 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:08,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [238385937] [2020-07-18 00:14:08,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:08,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-18 00:14:08,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453610867] [2020-07-18 00:14:08,091 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2020-07-18 00:14:08,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:08,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-18 00:14:08,134 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:14:08,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-18 00:14:08,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:08,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-18 00:14:08,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-07-18 00:14:08,136 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 12 states. [2020-07-18 00:14:08,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:08,808 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-18 00:14:08,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-18 00:14:08,808 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2020-07-18 00:14:08,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:08,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 00:14:08,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2020-07-18 00:14:08,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 00:14:08,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2020-07-18 00:14:08,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 31 transitions. [2020-07-18 00:14:08,852 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:08,852 INFO L225 Difference]: With dead ends: 28 [2020-07-18 00:14:08,852 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 00:14:08,854 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2020-07-18 00:14:08,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 00:14:08,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 00:14:08,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:08,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 00:14:08,855 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:14:08,855 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:14:08,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:08,856 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:14:08,856 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:14:08,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:08,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:08,857 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:14:08,857 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:14:08,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:08,857 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:14:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:14:08,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:08,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:08,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:08,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:08,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 00:14:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 00:14:08,859 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2020-07-18 00:14:08,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:08,859 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 00:14:08,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-18 00:14:08,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 00:14:08,859 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-18 00:14:08,860 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:14:08,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:08,860 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:14:08,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 00:14:09,357 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:14:09,357 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:14:09,358 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:14:09,358 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 00:14:09,358 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 00:14:09,358 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:14:09,358 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 30) the Hoare annotation is: false [2020-07-18 00:14:09,358 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: false [2020-07-18 00:14:09,359 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 24 32) the Hoare annotation is: true [2020-07-18 00:14:09,359 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-18 00:14:09,359 INFO L264 CegarLoopResult]: At program point L27(lines 27 31) the Hoare annotation is: (let ((.cse0 (<= 91 main_~result~0))) (or (and (<= main_~result~0 91) .cse0) (let ((.cse1 (+ main_~result~0 10))) (and (<= main_~x~0 .cse1) .cse0 (<= .cse1 main_~x~0))))) [2020-07-18 00:14:09,364 INFO L271 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-07-18 00:14:09,364 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-18 00:14:09,364 INFO L264 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse0 (<= 91 |main_#t~ret3|))) (or (and (<= |main_#t~ret3| 91) .cse0) (let ((.cse1 (+ |main_#t~ret3| 10))) (and (<= main_~x~0 .cse1) (<= .cse1 main_~x~0) .cse0)))) [2020-07-18 00:14:09,365 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 24 32) the Hoare annotation is: true [2020-07-18 00:14:09,365 INFO L271 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: true [2020-07-18 00:14:09,365 INFO L264 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: (let ((.cse0 (<= 91 |main_#t~ret3|))) (or (and (<= |main_#t~ret3| 91) .cse0) (let ((.cse1 (+ |main_#t~ret3| 10))) (and (<= main_~x~0 .cse1) (<= .cse1 main_~x~0) .cse0)))) [2020-07-18 00:14:09,365 INFO L264 CegarLoopResult]: At program point L26-3(line 26) the Hoare annotation is: (let ((.cse2 (<= 91 |main_#t~ret3|))) (or (let ((.cse0 (+ |main_#t~ret3| 10)) (.cse1 (+ main_~result~0 10))) (and (<= main_~x~0 .cse0) (<= main_~x~0 .cse1) (<= .cse0 main_~x~0) (<= .cse1 main_~x~0) .cse2)) (and (<= |main_#t~ret3| 91) (<= main_~result~0 91) (<= 91 main_~result~0) .cse2))) [2020-07-18 00:14:09,366 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 24 32) the Hoare annotation is: true [2020-07-18 00:14:09,366 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= f91_~x |f91_#in~x|) (<= f91_~x 100)) [2020-07-18 00:14:09,366 INFO L264 CegarLoopResult]: At program point f91EXIT(lines 15 21) the Hoare annotation is: (let ((.cse0 (= f91_~x |f91_#in~x|))) (or (and (<= 91 |f91_#res|) (<= |f91_#res| 91) .cse0 (<= f91_~x 100)) (let ((.cse1 (+ |f91_#res| 10))) (and (<= .cse1 |f91_#in~x|) (<= |f91_#in~x| .cse1) .cse0 (<= 101 f91_~x))))) [2020-07-18 00:14:09,366 INFO L264 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (and (<= |f91_#t~ret0| 101) (= f91_~x |f91_#in~x|) (<= f91_~x 100)) [2020-07-18 00:14:09,366 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (= f91_~x |f91_#in~x|) (<= 101 f91_~x)) [2020-07-18 00:14:09,367 INFO L264 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (and (<= |f91_#t~ret0| 101) (= f91_~x |f91_#in~x|) (<= f91_~x 100)) [2020-07-18 00:14:09,367 INFO L264 CegarLoopResult]: At program point L16(lines 16 20) the Hoare annotation is: (= f91_~x |f91_#in~x|) [2020-07-18 00:14:09,367 INFO L264 CegarLoopResult]: At program point L19-3(line 19) the Hoare annotation is: (and (<= |f91_#t~ret0| 101) (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91) (= f91_~x |f91_#in~x|) (<= f91_~x 100)) [2020-07-18 00:14:09,367 INFO L264 CegarLoopResult]: At program point L19-4(line 19) the Hoare annotation is: (and (<= |f91_#t~ret0| 101) (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91) (= f91_~x |f91_#in~x|) (<= f91_~x 100)) [2020-07-18 00:14:09,367 INFO L264 CegarLoopResult]: At program point L19-5(line 19) the Hoare annotation is: (and (<= |f91_#t~ret0| 101) (<= 91 |f91_#res|) (<= 91 |f91_#t~ret1|) (<= |f91_#res| 91) (<= |f91_#t~ret1| 91) (= f91_~x |f91_#in~x|) (<= f91_~x 100)) [2020-07-18 00:14:09,368 INFO L264 CegarLoopResult]: At program point L19-6(line 19) the Hoare annotation is: (and (<= 91 |f91_#res|) (<= 91 |f91_#t~ret1|) (<= |f91_#res| 91) (<= |f91_#t~ret1| 91) (= f91_~x |f91_#in~x|) (<= f91_~x 100)) [2020-07-18 00:14:09,368 INFO L271 CegarLoopResult]: At program point f91ENTRY(lines 15 21) the Hoare annotation is: true [2020-07-18 00:14:09,368 INFO L264 CegarLoopResult]: At program point f91FINAL(lines 15 21) the Hoare annotation is: (let ((.cse0 (= f91_~x |f91_#in~x|))) (or (and (<= 91 |f91_#res|) (<= |f91_#res| 91) .cse0 (<= f91_~x 100)) (let ((.cse1 (+ |f91_#res| 10))) (and (<= .cse1 |f91_#in~x|) (<= |f91_#in~x| .cse1) .cse0 (<= 101 f91_~x))))) [2020-07-18 00:14:09,385 INFO L163 areAnnotationChecker]: CFG has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 00:14:09,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:14:09 BoogieIcfgContainer [2020-07-18 00:14:09,397 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 00:14:09,401 INFO L168 Benchmark]: Toolchain (without parser) took 3776.92 ms. Allocated memory was 134.7 MB in the beginning and 256.9 MB in the end (delta: 122.2 MB). Free memory was 99.4 MB in the beginning and 216.4 MB in the end (delta: -116.9 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:09,402 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 134.7 MB. Free memory was 118.2 MB in the beginning and 117.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-18 00:14:09,403 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.97 ms. Allocated memory is still 134.7 MB. Free memory was 99.0 MB in the beginning and 89.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:09,404 INFO L168 Benchmark]: Boogie Preprocessor took 110.66 ms. Allocated memory was 134.7 MB in the beginning and 198.2 MB in the end (delta: 63.4 MB). Free memory was 89.6 MB in the beginning and 177.4 MB in the end (delta: -87.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:09,404 INFO L168 Benchmark]: RCFGBuilder took 319.73 ms. Allocated memory is still 198.2 MB. Free memory was 177.4 MB in the beginning and 159.2 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:09,405 INFO L168 Benchmark]: TraceAbstraction took 3098.07 ms. Allocated memory was 198.2 MB in the beginning and 256.9 MB in the end (delta: 58.7 MB). Free memory was 158.5 MB in the beginning and 216.4 MB in the end (delta: -57.9 MB). Peak memory consumption was 808.0 kB. Max. memory is 7.1 GB. [2020-07-18 00:14:09,409 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.19 ms. Allocated memory is still 134.7 MB. Free memory was 118.2 MB in the beginning and 117.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 240.97 ms. Allocated memory is still 134.7 MB. Free memory was 99.0 MB in the beginning and 89.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.66 ms. Allocated memory was 134.7 MB in the beginning and 198.2 MB in the end (delta: 63.4 MB). Free memory was 89.6 MB in the beginning and 177.4 MB in the end (delta: -87.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 319.73 ms. Allocated memory is still 198.2 MB. Free memory was 177.4 MB in the beginning and 159.2 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3098.07 ms. Allocated memory was 198.2 MB in the beginning and 256.9 MB in the end (delta: 58.7 MB). Free memory was 158.5 MB in the beginning and 216.4 MB in the end (delta: -57.9 MB). Peak memory consumption was 808.0 kB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 30]: 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: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 15]: Procedure Contract for f91 Derived contract for procedure f91: (((91 <= \result && \result <= 91) && x == \old(x)) && x <= 100) || (((\result + 10 <= \old(x) && \old(x) <= \result + 10) && x == \old(x)) && 101 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.4s, OverallIterations: 2, TraceHistogramMax: 3, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 40 SDtfs, 38 SDslu, 172 SDs, 0 SdLazy, 174 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred 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, 31 LocationsWithAnnotation, 55 PreInvPairs, 74 NumberOfFragments, 292 HoareAnnotationTreeSize, 55 FomulaSimplifications, 40 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 31 FomulaSimplificationsInter, 70 FormulaSimplificationTreeSizeReductionInter, 0.2s 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...