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_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem12_label14_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 03:45:50,696 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 03:45:50,698 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 03:45:50,712 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 03:45:50,712 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 03:45:50,713 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 03:45:50,714 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 03:45:50,716 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 03:45:50,718 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 03:45:50,719 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 03:45:50,720 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 03:45:50,720 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 03:45:50,721 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 03:45:50,722 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 03:45:50,724 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 03:45:50,724 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 03:45:50,725 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 03:45:50,727 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 03:45:50,729 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 03:45:50,731 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 03:45:50,732 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 03:45:50,733 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 03:45:50,736 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 03:45:50,736 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 03:45:50,737 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 03:45:50,737 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 03:45:50,738 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 03:45:50,739 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 03:45:50,740 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 03:45:50,741 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 03:45:50,742 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 03:45:50,742 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 03:45:50,743 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 03:45:50,743 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 03:45:50,744 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 03:45:50,745 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 03:45:50,745 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf [2018-09-19 03:45:50,761 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 03:45:50,761 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 03:45:50,762 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 03:45:50,762 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 03:45:50,763 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 03:45:50,763 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 03:45:50,763 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 03:45:50,763 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 03:45:50,763 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 03:45:50,764 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 03:45:50,764 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 03:45:50,764 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 03:45:50,765 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 03:45:50,765 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 03:45:50,765 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 03:45:50,765 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 03:45:50,765 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 03:45:50,766 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 03:45:50,766 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 03:45:50,766 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 03:45:50,766 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 03:45:50,767 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 03:45:50,767 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 03:45:50,767 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 03:45:50,767 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 03:45:50,767 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 03:45:50,768 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 03:45:50,768 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 03:45:50,768 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 03:45:50,768 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 03:45:50,768 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 03:45:50,768 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 03:45:50,769 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 03:45:50,769 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 03:45:50,830 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 03:45:50,853 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 03:45:50,861 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 03:45:50,863 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 03:45:50,864 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 03:45:50,865 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label14_true-unreach-call.c [2018-09-19 03:45:51,241 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36273b193/5b0dc4123a4d4575bf7ae61ed25e03c7/FLAG70eb9295a [2018-09-19 03:45:51,747 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 03:45:51,748 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label14_true-unreach-call.c [2018-09-19 03:45:51,778 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36273b193/5b0dc4123a4d4575bf7ae61ed25e03c7/FLAG70eb9295a [2018-09-19 03:45:51,796 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36273b193/5b0dc4123a4d4575bf7ae61ed25e03c7 [2018-09-19 03:45:51,809 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 03:45:51,812 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 03:45:51,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 03:45:51,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 03:45:51,821 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 03:45:51,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:45:51" (1/1) ... [2018-09-19 03:45:51,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@707d2d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:51, skipping insertion in model container [2018-09-19 03:45:51,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:45:51" (1/1) ... [2018-09-19 03:45:51,841 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 03:45:53,125 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 03:45:53,145 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 03:45:53,738 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 03:45:54,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:54 WrapperNode [2018-09-19 03:45:54,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 03:45:54,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 03:45:54,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 03:45:54,008 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 03:45:54,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:54" (1/1) ... [2018-09-19 03:45:54,109 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:54" (1/1) ... [2018-09-19 03:45:54,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 03:45:54,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 03:45:54,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 03:45:54,240 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 03:45:54,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:54" (1/1) ... [2018-09-19 03:45:54,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:54" (1/1) ... [2018-09-19 03:45:54,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:54" (1/1) ... [2018-09-19 03:45:54,894 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:54" (1/1) ... [2018-09-19 03:45:55,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:54" (1/1) ... [2018-09-19 03:45:55,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:54" (1/1) ... [2018-09-19 03:45:55,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:54" (1/1) ... [2018-09-19 03:45:55,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 03:45:55,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 03:45:55,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 03:45:55,254 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 03:45:55,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:54" (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 03:45:55,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 03:45:55,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 03:45:55,339 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-09-19 03:45:55,339 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-09-19 03:45:55,339 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-09-19 03:45:55,339 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-09-19 03:45:55,339 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-09-19 03:45:55,340 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-09-19 03:45:55,340 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 03:45:55,340 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 03:45:55,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 03:45:55,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 03:45:55,341 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 03:45:55,341 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 03:46:06,616 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 03:46:06,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:46:06 BoogieIcfgContainer [2018-09-19 03:46:06,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 03:46:06,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 03:46:06,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 03:46:06,623 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 03:46:06,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:45:51" (1/3) ... [2018-09-19 03:46:06,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff34ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:46:06, skipping insertion in model container [2018-09-19 03:46:06,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:45:54" (2/3) ... [2018-09-19 03:46:06,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff34ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:46:06, skipping insertion in model container [2018-09-19 03:46:06,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:46:06" (3/3) ... [2018-09-19 03:46:06,627 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label14_true-unreach-call.c [2018-09-19 03:46:06,637 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 03:46:06,648 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 03:46:06,737 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 03:46:06,738 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 03:46:06,739 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 03:46:06,739 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 03:46:06,739 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 03:46:06,739 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 03:46:06,739 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 03:46:06,740 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 03:46:06,740 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 03:46:06,799 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-09-19 03:46:06,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-19 03:46:06,812 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:46:06,814 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:46:06,815 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:46:06,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1198355269, now seen corresponding path program 1 times [2018-09-19 03:46:06,825 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:46:06,826 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-09-19 03:46:06,830 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2179], [2187], [2195], [2203], [2207], [2209], [3244], [3248], [3254], [3258], [3271], [3272], [3273], [3275] [2018-09-19 03:46:06,903 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:46:06,903 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:46:09,245 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:46:09,247 INFO L272 AbstractInterpreter]: Visited 54 different actions 54 times. Never merged. Never widened. Never found a fixpoint. Largest state had 25 variables. [2018-09-19 03:46:09,272 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:46:10,315 INFO L232 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 77.84% of their original sizes. [2018-09-19 03:46:10,316 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:46:10,626 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:46:10,628 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:46:10,629 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 03:46:10,629 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:46:10,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 03:46:10,645 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 03:46:10,646 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 03:46:10,649 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 6 states. [2018-09-19 03:46:32,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:46:32,829 INFO L93 Difference]: Finished difference Result 2448 states and 4699 transitions. [2018-09-19 03:46:32,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 03:46:32,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-09-19 03:46:32,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:46:32,867 INFO L225 Difference]: With dead ends: 2448 [2018-09-19 03:46:32,867 INFO L226 Difference]: Without dead ends: 1606 [2018-09-19 03:46:32,879 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 54 GetRequests, 50 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-09-19 03:46:32,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2018-09-19 03:46:33,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1604. [2018-09-19 03:46:33,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-09-19 03:46:33,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2357 transitions. [2018-09-19 03:46:33,039 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2357 transitions. Word has length 55 [2018-09-19 03:46:33,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:46:33,042 INFO L480 AbstractCegarLoop]: Abstraction has 1604 states and 2357 transitions. [2018-09-19 03:46:33,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 03:46:33,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2357 transitions. [2018-09-19 03:46:33,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-09-19 03:46:33,052 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:46:33,052 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, 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] [2018-09-19 03:46:33,053 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:46:33,053 INFO L82 PathProgramCache]: Analyzing trace with hash -243737608, now seen corresponding path program 1 times [2018-09-19 03:46:33,053 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:46:33,053 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 132 with the following transitions: [2018-09-19 03:46:33,054 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2179], [2187], [2195], [2203], [2207], [2209], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2384], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-09-19 03:46:33,059 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:46:33,060 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:46:38,521 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:46:38,521 INFO L272 AbstractInterpreter]: Visited 83 different actions 159 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-19 03:46:38,561 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:46:39,892 INFO L232 lantSequenceWeakener]: Weakened 129 states. On average, predicates are now at 76.23% of their original sizes. [2018-09-19 03:46:39,892 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:46:41,131 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:46:41,132 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:46:41,132 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 03:46:41,132 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:46:41,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 03:46:41,138 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 03:46:41,139 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-09-19 03:46:41,139 INFO L87 Difference]: Start difference. First operand 1604 states and 2357 transitions. Second operand 14 states. [2018-09-19 03:47:24,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:47:24,802 INFO L93 Difference]: Finished difference Result 5514 states and 10027 transitions. [2018-09-19 03:47:24,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-19 03:47:24,803 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 131 [2018-09-19 03:47:24,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:47:24,829 INFO L225 Difference]: With dead ends: 5514 [2018-09-19 03:47:24,830 INFO L226 Difference]: Without dead ends: 4684 [2018-09-19 03:47:24,838 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 145 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2018-09-19 03:47:24,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4684 states. [2018-09-19 03:47:25,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4684 to 4681. [2018-09-19 03:47:25,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4681 states. [2018-09-19 03:47:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4681 states to 4681 states and 5484 transitions. [2018-09-19 03:47:25,122 INFO L78 Accepts]: Start accepts. Automaton has 4681 states and 5484 transitions. Word has length 131 [2018-09-19 03:47:25,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:47:25,123 INFO L480 AbstractCegarLoop]: Abstraction has 4681 states and 5484 transitions. [2018-09-19 03:47:25,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 03:47:25,123 INFO L276 IsEmpty]: Start isEmpty. Operand 4681 states and 5484 transitions. [2018-09-19 03:47:25,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-09-19 03:47:25,138 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:47:25,142 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, 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] [2018-09-19 03:47:25,142 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:47:25,143 INFO L82 PathProgramCache]: Analyzing trace with hash -178064156, now seen corresponding path program 1 times [2018-09-19 03:47:25,143 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:47:25,143 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-09-19 03:47:25,144 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2179], [2187], [2195], [2203], [2207], [2209], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2664], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-09-19 03:47:25,158 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:47:25,158 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:47:31,001 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:47:43,095 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:47:43,095 INFO L272 AbstractInterpreter]: Visited 153 different actions 446 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 03:47:43,104 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:47:45,026 INFO L232 lantSequenceWeakener]: Weakened 199 states. On average, predicates are now at 75.8% of their original sizes. [2018-09-19 03:47:45,026 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:47:45,974 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:47:45,974 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:47:45,975 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 03:47:45,975 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:47:45,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 03:47:45,976 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 03:47:45,976 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 03:47:45,976 INFO L87 Difference]: Start difference. First operand 4681 states and 5484 transitions. Second operand 12 states. [2018-09-19 03:48:17,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:48:17,867 INFO L93 Difference]: Finished difference Result 6286 states and 8585 transitions. [2018-09-19 03:48:17,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:48:17,869 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 201 [2018-09-19 03:48:17,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:48:17,895 INFO L225 Difference]: With dead ends: 6286 [2018-09-19 03:48:17,896 INFO L226 Difference]: Without dead ends: 5456 [2018-09-19 03:48:17,901 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 211 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2018-09-19 03:48:17,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5456 states. [2018-09-19 03:48:18,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5456 to 5451. [2018-09-19 03:48:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5451 states. [2018-09-19 03:48:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5451 states to 5451 states and 6269 transitions. [2018-09-19 03:48:18,043 INFO L78 Accepts]: Start accepts. Automaton has 5451 states and 6269 transitions. Word has length 201 [2018-09-19 03:48:18,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:48:18,044 INFO L480 AbstractCegarLoop]: Abstraction has 5451 states and 6269 transitions. [2018-09-19 03:48:18,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 03:48:18,044 INFO L276 IsEmpty]: Start isEmpty. Operand 5451 states and 6269 transitions. [2018-09-19 03:48:18,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-09-19 03:48:18,047 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:48:18,048 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, 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, 1, 1] [2018-09-19 03:48:18,048 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:48:18,048 INFO L82 PathProgramCache]: Analyzing trace with hash -630663892, now seen corresponding path program 1 times [2018-09-19 03:48:18,049 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:48:18,049 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 206 with the following transitions: [2018-09-19 03:48:18,049 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2179], [2187], [2195], [2203], [2207], [2209], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2665], [2669], [2673], [2677], [2680], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-09-19 03:48:18,055 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:48:18,055 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:48:24,216 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:48:36,443 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:48:36,444 INFO L272 AbstractInterpreter]: Visited 157 different actions 458 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 03:48:36,448 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:48:38,036 INFO L232 lantSequenceWeakener]: Weakened 203 states. On average, predicates are now at 75.78% of their original sizes. [2018-09-19 03:48:38,036 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:48:38,715 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:48:38,716 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:48:38,716 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 03:48:38,716 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:48:38,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 03:48:38,717 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 03:48:38,717 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-19 03:48:38,717 INFO L87 Difference]: Start difference. First operand 5451 states and 6269 transitions. Second operand 14 states. [2018-09-19 03:49:03,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:49:03,714 INFO L93 Difference]: Finished difference Result 7157 states and 9570 transitions. [2018-09-19 03:49:03,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-19 03:49:03,715 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 205 [2018-09-19 03:49:03,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:49:03,742 INFO L225 Difference]: With dead ends: 7157 [2018-09-19 03:49:03,742 INFO L226 Difference]: Without dead ends: 6327 [2018-09-19 03:49:03,748 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 217 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2018-09-19 03:49:03,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6327 states. [2018-09-19 03:49:03,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6327 to 6225. [2018-09-19 03:49:03,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2018-09-19 03:49:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 7083 transitions. [2018-09-19 03:49:03,913 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 7083 transitions. Word has length 205 [2018-09-19 03:49:03,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:49:03,914 INFO L480 AbstractCegarLoop]: Abstraction has 6225 states and 7083 transitions. [2018-09-19 03:49:03,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 03:49:03,914 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 7083 transitions. [2018-09-19 03:49:03,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-09-19 03:49:03,921 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:49:03,921 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:49:03,921 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:49:03,922 INFO L82 PathProgramCache]: Analyzing trace with hash -206569759, now seen corresponding path program 1 times [2018-09-19 03:49:03,922 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:49:03,922 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 278 with the following transitions: [2018-09-19 03:49:03,923 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2179], [2187], [2195], [2203], [2207], [2209], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2384], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2664], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-09-19 03:49:03,928 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:49:03,928 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:49:10,764 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:49:25,996 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 03:49:25,996 INFO L272 AbstractInterpreter]: Visited 155 different actions 608 times. Merged at 7 different actions 23 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 26 variables. [2018-09-19 03:49:26,003 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 03:49:26,040 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 03:49:26,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 03:49:26 BoogieIcfgContainer [2018-09-19 03:49:26,040 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 03:49:26,041 INFO L168 Benchmark]: Toolchain (without parser) took 214231.83 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 3.9 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-09-19 03:49:26,043 INFO L168 Benchmark]: CDTParser took 0.22 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 03:49:26,044 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2193.20 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: 256.3 MB). Peak memory consumption was 256.3 MB. Max. memory is 7.1 GB. [2018-09-19 03:49:26,044 INFO L168 Benchmark]: Boogie Procedure Inliner took 232.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-19 03:49:26,045 INFO L168 Benchmark]: Boogie Preprocessor took 1013.81 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 929.0 MB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 127.8 MB. Max. memory is 7.1 GB. [2018-09-19 03:49:26,046 INFO L168 Benchmark]: RCFGBuilder took 11363.58 ms. Allocated memory is still 2.5 GB. Free memory was 2.3 GB in the beginning and 1.7 GB in the end (delta: 644.0 MB). Peak memory consumption was 644.0 MB. Max. memory is 7.1 GB. [2018-09-19 03:49:26,047 INFO L168 Benchmark]: TraceAbstraction took 199421.78 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.7 GB in the beginning and 3.9 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-09-19 03:49:26,052 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.22 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 2193.20 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: 256.3 MB). Peak memory consumption was 256.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 232.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 1013.81 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 929.0 MB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 127.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11363.58 ms. Allocated memory is still 2.5 GB. Free memory was 2.3 GB in the beginning and 1.7 GB in the end (delta: 644.0 MB). Peak memory consumption was 644.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 199421.78 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.7 GB in the beginning and 3.9 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 156]: 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: [L10] int inputC = 3; [L11] int inputF = 6; [L12] int inputA = 1; [L13] int inputB = 2; [L14] int inputD = 4; [L15] int inputE = 5; [L18] int a17 = -124; [L19] int a5 = 4; [L20] int a24 = 15; [L21] int a2 = 170; [L22] int a7 = 13; [L4815] int output = -1; [L4818] COND TRUE 1 [L4821] int input; [L4822] input = __VERIFIER_nondet_int() [L4823] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L4826] CALL, EXPR calculate_output(input) [L29] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==3))) [L32] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==4))) [L35] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==4))) [L38] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==4))) [L41] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==4))) [L44] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==4))) [L47] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==3))) [L50] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==4))) [L53] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==3))) [L56] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==3))) [L59] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==15)) && (a5==3))) [L62] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==15)) && (a5==3))) [L65] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==4))) [L68] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==3))) [L71] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==15)) && (a5==3))) [L74] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==4))) [L77] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==3))) [L80] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==3))) [L83] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==4))) [L86] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==15)) && (a5==3))) [L89] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==4))) [L92] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==3))) [L95] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==3))) [L98] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==3))) [L101] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==4))) [L104] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==15)) && (a5==3))) [L107] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==4))) [L110] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==4))) [L113] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==4))) [L116] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==15)) && (a5==3))) [L119] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==3))) [L122] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==4))) [L125] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==4))) [L128] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==3))) [L131] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==3))) [L134] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==4))) [L137] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==4))) [L140] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==15)) && (a5==3))) [L143] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==15)) && (a5==4))) [L146] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==15)) && (a5==3))) [L149] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==15)) && (a5==3))) [L152] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==3))) [L155] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==3))) [L158] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==15)) && (a5==3))) [L161] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==4))) [L164] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==4))) [L167] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==4))) [L170] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==3))) [L173] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==3))) [L176] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==15)) && (a5==3))) [L179] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==4))) [L182] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==4))) [L185] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==3))) [L188] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==3))) [L191] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==3))) [L194] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==4))) [L197] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==3))) [L200] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==15)) && (a5==3))) [L203] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==3))) [L206] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==3))) [L209] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==3))) [L213] COND FALSE !(((( ((189 < a2) && (281 >= a2)) && ((input == 4) && (((a7==12) && 255 < a17 ) || (((a7==13) && ((111 < a17) && (255 >= a17)) ) || ( ((111 < a17) && (255 >= a17)) && (a7==14)))))) && (a5==4)) && (a24==14))) [L218] COND FALSE !(((((a24==13) && (((input == 2) && ((a7==13) || (a7==14))) && (a5==3))) && a17 <= -108 ) && ((189 < a2) && (281 >= a2)) )) [L223] COND FALSE !((((((((a7==12) && ((111 < a17) && (255 >= a17)) ) || (( ((-108 < a17) && (111 >= a17)) && (a7==13)) || ( ((-108 < a17) && (111 >= a17)) && (a7==14)))) && (input == 1)) && (a24==14)) && ((189 < a2) && (281 >= a2)) ) && (a5==5))) [L230] COND FALSE !(((( ((189 < a2) && (281 >= a2)) && (((( a17 <= -108 && (a7==13)) || ( a17 <= -108 && (a7==14))) || ( ((-108 < a17) && (111 >= a17)) && (a7==12))) && (input == 4))) && (a5==3)) && (a24==14))) [L237] COND FALSE !(((a5==6) && (((a24==13) && ((input == 6) && ((((a7==13) && ((111 < a17) && (255 >= a17)) ) || ((a7==14) && ((111 < a17) && (255 >= a17)) )) || ( 255 < a17 && (a7==12))))) && a2 <= 189 ))) [L245] COND FALSE !((((a24==13) && ( ((189 < a2) && (281 >= a2)) && (((((a7==13) && ((111 < a17) && (255 >= a17)) ) || ( ((111 < a17) && (255 >= a17)) && (a7==14))) || ( 255 < a17 && (a7==12))) && (input == 3)))) && (a5==6))) [L250] COND TRUE ((a5==4) && ( a2 <= 189 && ((((input == 1) && ((a7==13) || (a7==14))) && a17 <= -108 ) && (a24==15)))) [L252] a7 = 12 [L253] a24 = 13 [L254] a5 = 3 [L256] RET return -1; [L4826] EXPR calculate_output(input) [L4826] output = calculate_output(input) [L4818] COND TRUE 1 [L4821] int input; [L4822] input = __VERIFIER_nondet_int() [L4823] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L4826] CALL, EXPR calculate_output(input) [L29] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==3))) [L32] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==4))) [L35] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==4))) [L38] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==4))) [L41] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==4))) [L44] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==4))) [L47] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==3))) [L50] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==4))) [L53] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==3))) [L56] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==3))) [L59] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==15)) && (a5==3))) [L62] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==15)) && (a5==3))) [L65] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==4))) [L68] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==3))) [L71] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==15)) && (a5==3))) [L74] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==4))) [L77] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==3))) [L80] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==3))) [L83] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==4))) [L86] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==15)) && (a5==3))) [L89] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==4))) [L92] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==3))) [L95] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==3))) [L98] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==3))) [L101] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==4))) [L104] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==15)) && (a5==3))) [L107] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==4))) [L110] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==4))) [L113] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==4))) [L116] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==15)) && (a5==3))) [L119] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==3))) [L122] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==4))) [L125] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==4))) [L128] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==3))) [L131] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==3))) [L134] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==4))) [L137] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==4))) [L140] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==15)) && (a5==3))) [L143] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==15)) && (a5==4))) [L146] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==15)) && (a5==3))) [L149] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==15)) && (a5==3))) [L152] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==3))) [L155] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==3))) [L158] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==15)) && (a5==3))) [L161] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==4))) [L164] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==4))) [L167] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==4))) [L170] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==3))) [L173] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==3))) [L176] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==15)) && (a5==3))) [L179] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==4))) [L182] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==4))) [L185] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==3))) [L188] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==3))) [L191] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==3))) [L194] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==4))) [L197] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==3))) [L200] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==15)) && (a5==3))) [L203] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==3))) [L206] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==3))) [L209] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==3))) [L213] COND FALSE !(((( ((189 < a2) && (281 >= a2)) && ((input == 4) && (((a7==12) && 255 < a17 ) || (((a7==13) && ((111 < a17) && (255 >= a17)) ) || ( ((111 < a17) && (255 >= a17)) && (a7==14)))))) && (a5==4)) && (a24==14))) [L218] COND FALSE !(((((a24==13) && (((input == 2) && ((a7==13) || (a7==14))) && (a5==3))) && a17 <= -108 ) && ((189 < a2) && (281 >= a2)) )) [L223] COND FALSE !((((((((a7==12) && ((111 < a17) && (255 >= a17)) ) || (( ((-108 < a17) && (111 >= a17)) && (a7==13)) || ( ((-108 < a17) && (111 >= a17)) && (a7==14)))) && (input == 1)) && (a24==14)) && ((189 < a2) && (281 >= a2)) ) && (a5==5))) [L230] COND FALSE !(((( ((189 < a2) && (281 >= a2)) && (((( a17 <= -108 && (a7==13)) || ( a17 <= -108 && (a7==14))) || ( ((-108 < a17) && (111 >= a17)) && (a7==12))) && (input == 4))) && (a5==3)) && (a24==14))) [L237] COND FALSE !(((a5==6) && (((a24==13) && ((input == 6) && ((((a7==13) && ((111 < a17) && (255 >= a17)) ) || ((a7==14) && ((111 < a17) && (255 >= a17)) )) || ( 255 < a17 && (a7==12))))) && a2 <= 189 ))) [L245] COND FALSE !((((a24==13) && ( ((189 < a2) && (281 >= a2)) && (((((a7==13) && ((111 < a17) && (255 >= a17)) ) || ( ((111 < a17) && (255 >= a17)) && (a7==14))) || ( 255 < a17 && (a7==12))) && (input == 3)))) && (a5==6))) [L250] COND FALSE !(((a5==4) && ( a2 <= 189 && ((((input == 1) && ((a7==13) || (a7==14))) && a17 <= -108 ) && (a24==15))))) [L257] COND FALSE !(((a24==15) && ((( ((189 < a2) && (281 >= a2)) && ((input == 1) && (a5==4))) && (a7==13)) && 255 < a17 ))) [L264] COND FALSE !(((a5==4) && ( ((189 < a2) && (281 >= a2)) && ((a24==14) && ((( ((-108 < a17) && (111 >= a17)) && (a7==14)) || ((a7==12) && ((111 < a17) && (255 >= a17)) )) && (input == 4)))))) [L272] COND FALSE !(((((a5==5) && ( a2 <= 189 && ((input == 1) && (a24==15)))) && 255 < a17 ) && (a7==14))) [L278] COND FALSE !((( a17 <= -108 && ( ((189 < a2) && (281 >= a2)) && ((((a7==14) || ((a7==12) || (a7==13))) && (input == 1)) && (a24==15)))) && (a5==5))) [L284] COND FALSE !((( a17 <= -108 && (( ((189 < a2) && (281 >= a2)) && (((a7==12) || (a7==13)) && (input == 5))) && (a24==13))) && (a5==6))) [L291] COND FALSE !((((a24==13) && ( a17 <= -108 && (((a5==4) && (input == 2)) && ((189 < a2) && (281 >= a2)) ))) && (a7==12))) [L298] COND FALSE !((((a5==3) && ( ((-108 < a17) && (111 >= a17)) && ((a24==13) && (((a7==12) || (a7==13)) && (input == 4))))) && ((189 < a2) && (281 >= a2)) )) [L303] COND FALSE !(( ((111 < a17) && (255 >= a17)) && ((a5==4) && ( a2 <= 189 && ((a24==15) && (((a7==13) || (a7==14)) && (input == 5))))))) [L309] COND FALSE !(( a2 <= 189 && ((((( ((-108 < a17) && (111 >= a17)) && (a7==14)) || ( ((111 < a17) && (255 >= a17)) && (a7==12))) && (input == 6)) && (a5==7)) && (a24==13)))) [L316] COND FALSE !(((((((a24==13) && ( a17 <= -108 && (a7==13))) && (a5==5)) || (((a5==4) && ((a24==15) && ((a7==14) && 255 < a17 ))) || ((a5==5) && ((a24==13) && ((a7==12) && a17 <= -108 ))))) && (input == 1)) && ((189 < a2) && (281 >= a2)) )) [L323] COND FALSE !(((((a24==13) && ((((a7==13) || (a7==14)) && (input == 5)) && ((189 < a2) && (281 >= a2)) )) && (a5==3)) && a17 <= -108 )) [L330] COND FALSE !((((a5==4) && ((((input == 5) && ((a7==12) || (a7==13))) && (a24==14)) && ((189 < a2) && (281 >= a2)) )) && a17 <= -108 )) [L337] COND FALSE !(((a24==14) && ((a5==3) && (((( ((-108 < a17) && (111 >= a17)) && (a7==12)) || (( a17 <= -108 && (a7==13)) || ((a7==14) && a17 <= -108 ))) && (input == 2)) && ((189 < a2) && (281 >= a2)) )))) [L345] COND FALSE !(((((a5==4) && (((input == 1) && (a24==15)) && ((-108 < a17) && (111 >= a17)) )) && a2 <= 189 ) && (a7==12))) [L351] COND FALSE !(( a2 <= 189 && (((a5==4) && (((input == 2) && (a24==15)) && (a7==12))) && ((-108 < a17) && (111 >= a17)) ))) [L358] COND FALSE !(((a24==13) && ( ((-108 < a17) && (111 >= a17)) && ((a5==5) && (((input == 2) && a2 <= 189 ) && (a7==14)))))) [L365] COND FALSE !(( a2 <= 189 && ((((a5==5) && ((input == 3) && (a24==13))) && (a7==14)) && ((111 < a17) && (255 >= a17)) ))) [L371] COND FALSE !(((((((a5==5) && (input == 1)) && ((189 < a2) && (281 >= a2)) ) && (a24==13)) && (a7==13)) && ((-108 < a17) && (111 >= a17)) )) [L378] COND FALSE !((( ((189 < a2) && (281 >= a2)) && (((input == 6) && ((( ((-108 < a17) && (111 >= a17)) && (a7==14)) || ((a7==12) && ((111 < a17) && (255 >= a17)) )) || ((a7==13) && ((111 < a17) && (255 >= a17)) ))) && (a24==15))) && (a5==3))) [L384] COND FALSE !((((a5==7) && ((( ((-108 < a17) && (111 >= a17)) && (input == 1)) && (a7==13)) && a2 <= 189 )) && (a24==14))) [L391] COND FALSE !(( ((189 < a2) && (281 >= a2)) && ((a24==15) && ((a5==5) && ( ((111 < a17) && (255 >= a17)) && (((a7==14) || ((a7==12) || (a7==13))) && (input == 6))))))) [L397] COND FALSE !((( a2 <= 189 && (( 255 < a17 && ((input == 3) && ((a7==13) || (a7==14)))) && (a5==7))) && (a24==15))) [L404] COND FALSE !((( ((189 < a2) && (281 >= a2)) && ((a24==13) && ( ((-108 < a17) && (111 >= a17)) && ((input == 4) && ((a7==12) || (a7==13)))))) && (a5==6))) [L409] COND FALSE !(( a17 <= -108 && (((((input == 5) && ((a7==12) || (a7==13))) && (a5==5)) && ((189 < a2) && (281 >= a2)) ) && (a24==14)))) [L417] COND FALSE !(( a2 <= 189 && ((a5==5) && ((input == 6) && (((a24==14) && ((a7==13) && a17 <= -108 )) || (((a24==13) && ( 255 < a17 && (a7==14))) || ((a24==14) && ((a7==12) && a17 <= -108 )))))))) [L424] COND FALSE !((((a5==6) && ((a24==13) && (((((a7==13) && ((111 < a17) && (255 >= a17)) ) || ((a7==14) && ((111 < a17) && (255 >= a17)) )) || ((a7==12) && 255 < a17 )) && (input == 1)))) && a2 <= 189 )) [L430] COND FALSE !((((a5==7) && ((((((a7==14) && a17 <= -108 ) || ((a7==12) && ((-108 < a17) && (111 >= a17)) )) || ( ((-108 < a17) && (111 >= a17)) && (a7==13))) && (input == 4)) && a2 <= 189 )) && (a24==13))) [L438] COND FALSE !(( a2 <= 189 && ((a24==15) && ((((input == 6) && ((a7==13) || (a7==14))) && (a5==4)) && ((-108 < a17) && (111 >= a17)) )))) [L445] COND FALSE !((( ((189 < a2) && (281 >= a2)) && ((((( a17 <= -108 && (a7==13)) || ( a17 <= -108 && (a7==14))) || ( ((-108 < a17) && (111 >= a17)) && (a7==12))) && (input == 3)) && (a5==3))) && (a24==14))) [L452] COND FALSE !((((a24==13) && (((( ((111 < a17) && (255 >= a17)) && (a7==14)) || ( 255 < a17 && (a7==12))) && (input == 2)) && (a5==4))) && ((189 < a2) && (281 >= a2)) )) [L459] COND FALSE !(((( ((111 < a17) && (255 >= a17)) && (((a5==5) && (input == 4)) && a2 <= 189 )) && (a7==14)) && (a24==15))) [L466] COND FALSE !(((((((a7==12) && (input == 6)) && ((189 < a2) && (281 >= a2)) ) && (a5==4)) && (a24==13)) && a17 <= -108 )) [L469] COND FALSE !(((a24==15) && ((a5==6) && ((((a7==12) && (input == 6)) && a17 <= -108 ) && a2 <= 189 )))) [L475] COND FALSE !((( ((111 < a17) && (255 >= a17)) && ((a24==15) && ((a5==6) && ((a7==12) && (input == 6))))) && a2 <= 189 )) [L481] COND FALSE !((((((a24==14) && ((input == 4) && ((a7==12) || (a7==13)))) && a17 <= -108 ) && ((189 < a2) && (281 >= a2)) ) && (a5==5))) [L488] COND FALSE !(((a24==13) && (( ((111 < a17) && (255 >= a17)) && (((input == 6) && ((a7==12) || (a7==13))) && (a5==4))) && ((189 < a2) && (281 >= a2)) ))) [L495] COND FALSE !((((a24==15) && ( a2 <= 189 && ((((a7==12) || (a7==13)) && (input == 6)) && (a5==5)))) && 255 < a17 )) [L502] COND FALSE !((((a7==12) && ((a24==15) && ((a5==6) && ((input == 2) && a2 <= 189 )))) && a17 <= -108 )) [L510] COND FALSE !(((a5==6) && ((((a7==12) && ((input == 3) && (a24==13))) && a2 <= 189 ) && a17 <= -108 ))) [L517] COND FALSE !(( a2 <= 189 && ( ((111 < a17) && (255 >= a17)) && ((((a24==15) && (input == 6)) && (a5==4)) && (a7==12))))) [L524] COND FALSE !((((a5==6) && (((input == 2) && (( 255 < a17 && (a7==12)) || (( ((111 < a17) && (255 >= a17)) && (a7==13)) || ((a7==14) && ((111 < a17) && (255 >= a17)) )))) && (a24==13))) && ((189 < a2) && (281 >= a2)) )) [L531] COND FALSE !((((a24==15) && ((a5==4) && ((((a7==12) || (a7==13)) && (input == 6)) && a2 <= 189 ))) && 255 < a17 )) [L537] COND FALSE !((((( ((189 < a2) && (281 >= a2)) && ((input == 6) && (a5==4))) && (a24==15)) && ((-108 < a17) && (111 >= a17)) ) && (a7==13))) [L543] COND FALSE !(( ((-108 < a17) && (111 >= a17)) && (((a24==13) && ((a5==4) && (((a7==13) || (a7==14)) && (input == 5)))) && ((189 < a2) && (281 >= a2)) ))) [L550] COND FALSE !(( a17 <= -108 && ((a24==14) && (( a2 <= 189 && ((input == 3) && ((a7==13) || (a7==14)))) && (a5==6))))) [L557] COND FALSE !(( a2 <= 189 && (((a5==4) && ( 255 < a17 && (((a7==12) || (a7==13)) && (input == 1)))) && (a24==15)))) [L564] COND FALSE !(((a5==7) && (((a24==14) && ((input == 2) && (( ((-108 < a17) && (111 >= a17)) && (a7==12)) || (( a17 <= -108 && (a7==13)) || ( a17 <= -108 && (a7==14)))))) && a2 <= 189 ))) [L571] COND FALSE !(((a24==14) && (((a7==13) && ( ((189 < a2) && (281 >= a2)) && ((input == 2) && ((-108 < a17) && (111 >= a17)) ))) && (a5==4)))) [L577] COND FALSE !(((((a5==5) && (((((a7==14) && a17 <= -108 ) || ((a7==12) && ((-108 < a17) && (111 >= a17)) )) || ((a7==13) && ((-108 < a17) && (111 >= a17)) )) && (input == 6))) && (a24==13)) && a2 <= 189 )) [L584] COND FALSE !(( ((-108 < a17) && (111 >= a17)) && ((a7==14) && ((a5==5) && (((a24==13) && (input == 6)) && a2 <= 189 ))))) [L591] COND FALSE !((( ((-108 < a17) && (111 >= a17)) && ((((input == 3) && ((a7==13) || (a7==14))) && (a5==6)) && (a24==15))) && a2 <= 189 )) [L598] COND FALSE !(( ((189 < a2) && (281 >= a2)) && (((a24==14) && ((a7==13) && ((a5==3) && (input == 5)))) && ((111 < a17) && (255 >= a17)) ))) [L605] COND FALSE !(( a2 <= 189 && ((a24==14) && ( ((-108 < a17) && (111 >= a17)) && (((input == 2) && ((a7==14) || ((a7==12) || (a7==13)))) && (a5==6)))))) [L611] COND FALSE !(((a5==5) && (((((((a7==12) || (a7==13)) || (a7==14)) && (input == 2)) && a17 <= -108 ) && ((189 < a2) && (281 >= a2)) ) && (a24==15)))) [L618] COND FALSE !(( a2 <= 189 && (( ((-108 < a17) && (111 >= a17)) && ((a24==14) && ((input == 3) && ((a7==14) || ((a7==12) || (a7==13)))))) && (a5==5)))) [L625] COND FALSE !((((((input == 5) && ((( ((111 < a17) && (255 >= a17)) && (a7==13)) || ( ((111 < a17) && (255 >= a17)) && (a7==14))) || ( 255 < a17 && (a7==12)))) && (a24==14)) && (a5==5)) && ((189 < a2) && (281 >= a2)) )) [L633] COND FALSE !(((a24==13) && ((((((a7==14) && ((111 < a17) && (255 >= a17)) ) || ((a7==12) && 255 < a17 )) && (input == 5)) && (a5==4)) && ((189 < a2) && (281 >= a2)) ))) [L640] COND FALSE !((((((a24==14) && (((a7==13) || (a7==14)) && (input == 4))) && ((189 < a2) && (281 >= a2)) ) && (a5==4)) && 255 < a17 )) [L648] COND FALSE !(((a5==6) && (((a24==13) && ((input == 2) && (( ((111 < a17) && (255 >= a17)) && (a7==12)) || (( ((-108 < a17) && (111 >= a17)) && (a7==13)) || ( ((-108 < a17) && (111 >= a17)) && (a7==14)))))) && a2 <= 189 ))) [L654] COND FALSE !((((a5==5) && ( ((-108 < a17) && (111 >= a17)) && (((a7==14) && (input == 5)) && (a24==13)))) && ((189 < a2) && (281 >= a2)) )) [L662] COND FALSE !(((a5==4) && ((((((a7==12) && 255 < a17 ) || (( ((111 < a17) && (255 >= a17)) && (a7==13)) || ((a7==14) && ((111 < a17) && (255 >= a17)) ))) && (input == 3)) && (a24==14)) && ((189 < a2) && (281 >= a2)) ))) [L667] COND FALSE !(((a7==14) && ((a5==5) && ((( ((-108 < a17) && (111 >= a17)) && (input == 2)) && (a24==13)) && ((189 < a2) && (281 >= a2)) )))) [L674] COND FALSE !((( ((189 < a2) && (281 >= a2)) && ((((input == 1) && (a5==6)) && (a24==13)) && (a7==13))) && 255 < a17 )) [L681] COND FALSE !(((a5==6) && ( ((-108 < a17) && (111 >= a17)) && ( ((189 < a2) && (281 >= a2)) && ((((a7==12) || (a7==13)) && (input == 2)) && (a24==13)))))) [L688] COND FALSE !(((((a5==4) && ((((a7==13) || (a7==14)) && (input == 5)) && a2 <= 189 )) && ((-108 < a17) && (111 >= a17)) ) && (a24==15))) [L695] COND FALSE !(( ((-108 < a17) && (111 >= a17)) && (((((a24==13) && (input == 4)) && (a5==5)) && (a7==14)) && ((189 < a2) && (281 >= a2)) ))) [L703] COND FALSE !((( a2 <= 189 && ((input == 4) && (((a24==13) && ( 255 < a17 && (a7==14))) || ((a24==14) && ( a17 <= -108 && (a7==12)))))) && (a5==7))) [L710] COND FALSE !(((a5==5) && ((a24==13) && ( a2 <= 189 && ((a7==14) && ( ((-108 < a17) && (111 >= a17)) && (input == 5))))))) [L716] COND FALSE !(((((a24==14) && ((input == 2) && ((( ((111 < a17) && (255 >= a17)) && (a7==13)) || ((a7==14) && ((111 < a17) && (255 >= a17)) )) || ((a7==12) && 255 < a17 )))) && (a5==4)) && ((189 < a2) && (281 >= a2)) )) [L724] COND TRUE (( a17 <= -108 && ((a5==4) && ( a2 <= 189 && ((input == 6) && ((a7==13) || (a7==14)))))) && (a24==15)) [L725] a17 = ((((((a17 % 109)- -74) * 5) * 5) % 109)- -2) [L726] a7 = 14 [L728] RET return 21; [L4826] EXPR calculate_output(input) [L4826] output = calculate_output(input) [L4818] COND TRUE 1 [L4821] int input; [L4822] input = __VERIFIER_nondet_int() [L4823] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L4826] CALL calculate_output(input) [L29] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==3))) [L32] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==4))) [L35] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==4))) [L38] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==4))) [L41] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==4))) [L44] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==4))) [L47] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==3))) [L50] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==4))) [L53] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==3))) [L56] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==3))) [L59] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==15)) && (a5==3))) [L62] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==15)) && (a5==3))) [L65] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==4))) [L68] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==3))) [L71] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==15)) && (a5==3))) [L74] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==4))) [L77] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==3))) [L80] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==3))) [L83] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==4))) [L86] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==15)) && (a5==3))) [L89] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==4))) [L92] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==3))) [L95] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==3))) [L98] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==3))) [L101] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==4))) [L104] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==15)) && (a5==3))) [L107] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==4))) [L110] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==4))) [L113] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==4))) [L116] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==15)) && (a5==3))) [L119] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==3))) [L122] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==4))) [L125] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==4))) [L128] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==3))) [L131] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==3))) [L134] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==4))) [L137] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==4))) [L140] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==15)) && (a5==3))) [L143] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==15)) && (a5==4))) [L146] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==15)) && (a5==3))) [L149] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==15)) && (a5==3))) [L152] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==3))) [L155] COND TRUE (((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==3)) [L156] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 840 locations, 1 error locations. UNKNOWN Result, 199.3s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 122.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3356 SDtfs, 14281 SDslu, 1347 SDs, 0 SdLazy, 33331 SolverSat, 4513 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 110.6s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 627 GetRequests, 550 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6225occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 66.3s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.9943299755799754 AbsIntWeakeningRatio, 0.1326530612244898 AbsIntAvgWeakeningVarsNumRemoved, 1068.4897959183672 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 4 MinimizatonAttempts, 112 StatesRemovedByMinimization, 4 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/Problem12_label14_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_03-49-26-068.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem12_label14_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_03-49-26-068.csv Received shutdown request...