/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-simple/id_b5_o10-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 15:57:18,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 15:57:18,140 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 15:57:18,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 15:57:18,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 15:57:18,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 15:57:18,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 15:57:18,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 15:57:18,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 15:57:18,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 15:57:18,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 15:57:18,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 15:57:18,184 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 15:57:18,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 15:57:18,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 15:57:18,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 15:57:18,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 15:57:18,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 15:57:18,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 15:57:18,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 15:57:18,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 15:57:18,206 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 15:57:18,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 15:57:18,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 15:57:18,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 15:57:18,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 15:57:18,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 15:57:18,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 15:57:18,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 15:57:18,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 15:57:18,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 15:57:18,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 15:57:18,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 15:57:18,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 15:57:18,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 15:57:18,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 15:57:18,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 15:57:18,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 15:57:18,221 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 15:57:18,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 15:57:18,223 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 15:57:18,224 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 15:57:18,250 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 15:57:18,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 15:57:18,255 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 15:57:18,255 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 15:57:18,255 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 15:57:18,256 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 15:57:18,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 15:57:18,256 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 15:57:18,256 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 15:57:18,256 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 15:57:18,256 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 15:57:18,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 15:57:18,257 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 15:57:18,257 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 15:57:18,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 15:57:18,260 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 15:57:18,261 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 15:57:18,261 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 15:57:18,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 15:57:18,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 15:57:18,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 15:57:18,261 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 15:57:18,262 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 15:57:18,566 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 15:57:18,583 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 15:57:18,586 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 15:57:18,588 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 15:57:18,589 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 15:57:18,589 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_b5_o10-2.c [2020-07-08 15:57:18,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10987f47f/dad0b50c608f4176aac62efa6bf5621f/FLAGa55187adc [2020-07-08 15:57:19,113 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 15:57:19,113 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_b5_o10-2.c [2020-07-08 15:57:19,120 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10987f47f/dad0b50c608f4176aac62efa6bf5621f/FLAGa55187adc [2020-07-08 15:57:19,543 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10987f47f/dad0b50c608f4176aac62efa6bf5621f [2020-07-08 15:57:19,554 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 15:57:19,556 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 15:57:19,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 15:57:19,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 15:57:19,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 15:57:19,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:57:19" (1/1) ... [2020-07-08 15:57:19,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@451ae331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:57:19, skipping insertion in model container [2020-07-08 15:57:19,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:57:19" (1/1) ... [2020-07-08 15:57:19,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 15:57:19,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 15:57:19,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 15:57:19,773 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 15:57:19,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 15:57:19,805 INFO L208 MainTranslator]: Completed translation [2020-07-08 15:57:19,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:57:19 WrapperNode [2020-07-08 15:57:19,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 15:57:19,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 15:57:19,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 15:57:19,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 15:57:19,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:57:19" (1/1) ... [2020-07-08 15:57:19,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:57:19" (1/1) ... [2020-07-08 15:57:19,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:57:19" (1/1) ... [2020-07-08 15:57:19,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:57:19" (1/1) ... [2020-07-08 15:57:19,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:57:19" (1/1) ... [2020-07-08 15:57:19,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:57:19" (1/1) ... [2020-07-08 15:57:19,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:57:19" (1/1) ... [2020-07-08 15:57:19,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 15:57:19,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 15:57:19,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 15:57:19,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 15:57:19,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:57:19" (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-08 15:57:19,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 15:57:19,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 15:57:19,986 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-08 15:57:19,986 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 15:57:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 15:57:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 15:57:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-08 15:57:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 15:57:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 15:57:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 15:57:20,303 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 15:57:20,303 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 15:57:20,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:57:20 BoogieIcfgContainer [2020-07-08 15:57:20,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 15:57:20,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 15:57:20,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 15:57:20,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 15:57:20,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 03:57:19" (1/3) ... [2020-07-08 15:57:20,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d594ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:57:20, skipping insertion in model container [2020-07-08 15:57:20,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:57:19" (2/3) ... [2020-07-08 15:57:20,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d594ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:57:20, skipping insertion in model container [2020-07-08 15:57:20,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:57:20" (3/3) ... [2020-07-08 15:57:20,317 INFO L109 eAbstractionObserver]: Analyzing ICFG id_b5_o10-2.c [2020-07-08 15:57:20,327 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 15:57:20,335 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 15:57:20,349 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 15:57:20,371 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 15:57:20,371 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 15:57:20,372 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 15:57:20,372 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 15:57:20,372 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 15:57:20,372 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 15:57:20,372 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 15:57:20,373 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 15:57:20,387 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-08 15:57:20,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-08 15:57:20,398 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:57:20,399 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-08 15:57:20,400 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:57:20,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:57:20,405 INFO L82 PathProgramCache]: Analyzing trace with hash 856871792, now seen corresponding path program 1 times [2020-07-08 15:57:20,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:57:20,412 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1328798859] [2020-07-08 15:57:20,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:57:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:57:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:57:20,638 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-08 15:57:20,638 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-08 15:57:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:57:20,679 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} ~x := #in~x; {33#true} is VALID [2020-07-08 15:57:20,680 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~x; {33#true} is VALID [2020-07-08 15:57:20,681 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#true} #res := 0; {44#(= 0 |id_#res|)} is VALID [2020-07-08 15:57:20,682 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#(= 0 |id_#res|)} assume true; {44#(= 0 |id_#res|)} is VALID [2020-07-08 15:57:20,684 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {44#(= 0 |id_#res|)} {33#true} #43#return; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-08 15:57:20,685 INFO L263 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2020-07-08 15:57:20,686 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-08 15:57:20,686 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-08 15:57:20,686 INFO L263 TraceCheckUtils]: 3: Hoare triple {33#true} call #t~ret3 := main(); {33#true} is VALID [2020-07-08 15:57:20,687 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {33#true} is VALID [2020-07-08 15:57:20,687 INFO L280 TraceCheckUtils]: 5: Hoare triple {33#true} ~input~0 := #t~nondet1; {33#true} is VALID [2020-07-08 15:57:20,688 INFO L280 TraceCheckUtils]: 6: Hoare triple {33#true} havoc #t~nondet1; {33#true} is VALID [2020-07-08 15:57:20,688 INFO L263 TraceCheckUtils]: 7: Hoare triple {33#true} call #t~ret2 := id(~input~0); {33#true} is VALID [2020-07-08 15:57:20,689 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#true} ~x := #in~x; {33#true} is VALID [2020-07-08 15:57:20,689 INFO L280 TraceCheckUtils]: 9: Hoare triple {33#true} assume 0 == ~x; {33#true} is VALID [2020-07-08 15:57:20,690 INFO L280 TraceCheckUtils]: 10: Hoare triple {33#true} #res := 0; {44#(= 0 |id_#res|)} is VALID [2020-07-08 15:57:20,692 INFO L280 TraceCheckUtils]: 11: Hoare triple {44#(= 0 |id_#res|)} assume true; {44#(= 0 |id_#res|)} is VALID [2020-07-08 15:57:20,694 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {44#(= 0 |id_#res|)} {33#true} #43#return; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-08 15:57:20,695 INFO L280 TraceCheckUtils]: 13: Hoare triple {42#(<= |main_#t~ret2| 0)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-08 15:57:20,696 INFO L280 TraceCheckUtils]: 14: Hoare triple {42#(<= |main_#t~ret2| 0)} ~result~0 := #t~ret2; {43#(<= main_~result~0 0)} is VALID [2020-07-08 15:57:20,698 INFO L280 TraceCheckUtils]: 15: Hoare triple {43#(<= main_~result~0 0)} havoc #t~ret2; {43#(<= main_~result~0 0)} is VALID [2020-07-08 15:57:20,699 INFO L280 TraceCheckUtils]: 16: Hoare triple {43#(<= main_~result~0 0)} assume 10 == ~result~0; {34#false} is VALID [2020-07-08 15:57:20,700 INFO L280 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-08 15:57:20,702 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-08 15:57:20,703 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:57:20,705 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1328798859] [2020-07-08 15:57:20,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:57:20,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 15:57:20,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611403216] [2020-07-08 15:57:20,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-08 15:57:20,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:57:20,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 15:57:20,761 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-08 15:57:20,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 15:57:20,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:57:20,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 15:57:20,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 15:57:20,774 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2020-07-08 15:57:21,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:57:21,013 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-08 15:57:21,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 15:57:21,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-08 15:57:21,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:57:21,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 15:57:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-08 15:57:21,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 15:57:21,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-08 15:57:21,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2020-07-08 15:57:21,109 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:57:21,122 INFO L225 Difference]: With dead ends: 44 [2020-07-08 15:57:21,123 INFO L226 Difference]: Without dead ends: 28 [2020-07-08 15:57:21,127 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 15:57:21,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-08 15:57:21,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-08 15:57:21,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:57:21,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-08 15:57:21,188 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-08 15:57:21,189 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-08 15:57:21,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:57:21,195 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-08 15:57:21,195 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-08 15:57:21,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:57:21,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:57:21,197 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-08 15:57:21,197 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-08 15:57:21,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:57:21,202 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-08 15:57:21,202 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-08 15:57:21,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:57:21,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:57:21,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:57:21,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:57:21,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-08 15:57:21,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-07-08 15:57:21,218 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2020-07-08 15:57:21,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:57:21,219 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-07-08 15:57:21,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 15:57:21,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2020-07-08 15:57:21,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:57:21,268 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-08 15:57:21,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-08 15:57:21,269 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:57:21,270 INFO L422 BasicCegarLoop]: trace histogram [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-08 15:57:21,270 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 15:57:21,270 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:57:21,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:57:21,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1774609951, now seen corresponding path program 1 times [2020-07-08 15:57:21,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:57:21,272 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [240628449] [2020-07-08 15:57:21,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 13 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 13 to 23 Garbage collection #2: 23 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 23 to 43 Garbage collection #3: 43 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 43 to 83 [2020-07-08 15:57:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:57:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:57:21,571 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} assume true; {249#true} is VALID [2020-07-08 15:57:21,571 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {249#true} {249#true} #39#return; {249#true} is VALID [2020-07-08 15:57:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:57:21,622 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-08 15:57:21,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-08 15:57:21,624 INFO L280 TraceCheckUtils]: 2: Hoare triple {249#true} #res := 0; {261#(= 0 |id_#res|)} is VALID [2020-07-08 15:57:21,627 INFO L280 TraceCheckUtils]: 3: Hoare triple {261#(= 0 |id_#res|)} [47] idFINAL-->idEXIT_primed: Formula: (let ((.cse23 (* 2 |v_oct_id_#res_out_1|)) (.cse22 (* 2 |v_oct_id_#res_in_1|)) (.cse16 (* 2 v_oct_id_~ret~0_out_1))) (let ((.cse18 (<= .cse16 4294967296)) (.cse17 (<= .cse22 4294967294)) (.cse19 (<= 0 (+ .cse16 4294967294))) (.cse7 (<= .cse16 4294967296)) (.cse1 (<= .cse23 10)) (.cse12 (<= 10 .cse23)) (.cse14 (<= 12 .cse16)) (.cse3 (<= .cse22 4294967294)) (.cse21 (<= 10 .cse22)) (.cse20 (<= .cse16 12)) (.cse2 (<= 0 (+ .cse16 4294967294)))) (or (let ((.cse0 (+ |v_oct_id_#res_in_1| 1)) (.cse4 (not .cse12)) (.cse5 (not .cse14)) (.cse6 (not .cse1)) (.cse8 (not .cse21)) (.cse9 (not .cse20))) (and (<= v_oct_id_~ret~0_out_1 .cse0) .cse1 (<= .cse0 v_oct_id_~ret~0_out_1) (or (not .cse2) (not .cse3) .cse4 .cse5 .cse6 (not .cse7) .cse8 .cse9) (let ((.cse11 (<= .cse16 4294967296)) (.cse10 (<= .cse16 4294967296)) (.cse13 (<= 0 (+ .cse16 4294967294)))) (or (and .cse10 (not .cse11) .cse12 .cse13 .cse14) (and .cse11 (let ((.cse15 (<= 0 (+ .cse16 4294967294)))) (or (and .cse10 (not .cse15) .cse13 .cse14) (and .cse14 .cse15))) .cse12))) (or .cse4 .cse5 (not .cse17) .cse6 .cse8 .cse9 (not .cse18) (not .cse19)))) (and .cse18 .cse1 .cse12 .cse14 .cse17 .cse21 .cse20 .cse19) (and .cse7 .cse1 .cse12 .cse14 .cse3 .cse21 .cse20 .cse2)))) InVars {id_#res=|v_oct_id_#res_in_1|} OutVars{id_#res=|v_oct_id_#res_out_1|, id_#t~ret0=|v_oct_id_#t~ret0_out_1|, id_~ret~0=v_oct_id_~ret~0_out_1} AuxVars[] AssignedVars[id_#res, id_#t~ret0, id_~ret~0] {262#(<= |id_#res| 5)} is VALID [2020-07-08 15:57:21,628 INFO L280 TraceCheckUtils]: 4: Hoare triple {262#(<= |id_#res| 5)} [46] idEXIT_primed-->idEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#(<= |id_#res| 5)} is VALID [2020-07-08 15:57:21,629 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {262#(<= |id_#res| 5)} {249#true} #43#return; {259#(<= |main_#t~ret2| 5)} is VALID [2020-07-08 15:57:21,630 INFO L263 TraceCheckUtils]: 0: Hoare triple {249#true} call ULTIMATE.init(); {249#true} is VALID [2020-07-08 15:57:21,630 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume true; {249#true} is VALID [2020-07-08 15:57:21,631 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {249#true} {249#true} #39#return; {249#true} is VALID [2020-07-08 15:57:21,631 INFO L263 TraceCheckUtils]: 3: Hoare triple {249#true} call #t~ret3 := main(); {249#true} is VALID [2020-07-08 15:57:21,631 INFO L280 TraceCheckUtils]: 4: Hoare triple {249#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {249#true} is VALID [2020-07-08 15:57:21,632 INFO L280 TraceCheckUtils]: 5: Hoare triple {249#true} ~input~0 := #t~nondet1; {249#true} is VALID [2020-07-08 15:57:21,632 INFO L280 TraceCheckUtils]: 6: Hoare triple {249#true} havoc #t~nondet1; {249#true} is VALID [2020-07-08 15:57:21,632 INFO L263 TraceCheckUtils]: 7: Hoare triple {249#true} call #t~ret2 := id(~input~0); {249#true} is VALID [2020-07-08 15:57:21,633 INFO L280 TraceCheckUtils]: 8: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-08 15:57:21,633 INFO L280 TraceCheckUtils]: 9: Hoare triple {249#true} assume !(0 == ~x); {249#true} is VALID [2020-07-08 15:57:21,633 INFO L263 TraceCheckUtils]: 10: Hoare triple {249#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {249#true} is VALID [2020-07-08 15:57:21,634 INFO L280 TraceCheckUtils]: 11: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-08 15:57:21,634 INFO L280 TraceCheckUtils]: 12: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-08 15:57:21,635 INFO L280 TraceCheckUtils]: 13: Hoare triple {249#true} #res := 0; {261#(= 0 |id_#res|)} is VALID [2020-07-08 15:57:21,638 INFO L280 TraceCheckUtils]: 14: Hoare triple {261#(= 0 |id_#res|)} [47] idFINAL-->idEXIT_primed: Formula: (let ((.cse23 (* 2 |v_oct_id_#res_out_1|)) (.cse22 (* 2 |v_oct_id_#res_in_1|)) (.cse16 (* 2 v_oct_id_~ret~0_out_1))) (let ((.cse18 (<= .cse16 4294967296)) (.cse17 (<= .cse22 4294967294)) (.cse19 (<= 0 (+ .cse16 4294967294))) (.cse7 (<= .cse16 4294967296)) (.cse1 (<= .cse23 10)) (.cse12 (<= 10 .cse23)) (.cse14 (<= 12 .cse16)) (.cse3 (<= .cse22 4294967294)) (.cse21 (<= 10 .cse22)) (.cse20 (<= .cse16 12)) (.cse2 (<= 0 (+ .cse16 4294967294)))) (or (let ((.cse0 (+ |v_oct_id_#res_in_1| 1)) (.cse4 (not .cse12)) (.cse5 (not .cse14)) (.cse6 (not .cse1)) (.cse8 (not .cse21)) (.cse9 (not .cse20))) (and (<= v_oct_id_~ret~0_out_1 .cse0) .cse1 (<= .cse0 v_oct_id_~ret~0_out_1) (or (not .cse2) (not .cse3) .cse4 .cse5 .cse6 (not .cse7) .cse8 .cse9) (let ((.cse11 (<= .cse16 4294967296)) (.cse10 (<= .cse16 4294967296)) (.cse13 (<= 0 (+ .cse16 4294967294)))) (or (and .cse10 (not .cse11) .cse12 .cse13 .cse14) (and .cse11 (let ((.cse15 (<= 0 (+ .cse16 4294967294)))) (or (and .cse10 (not .cse15) .cse13 .cse14) (and .cse14 .cse15))) .cse12))) (or .cse4 .cse5 (not .cse17) .cse6 .cse8 .cse9 (not .cse18) (not .cse19)))) (and .cse18 .cse1 .cse12 .cse14 .cse17 .cse21 .cse20 .cse19) (and .cse7 .cse1 .cse12 .cse14 .cse3 .cse21 .cse20 .cse2)))) InVars {id_#res=|v_oct_id_#res_in_1|} OutVars{id_#res=|v_oct_id_#res_out_1|, id_#t~ret0=|v_oct_id_#t~ret0_out_1|, id_~ret~0=v_oct_id_~ret~0_out_1} AuxVars[] AssignedVars[id_#res, id_#t~ret0, id_~ret~0] {262#(<= |id_#res| 5)} is VALID [2020-07-08 15:57:21,639 INFO L280 TraceCheckUtils]: 15: Hoare triple {262#(<= |id_#res| 5)} [46] idEXIT_primed-->idEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#(<= |id_#res| 5)} is VALID [2020-07-08 15:57:21,640 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {262#(<= |id_#res| 5)} {249#true} #43#return; {259#(<= |main_#t~ret2| 5)} is VALID [2020-07-08 15:57:21,641 INFO L280 TraceCheckUtils]: 17: Hoare triple {259#(<= |main_#t~ret2| 5)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {259#(<= |main_#t~ret2| 5)} is VALID [2020-07-08 15:57:21,642 INFO L280 TraceCheckUtils]: 18: Hoare triple {259#(<= |main_#t~ret2| 5)} ~result~0 := #t~ret2; {260#(<= main_~result~0 5)} is VALID [2020-07-08 15:57:21,643 INFO L280 TraceCheckUtils]: 19: Hoare triple {260#(<= main_~result~0 5)} havoc #t~ret2; {260#(<= main_~result~0 5)} is VALID [2020-07-08 15:57:21,644 INFO L280 TraceCheckUtils]: 20: Hoare triple {260#(<= main_~result~0 5)} assume 10 == ~result~0; {250#false} is VALID [2020-07-08 15:57:21,644 INFO L280 TraceCheckUtils]: 21: Hoare triple {250#false} assume !false; {250#false} is VALID [2020-07-08 15:57:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 15:57:21,704 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:57:21,704 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [240628449] [2020-07-08 15:57:21,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:57:21,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 15:57:21,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662978469] [2020-07-08 15:57:21,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-07-08 15:57:21,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:57:21,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 15:57:21,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:57:21,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 15:57:21,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:57:21,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 15:57:21,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-08 15:57:21,747 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 9 states. [2020-07-08 15:57:22,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:57:22,102 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2020-07-08 15:57:22,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 15:57:22,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-07-08 15:57:22,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:57:22,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 15:57:22,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2020-07-08 15:57:22,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 15:57:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2020-07-08 15:57:22,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 61 transitions. [2020-07-08 15:57:22,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:57:22,207 INFO L225 Difference]: With dead ends: 55 [2020-07-08 15:57:22,207 INFO L226 Difference]: Without dead ends: 37 [2020-07-08 15:57:22,209 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-08 15:57:22,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-08 15:57:22,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2020-07-08 15:57:22,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:57:22,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 35 states. [2020-07-08 15:57:22,251 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 35 states. [2020-07-08 15:57:22,251 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 35 states. [2020-07-08 15:57:22,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:57:22,255 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-08 15:57:22,255 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-08 15:57:22,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:57:22,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:57:22,256 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 37 states. [2020-07-08 15:57:22,256 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 37 states. [2020-07-08 15:57:22,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:57:22,260 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-08 15:57:22,260 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-08 15:57:22,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:57:22,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:57:22,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:57:22,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:57:22,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-08 15:57:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2020-07-08 15:57:22,265 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 28 [2020-07-08 15:57:22,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:57:22,266 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2020-07-08 15:57:22,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 15:57:22,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2020-07-08 15:57:22,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:57:22,315 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-08 15:57:22,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-08 15:57:22,317 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:57:22,317 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 15:57:22,317 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 15:57:22,317 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:57:22,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:57:22,318 INFO L82 PathProgramCache]: Analyzing trace with hash 41013968, now seen corresponding path program 1 times [2020-07-08 15:57:22,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:57:22,319 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1686813777] [2020-07-08 15:57:22,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #3: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 [2020-07-08 15:57:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:57:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:57:22,423 INFO L280 TraceCheckUtils]: 0: Hoare triple {526#true} assume true; {526#true} is VALID [2020-07-08 15:57:22,423 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {526#true} {526#true} #39#return; {526#true} is VALID [2020-07-08 15:57:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:57:22,472 INFO L280 TraceCheckUtils]: 0: Hoare triple {526#true} ~x := #in~x; {526#true} is VALID [2020-07-08 15:57:22,472 INFO L280 TraceCheckUtils]: 1: Hoare triple {526#true} assume 0 == ~x; {526#true} is VALID [2020-07-08 15:57:22,473 INFO L280 TraceCheckUtils]: 2: Hoare triple {526#true} #res := 0; {538#(= 0 |id_#res|)} is VALID [2020-07-08 15:57:22,474 INFO L280 TraceCheckUtils]: 3: Hoare triple {538#(= 0 |id_#res|)} [49] idFINAL-->idEXIT_primed: Formula: (let ((.cse0 (+ |v_oct_id_#res_in_2| 1))) (and (<= v_oct_id_~ret~0_out_2 .cse0) (<= v_oct_id_~ret~0_out_2 |v_oct_id_#res_out_2|) (let ((.cse7 (* 2 |v_oct_id_#res_in_2|))) (let ((.cse1 (<= (* 2 v_oct_id_~ret~0_out_2) 10)) (.cse2 (<= |v_oct_id_#res_out_2| v_oct_id_~ret~0_out_2)) (.cse4 (<= 0 (+ .cse7 4294967296))) (.cse5 (<= .cse7 4294967294)) (.cse3 (<= .cse7 4294967294))) (or (and .cse1 .cse2 (not .cse3) .cse4 .cse5) (and .cse1 .cse2 (let ((.cse6 (<= 0 (+ .cse7 4294967296)))) (or .cse6 (and (not .cse6) .cse4 .cse5))) .cse3)))) (<= .cse0 v_oct_id_~ret~0_out_2))) InVars {id_#res=|v_oct_id_#res_in_2|} OutVars{id_#res=|v_oct_id_#res_out_2|, id_#t~ret0=|v_oct_id_#t~ret0_out_2|, id_~ret~0=v_oct_id_~ret~0_out_2} AuxVars[] AssignedVars[id_#res, id_#t~ret0, id_~ret~0] {539#(<= |id_#res| 1)} is VALID [2020-07-08 15:57:22,476 INFO L280 TraceCheckUtils]: 4: Hoare triple {539#(<= |id_#res| 1)} [48] idEXIT_primed-->idEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {539#(<= |id_#res| 1)} is VALID [2020-07-08 15:57:22,477 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {539#(<= |id_#res| 1)} {526#true} #43#return; {536#(<= |main_#t~ret2| 1)} is VALID [2020-07-08 15:57:22,477 INFO L263 TraceCheckUtils]: 0: Hoare triple {526#true} call ULTIMATE.init(); {526#true} is VALID [2020-07-08 15:57:22,478 INFO L280 TraceCheckUtils]: 1: Hoare triple {526#true} assume true; {526#true} is VALID [2020-07-08 15:57:22,478 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {526#true} {526#true} #39#return; {526#true} is VALID [2020-07-08 15:57:22,478 INFO L263 TraceCheckUtils]: 3: Hoare triple {526#true} call #t~ret3 := main(); {526#true} is VALID [2020-07-08 15:57:22,479 INFO L280 TraceCheckUtils]: 4: Hoare triple {526#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {526#true} is VALID [2020-07-08 15:57:22,479 INFO L280 TraceCheckUtils]: 5: Hoare triple {526#true} ~input~0 := #t~nondet1; {526#true} is VALID [2020-07-08 15:57:22,479 INFO L280 TraceCheckUtils]: 6: Hoare triple {526#true} havoc #t~nondet1; {526#true} is VALID [2020-07-08 15:57:22,480 INFO L263 TraceCheckUtils]: 7: Hoare triple {526#true} call #t~ret2 := id(~input~0); {526#true} is VALID [2020-07-08 15:57:22,480 INFO L280 TraceCheckUtils]: 8: Hoare triple {526#true} ~x := #in~x; {526#true} is VALID [2020-07-08 15:57:22,480 INFO L280 TraceCheckUtils]: 9: Hoare triple {526#true} assume !(0 == ~x); {526#true} is VALID [2020-07-08 15:57:22,480 INFO L263 TraceCheckUtils]: 10: Hoare triple {526#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {526#true} is VALID [2020-07-08 15:57:22,481 INFO L280 TraceCheckUtils]: 11: Hoare triple {526#true} ~x := #in~x; {526#true} is VALID [2020-07-08 15:57:22,481 INFO L280 TraceCheckUtils]: 12: Hoare triple {526#true} assume !(0 == ~x); {526#true} is VALID [2020-07-08 15:57:22,481 INFO L263 TraceCheckUtils]: 13: Hoare triple {526#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {526#true} is VALID [2020-07-08 15:57:22,482 INFO L280 TraceCheckUtils]: 14: Hoare triple {526#true} ~x := #in~x; {526#true} is VALID [2020-07-08 15:57:22,482 INFO L280 TraceCheckUtils]: 15: Hoare triple {526#true} assume 0 == ~x; {526#true} is VALID [2020-07-08 15:57:22,483 INFO L280 TraceCheckUtils]: 16: Hoare triple {526#true} #res := 0; {538#(= 0 |id_#res|)} is VALID [2020-07-08 15:57:22,485 INFO L280 TraceCheckUtils]: 17: Hoare triple {538#(= 0 |id_#res|)} [49] idFINAL-->idEXIT_primed: Formula: (let ((.cse0 (+ |v_oct_id_#res_in_2| 1))) (and (<= v_oct_id_~ret~0_out_2 .cse0) (<= v_oct_id_~ret~0_out_2 |v_oct_id_#res_out_2|) (let ((.cse7 (* 2 |v_oct_id_#res_in_2|))) (let ((.cse1 (<= (* 2 v_oct_id_~ret~0_out_2) 10)) (.cse2 (<= |v_oct_id_#res_out_2| v_oct_id_~ret~0_out_2)) (.cse4 (<= 0 (+ .cse7 4294967296))) (.cse5 (<= .cse7 4294967294)) (.cse3 (<= .cse7 4294967294))) (or (and .cse1 .cse2 (not .cse3) .cse4 .cse5) (and .cse1 .cse2 (let ((.cse6 (<= 0 (+ .cse7 4294967296)))) (or .cse6 (and (not .cse6) .cse4 .cse5))) .cse3)))) (<= .cse0 v_oct_id_~ret~0_out_2))) InVars {id_#res=|v_oct_id_#res_in_2|} OutVars{id_#res=|v_oct_id_#res_out_2|, id_#t~ret0=|v_oct_id_#t~ret0_out_2|, id_~ret~0=v_oct_id_~ret~0_out_2} AuxVars[] AssignedVars[id_#res, id_#t~ret0, id_~ret~0] {539#(<= |id_#res| 1)} is VALID [2020-07-08 15:57:22,487 INFO L280 TraceCheckUtils]: 18: Hoare triple {539#(<= |id_#res| 1)} [48] idEXIT_primed-->idEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {539#(<= |id_#res| 1)} is VALID [2020-07-08 15:57:22,490 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {539#(<= |id_#res| 1)} {526#true} #43#return; {536#(<= |main_#t~ret2| 1)} is VALID [2020-07-08 15:57:22,491 INFO L280 TraceCheckUtils]: 20: Hoare triple {536#(<= |main_#t~ret2| 1)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {536#(<= |main_#t~ret2| 1)} is VALID [2020-07-08 15:57:22,492 INFO L280 TraceCheckUtils]: 21: Hoare triple {536#(<= |main_#t~ret2| 1)} ~result~0 := #t~ret2; {537#(<= main_~result~0 1)} is VALID [2020-07-08 15:57:22,493 INFO L280 TraceCheckUtils]: 22: Hoare triple {537#(<= main_~result~0 1)} havoc #t~ret2; {537#(<= main_~result~0 1)} is VALID [2020-07-08 15:57:22,494 INFO L280 TraceCheckUtils]: 23: Hoare triple {537#(<= main_~result~0 1)} assume 10 == ~result~0; {527#false} is VALID [2020-07-08 15:57:22,495 INFO L280 TraceCheckUtils]: 24: Hoare triple {527#false} assume !false; {527#false} is VALID [2020-07-08 15:57:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 15:57:22,659 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:57:22,660 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1686813777] [2020-07-08 15:57:22,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:57:22,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-08 15:57:22,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886793334] [2020-07-08 15:57:22,661 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2020-07-08 15:57:22,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:57:22,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 15:57:22,671 WARN L140 InductivityCheck]: Transition 547#(and (= id_~ret~0 |id_#res|) (= 2 id_~ret~0)) ( _ , assume true; , 539#(<= |id_#res| 1) ) not inductive [2020-07-08 15:57:22,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 15:57:22,672 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:583) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:455) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-08 15:57:22,678 INFO L168 Benchmark]: Toolchain (without parser) took 3122.11 ms. Allocated memory was 147.3 MB in the beginning and 241.7 MB in the end (delta: 94.4 MB). Free memory was 103.7 MB in the beginning and 148.7 MB in the end (delta: -44.9 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2020-07-08 15:57:22,679 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 147.3 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 15:57:22,680 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.62 ms. Allocated memory is still 147.3 MB. Free memory was 103.5 MB in the beginning and 94.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-08 15:57:22,681 INFO L168 Benchmark]: Boogie Preprocessor took 31.61 ms. Allocated memory is still 147.3 MB. Free memory was 94.1 MB in the beginning and 92.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-08 15:57:22,682 INFO L168 Benchmark]: RCFGBuilder took 468.77 ms. Allocated memory was 147.3 MB in the beginning and 203.9 MB in the end (delta: 56.6 MB). Free memory was 92.7 MB in the beginning and 166.9 MB in the end (delta: -74.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-08 15:57:22,683 INFO L168 Benchmark]: TraceAbstraction took 2365.93 ms. Allocated memory was 203.9 MB in the beginning and 241.7 MB in the end (delta: 37.7 MB). Free memory was 166.3 MB in the beginning and 148.7 MB in the end (delta: 17.6 MB). Peak memory consumption was 55.4 MB. Max. memory is 7.1 GB. [2020-07-08 15:57:22,687 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.24 ms. Allocated memory is still 147.3 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 249.62 ms. Allocated memory is still 147.3 MB. Free memory was 103.5 MB in the beginning and 94.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.61 ms. Allocated memory is still 147.3 MB. Free memory was 94.1 MB in the beginning and 92.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 468.77 ms. Allocated memory was 147.3 MB in the beginning and 203.9 MB in the end (delta: 56.6 MB). Free memory was 92.7 MB in the beginning and 166.9 MB in the end (delta: -74.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2365.93 ms. Allocated memory was 203.9 MB in the beginning and 241.7 MB in the end (delta: 37.7 MB). Free memory was 166.3 MB in the beginning and 148.7 MB in the end (delta: 17.6 MB). Peak memory consumption was 55.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...