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_OCT-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label43_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ddc4263 [2018-08-08 13:27:24,518 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-08-08 13:27:24,521 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-08-08 13:27:24,534 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-08-08 13:27:24,535 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-08-08 13:27:24,536 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-08-08 13:27:24,537 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-08-08 13:27:24,539 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-08-08 13:27:24,541 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-08-08 13:27:24,542 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-08-08 13:27:24,543 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-08-08 13:27:24,543 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-08-08 13:27:24,544 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-08-08 13:27:24,545 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-08-08 13:27:24,546 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-08-08 13:27:24,547 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-08-08 13:27:24,548 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-08-08 13:27:24,550 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-08-08 13:27:24,552 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-08-08 13:27:24,554 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-08-08 13:27:24,555 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-08-08 13:27:24,557 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-08-08 13:27:24,560 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-08-08 13:27:24,560 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-08-08 13:27:24,560 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-08-08 13:27:24,561 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-08-08 13:27:24,562 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-08-08 13:27:24,563 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-08-08 13:27:24,564 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-08-08 13:27:24,565 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-08-08 13:27:24,566 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-08-08 13:27:24,567 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-08-08 13:27:24,567 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-08-08 13:27:24,567 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-08-08 13:27:24,568 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-08-08 13:27:24,569 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-08-08 13:27:24,569 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf [2018-08-08 13:27:24,586 INFO L110 SettingsManager]: Loading preferences was successful [2018-08-08 13:27:24,586 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-08-08 13:27:24,587 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-08-08 13:27:24,588 INFO L133 SettingsManager]: * User list type=DISABLED [2018-08-08 13:27:24,588 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-08-08 13:27:24,588 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-08-08 13:27:24,588 INFO L133 SettingsManager]: * Congruence Domain=false [2018-08-08 13:27:24,588 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-08-08 13:27:24,589 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2018-08-08 13:27:24,589 INFO L133 SettingsManager]: * Log string format=TERM [2018-08-08 13:27:24,589 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-08-08 13:27:24,589 INFO L133 SettingsManager]: * Interval Domain=false [2018-08-08 13:27:24,590 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-08-08 13:27:24,590 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-08-08 13:27:24,590 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-08-08 13:27:24,591 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-08-08 13:27:24,591 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-08-08 13:27:24,591 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-08-08 13:27:24,591 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-08-08 13:27:24,591 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-08-08 13:27:24,592 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-08-08 13:27:24,592 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-08-08 13:27:24,592 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-08-08 13:27:24,592 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-08-08 13:27:24,592 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-08-08 13:27:24,593 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-08-08 13:27:24,593 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-08-08 13:27:24,593 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-08-08 13:27:24,593 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-08-08 13:27:24,594 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-08-08 13:27:24,594 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-08-08 13:27:24,594 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-08-08 13:27:24,594 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-08-08 13:27:24,594 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-08-08 13:27:24,666 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-08-08 13:27:24,689 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-08-08 13:27:24,697 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-08-08 13:27:24,699 INFO L271 PluginConnector]: Initializing CDTParser... [2018-08-08 13:27:24,700 INFO L276 PluginConnector]: CDTParser initialized [2018-08-08 13:27:24,701 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label43_true-unreach-call.c [2018-08-08 13:27:25,093 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b9ce1aa3/7b6057eeec174bffa1d040d935eb93a8/FLAG0f00ca4d4 [2018-08-08 13:27:25,369 INFO L276 CDTParser]: Found 1 translation units. [2018-08-08 13:27:25,370 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label43_true-unreach-call.c [2018-08-08 13:27:25,391 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b9ce1aa3/7b6057eeec174bffa1d040d935eb93a8/FLAG0f00ca4d4 [2018-08-08 13:27:25,413 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b9ce1aa3/7b6057eeec174bffa1d040d935eb93a8 [2018-08-08 13:27:25,428 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-08-08 13:27:25,431 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-08-08 13:27:25,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-08-08 13:27:25,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-08-08 13:27:25,440 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-08-08 13:27:25,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.08 01:27:25" (1/1) ... [2018-08-08 13:27:25,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@711a5c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 01:27:25, skipping insertion in model container [2018-08-08 13:27:25,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.08 01:27:25" (1/1) ... [2018-08-08 13:27:25,647 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-08-08 13:27:25,937 INFO L175 PostProcessor]: Settings: Checked method=main [2018-08-08 13:27:25,958 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-08-08 13:27:26,103 INFO L175 PostProcessor]: Settings: Checked method=main [2018-08-08 13:27:26,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 01:27:26 WrapperNode [2018-08-08 13:27:26,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-08-08 13:27:26,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-08-08 13:27:26,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-08-08 13:27:26,172 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-08-08 13:27:26,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 01:27:26" (1/1) ... [2018-08-08 13:27:26,223 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 01:27:26" (1/1) ... [2018-08-08 13:27:26,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-08-08 13:27:26,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-08-08 13:27:26,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-08-08 13:27:26,319 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-08-08 13:27:26,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 01:27:26" (1/1) ... [2018-08-08 13:27:26,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 01:27:26" (1/1) ... [2018-08-08 13:27:26,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 01:27:26" (1/1) ... [2018-08-08 13:27:26,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 01:27:26" (1/1) ... [2018-08-08 13:27:26,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 01:27:26" (1/1) ... [2018-08-08 13:27:26,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 01:27:26" (1/1) ... [2018-08-08 13:27:26,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 01:27:26" (1/1) ... [2018-08-08 13:27:26,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-08-08 13:27:26,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-08-08 13:27:26,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-08-08 13:27:26,657 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-08-08 13:27:26,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 01:27:26" (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-08-08 13:27:26,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-08-08 13:27:26,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-08-08 13:27:26,741 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-08-08 13:27:26,742 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-08-08 13:27:26,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-08-08 13:27:26,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-08-08 13:27:26,742 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-08-08 13:27:26,743 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-08-08 13:27:30,002 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-08-08 13:27:30,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.08 01:27:30 BoogieIcfgContainer [2018-08-08 13:27:30,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-08-08 13:27:30,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-08-08 13:27:30,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-08-08 13:27:30,009 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-08-08 13:27:30,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.08 01:27:25" (1/3) ... [2018-08-08 13:27:30,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5135be89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.08 01:27:30, skipping insertion in model container [2018-08-08 13:27:30,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 01:27:26" (2/3) ... [2018-08-08 13:27:30,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5135be89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.08 01:27:30, skipping insertion in model container [2018-08-08 13:27:30,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.08 01:27:30" (3/3) ... [2018-08-08 13:27:30,013 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label43_true-unreach-call.c [2018-08-08 13:27:30,024 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-08-08 13:27:30,034 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-08-08 13:27:30,088 INFO L129 ementStrategyFactory]: Using default assertion order modulation [2018-08-08 13:27:30,089 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-08-08 13:27:30,089 INFO L382 AbstractCegarLoop]: Hoare is true [2018-08-08 13:27:30,090 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-08-08 13:27:30,090 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-08-08 13:27:30,090 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-08-08 13:27:30,090 INFO L386 AbstractCegarLoop]: Difference is false [2018-08-08 13:27:30,090 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-08-08 13:27:30,090 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-08-08 13:27:30,120 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-08-08 13:27:30,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-08-08 13:27:30,129 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 13:27:30,131 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, 1, 1, 1, 1] [2018-08-08 13:27:30,132 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 13:27:30,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1430816948, now seen corresponding path program 1 times [2018-08-08 13:27:30,140 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 13:27:30,141 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-08-08 13:27:30,144 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], [209], [217], [225], [233], [237], [239], [796], [800], [806], [810], [817], [818], [819], [821] [2018-08-08 13:27:30,205 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-08-08 13:27:30,206 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 13:27:31,423 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 13:27:31,425 INFO L272 AbstractInterpreter]: Visited 41 different actions 41 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-08-08 13:27:31,441 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 13:27:32,003 INFO L232 lantSequenceWeakener]: Weakened 40 states. On average, predicates are now at 75.31% of their original sizes. [2018-08-08 13:27:32,003 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 13:27:32,305 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 13:27:32,307 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 13:27:32,308 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-08-08 13:27:32,308 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 13:27:32,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-08-08 13:27:32,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-08-08 13:27:32,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-08-08 13:27:32,324 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-08-08 13:27:36,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 13:27:36,608 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-08-08 13:27:36,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-08-08 13:27:36,610 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-08-08 13:27:36,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 13:27:36,629 INFO L225 Difference]: With dead ends: 576 [2018-08-08 13:27:36,629 INFO L226 Difference]: Without dead ends: 358 [2018-08-08 13:27:36,637 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-08-08 13:27:36,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-08-08 13:27:36,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-08-08 13:27:36,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-08-08 13:27:36,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-08-08 13:27:36,714 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 42 [2018-08-08 13:27:36,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 13:27:36,715 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-08-08 13:27:36,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-08-08 13:27:36,717 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-08-08 13:27:36,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-08-08 13:27:36,728 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 13:27:36,729 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, 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] [2018-08-08 13:27:36,730 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 13:27:36,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1958223005, now seen corresponding path program 1 times [2018-08-08 13:27:36,730 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 13:27:36,731 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2018-08-08 13:27:36,731 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], [209], [217], [225], [233], [237], [239], [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-08-08 13:27:36,745 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-08-08 13:27:36,746 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 13:27:38,098 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-08-08 13:27:40,661 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 13:27:40,662 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-08-08 13:27:40,668 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 13:27:42,153 INFO L232 lantSequenceWeakener]: Weakened 111 states. On average, predicates are now at 73.78% of their original sizes. [2018-08-08 13:27:42,153 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 13:27:43,136 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 13:27:43,137 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 13:27:43,137 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-08-08 13:27:43,137 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 13:27:43,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-08-08 13:27:43,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-08-08 13:27:43,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-08-08 13:27:43,139 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-08-08 13:27:55,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 13:27:55,593 INFO L93 Difference]: Finished difference Result 711 states and 1126 transitions. [2018-08-08 13:27:55,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-08-08 13:27:55,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2018-08-08 13:27:55,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 13:27:55,599 INFO L225 Difference]: With dead ends: 711 [2018-08-08 13:27:55,600 INFO L226 Difference]: Without dead ends: 505 [2018-08-08 13:27:55,603 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 119 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-08-08 13:27:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-08-08 13:27:55,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 502. [2018-08-08 13:27:55,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-08-08 13:27:55,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 655 transitions. [2018-08-08 13:27:55,641 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 655 transitions. Word has length 113 [2018-08-08 13:27:55,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 13:27:55,642 INFO L480 AbstractCegarLoop]: Abstraction has 502 states and 655 transitions. [2018-08-08 13:27:55,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-08-08 13:27:55,642 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 655 transitions. [2018-08-08 13:27:55,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-08-08 13:27:55,645 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 13:27:55,646 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, 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] [2018-08-08 13:27:55,646 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 13:27:55,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1479974744, now seen corresponding path program 1 times [2018-08-08 13:27:55,646 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 13:27:55,647 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 123 with the following transitions: [2018-08-08 13:27:55,647 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], [209], [217], [225], [233], [237], [239], [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-08-08 13:27:55,652 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-08-08 13:27:55,652 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 13:28:00,500 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 13:28:00,500 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-08-08 13:28:00,505 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 13:28:01,386 INFO L232 lantSequenceWeakener]: Weakened 120 states. On average, predicates are now at 73.7% of their original sizes. [2018-08-08 13:28:01,387 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 13:28:02,013 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 13:28:02,014 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 13:28:02,014 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-08-08 13:28:02,014 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 13:28:02,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-08-08 13:28:02,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-08-08 13:28:02,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-08-08 13:28:02,016 INFO L87 Difference]: Start difference. First operand 502 states and 655 transitions. Second operand 12 states. [2018-08-08 13:28:10,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 13:28:10,483 INFO L93 Difference]: Finished difference Result 1002 states and 1569 transitions. [2018-08-08 13:28:10,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-08-08 13:28:10,487 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 122 [2018-08-08 13:28:10,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 13:28:10,501 INFO L225 Difference]: With dead ends: 1002 [2018-08-08 13:28:10,501 INFO L226 Difference]: Without dead ends: 796 [2018-08-08 13:28:10,503 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 129 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-08-08 13:28:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-08-08 13:28:10,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 793. [2018-08-08 13:28:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2018-08-08 13:28:10,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 962 transitions. [2018-08-08 13:28:10,575 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 962 transitions. Word has length 122 [2018-08-08 13:28:10,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 13:28:10,576 INFO L480 AbstractCegarLoop]: Abstraction has 793 states and 962 transitions. [2018-08-08 13:28:10,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-08-08 13:28:10,576 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 962 transitions. [2018-08-08 13:28:10,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-08-08 13:28:10,584 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 13:28:10,585 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, 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] [2018-08-08 13:28:10,585 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 13:28:10,585 INFO L82 PathProgramCache]: Analyzing trace with hash -2055571680, now seen corresponding path program 1 times [2018-08-08 13:28:10,585 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 13:28:10,586 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2018-08-08 13:28:10,586 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], [209], [217], [225], [233], [237], [239], [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-08-08 13:28:10,591 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-08-08 13:28:10,591 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 13:28:14,682 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-08-08 13:28:24,872 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 13:28:24,873 INFO L272 AbstractInterpreter]: Visited 123 different actions 356 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-08-08 13:28:24,875 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 13:28:27,233 INFO L232 lantSequenceWeakener]: Weakened 156 states. On average, predicates are now at 73.48% of their original sizes. [2018-08-08 13:28:27,234 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 13:28:28,192 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 13:28:28,192 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 13:28:28,192 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-08-08 13:28:28,193 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 13:28:28,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-08-08 13:28:28,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-08-08 13:28:28,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-08-08 13:28:28,194 INFO L87 Difference]: Start difference. First operand 793 states and 962 transitions. Second operand 14 states. [2018-08-08 13:28:43,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 13:28:43,088 INFO L93 Difference]: Finished difference Result 1161 states and 1610 transitions. [2018-08-08 13:28:43,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-08-08 13:28:43,088 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 158 [2018-08-08 13:28:43,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 13:28:43,095 INFO L225 Difference]: With dead ends: 1161 [2018-08-08 13:28:43,095 INFO L226 Difference]: Without dead ends: 955 [2018-08-08 13:28:43,097 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 169 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2018-08-08 13:28:43,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-08-08 13:28:43,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 943. [2018-08-08 13:28:43,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-08-08 13:28:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1137 transitions. [2018-08-08 13:28:43,149 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1137 transitions. Word has length 158 [2018-08-08 13:28:43,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 13:28:43,150 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 1137 transitions. [2018-08-08 13:28:43,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-08-08 13:28:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1137 transitions. [2018-08-08 13:28:43,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-08-08 13:28:43,154 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 13:28:43,154 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-08 13:28:43,155 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 13:28:43,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2070095587, now seen corresponding path program 1 times [2018-08-08 13:28:43,156 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 13:28:43,156 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 178 with the following transitions: [2018-08-08 13:28:43,156 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], [209], [217], [225], [233], [237], [239], [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], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-08-08 13:28:43,168 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-08-08 13:28:43,169 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 13:28:56,907 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 13:28:56,908 INFO L272 AbstractInterpreter]: Visited 142 different actions 278 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-08-08 13:28:56,916 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 13:28:58,948 INFO L232 lantSequenceWeakener]: Weakened 175 states. On average, predicates are now at 73.4% of their original sizes. [2018-08-08 13:28:58,948 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 13:29:00,725 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 13:29:00,726 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 13:29:00,726 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-08-08 13:29:00,726 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 13:29:00,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-08-08 13:29:00,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-08-08 13:29:00,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-08-08 13:29:00,727 INFO L87 Difference]: Start difference. First operand 943 states and 1137 transitions. Second operand 18 states. [2018-08-08 13:29:14,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 13:29:14,166 INFO L93 Difference]: Finished difference Result 1561 states and 2167 transitions. [2018-08-08 13:29:14,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-08-08 13:29:14,168 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 177 [2018-08-08 13:29:14,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 13:29:14,176 INFO L225 Difference]: With dead ends: 1561 [2018-08-08 13:29:14,176 INFO L226 Difference]: Without dead ends: 1207 [2018-08-08 13:29:14,178 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 193 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=287, Invalid=903, Unknown=0, NotChecked=0, Total=1190 [2018-08-08 13:29:14,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-08-08 13:29:14,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1205. [2018-08-08 13:29:14,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-08-08 13:29:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1418 transitions. [2018-08-08 13:29:14,233 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1418 transitions. Word has length 177 [2018-08-08 13:29:14,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 13:29:14,234 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1418 transitions. [2018-08-08 13:29:14,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-08-08 13:29:14,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1418 transitions. [2018-08-08 13:29:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-08-08 13:29:14,237 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 13:29:14,238 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-08 13:29:14,238 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 13:29:14,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1220148193, now seen corresponding path program 1 times [2018-08-08 13:29:14,239 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 13:29:14,239 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-08-08 13:29:14,239 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], [209], [217], [225], [233], [237], [239], [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], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-08-08 13:29:14,242 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-08-08 13:29:14,242 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 13:29:15,680 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-08-08 13:29:21,920 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 13:29:21,921 INFO L272 AbstractInterpreter]: Visited 84 different actions 244 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-08-08 13:29:21,929 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 13:29:23,645 INFO L232 lantSequenceWeakener]: Weakened 187 states. On average, predicates are now at 73.41% of their original sizes. [2018-08-08 13:29:23,646 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 13:29:24,238 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 13:29:24,239 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 13:29:24,239 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-08-08 13:29:24,239 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 13:29:24,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-08-08 13:29:24,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-08-08 13:29:24,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-08-08 13:29:24,240 INFO L87 Difference]: Start difference. First operand 1205 states and 1418 transitions. Second operand 11 states. [2018-08-08 13:29:32,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 13:29:32,091 INFO L93 Difference]: Finished difference Result 1717 states and 2233 transitions. [2018-08-08 13:29:32,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-08-08 13:29:32,092 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 189 [2018-08-08 13:29:32,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 13:29:32,098 INFO L225 Difference]: With dead ends: 1717 [2018-08-08 13:29:32,098 INFO L226 Difference]: Without dead ends: 1363 [2018-08-08 13:29:32,100 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 198 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-08-08 13:29:32,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2018-08-08 13:29:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1353. [2018-08-08 13:29:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1353 states. [2018-08-08 13:29:32,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1584 transitions. [2018-08-08 13:29:32,157 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1584 transitions. Word has length 189 [2018-08-08 13:29:32,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 13:29:32,158 INFO L480 AbstractCegarLoop]: Abstraction has 1353 states and 1584 transitions. [2018-08-08 13:29:32,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-08-08 13:29:32,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1584 transitions. [2018-08-08 13:29:32,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-08-08 13:29:32,161 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 13:29:32,162 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-08-08 13:29:32,162 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 13:29:32,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1560902313, now seen corresponding path program 1 times [2018-08-08 13:29:32,163 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 13:29:32,163 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2018-08-08 13:29:32,163 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], [209], [217], [225], [233], [237], [239], [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], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-08-08 13:29:32,166 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-08-08 13:29:32,166 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 13:29:33,278 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-08-08 13:29:50,675 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-08-08 13:29:50,675 INFO L272 AbstractInterpreter]: Visited 89 different actions 514 times. Merged at 7 different actions 38 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-08-08 13:29:50,683 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-08-08 13:29:50,722 WARN L205 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-08-08 13:29:50,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.08 01:29:50 BoogieIcfgContainer [2018-08-08 13:29:50,722 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-08-08 13:29:50,724 INFO L168 Benchmark]: Toolchain (without parser) took 145294.49 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -503.1 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-08-08 13:29:50,726 INFO L168 Benchmark]: CDTParser took 0.25 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-08-08 13:29:50,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 738.63 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-08-08 13:29:50,727 INFO L168 Benchmark]: Boogie Procedure Inliner took 146.72 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-08-08 13:29:50,728 INFO L168 Benchmark]: Boogie Preprocessor took 337.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 771.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -872.8 MB). Peak memory consumption was 32.9 MB. Max. memory is 7.1 GB. [2018-08-08 13:29:50,730 INFO L168 Benchmark]: RCFGBuilder took 3346.62 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: 129.4 MB). Peak memory consumption was 129.4 MB. Max. memory is 7.1 GB. [2018-08-08 13:29:50,731 INFO L168 Benchmark]: TraceAbstraction took 140718.30 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 187.5 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-08-08 13:29:50,736 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.25 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 738.63 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 146.72 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 337.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 771.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -872.8 MB). Peak memory consumption was 32.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3346.62 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: 129.4 MB). Peak memory consumption was 129.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 140718.30 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 187.5 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 109]: 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 TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L211] a1 = (((a1 + -15535) - 211896) / 5) [L212] a10 = 2 [L214] RET return 22; [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, 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 TRUE (((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)) [L255] a1 = (((a1 / 5) + 110755) + 220746) [L256] a10 = 1 [L257] a19 = 8 [L259] RET return -1; [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 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 TRUE (((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)) [L109] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 140.6s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 61.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1241 SDtfs, 4243 SDslu, 1942 SDs, 0 SdLazy, 10346 SolverSat, 1048 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 53.8s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 849 GetRequests, 736 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1353occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 64.3s AbstIntTime, 7 AbstIntIterations, 6 AbstIntStrong, 0.9930177492728762 AbsIntWeakeningRatio, 0.1509433962264151 AbsIntAvgWeakeningVarsNumRemoved, 130.38993710691824 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 32 StatesRemovedByMinimization, 6 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_label43_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-08-08_13-29-50-753.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label43_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-08-08_13-29-50-753.csv Received shutdown request...