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/Problem17_label42_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 11:10:54,598 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 11:10:54,600 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 11:10:54,618 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 11:10:54,619 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 11:10:54,620 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 11:10:54,621 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 11:10:54,624 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 11:10:54,627 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 11:10:54,628 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 11:10:54,630 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 11:10:54,631 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 11:10:54,632 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 11:10:54,633 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 11:10:54,642 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 11:10:54,643 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 11:10:54,648 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 11:10:54,650 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 11:10:54,655 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 11:10:54,657 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 11:10:54,658 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 11:10:54,659 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 11:10:54,662 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 11:10:54,662 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 11:10:54,662 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 11:10:54,663 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 11:10:54,664 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 11:10:54,665 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 11:10:54,666 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 11:10:54,667 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 11:10:54,667 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 11:10:54,668 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 11:10:54,668 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 11:10:54,668 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 11:10:54,669 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 11:10:54,670 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 11:10:54,670 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-09-19 11:10:54,697 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 11:10:54,698 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 11:10:54,699 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 11:10:54,699 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 11:10:54,700 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 11:10:54,700 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 11:10:54,700 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-19 11:10:54,700 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 11:10:54,700 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2018-09-19 11:10:54,701 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 11:10:54,701 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 11:10:54,701 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 11:10:54,701 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 11:10:54,702 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 11:10:54,702 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 11:10:54,703 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 11:10:54,703 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 11:10:54,703 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 11:10:54,703 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 11:10:54,703 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 11:10:54,704 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 11:10:54,704 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 11:10:54,704 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 11:10:54,704 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 11:10:54,706 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 11:10:54,706 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 11:10:54,707 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 11:10:54,707 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 11:10:54,707 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 11:10:54,707 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 11:10:54,707 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 11:10:54,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 11:10:54,708 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 11:10:54,708 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 11:10:54,708 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 11:10:54,775 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 11:10:54,791 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 11:10:54,798 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 11:10:54,800 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 11:10:54,800 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 11:10:54,802 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label42_true-unreach-call.c [2018-09-19 11:10:55,151 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04526d6f8/1bbe6ab6a13445e0ad099079892a9e46/FLAG8f891d753 [2018-09-19 11:10:55,576 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 11:10:55,577 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label42_true-unreach-call.c [2018-09-19 11:10:55,608 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04526d6f8/1bbe6ab6a13445e0ad099079892a9e46/FLAG8f891d753 [2018-09-19 11:10:55,624 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04526d6f8/1bbe6ab6a13445e0ad099079892a9e46 [2018-09-19 11:10:55,634 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 11:10:55,637 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 11:10:55,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 11:10:55,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 11:10:55,645 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 11:10:55,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 11:10:55" (1/1) ... [2018-09-19 11:10:55,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14d0561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:10:55, skipping insertion in model container [2018-09-19 11:10:55,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 11:10:55" (1/1) ... [2018-09-19 11:10:55,662 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 11:10:56,624 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 11:10:56,643 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 11:10:57,072 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 11:10:57,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:10:57 WrapperNode [2018-09-19 11:10:57,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 11:10:57,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 11:10:57,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 11:10:57,288 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 11:10:57,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:10:57" (1/1) ... [2018-09-19 11:10:57,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:10:57" (1/1) ... [2018-09-19 11:10:57,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 11:10:57,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 11:10:57,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 11:10:57,593 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 11:10:58,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:10:57" (1/1) ... [2018-09-19 11:10:58,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:10:57" (1/1) ... [2018-09-19 11:10:58,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:10:57" (1/1) ... [2018-09-19 11:10:58,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:10:57" (1/1) ... [2018-09-19 11:10:58,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:10:57" (1/1) ... [2018-09-19 11:10:58,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:10:57" (1/1) ... [2018-09-19 11:10:58,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:10:57" (1/1) ... [2018-09-19 11:10:58,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 11:10:58,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 11:10:58,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 11:10:58,607 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 11:10:58,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:10:57" (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-19 11:10:58,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 11:10:58,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 11:10:58,693 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-09-19 11:10:58,693 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-09-19 11:10:58,693 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 11:10:58,694 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 11:10:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 11:10:58,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 11:10:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 11:10:58,694 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 11:11:09,942 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 11:11:09,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 11:11:09 BoogieIcfgContainer [2018-09-19 11:11:09,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 11:11:09,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 11:11:09,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 11:11:09,948 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 11:11:09,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 11:10:55" (1/3) ... [2018-09-19 11:11:09,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf0af08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 11:11:09, skipping insertion in model container [2018-09-19 11:11:09,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 11:10:57" (2/3) ... [2018-09-19 11:11:09,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf0af08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 11:11:09, skipping insertion in model container [2018-09-19 11:11:09,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 11:11:09" (3/3) ... [2018-09-19 11:11:09,956 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label42_true-unreach-call.c [2018-09-19 11:11:09,968 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 11:11:09,988 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 11:11:10,066 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 11:11:10,067 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 11:11:10,068 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 11:11:10,068 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 11:11:10,068 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 11:11:10,068 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 11:11:10,068 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 11:11:10,068 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 11:11:10,069 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 11:11:10,133 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2018-09-19 11:11:10,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-19 11:11:10,144 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 11:11:10,146 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, 1, 1, 1, 1, 1] [2018-09-19 11:11:10,148 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 11:11:10,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1611453546, now seen corresponding path program 1 times [2018-09-19 11:11:10,157 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 11:11:10,159 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-09-19 11:11:10,163 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [986], [988], [2283], [2287], [2293], [2297], [2306], [2307], [2308], [2310] [2018-09-19 11:11:10,240 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 11:11:10,240 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 11:11:11,680 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 11:11:11,682 INFO L272 AbstractInterpreter]: Visited 46 different actions 46 times. Never merged. Never widened. Never found a fixpoint. Largest state had 25 variables. [2018-09-19 11:11:11,708 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 11:11:12,344 INFO L232 lantSequenceWeakener]: Weakened 45 states. On average, predicates are now at 77.6% of their original sizes. [2018-09-19 11:11:12,344 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 11:11:12,682 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 11:11:12,684 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 11:11:12,684 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 11:11:12,684 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 11:11:12,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 11:11:12,698 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 11:11:12,699 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 11:11:12,701 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 6 states. [2018-09-19 11:11:32,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 11:11:32,618 INFO L93 Difference]: Finished difference Result 1642 states and 3016 transitions. [2018-09-19 11:11:32,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 11:11:32,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-09-19 11:11:32,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 11:11:32,648 INFO L225 Difference]: With dead ends: 1642 [2018-09-19 11:11:32,648 INFO L226 Difference]: Without dead ends: 1036 [2018-09-19 11:11:32,658 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 11:11:32,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2018-09-19 11:11:32,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1034. [2018-09-19 11:11:32,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2018-09-19 11:11:32,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1511 transitions. [2018-09-19 11:11:32,775 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1511 transitions. Word has length 47 [2018-09-19 11:11:32,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 11:11:32,775 INFO L480 AbstractCegarLoop]: Abstraction has 1034 states and 1511 transitions. [2018-09-19 11:11:32,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 11:11:32,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1511 transitions. [2018-09-19 11:11:32,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-19 11:11:32,786 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 11:11:32,787 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, 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] [2018-09-19 11:11:32,787 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 11:11:32,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1730484511, now seen corresponding path program 1 times [2018-09-19 11:11:32,791 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 11:11:32,791 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 123 with the following transitions: [2018-09-19 11:11:32,792 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [986], [988], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-09-19 11:11:32,803 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 11:11:32,803 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 11:11:34,686 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 11:11:39,974 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 11:11:39,974 INFO L272 AbstractInterpreter]: Visited 82 different actions 233 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-19 11:11:39,982 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 11:11:41,242 INFO L232 lantSequenceWeakener]: Weakened 120 states. On average, predicates are now at 76.05% of their original sizes. [2018-09-19 11:11:41,242 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 11:11:42,479 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 11:11:42,479 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 11:11:42,479 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 11:11:42,479 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 11:11:42,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 11:11:42,481 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 11:11:42,481 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 11:11:42,481 INFO L87 Difference]: Start difference. First operand 1034 states and 1511 transitions. Second operand 13 states. [2018-09-19 11:12:33,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 11:12:33,323 INFO L93 Difference]: Finished difference Result 2814 states and 4895 transitions. [2018-09-19 11:12:33,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-19 11:12:33,324 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 122 [2018-09-19 11:12:33,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 11:12:33,337 INFO L225 Difference]: With dead ends: 2814 [2018-09-19 11:12:33,337 INFO L226 Difference]: Without dead ends: 2220 [2018-09-19 11:12:33,342 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 135 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2018-09-19 11:12:33,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2018-09-19 11:12:33,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 1497. [2018-09-19 11:12:33,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2018-09-19 11:12:33,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2009 transitions. [2018-09-19 11:12:33,402 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2009 transitions. Word has length 122 [2018-09-19 11:12:33,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 11:12:33,403 INFO L480 AbstractCegarLoop]: Abstraction has 1497 states and 2009 transitions. [2018-09-19 11:12:33,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 11:12:33,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2009 transitions. [2018-09-19 11:12:33,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-09-19 11:12:33,407 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 11:12:33,408 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, 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] [2018-09-19 11:12:33,408 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 11:12:33,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1457133031, now seen corresponding path program 1 times [2018-09-19 11:12:33,408 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 11:12:33,409 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2018-09-19 11:12:33,409 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [986], [988], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-09-19 11:12:33,414 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 11:12:33,414 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 11:12:35,794 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 11:12:41,500 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 11:12:41,500 INFO L272 AbstractInterpreter]: Visited 95 different actions 272 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-19 11:12:41,531 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 11:12:42,811 INFO L232 lantSequenceWeakener]: Weakened 133 states. On average, predicates are now at 75.94% of their original sizes. [2018-09-19 11:12:42,811 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 11:12:43,693 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 11:12:43,694 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 11:12:43,694 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 11:12:43,694 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 11:12:43,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 11:12:43,695 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 11:12:43,695 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 11:12:43,696 INFO L87 Difference]: Start difference. First operand 1497 states and 2009 transitions. Second operand 11 states. [2018-09-19 11:13:09,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 11:13:09,199 INFO L93 Difference]: Finished difference Result 2646 states and 4140 transitions. [2018-09-19 11:13:09,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 11:13:09,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 135 [2018-09-19 11:13:09,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 11:13:09,217 INFO L225 Difference]: With dead ends: 2646 [2018-09-19 11:13:09,217 INFO L226 Difference]: Without dead ends: 2052 [2018-09-19 11:13:09,221 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 143 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-09-19 11:13:09,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2018-09-19 11:13:09,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 1962. [2018-09-19 11:13:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2018-09-19 11:13:09,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2620 transitions. [2018-09-19 11:13:09,290 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2620 transitions. Word has length 135 [2018-09-19 11:13:09,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 11:13:09,291 INFO L480 AbstractCegarLoop]: Abstraction has 1962 states and 2620 transitions. [2018-09-19 11:13:09,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 11:13:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2620 transitions. [2018-09-19 11:13:09,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-19 11:13:09,307 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 11:13:09,307 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, 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, 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-19 11:13:09,308 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 11:13:09,308 INFO L82 PathProgramCache]: Analyzing trace with hash 82806834, now seen corresponding path program 1 times [2018-09-19 11:13:09,308 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 11:13:09,308 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2018-09-19 11:13:09,309 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [986], [988], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-09-19 11:13:09,316 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 11:13:09,316 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 11:13:11,155 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 11:13:25,538 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 11:13:25,539 INFO L272 AbstractInterpreter]: Visited 96 different actions 558 times. Merged at 7 different actions 37 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 2 different actions. Largest state had 26 variables. [2018-09-19 11:13:25,542 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 11:13:26,811 INFO L232 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 75.64% of their original sizes. [2018-09-19 11:13:26,811 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 11:13:27,226 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 11:13:27,226 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 11:13:27,226 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 11:13:27,227 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 11:13:27,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 11:13:27,227 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 11:13:27,228 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 11:13:27,228 INFO L87 Difference]: Start difference. First operand 1962 states and 2620 transitions. Second operand 12 states. [2018-09-19 11:14:15,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 11:14:15,370 INFO L93 Difference]: Finished difference Result 3982 states and 6007 transitions. [2018-09-19 11:14:15,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 11:14:15,379 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 210 [2018-09-19 11:14:15,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 11:14:15,396 INFO L225 Difference]: With dead ends: 3982 [2018-09-19 11:14:15,396 INFO L226 Difference]: Without dead ends: 3388 [2018-09-19 11:14:15,401 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 219 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-09-19 11:14:15,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2018-09-19 11:14:15,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 2433. [2018-09-19 11:14:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2433 states. [2018-09-19 11:14:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 3279 transitions. [2018-09-19 11:14:15,495 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 3279 transitions. Word has length 210 [2018-09-19 11:14:15,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 11:14:15,496 INFO L480 AbstractCegarLoop]: Abstraction has 2433 states and 3279 transitions. [2018-09-19 11:14:15,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 11:14:15,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 3279 transitions. [2018-09-19 11:14:15,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-09-19 11:14:15,500 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 11:14:15,501 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, 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, 1, 1, 1] [2018-09-19 11:14:15,501 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 11:14:15,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1600198304, now seen corresponding path program 1 times [2018-09-19 11:14:15,502 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 11:14:15,502 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-09-19 11:14:15,502 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [986], [988], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1227], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-09-19 11:14:15,507 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 11:14:15,507 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 11:14:17,641 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 11:14:32,501 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 11:14:32,501 INFO L272 AbstractInterpreter]: Visited 96 different actions 461 times. Merged at 7 different actions 25 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-19 11:14:32,511 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 11:14:33,700 INFO L232 lantSequenceWeakener]: Weakened 209 states. On average, predicates are now at 75.64% of their original sizes. [2018-09-19 11:14:33,700 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 11:14:34,037 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 11:14:34,038 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 11:14:34,038 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 11:14:34,038 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 11:14:34,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 11:14:34,039 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 11:14:34,039 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 11:14:34,040 INFO L87 Difference]: Start difference. First operand 2433 states and 3279 transitions. Second operand 11 states. [2018-09-19 11:14:59,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 11:14:59,495 INFO L93 Difference]: Finished difference Result 4146 states and 6156 transitions. [2018-09-19 11:14:59,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 11:14:59,496 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 211 [2018-09-19 11:14:59,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 11:14:59,511 INFO L225 Difference]: With dead ends: 4146 [2018-09-19 11:14:59,512 INFO L226 Difference]: Without dead ends: 3552 [2018-09-19 11:14:59,516 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 219 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-09-19 11:14:59,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3552 states. [2018-09-19 11:14:59,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3552 to 3371. [2018-09-19 11:14:59,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3371 states. [2018-09-19 11:14:59,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3371 states to 3371 states and 4576 transitions. [2018-09-19 11:14:59,612 INFO L78 Accepts]: Start accepts. Automaton has 3371 states and 4576 transitions. Word has length 211 [2018-09-19 11:14:59,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 11:14:59,613 INFO L480 AbstractCegarLoop]: Abstraction has 3371 states and 4576 transitions. [2018-09-19 11:14:59,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 11:14:59,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3371 states and 4576 transitions. [2018-09-19 11:14:59,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-19 11:14:59,617 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 11:14:59,617 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 11:14:59,617 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 11:14:59,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1967519732, now seen corresponding path program 1 times [2018-09-19 11:14:59,618 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 11:14:59,618 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-09-19 11:14:59,618 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [986], [988], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1231], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-09-19 11:14:59,621 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 11:14:59,621 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 11:15:01,864 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-19 11:15:09,443 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-19 11:15:09,444 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-19 11:15:09,445 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 11:15:09,486 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 11:15:09,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 11:15:09 BoogieIcfgContainer [2018-09-19 11:15:09,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 11:15:09,487 INFO L168 Benchmark]: Toolchain (without parser) took 253852.77 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-09-19 11:15:09,489 INFO L168 Benchmark]: CDTParser took 0.55 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-19 11:15:09,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1649.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 179.7 MB). Peak memory consumption was 179.7 MB. Max. memory is 7.1 GB. [2018-09-19 11:15:09,491 INFO L168 Benchmark]: Boogie Procedure Inliner took 304.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 7.1 GB. [2018-09-19 11:15:09,492 INFO L168 Benchmark]: Boogie Preprocessor took 1014.00 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 931.1 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 123.6 MB. Max. memory is 7.1 GB. [2018-09-19 11:15:09,493 INFO L168 Benchmark]: RCFGBuilder took 11336.37 ms. Allocated memory is still 2.5 GB. Free memory was 2.3 GB in the beginning and 1.9 GB in the end (delta: 447.3 MB). Peak memory consumption was 447.3 MB. Max. memory is 7.1 GB. [2018-09-19 11:15:09,494 INFO L168 Benchmark]: TraceAbstraction took 239542.37 ms. Allocated memory was 2.5 GB in the beginning and 4.3 GB in the end (delta: 1.8 GB). Free memory was 1.9 GB in the beginning and 2.9 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-09-19 11:15:09,499 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.55 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 1649.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 179.7 MB). Peak memory consumption was 179.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 304.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 1014.00 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 931.1 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 123.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11336.37 ms. Allocated memory is still 2.5 GB. Free memory was 2.3 GB in the beginning and 1.9 GB in the end (delta: 447.3 MB). Peak memory consumption was 447.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239542.37 ms. Allocated memory was 2.5 GB in the beginning and 4.3 GB in the end (delta: 1.8 GB). Free memory was 1.9 GB in the beginning and 2.9 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 128]: 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: [L8] int inputA = 1; [L9] int inputB = 2; [L10] int inputC = 3; [L11] int inputE = 5; [L12] int inputD = 4; [L13] int inputF = 6; [L16] int a24 = 1; [L17] int a21 = 124; [L18] int a26 = 222; [L19] int a14 = -79; [L20] int a28 = 111; [L2577] int output = -1; [L2580] COND TRUE 1 [L2583] int input; [L2584] input = __VERIFIER_nondet_int() [L2585] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2588] CALL, EXPR calculate_output(input) [L25] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L28] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L31] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L34] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L37] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L40] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L43] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L46] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L49] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L52] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L55] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L58] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L61] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L64] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L67] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L70] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L73] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L76] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L79] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L82] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L85] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L88] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L91] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L94] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L97] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L100] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L103] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L106] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L109] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L112] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L115] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L118] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L121] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L124] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L127] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L130] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L133] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L136] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L139] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L142] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L145] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L148] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L151] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L154] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L157] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L160] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L163] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L166] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L169] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L172] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L175] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L178] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L181] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L184] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L187] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L190] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L193] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L196] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L199] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L202] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L205] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L209] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) [L215] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) [L222] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) [L228] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) [L231] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) [L238] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) [L243] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) [L249] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) [L256] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) [L262] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) [L266] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) [L273] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) [L287] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) [L294] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) [L301] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) [L306] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) [L313] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) [L319] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 ))) [L323] COND TRUE ( 217 < a26 && (( a21 <= 127 && ((a24==1) && ((input == 6) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && -84 < a14 )) [L324] a14 = ((((a14 % 299909)- 300090) + 0) + -1) [L325] a26 = ((((a26 * 9)/ 10) - 554854) * 1) [L326] a28 = ((((a28 * 9)/ 10) * 1) - 589002) [L327] a24 = 2 [L329] RET return 25; [L2588] EXPR calculate_output(input) [L2588] output = calculate_output(input) [L2580] COND TRUE 1 [L2583] int input; [L2584] input = __VERIFIER_nondet_int() [L2585] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2588] CALL, EXPR calculate_output(input) [L25] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L28] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L31] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L34] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L37] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L40] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L43] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L46] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L49] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L52] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L55] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L58] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L61] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L64] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L67] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L70] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L73] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L76] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L79] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L82] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L85] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L88] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L91] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L94] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L97] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L100] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L103] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L106] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L109] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L112] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L115] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L118] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L121] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L124] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L127] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L130] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L133] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L136] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L139] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L142] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L145] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L148] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L151] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L154] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L157] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L160] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L163] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L166] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L169] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L172] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L175] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L178] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L181] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L184] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L187] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L190] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L193] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L196] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L199] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L202] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L205] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L209] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) [L215] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) [L222] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) [L228] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) [L231] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) [L238] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) [L243] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) [L249] COND TRUE (((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 ) [L250] a14 = ((((a14 * 9)/ 10) - -57076) + -651983) [L251] a26 = ((((a26 * -6)/ 10) * 5) - 355073) [L252] a28 = (((a28 / 5) - -352351) - 552393) [L253] a24 = 1 [L255] RET return -1; [L2588] EXPR calculate_output(input) [L2588] output = calculate_output(input) [L2580] COND TRUE 1 [L2583] int input; [L2584] input = __VERIFIER_nondet_int() [L2585] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2588] CALL calculate_output(input) [L25] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L28] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L31] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L34] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L37] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L40] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L43] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L46] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L49] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L52] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L55] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L58] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L61] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L64] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L67] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L70] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L73] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L76] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L79] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L82] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L85] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L88] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L91] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L94] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L97] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L100] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L103] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L106] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L109] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L112] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L115] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L118] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L121] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L124] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L127] COND TRUE (((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 ) [L128] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 604 locations, 1 error locations. UNKNOWN Result, 239.4s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 170.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2766 SDtfs, 12603 SDslu, 3128 SDs, 0 SdLazy, 30237 SolverSat, 2750 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 157.4s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 762 GetRequests, 677 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3371occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 59.9s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.9934784544159543 AbsIntWeakeningRatio, 0.15416666666666667 AbsIntAvgWeakeningVarsNumRemoved, 1049.6819444444445 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 5 MinimizatonAttempts, 1951 StatesRemovedByMinimization, 5 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/Problem17_label42_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_11-15-09-524.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem17_label42_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_11-15-09-524.csv Completed graceful shutdown