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_label58_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 03:53:12,013 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 03:53:12,016 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 03:53:12,031 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 03:53:12,031 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 03:53:12,032 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 03:53:12,035 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 03:53:12,037 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 03:53:12,040 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 03:53:12,041 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 03:53:12,042 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 03:53:12,042 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 03:53:12,050 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 03:53:12,051 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 03:53:12,054 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 03:53:12,055 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 03:53:12,056 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 03:53:12,057 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 03:53:12,059 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 03:53:12,061 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 03:53:12,062 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 03:53:12,063 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 03:53:12,065 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 03:53:12,065 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 03:53:12,065 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 03:53:12,066 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 03:53:12,067 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 03:53:12,068 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 03:53:12,069 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 03:53:12,070 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 03:53:12,070 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 03:53:12,070 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 03:53:12,071 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 03:53:12,071 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 03:53:12,072 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 03:53:12,072 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 03:53:12,073 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:53:12,091 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 03:53:12,091 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 03:53:12,092 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 03:53:12,092 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 03:53:12,093 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 03:53:12,093 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 03:53:12,093 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 03:53:12,093 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 03:53:12,093 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 03:53:12,094 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 03:53:12,094 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 03:53:12,094 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 03:53:12,095 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 03:53:12,095 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 03:53:12,095 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 03:53:12,095 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 03:53:12,095 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 03:53:12,096 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 03:53:12,096 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 03:53:12,096 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 03:53:12,096 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 03:53:12,096 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 03:53:12,097 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 03:53:12,097 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 03:53:12,097 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 03:53:12,097 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 03:53:12,097 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 03:53:12,098 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 03:53:12,098 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 03:53:12,098 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 03:53:12,098 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 03:53:12,098 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 03:53:12,099 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 03:53:12,099 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 03:53:12,149 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 03:53:12,163 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 03:53:12,167 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 03:53:12,169 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 03:53:12,169 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 03:53:12,170 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label58_true-unreach-call.c [2018-09-19 03:53:12,515 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cd3d297d/04f088019a384908962a0e9ca8e7de82/FLAGb0f09134d [2018-09-19 03:53:12,958 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 03:53:12,959 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label58_true-unreach-call.c [2018-09-19 03:53:12,996 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cd3d297d/04f088019a384908962a0e9ca8e7de82/FLAGb0f09134d [2018-09-19 03:53:13,013 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cd3d297d/04f088019a384908962a0e9ca8e7de82 [2018-09-19 03:53:13,026 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 03:53:13,029 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 03:53:13,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 03:53:13,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 03:53:13,038 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 03:53:13,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:53:13" (1/1) ... [2018-09-19 03:53:13,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62961037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:53:13, skipping insertion in model container [2018-09-19 03:53:13,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:53:13" (1/1) ... [2018-09-19 03:53:13,057 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 03:53:14,509 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 03:53:14,531 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 03:53:15,286 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 03:53:15,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:53:15 WrapperNode [2018-09-19 03:53:15,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 03:53:15,589 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 03:53:15,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 03:53:15,589 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 03:53:15,600 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:53:15" (1/1) ... [2018-09-19 03:53:15,705 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:53:15" (1/1) ... [2018-09-19 03:53:16,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 03:53:16,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 03:53:16,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 03:53:16,394 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 03:53:16,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:53:15" (1/1) ... [2018-09-19 03:53:16,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:53:15" (1/1) ... [2018-09-19 03:53:16,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:53:15" (1/1) ... [2018-09-19 03:53:16,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:53:15" (1/1) ... [2018-09-19 03:53:16,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:53:15" (1/1) ... [2018-09-19 03:53:16,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:53:15" (1/1) ... [2018-09-19 03:53:16,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:53:15" (1/1) ... [2018-09-19 03:53:16,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 03:53:16,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 03:53:16,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 03:53:16,848 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 03:53:16,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:53:15" (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:53:16,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 03:53:16,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 03:53:16,931 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-09-19 03:53:16,931 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-09-19 03:53:16,931 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-09-19 03:53:16,932 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-09-19 03:53:16,932 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-09-19 03:53:16,932 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-09-19 03:53:16,932 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 03:53:16,932 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 03:53:16,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 03:53:16,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 03:53:16,933 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 03:53:16,933 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 03:53:27,770 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 03:53:27,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:53:27 BoogieIcfgContainer [2018-09-19 03:53:27,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 03:53:27,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 03:53:27,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 03:53:27,775 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 03:53:27,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:53:13" (1/3) ... [2018-09-19 03:53:27,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0f5f17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:53:27, skipping insertion in model container [2018-09-19 03:53:27,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:53:15" (2/3) ... [2018-09-19 03:53:27,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0f5f17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:53:27, skipping insertion in model container [2018-09-19 03:53:27,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:53:27" (3/3) ... [2018-09-19 03:53:27,779 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label58_true-unreach-call.c [2018-09-19 03:53:27,789 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 03:53:27,799 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 03:53:27,865 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 03:53:27,866 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 03:53:27,866 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 03:53:27,866 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 03:53:27,866 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 03:53:27,866 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 03:53:27,866 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 03:53:27,867 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 03:53:27,867 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 03:53:27,911 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-09-19 03:53:27,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-19 03:53:27,921 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:53:27,922 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] [2018-09-19 03:53:27,923 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:53:27,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1911661987, now seen corresponding path program 1 times [2018-09-19 03:53:27,933 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:53:27,935 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-09-19 03:53:27,938 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], [2095], [2097], [3244], [3248], [3254], [3258], [3271], [3272], [3273], [3275] [2018-09-19 03:53:28,014 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:53:28,015 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:53:29,634 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:53:29,636 INFO L272 AbstractInterpreter]: Visited 40 different actions 40 times. Never merged. Never widened. Never found a fixpoint. Largest state had 25 variables. [2018-09-19 03:53:29,679 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:53:30,512 INFO L232 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 77.36% of their original sizes. [2018-09-19 03:53:30,513 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:53:30,830 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:53:30,832 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:53:30,832 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 03:53:30,832 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:53:30,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 03:53:30,846 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 03:53:30,846 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 03:53:30,849 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 6 states. [2018-09-19 03:53:55,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:53:55,974 INFO L93 Difference]: Finished difference Result 2448 states and 4699 transitions. [2018-09-19 03:53:55,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 03:53:55,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-09-19 03:53:55,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:53:56,008 INFO L225 Difference]: With dead ends: 2448 [2018-09-19 03:53:56,009 INFO L226 Difference]: Without dead ends: 1606 [2018-09-19 03:53:56,020 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 40 GetRequests, 36 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:53:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2018-09-19 03:53:56,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1604. [2018-09-19 03:53:56,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-09-19 03:53:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2357 transitions. [2018-09-19 03:53:56,182 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2357 transitions. Word has length 41 [2018-09-19 03:53:56,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:53:56,183 INFO L480 AbstractCegarLoop]: Abstraction has 1604 states and 2357 transitions. [2018-09-19 03:53:56,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 03:53:56,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2357 transitions. [2018-09-19 03:53:56,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-09-19 03:53:56,191 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:53:56,192 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:56,192 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:53:56,192 INFO L82 PathProgramCache]: Analyzing trace with hash -718041984, now seen corresponding path program 1 times [2018-09-19 03:53:56,193 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:53:56,193 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 118 with the following transitions: [2018-09-19 03:53:56,194 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], [2095], [2097], [2100], [2108], [2116], [2124], [2132], [2140], [2148], [2156], [2164], [2172], [2180], [2188], [2196], [2204], [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:53:56,204 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:53:56,205 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:54:02,302 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:54:02,303 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:54:02,310 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:54:03,556 INFO L232 lantSequenceWeakener]: Weakened 115 states. On average, predicates are now at 75.87% of their original sizes. [2018-09-19 03:54:03,556 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:54:04,081 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:54:04,082 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:54:04,082 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 03:54:04,082 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:54:04,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 03:54:04,084 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 03:54:04,084 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 03:54:04,085 INFO L87 Difference]: Start difference. First operand 1604 states and 2357 transitions. Second operand 12 states. [2018-09-19 03:54:33,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:54:33,264 INFO L93 Difference]: Finished difference Result 3738 states and 6520 transitions. [2018-09-19 03:54:33,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 03:54:33,267 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 117 [2018-09-19 03:54:33,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:54:33,282 INFO L225 Difference]: With dead ends: 3738 [2018-09-19 03:54:33,283 INFO L226 Difference]: Without dead ends: 2908 [2018-09-19 03:54:33,288 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 125 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2018-09-19 03:54:33,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2018-09-19 03:54:33,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2406. [2018-09-19 03:54:33,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2406 states. [2018-09-19 03:54:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 3172 transitions. [2018-09-19 03:54:33,369 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 3172 transitions. Word has length 117 [2018-09-19 03:54:33,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:54:33,370 INFO L480 AbstractCegarLoop]: Abstraction has 2406 states and 3172 transitions. [2018-09-19 03:54:33,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 03:54:33,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 3172 transitions. [2018-09-19 03:54:33,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-09-19 03:54:33,374 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:54:33,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:33,375 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:54:33,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1246186092, now seen corresponding path program 1 times [2018-09-19 03:54:33,376 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:54:33,376 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2018-09-19 03:54:33,377 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], [2095], [2097], [2100], [2108], [2116], [2124], [2132], [2140], [2148], [2156], [2164], [2172], [2180], [2188], [2196], [2204], [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:54:33,386 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:54:33,386 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:54:39,269 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:54:51,549 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:54:51,549 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:54:51,579 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:54:53,439 INFO L232 lantSequenceWeakener]: Weakened 185 states. On average, predicates are now at 75.54% of their original sizes. [2018-09-19 03:54:53,440 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:54:53,925 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:54:53,925 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:54:53,925 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 03:54:53,926 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:54:53,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 03:54:53,927 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 03:54:53,927 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 03:54:53,927 INFO L87 Difference]: Start difference. First operand 2406 states and 3172 transitions. Second operand 12 states. [2018-09-19 03:55:17,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:55:17,299 INFO L93 Difference]: Finished difference Result 4011 states and 6273 transitions. [2018-09-19 03:55:17,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:55:17,305 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 187 [2018-09-19 03:55:17,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:55:17,323 INFO L225 Difference]: With dead ends: 4011 [2018-09-19 03:55:17,323 INFO L226 Difference]: Without dead ends: 3181 [2018-09-19 03:55:17,327 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 197 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2018-09-19 03:55:17,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2018-09-19 03:55:17,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 3176. [2018-09-19 03:55:17,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3176 states. [2018-09-19 03:55:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3176 states to 3176 states and 3957 transitions. [2018-09-19 03:55:17,410 INFO L78 Accepts]: Start accepts. Automaton has 3176 states and 3957 transitions. Word has length 187 [2018-09-19 03:55:17,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:55:17,411 INFO L480 AbstractCegarLoop]: Abstraction has 3176 states and 3957 transitions. [2018-09-19 03:55:17,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 03:55:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3176 states and 3957 transitions. [2018-09-19 03:55:17,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-09-19 03:55:17,414 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:55:17,415 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:17,415 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:55:17,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1656203084, now seen corresponding path program 1 times [2018-09-19 03:55:17,415 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:55:17,416 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 192 with the following transitions: [2018-09-19 03:55:17,416 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], [2095], [2097], [2100], [2108], [2116], [2124], [2132], [2140], [2148], [2156], [2164], [2172], [2180], [2188], [2196], [2204], [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:55:17,423 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:55:17,423 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:55:23,491 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:55:35,753 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:55:35,753 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:55:35,761 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:55:37,142 INFO L232 lantSequenceWeakener]: Weakened 189 states. On average, predicates are now at 75.53% of their original sizes. [2018-09-19 03:55:37,143 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:55:37,708 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:55:37,708 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:55:37,708 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 03:55:37,708 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:55:37,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 03:55:37,709 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 03:55:37,709 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-19 03:55:37,710 INFO L87 Difference]: Start difference. First operand 3176 states and 3957 transitions. Second operand 14 states. [2018-09-19 03:56:13,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:56:13,129 INFO L93 Difference]: Finished difference Result 4882 states and 7258 transitions. [2018-09-19 03:56:13,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-19 03:56:13,135 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 191 [2018-09-19 03:56:13,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:56:13,154 INFO L225 Difference]: With dead ends: 4882 [2018-09-19 03:56:13,154 INFO L226 Difference]: Without dead ends: 4052 [2018-09-19 03:56:13,158 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 203 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2018-09-19 03:56:13,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4052 states. [2018-09-19 03:56:13,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4052 to 3950. [2018-09-19 03:56:13,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3950 states. [2018-09-19 03:56:13,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3950 states to 3950 states and 4771 transitions. [2018-09-19 03:56:13,269 INFO L78 Accepts]: Start accepts. Automaton has 3950 states and 4771 transitions. Word has length 191 [2018-09-19 03:56:13,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:56:13,269 INFO L480 AbstractCegarLoop]: Abstraction has 3950 states and 4771 transitions. [2018-09-19 03:56:13,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 03:56:13,270 INFO L276 IsEmpty]: Start isEmpty. Operand 3950 states and 4771 transitions. [2018-09-19 03:56:13,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-09-19 03:56:13,275 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:56:13,275 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, 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] [2018-09-19 03:56:13,275 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:56:13,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1438336009, now seen corresponding path program 1 times [2018-09-19 03:56:13,276 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:56:13,276 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 264 with the following transitions: [2018-09-19 03:56:13,277 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], [2095], [2097], [2100], [2108], [2116], [2124], [2132], [2140], [2148], [2156], [2164], [2172], [2180], [2188], [2196], [2204], [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:56:13,283 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:56:13,284 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:56:20,534 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:56:36,961 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:56:36,962 INFO L272 AbstractInterpreter]: Visited 154 different actions 606 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:56:36,969 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:56:39,082 INFO L232 lantSequenceWeakener]: Weakened 261 states. On average, predicates are now at 75.42% of their original sizes. [2018-09-19 03:56:39,082 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:56:39,686 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:56:39,686 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:56:39,687 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 03:56:39,687 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:56:39,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 03:56:39,688 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 03:56:39,688 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-19 03:56:39,688 INFO L87 Difference]: Start difference. First operand 3950 states and 4771 transitions. Second operand 14 states. [2018-09-19 03:57:11,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:57:11,842 INFO L93 Difference]: Finished difference Result 6950 states and 10106 transitions. [2018-09-19 03:57:11,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-19 03:57:11,843 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 263 [2018-09-19 03:57:11,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:57:11,865 INFO L225 Difference]: With dead ends: 6950 [2018-09-19 03:57:11,866 INFO L226 Difference]: Without dead ends: 6120 [2018-09-19 03:57:11,871 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 275 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2018-09-19 03:57:11,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6120 states. [2018-09-19 03:57:12,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6120 to 4730. [2018-09-19 03:57:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4730 states. [2018-09-19 03:57:12,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4730 states to 4730 states and 5576 transitions. [2018-09-19 03:57:12,023 INFO L78 Accepts]: Start accepts. Automaton has 4730 states and 5576 transitions. Word has length 263 [2018-09-19 03:57:12,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:57:12,024 INFO L480 AbstractCegarLoop]: Abstraction has 4730 states and 5576 transitions. [2018-09-19 03:57:12,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 03:57:12,024 INFO L276 IsEmpty]: Start isEmpty. Operand 4730 states and 5576 transitions. [2018-09-19 03:57:12,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-09-19 03:57:12,028 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:57:12,029 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, 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] [2018-09-19 03:57:12,029 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:57:12,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1958493137, now seen corresponding path program 1 times [2018-09-19 03:57:12,030 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:57:12,030 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 268 with the following transitions: [2018-09-19 03:57:12,030 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], [2095], [2097], [2100], [2108], [2116], [2124], [2132], [2140], [2148], [2156], [2164], [2172], [2180], [2188], [2196], [2204], [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], [2665], [2669], [2673], [2677], [2680], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-09-19 03:57:12,042 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:57:12,043 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:57:19,500 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-19 03:57:23,506 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-19 03:57:23,506 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-19 03:57:23,507 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 03:57:23,541 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 03:57:23,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 03:57:23 BoogieIcfgContainer [2018-09-19 03:57:23,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 03:57:23,543 INFO L168 Benchmark]: Toolchain (without parser) took 250516.50 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -989.0 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-09-19 03:57:23,545 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:57:23,545 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2557.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-09-19 03:57:23,546 INFO L168 Benchmark]: Boogie Procedure Inliner took 804.30 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 882.9 MB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 126.4 MB. Max. memory is 7.1 GB. [2018-09-19 03:57:23,547 INFO L168 Benchmark]: Boogie Preprocessor took 454.02 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. [2018-09-19 03:57:23,548 INFO L168 Benchmark]: RCFGBuilder took 10922.88 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 1.6 GB in the end (delta: 643.5 MB). Peak memory consumption was 643.5 MB. Max. memory is 7.1 GB. [2018-09-19 03:57:23,549 INFO L168 Benchmark]: TraceAbstraction took 235770.09 ms. Allocated memory was 2.4 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: -779.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-09-19 03:57:23,557 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 2557.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 804.30 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 882.9 MB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 126.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 454.02 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10922.88 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 1.6 GB in the end (delta: 643.5 MB). Peak memory consumption was 643.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 235770.09 ms. Allocated memory was 2.4 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: -779.9 MB). 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: 114]: 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 FALSE !((( a17 <= -108 && ((a5==4) && ( a2 <= 189 && ((input == 6) && ((a7==13) || (a7==14)))))) && (a24==15))) [L729] COND FALSE !((((a5==3) && ( ((189 < a2) && (281 >= a2)) && (((((a7==13) && ((111 < a17) && (255 >= a17)) ) || ( ((111 < a17) && (255 >= a17)) && (a7==14))) || ((a7==12) && 255 < a17 )) && (input == 2)))) && (a24==13))) [L736] COND FALSE !(( 255 < a17 && ((a5==3) && ((((((a7==12) || (a7==13)) || (a7==14)) && (input == 6)) && ((189 < a2) && (281 >= a2)) ) && (a24==15))))) [L742] COND FALSE !(((((((a24==13) && ((a7==13) && a17 <= -108 )) && (a5==5)) || (((( 255 < a17 && (a7==14)) && (a24==15)) && (a5==4)) || ((( a17 <= -108 && (a7==12)) && (a24==13)) && (a5==5)))) && (input == 2)) && a2 <= 189 )) [L749] COND TRUE ( a17 <= -108 && ((a24==15) && ( a2 <= 189 && ((((a7==13) || (a7==14)) && (input == 3)) && (a5==4))))) [L750] a17 = ((((a17 % 299872)+ 300127) + 133154) / 5) [L751] a7 = 12 [L753] 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 TRUE (((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==4)) [L114] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 840 locations, 1 error locations. UNKNOWN Result, 235.6s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 145.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4192 SDtfs, 18299 SDslu, 1461 SDs, 0 SdLazy, 38343 SolverSat, 4354 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 130.4s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 840 GetRequests, 746 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4730occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 79.5s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.9943827100691081 AbsIntWeakeningRatio, 0.13224181360201512 AbsIntAvgWeakeningVarsNumRemoved, 1068.5944584382871 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 5 MinimizatonAttempts, 2001 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/Problem12_label58_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_03-57-23-586.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem12_label58_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_03-57-23-586.csv Completed graceful shutdown