java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label14_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 22:08:23,137 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 22:08:23,139 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 22:08:23,155 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 22:08:23,156 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 22:08:23,157 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 22:08:23,159 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 22:08:23,162 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 22:08:23,164 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 22:08:23,165 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 22:08:23,171 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 22:08:23,171 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 22:08:23,172 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 22:08:23,173 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 22:08:23,177 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 22:08:23,178 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 22:08:23,180 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 22:08:23,181 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 22:08:23,186 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 22:08:23,189 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 22:08:23,190 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 22:08:23,192 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 22:08:23,196 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 22:08:23,197 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 22:08:23,197 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 22:08:23,201 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 22:08:23,202 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 22:08:23,203 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 22:08:23,203 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 22:08:23,207 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 22:08:23,207 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 22:08:23,208 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 22:08:23,208 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 22:08:23,208 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 22:08:23,209 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 22:08:23,210 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 22:08:23,210 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf [2018-09-15 22:08:23,239 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 22:08:23,239 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 22:08:23,241 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 22:08:23,241 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 22:08:23,241 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 22:08:23,242 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 22:08:23,242 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 22:08:23,242 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-15 22:08:23,242 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-15 22:08:23,243 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 22:08:23,243 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 22:08:23,244 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 22:08:23,244 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 22:08:23,244 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 22:08:23,244 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 22:08:23,246 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 22:08:23,246 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 22:08:23,247 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 22:08:23,248 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 22:08:23,248 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 22:08:23,248 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 22:08:23,248 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 22:08:23,248 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 22:08:23,249 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 22:08:23,249 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 22:08:23,249 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 22:08:23,249 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 22:08:23,250 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 22:08:23,250 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 22:08:23,250 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 22:08:23,250 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 22:08:23,250 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 22:08:23,251 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 22:08:23,299 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 22:08:23,313 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 22:08:23,319 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 22:08:23,321 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 22:08:23,321 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 22:08:23,322 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label14_true-unreach-call.c [2018-09-15 22:08:23,675 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbb68dfa6/0c11fbbf7a4e4036bbdad42ba7d9e451/FLAG1bf3b2aef [2018-09-15 22:08:23,982 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 22:08:23,984 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label14_true-unreach-call.c [2018-09-15 22:08:24,001 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbb68dfa6/0c11fbbf7a4e4036bbdad42ba7d9e451/FLAG1bf3b2aef [2018-09-15 22:08:24,028 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbb68dfa6/0c11fbbf7a4e4036bbdad42ba7d9e451 [2018-09-15 22:08:24,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 22:08:24,048 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 22:08:24,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 22:08:24,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 22:08:24,057 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 22:08:24,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 10:08:24" (1/1) ... [2018-09-15 22:08:24,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a614e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 10:08:24, skipping insertion in model container [2018-09-15 22:08:24,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 10:08:24" (1/1) ... [2018-09-15 22:08:24,075 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 22:08:24,555 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 22:08:24,580 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 22:08:24,719 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 22:08:24,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 10:08:24 WrapperNode [2018-09-15 22:08:24,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 22:08:24,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 22:08:24,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 22:08:24,781 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 22:08:24,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 10:08:24" (1/1) ... [2018-09-15 22:08:24,816 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 10:08:24" (1/1) ... [2018-09-15 22:08:24,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 22:08:24,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 22:08:24,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 22:08:24,905 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 22:08:25,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 10:08:24" (1/1) ... [2018-09-15 22:08:25,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 10:08:24" (1/1) ... [2018-09-15 22:08:25,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 10:08:24" (1/1) ... [2018-09-15 22:08:25,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 10:08:24" (1/1) ... [2018-09-15 22:08:25,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 10:08:24" (1/1) ... [2018-09-15 22:08:25,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 10:08:24" (1/1) ... [2018-09-15 22:08:25,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 10:08:24" (1/1) ... [2018-09-15 22:08:25,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 22:08:25,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 22:08:25,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 22:08:25,155 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 22:08:25,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 10:08:24" (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 [2018-09-15 22:08:25,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 22:08:25,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 22:08:25,240 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 22:08:25,240 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 22:08:25,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 22:08:25,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 22:08:25,240 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 22:08:25,241 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 22:08:28,517 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 22:08:28,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 10:08:28 BoogieIcfgContainer [2018-09-15 22:08:28,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 22:08:28,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 22:08:28,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 22:08:28,524 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 22:08:28,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 10:08:24" (1/3) ... [2018-09-15 22:08:28,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a80e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 10:08:28, skipping insertion in model container [2018-09-15 22:08:28,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 10:08:24" (2/3) ... [2018-09-15 22:08:28,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a80e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 10:08:28, skipping insertion in model container [2018-09-15 22:08:28,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 10:08:28" (3/3) ... [2018-09-15 22:08:28,530 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label14_true-unreach-call.c [2018-09-15 22:08:28,540 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 22:08:28,550 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 22:08:28,615 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 22:08:28,616 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 22:08:28,616 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 22:08:28,616 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 22:08:28,616 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 22:08:28,617 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 22:08:28,617 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 22:08:28,617 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 22:08:28,617 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 22:08:28,662 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-15 22:08:28,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-15 22:08:28,671 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 22:08:28,672 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 22:08:28,673 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 22:08:28,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1440498332, now seen corresponding path program 1 times [2018-09-15 22:08:28,682 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 22:08:28,683 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-09-15 22:08:28,687 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [205], [207], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-15 22:08:28,735 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-15 22:08:28,735 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 22:08:32,405 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 22:08:32,407 INFO L272 AbstractInterpreter]: Visited 37 different actions 37 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-15 22:08:32,429 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 22:08:34,115 INFO L232 lantSequenceWeakener]: Weakened 35 states. On average, predicates are now at 74.38% of their original sizes. [2018-09-15 22:08:34,115 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 22:08:34,217 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 22:08:34,219 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 22:08:34,219 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 22:08:34,220 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 22:08:34,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 22:08:34,232 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 22:08:34,233 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 22:08:34,235 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-15 22:08:37,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 22:08:37,038 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-15 22:08:37,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-15 22:08:37,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-09-15 22:08:37,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 22:08:37,061 INFO L225 Difference]: With dead ends: 576 [2018-09-15 22:08:37,061 INFO L226 Difference]: Without dead ends: 358 [2018-09-15 22:08:37,070 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 22:08:37,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-15 22:08:37,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-15 22:08:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-15 22:08:37,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-15 22:08:37,141 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 38 [2018-09-15 22:08:37,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 22:08:37,141 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-15 22:08:37,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 22:08:37,142 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-15 22:08:37,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-09-15 22:08:37,147 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 22:08:37,147 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 22:08:37,148 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 22:08:37,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1526433965, now seen corresponding path program 1 times [2018-09-15 22:08:37,148 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 22:08:37,149 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2018-09-15 22:08:37,149 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [205], [207], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 22:08:37,156 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-15 22:08:37,156 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 22:08:41,183 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 22:08:47,334 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 22:08:47,334 INFO L272 AbstractInterpreter]: Visited 78 different actions 150 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 22:08:47,349 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 22:08:55,987 INFO L232 lantSequenceWeakener]: Weakened 106 states. On average, predicates are now at 73.4% of their original sizes. [2018-09-15 22:08:55,987 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 22:08:56,296 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 22:08:56,296 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 22:08:56,297 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 22:08:56,297 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 22:08:56,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 22:08:56,298 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 22:08:56,298 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 22:08:56,299 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-15 22:09:00,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 22:09:00,657 INFO L93 Difference]: Finished difference Result 711 states and 1126 transitions. [2018-09-15 22:09:00,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-15 22:09:00,662 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 109 [2018-09-15 22:09:00,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 22:09:00,668 INFO L225 Difference]: With dead ends: 711 [2018-09-15 22:09:00,668 INFO L226 Difference]: Without dead ends: 505 [2018-09-15 22:09:00,671 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 115 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-15 22:09:00,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-09-15 22:09:00,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 502. [2018-09-15 22:09:00,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-09-15 22:09:00,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 655 transitions. [2018-09-15 22:09:00,706 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 655 transitions. Word has length 109 [2018-09-15 22:09:00,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 22:09:00,707 INFO L480 AbstractCegarLoop]: Abstraction has 502 states and 655 transitions. [2018-09-15 22:09:00,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 22:09:00,707 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 655 transitions. [2018-09-15 22:09:00,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-15 22:09:00,710 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 22:09:00,711 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 22:09:00,711 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 22:09:00,711 INFO L82 PathProgramCache]: Analyzing trace with hash -396511336, now seen corresponding path program 1 times [2018-09-15 22:09:00,712 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 22:09:00,712 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2018-09-15 22:09:00,712 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [205], [207], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 22:09:00,716 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-15 22:09:00,716 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 22:09:41,370 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 22:10:28,307 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 22:10:28,307 INFO L272 AbstractInterpreter]: Visited 87 different actions 167 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 22:10:28,345 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 22:11:15,212 INFO L232 lantSequenceWeakener]: Weakened 115 states. On average, predicates are now at 73.35% of their original sizes. [2018-09-15 22:11:15,212 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 22:11:15,355 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 22:11:15,356 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 22:11:15,356 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 22:11:15,356 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 22:11:15,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 22:11:15,357 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 22:11:15,357 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-15 22:11:15,358 INFO L87 Difference]: Start difference. First operand 502 states and 655 transitions. Second operand 11 states. [2018-09-15 22:11:17,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 22:11:17,478 INFO L93 Difference]: Finished difference Result 1002 states and 1569 transitions. [2018-09-15 22:11:17,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-15 22:11:17,479 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 118 [2018-09-15 22:11:17,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 22:11:17,485 INFO L225 Difference]: With dead ends: 1002 [2018-09-15 22:11:17,485 INFO L226 Difference]: Without dead ends: 796 [2018-09-15 22:11:17,487 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 124 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 22:11:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-09-15 22:11:17,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 793. [2018-09-15 22:11:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2018-09-15 22:11:17,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 962 transitions. [2018-09-15 22:11:17,527 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 962 transitions. Word has length 118 [2018-09-15 22:11:17,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 22:11:17,528 INFO L480 AbstractCegarLoop]: Abstraction has 793 states and 962 transitions. [2018-09-15 22:11:17,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 22:11:17,528 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 962 transitions. [2018-09-15 22:11:17,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-15 22:11:17,533 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 22:11:17,533 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 22:11:17,533 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 22:11:17,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1570919920, now seen corresponding path program 1 times [2018-09-15 22:11:17,534 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 22:11:17,534 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 155 with the following transitions: [2018-09-15 22:11:17,535 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [205], [207], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 22:11:17,539 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-15 22:11:17,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-09-15 22:12:27,781 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-15 22:12:27,782 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-15 22:12:27,782 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 22:12:27,814 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 22:12:27,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 10:12:27 BoogieIcfgContainer [2018-09-15 22:12:27,815 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 22:12:27,816 INFO L168 Benchmark]: Toolchain (without parser) took 243770.20 ms. Allocated memory was 1.5 GB in the beginning and 4.8 GB in the end (delta: 3.3 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 5.1 GB. Max. memory is 7.1 GB. [2018-09-15 22:12:27,820 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-15 22:12:27,820 INFO L168 Benchmark]: CACSL2BoogieTranslator took 730.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2018-09-15 22:12:27,821 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-15 22:12:27,823 INFO L168 Benchmark]: Boogie Preprocessor took 249.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 768.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -861.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2018-09-15 22:12:27,824 INFO L168 Benchmark]: RCFGBuilder took 3363.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 108.5 MB). Peak memory consumption was 108.5 MB. Max. memory is 7.1 GB. [2018-09-15 22:12:27,825 INFO L168 Benchmark]: TraceAbstraction took 239295.28 ms. Allocated memory was 2.3 GB in the beginning and 4.8 GB in the end (delta: 2.5 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -408.5 MB). Peak memory consumption was 5.0 GB. Max. memory is 7.1 GB. [2018-09-15 22:12:27,830 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 730.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 123.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 249.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 768.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -861.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3363.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 108.5 MB). Peak memory consumption was 108.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239295.28 ms. Allocated memory was 2.3 GB in the beginning and 4.8 GB in the end (delta: 2.5 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -408.5 MB). Peak memory consumption was 5.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 97]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] RET return 25; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND TRUE (((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)) [L97] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 239.2s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 9.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 627 SDtfs, 1647 SDslu, 848 SDs, 0 SdLazy, 4555 SolverSat, 547 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 276 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=793occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 171.8s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.9957647811862885 AbsIntWeakeningRatio, 0.20610687022900764 AbsIntAvgWeakeningVarsNumRemoved, 7.713740458015267 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label14_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_22-12-27-846.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label14_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_22-12-27-846.csv Completed graceful shutdown