java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label06_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 10:39:36,815 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 10:39:36,817 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 10:39:36,829 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 10:39:36,829 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 10:39:36,830 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 10:39:36,832 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 10:39:36,833 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 10:39:36,835 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 10:39:36,836 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 10:39:36,837 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 10:39:36,837 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 10:39:36,838 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 10:39:36,839 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 10:39:36,840 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 10:39:36,841 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 10:39:36,841 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 10:39:36,843 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 10:39:36,845 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 10:39:36,847 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 10:39:36,851 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 10:39:36,852 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 10:39:36,858 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 10:39:36,858 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 10:39:36,858 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 10:39:36,862 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 10:39:36,863 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 10:39:36,864 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 10:39:36,864 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 10:39:36,865 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 10:39:36,866 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 10:39:36,866 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 10:39:36,869 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 10:39:36,870 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 10:39:36,871 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 10:39:36,873 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 10:39:36,873 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf [2018-09-19 10:39:36,902 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 10:39:36,902 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 10:39:36,903 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 10:39:36,903 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 10:39:36,903 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 10:39:36,903 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 10:39:36,904 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-19 10:39:36,904 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 10:39:36,905 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2018-09-19 10:39:36,905 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 10:39:36,905 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 10:39:36,905 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 10:39:36,905 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 10:39:36,906 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 10:39:36,906 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 10:39:36,906 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 10:39:36,907 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 10:39:36,908 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 10:39:36,908 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 10:39:36,908 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 10:39:36,908 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 10:39:36,908 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 10:39:36,909 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 10:39:36,909 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 10:39:36,909 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 10:39:36,909 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 10:39:36,910 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 10:39:36,910 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 10:39:36,910 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 10:39:36,910 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 10:39:36,911 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 10:39:36,911 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 10:39:36,911 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 10:39:36,911 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 10:39:36,911 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 10:39:36,959 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 10:39:36,974 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 10:39:36,981 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 10:39:36,983 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 10:39:36,983 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 10:39:36,984 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label06_true-unreach-call_false-termination.c [2018-09-19 10:39:37,316 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdfa63143/cf1a4da01e2147089b2250d2a5784310/FLAG82d75ec75 [2018-09-19 10:39:37,609 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 10:39:37,613 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label06_true-unreach-call_false-termination.c [2018-09-19 10:39:37,639 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdfa63143/cf1a4da01e2147089b2250d2a5784310/FLAG82d75ec75 [2018-09-19 10:39:37,663 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdfa63143/cf1a4da01e2147089b2250d2a5784310 [2018-09-19 10:39:37,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 10:39:37,677 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 10:39:37,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 10:39:37,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 10:39:37,685 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 10:39:37,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 10:39:37" (1/1) ... [2018-09-19 10:39:37,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46cb0a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:39:37, skipping insertion in model container [2018-09-19 10:39:37,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 10:39:37" (1/1) ... [2018-09-19 10:39:37,701 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 10:39:38,254 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 10:39:38,283 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 10:39:38,460 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 10:39:38,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:39:38 WrapperNode [2018-09-19 10:39:38,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 10:39:38,522 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 10:39:38,523 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 10:39:38,523 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 10:39:38,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:39:38" (1/1) ... [2018-09-19 10:39:38,560 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:39:38" (1/1) ... [2018-09-19 10:39:38,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 10:39:38,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 10:39:38,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 10:39:38,664 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 10:39:38,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:39:38" (1/1) ... [2018-09-19 10:39:38,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:39:38" (1/1) ... [2018-09-19 10:39:38,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:39:38" (1/1) ... [2018-09-19 10:39:38,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:39:38" (1/1) ... [2018-09-19 10:39:38,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:39:38" (1/1) ... [2018-09-19 10:39:38,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:39:38" (1/1) ... [2018-09-19 10:39:38,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:39:38" (1/1) ... [2018-09-19 10:39:38,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 10:39:38,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 10:39:38,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 10:39:38,971 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 10:39:38,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:39:38" (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 10:39:39,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 10:39:39,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 10:39:39,052 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 10:39:39,052 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 10:39:39,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 10:39:39,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 10:39:39,052 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 10:39:39,053 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 10:39:42,718 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 10:39:42,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 10:39:42 BoogieIcfgContainer [2018-09-19 10:39:42,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 10:39:42,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 10:39:42,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 10:39:42,727 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 10:39:42,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 10:39:37" (1/3) ... [2018-09-19 10:39:42,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19050f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 10:39:42, skipping insertion in model container [2018-09-19 10:39:42,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:39:38" (2/3) ... [2018-09-19 10:39:42,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19050f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 10:39:42, skipping insertion in model container [2018-09-19 10:39:42,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 10:39:42" (3/3) ... [2018-09-19 10:39:42,731 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label06_true-unreach-call_false-termination.c [2018-09-19 10:39:42,741 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 10:39:42,752 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 10:39:42,807 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 10:39:42,808 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 10:39:42,808 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 10:39:42,808 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 10:39:42,809 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 10:39:42,809 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 10:39:42,809 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 10:39:42,809 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 10:39:42,809 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 10:39:42,844 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-09-19 10:39:42,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-19 10:39:42,855 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:39:42,856 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:39:42,857 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:39:42,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1354853180, now seen corresponding path program 1 times [2018-09-19 10:39:42,868 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:39:42,869 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-09-19 10:39:42,872 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [952], [956], [962], [966], [973], [974], [975], [977] [2018-09-19 10:39:42,929 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:39:42,930 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:39:44,335 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:39:44,337 INFO L272 AbstractInterpreter]: Visited 67 different actions 67 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 10:39:44,354 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:39:45,099 INFO L232 lantSequenceWeakener]: Weakened 66 states. On average, predicates are now at 80.83% of their original sizes. [2018-09-19 10:39:45,099 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:39:45,379 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:39:45,381 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:39:45,381 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 10:39:45,381 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:39:45,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 10:39:45,396 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 10:39:45,397 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 10:39:45,400 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 6 states. [2018-09-19 10:39:50,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:39:50,308 INFO L93 Difference]: Finished difference Result 693 states and 1229 transitions. [2018-09-19 10:39:50,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 10:39:50,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-09-19 10:39:50,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:39:50,330 INFO L225 Difference]: With dead ends: 693 [2018-09-19 10:39:50,330 INFO L226 Difference]: Without dead ends: 436 [2018-09-19 10:39:50,338 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 67 GetRequests, 63 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 10:39:50,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-09-19 10:39:50,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2018-09-19 10:39:50,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-09-19 10:39:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 615 transitions. [2018-09-19 10:39:50,419 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 615 transitions. Word has length 68 [2018-09-19 10:39:50,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:39:50,420 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 615 transitions. [2018-09-19 10:39:50,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 10:39:50,420 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 615 transitions. [2018-09-19 10:39:50,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-09-19 10:39:50,429 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:39:50,429 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, 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] [2018-09-19 10:39:50,430 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:39:50,430 INFO L82 PathProgramCache]: Analyzing trace with hash -702186069, now seen corresponding path program 1 times [2018-09-19 10:39:50,430 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:39:50,431 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 154 with the following transitions: [2018-09-19 10:39:50,431 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-19 10:39:50,439 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:39:50,439 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:39:54,130 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:39:54,131 INFO L272 AbstractInterpreter]: Visited 92 different actions 177 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:39:54,136 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:39:55,027 INFO L232 lantSequenceWeakener]: Weakened 151 states. On average, predicates are now at 78.89% of their original sizes. [2018-09-19 10:39:55,028 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:39:55,919 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:39:55,920 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:39:55,920 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-19 10:39:55,920 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:39:55,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-19 10:39:55,923 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-19 10:39:55,923 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-09-19 10:39:55,923 INFO L87 Difference]: Start difference. First operand 434 states and 615 transitions. Second operand 15 states. [2018-09-19 10:40:08,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:40:08,296 INFO L93 Difference]: Finished difference Result 1401 states and 2456 transitions. [2018-09-19 10:40:08,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-19 10:40:08,297 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 153 [2018-09-19 10:40:08,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:40:08,309 INFO L225 Difference]: With dead ends: 1401 [2018-09-19 10:40:08,309 INFO L226 Difference]: Without dead ends: 1156 [2018-09-19 10:40:08,313 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 168 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2018-09-19 10:40:08,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2018-09-19 10:40:08,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1033. [2018-09-19 10:40:08,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1033 states. [2018-09-19 10:40:08,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1254 transitions. [2018-09-19 10:40:08,372 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1254 transitions. Word has length 153 [2018-09-19 10:40:08,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:40:08,374 INFO L480 AbstractCegarLoop]: Abstraction has 1033 states and 1254 transitions. [2018-09-19 10:40:08,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-19 10:40:08,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1254 transitions. [2018-09-19 10:40:08,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-09-19 10:40:08,379 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:40:08,380 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, 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] [2018-09-19 10:40:08,380 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:40:08,381 INFO L82 PathProgramCache]: Analyzing trace with hash -414222825, now seen corresponding path program 1 times [2018-09-19 10:40:08,381 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:40:08,381 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 180 with the following transitions: [2018-09-19 10:40:08,382 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-19 10:40:08,388 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:40:08,388 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:40:13,536 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:40:13,536 INFO L272 AbstractInterpreter]: Visited 118 different actions 230 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:40:13,574 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:40:14,569 INFO L232 lantSequenceWeakener]: Weakened 177 states. On average, predicates are now at 78.65% of their original sizes. [2018-09-19 10:40:14,570 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:40:15,032 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:40:15,033 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:40:15,033 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 10:40:15,033 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:40:15,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 10:40:15,034 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 10:40:15,034 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 10:40:15,035 INFO L87 Difference]: Start difference. First operand 1033 states and 1254 transitions. Second operand 11 states. [2018-09-19 10:40:22,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:40:22,858 INFO L93 Difference]: Finished difference Result 1466 states and 2038 transitions. [2018-09-19 10:40:22,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 10:40:22,862 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 179 [2018-09-19 10:40:22,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:40:22,873 INFO L225 Difference]: With dead ends: 1466 [2018-09-19 10:40:22,874 INFO L226 Difference]: Without dead ends: 1221 [2018-09-19 10:40:22,875 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 186 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-09-19 10:40:22,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2018-09-19 10:40:22,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1218. [2018-09-19 10:40:22,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2018-09-19 10:40:22,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1452 transitions. [2018-09-19 10:40:22,928 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1452 transitions. Word has length 179 [2018-09-19 10:40:22,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:40:22,929 INFO L480 AbstractCegarLoop]: Abstraction has 1218 states and 1452 transitions. [2018-09-19 10:40:22,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 10:40:22,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1452 transitions. [2018-09-19 10:40:22,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-19 10:40:22,937 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:40:22,938 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:40:22,939 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:40:22,939 INFO L82 PathProgramCache]: Analyzing trace with hash 262360008, now seen corresponding path program 1 times [2018-09-19 10:40:22,939 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:40:22,940 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 265 with the following transitions: [2018-09-19 10:40:22,940 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-19 10:40:22,954 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:40:22,954 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:40:30,461 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:40:30,461 INFO L272 AbstractInterpreter]: Visited 119 different actions 352 times. Merged at 7 different actions 17 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 10:40:30,467 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:40:31,508 INFO L232 lantSequenceWeakener]: Weakened 262 states. On average, predicates are now at 78.24% of their original sizes. [2018-09-19 10:40:31,509 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:40:32,053 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:40:32,054 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:40:32,054 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-09-19 10:40:32,054 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:40:32,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-19 10:40:32,055 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-19 10:40:32,055 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-09-19 10:40:32,056 INFO L87 Difference]: Start difference. First operand 1218 states and 1452 transitions. Second operand 16 states. [2018-09-19 10:40:42,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:40:42,898 INFO L93 Difference]: Finished difference Result 3037 states and 4258 transitions. [2018-09-19 10:40:42,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-19 10:40:42,899 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 264 [2018-09-19 10:40:42,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:40:42,911 INFO L225 Difference]: With dead ends: 3037 [2018-09-19 10:40:42,911 INFO L226 Difference]: Without dead ends: 2193 [2018-09-19 10:40:42,917 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 282 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=260, Invalid=930, Unknown=0, NotChecked=0, Total=1190 [2018-09-19 10:40:42,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2018-09-19 10:40:42,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 1835. [2018-09-19 10:40:42,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1835 states. [2018-09-19 10:40:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2144 transitions. [2018-09-19 10:40:42,977 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2144 transitions. Word has length 264 [2018-09-19 10:40:42,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:40:42,978 INFO L480 AbstractCegarLoop]: Abstraction has 1835 states and 2144 transitions. [2018-09-19 10:40:42,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-19 10:40:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2144 transitions. [2018-09-19 10:40:42,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-09-19 10:40:42,985 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:40:42,985 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:40:42,986 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:40:42,986 INFO L82 PathProgramCache]: Analyzing trace with hash -164787285, now seen corresponding path program 1 times [2018-09-19 10:40:42,986 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:40:42,986 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 290 with the following transitions: [2018-09-19 10:40:42,987 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-19 10:40:42,992 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:40:42,993 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:40:48,873 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:40:58,191 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:40:58,191 INFO L272 AbstractInterpreter]: Visited 119 different actions 465 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 10:40:58,226 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:40:59,523 INFO L232 lantSequenceWeakener]: Weakened 287 states. On average, predicates are now at 78.15% of their original sizes. [2018-09-19 10:40:59,523 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:40:59,772 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:40:59,772 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:40:59,772 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:40:59,773 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:40:59,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:40:59,773 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:40:59,773 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:40:59,774 INFO L87 Difference]: Start difference. First operand 1835 states and 2144 transitions. Second operand 10 states. [2018-09-19 10:41:04,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:41:04,545 INFO L93 Difference]: Finished difference Result 2274 states and 2934 transitions. [2018-09-19 10:41:04,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 10:41:04,546 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 289 [2018-09-19 10:41:04,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:41:04,556 INFO L225 Difference]: With dead ends: 2274 [2018-09-19 10:41:04,556 INFO L226 Difference]: Without dead ends: 2029 [2018-09-19 10:41:04,559 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 296 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 10:41:04,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2018-09-19 10:41:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 2022. [2018-09-19 10:41:04,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2018-09-19 10:41:04,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 2362 transitions. [2018-09-19 10:41:04,620 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 2362 transitions. Word has length 289 [2018-09-19 10:41:04,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:41:04,621 INFO L480 AbstractCegarLoop]: Abstraction has 2022 states and 2362 transitions. [2018-09-19 10:41:04,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:41:04,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2362 transitions. [2018-09-19 10:41:04,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-09-19 10:41:04,631 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:41:04,631 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:41:04,632 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:41:04,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1215134593, now seen corresponding path program 1 times [2018-09-19 10:41:04,632 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:41:04,632 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 368 with the following transitions: [2018-09-19 10:41:04,633 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-19 10:41:04,636 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:41:04,636 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:41:09,264 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:41:25,056 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:41:25,056 INFO L272 AbstractInterpreter]: Visited 120 different actions 709 times. Merged at 8 different actions 44 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 10:41:25,065 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:41:26,527 INFO L232 lantSequenceWeakener]: Weakened 365 states. On average, predicates are now at 77.99% of their original sizes. [2018-09-19 10:41:26,527 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:41:26,950 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:41:26,951 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:41:26,951 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 10:41:26,951 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:41:26,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 10:41:26,952 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 10:41:26,953 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-09-19 10:41:26,953 INFO L87 Difference]: Start difference. First operand 2022 states and 2362 transitions. Second operand 14 states. [2018-09-19 10:41:36,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:41:36,650 INFO L93 Difference]: Finished difference Result 3054 states and 4144 transitions. [2018-09-19 10:41:36,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-19 10:41:36,651 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 367 [2018-09-19 10:41:36,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:41:36,664 INFO L225 Difference]: With dead ends: 3054 [2018-09-19 10:41:36,664 INFO L226 Difference]: Without dead ends: 2622 [2018-09-19 10:41:36,668 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 386 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2018-09-19 10:41:36,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2622 states. [2018-09-19 10:41:36,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 2229. [2018-09-19 10:41:36,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2229 states. [2018-09-19 10:41:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 2619 transitions. [2018-09-19 10:41:36,742 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 2619 transitions. Word has length 367 [2018-09-19 10:41:36,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:41:36,744 INFO L480 AbstractCegarLoop]: Abstraction has 2229 states and 2619 transitions. [2018-09-19 10:41:36,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 10:41:36,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 2619 transitions. [2018-09-19 10:41:36,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-09-19 10:41:36,756 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:41:36,756 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-09-19 10:41:36,756 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:41:36,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2032414793, now seen corresponding path program 1 times [2018-09-19 10:41:36,757 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:41:36,757 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 372 with the following transitions: [2018-09-19 10:41:36,758 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-19 10:41:36,761 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:41:36,761 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:41:41,796 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:42:03,452 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:42:03,452 INFO L272 AbstractInterpreter]: Visited 120 different actions 945 times. Merged at 8 different actions 62 times. Widened at 1 different actions 3 times. Found 14 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 10:42:03,458 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:42:04,888 INFO L232 lantSequenceWeakener]: Weakened 369 states. On average, predicates are now at 77.98% of their original sizes. [2018-09-19 10:42:04,889 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:42:05,145 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:42:05,146 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:42:05,146 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:42:05,146 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:42:05,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:42:05,147 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:42:05,147 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:42:05,147 INFO L87 Difference]: Start difference. First operand 2229 states and 2619 transitions. Second operand 10 states. [2018-09-19 10:42:12,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:42:12,419 INFO L93 Difference]: Finished difference Result 3063 states and 3890 transitions. [2018-09-19 10:42:12,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 10:42:12,423 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 371 [2018-09-19 10:42:12,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:42:12,434 INFO L225 Difference]: With dead ends: 3063 [2018-09-19 10:42:12,434 INFO L226 Difference]: Without dead ends: 2424 [2018-09-19 10:42:12,437 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 378 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 10:42:12,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2018-09-19 10:42:12,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 2414. [2018-09-19 10:42:12,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2414 states. [2018-09-19 10:42:12,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 2837 transitions. [2018-09-19 10:42:12,511 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 2837 transitions. Word has length 371 [2018-09-19 10:42:12,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:42:12,512 INFO L480 AbstractCegarLoop]: Abstraction has 2414 states and 2837 transitions. [2018-09-19 10:42:12,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:42:12,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 2837 transitions. [2018-09-19 10:42:12,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-09-19 10:42:12,521 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:42:12,521 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:42:12,522 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:42:12,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1601725016, now seen corresponding path program 1 times [2018-09-19 10:42:12,522 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:42:12,522 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 393 with the following transitions: [2018-09-19 10:42:12,523 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [626], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-19 10:42:12,526 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:42:12,526 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:42:17,741 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:42:33,547 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:42:33,547 INFO L272 AbstractInterpreter]: Visited 120 different actions 709 times. Merged at 8 different actions 44 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 10:42:33,554 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:42:35,234 INFO L232 lantSequenceWeakener]: Weakened 390 states. On average, predicates are now at 77.94% of their original sizes. [2018-09-19 10:42:35,234 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:42:35,637 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:42:35,637 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:42:35,638 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 10:42:35,638 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:42:35,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 10:42:35,639 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 10:42:35,639 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-09-19 10:42:35,640 INFO L87 Difference]: Start difference. First operand 2414 states and 2837 transitions. Second operand 14 states. [2018-09-19 10:42:46,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:42:46,043 INFO L93 Difference]: Finished difference Result 3844 states and 5109 transitions. [2018-09-19 10:42:46,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-19 10:42:46,043 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 392 [2018-09-19 10:42:46,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:42:46,058 INFO L225 Difference]: With dead ends: 3844 [2018-09-19 10:42:46,058 INFO L226 Difference]: Without dead ends: 3020 [2018-09-19 10:42:46,064 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 411 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2018-09-19 10:42:46,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3020 states. [2018-09-19 10:42:46,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3020 to 2625. [2018-09-19 10:42:46,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2625 states. [2018-09-19 10:42:46,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2625 states and 3100 transitions. [2018-09-19 10:42:46,151 INFO L78 Accepts]: Start accepts. Automaton has 2625 states and 3100 transitions. Word has length 392 [2018-09-19 10:42:46,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:42:46,152 INFO L480 AbstractCegarLoop]: Abstraction has 2625 states and 3100 transitions. [2018-09-19 10:42:46,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 10:42:46,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 3100 transitions. [2018-09-19 10:42:46,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2018-09-19 10:42:46,164 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:42:46,164 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-09-19 10:42:46,164 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:42:46,165 INFO L82 PathProgramCache]: Analyzing trace with hash -993846389, now seen corresponding path program 1 times [2018-09-19 10:42:46,165 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:42:46,165 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 450 with the following transitions: [2018-09-19 10:42:46,165 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [535], [539], [542], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-19 10:42:46,169 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:42:46,169 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:42:51,094 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:43:21,191 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:43:21,191 INFO L272 AbstractInterpreter]: Visited 121 different actions 1206 times. Merged at 9 different actions 95 times. Widened at 1 different actions 5 times. Found 26 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 10:43:21,197 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:43:22,939 INFO L232 lantSequenceWeakener]: Weakened 447 states. On average, predicates are now at 77.88% of their original sizes. [2018-09-19 10:43:22,940 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:43:23,379 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:43:23,379 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:43:23,380 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 10:43:23,380 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:43:23,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 10:43:23,381 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 10:43:23,381 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-09-19 10:43:23,381 INFO L87 Difference]: Start difference. First operand 2625 states and 3100 transitions. Second operand 14 states. [2018-09-19 10:43:32,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:43:32,432 INFO L93 Difference]: Finished difference Result 4266 states and 5382 transitions. [2018-09-19 10:43:32,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-19 10:43:32,433 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 449 [2018-09-19 10:43:32,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:43:32,445 INFO L225 Difference]: With dead ends: 4266 [2018-09-19 10:43:32,445 INFO L226 Difference]: Without dead ends: 3231 [2018-09-19 10:43:32,449 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 468 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2018-09-19 10:43:32,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3231 states. [2018-09-19 10:43:32,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3231 to 2830. [2018-09-19 10:43:32,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2830 states. [2018-09-19 10:43:32,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2830 states and 3358 transitions. [2018-09-19 10:43:32,540 INFO L78 Accepts]: Start accepts. Automaton has 2830 states and 3358 transitions. Word has length 449 [2018-09-19 10:43:32,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:43:32,542 INFO L480 AbstractCegarLoop]: Abstraction has 2830 states and 3358 transitions. [2018-09-19 10:43:32,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 10:43:32,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 3358 transitions. [2018-09-19 10:43:32,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2018-09-19 10:43:32,553 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:43:32,553 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 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] [2018-09-19 10:43:32,553 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:43:32,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1322317435, now seen corresponding path program 1 times [2018-09-19 10:43:32,554 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:43:32,554 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 450 with the following transitions: [2018-09-19 10:43:32,555 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [854], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-19 10:43:32,559 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:43:32,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:43:38,962 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-19 10:43:58,922 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-19 10:43:58,923 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-19 10:43:58,923 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 10:43:58,987 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 10:43:58,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 10:43:58 BoogieIcfgContainer [2018-09-19 10:43:58,988 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 10:43:58,989 INFO L168 Benchmark]: Toolchain (without parser) took 261314.54 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 16.7 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-09-19 10:43:58,991 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 10:43:58,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 843.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-09-19 10:43:58,992 INFO L168 Benchmark]: Boogie Procedure Inliner took 140.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 10:43:58,993 INFO L168 Benchmark]: Boogie Preprocessor took 306.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -859.1 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2018-09-19 10:43:58,995 INFO L168 Benchmark]: RCFGBuilder took 3748.51 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 130.5 MB). Peak memory consumption was 130.5 MB. Max. memory is 7.1 GB. [2018-09-19 10:43:58,996 INFO L168 Benchmark]: TraceAbstraction took 256265.14 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 1.4 GB in the end (delta: 681.8 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 10:43:59,003 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 843.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 140.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 306.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -859.1 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3748.51 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 130.5 MB). Peak memory consumption was 130.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 256265.14 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 1.4 GB in the end (delta: 681.8 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 187]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int inputD = 4; [L8] int inputB = 2; [L9] int inputC = 3; [L10] int inputF = 6; [L11] int inputE = 5; [L12] int inputA = 1; [L15] int a21 = 7; [L16] int a15 = 8; [L17] int a12 = -49; [L18] int a24 = 1; [L877] int output = -1; [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL, EXPR calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L189] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) [L192] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L195] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L198] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) [L201] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L205] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) [L211] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) [L217] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) [L223] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) [L229] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) [L235] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) [L241] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) [L247] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) [L252] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) [L258] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) [L264] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) [L269] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) [L275] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) [L280] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) [L286] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) [L293] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) [L299] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) [L305] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) [L311] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) [L317] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) [L323] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) [L329] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) [L335] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) [L341] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) [L347] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) [L353] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) [L359] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) [L366] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) [L372] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) [L378] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) [L384] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) [L390] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) [L396] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) [L402] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) [L408] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) [L414] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) [L420] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) [L426] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) [L432] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) [L438] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) [L444] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) [L449] COND TRUE (((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8)) [L451] a21 = 10 [L453] RET return 22; [L888] EXPR calculate_output(input) [L888] output = calculate_output(input) [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL, EXPR calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L189] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) [L192] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L195] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L198] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) [L201] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L205] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) [L211] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) [L217] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) [L223] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) [L229] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) [L235] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) [L241] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) [L247] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) [L252] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) [L258] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) [L264] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) [L269] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) [L275] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) [L280] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) [L286] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) [L293] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) [L299] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) [L305] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) [L311] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) [L317] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) [L323] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) [L329] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) [L335] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) [L341] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) [L347] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) [L353] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) [L359] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) [L366] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) [L372] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) [L378] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) [L384] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) [L390] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) [L396] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) [L402] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) [L408] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) [L414] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) [L420] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) [L426] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) [L432] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) [L438] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) [L444] COND TRUE ((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8)) [L445] a12 = ((((a12 % 26)+ -1) / 5) / 5) [L446] a21 = 7 [L448] RET return 25; [L888] EXPR calculate_output(input) [L888] output = calculate_output(input) [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL, EXPR calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L189] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) [L192] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L195] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L198] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) [L201] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L205] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) [L211] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) [L217] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) [L223] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) [L229] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) [L235] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) [L241] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) [L247] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) [L252] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) [L258] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) [L264] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) [L269] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) [L275] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) [L280] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) [L286] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) [L293] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) [L299] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) [L305] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) [L311] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) [L317] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) [L323] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) [L329] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) [L335] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) [L341] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) [L347] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) [L353] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) [L359] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) [L366] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) [L372] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) [L378] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) [L384] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) [L390] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) [L396] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) [L402] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) [L408] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) [L414] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) [L420] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) [L426] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) [L432] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) [L438] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) [L444] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) [L449] COND FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) [L454] COND FALSE !((((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1))) [L460] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 2))) [L467] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1))) [L472] COND FALSE !((((a15==8) && ( 80 < a12 && (((a21==8) || (a21==9)) && (input == 6)))) && (a24==1))) [L478] COND FALSE !((((((( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))) || ((a21==7) && ((-43 < a12) && (11 >= a12)) )) && (input == 3)) && (a24==1)) && (a15==9))) [L484] COND FALSE !(((a24==1) && ((input == 1) && (((a21==10) && ((a15==8) && 80 < a12 )) || (( a12 <= -43 && (a15==9)) && (a21==6)))))) [L490] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 1)))) && (a15==8))) [L495] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==7) || (a21==8)) || (a21==9)) && (input == 3)))) && (a15==9))) [L500] COND FALSE !((((a24==1) && ((input == 4) && ((((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )) || ((a21==6) && 80 < a12 )))) && (a15==9))) [L506] COND FALSE !(((a15==8) && (((a21==7) && ((input == 2) && (a24==1))) && a12 <= -43 ))) [L512] COND FALSE !(((a15==8) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ((a21==6) && ((11 < a12) && (80 >= a12)) ))) && (a24==1)))) [L518] COND FALSE !(((a15==9) && (( a12 <= -43 && (((a21==9) || ((a21==7) || (a21==8))) && (input == 2))) && (a24==1)))) [L524] COND FALSE !(((a24==1) && ((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 3))))) [L530] COND FALSE !((((a15==8) && (((a24==1) && (input == 4)) && ((11 < a12) && (80 >= a12)) )) && (a21==9))) [L536] COND FALSE !(((((input == 6) && ((( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10))) || ( 80 < a12 && (a21==6)))) && (a24==1)) && (a15==9))) [L541] COND FALSE !((((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 6))) && (a24==1))) [L547] COND FALSE !(((((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 2))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) [L552] COND FALSE !((((a21==9) && (((input == 3) && (a24==1)) && 80 < a12 )) && (a15==9))) [L555] COND FALSE !(((((((a21==7) || (a21==8)) && (input == 1)) && (a15==9)) && 80 < a12 ) && (a24==1))) [L561] COND FALSE !((((((a15==9) && ( 80 < a12 && (a24==1))) && (a21==10)) || ((a21==6) && (((a24==2) && a12 <= -43 ) && (a15==5)))) && (input == 6))) [L568] COND FALSE !(((a15==9) && ((a21==9) && ( 80 < a12 && ((input == 2) && (a24==1)))))) [L573] COND FALSE !(((((a15==8) && (((a21==7) || (a21==8)) && (input == 3))) && (a24==1)) && ((11 < a12) && (80 >= a12)) )) [L579] COND FALSE !(((a24==1) && ((input == 5) && ((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9))))))) [L585] COND FALSE !(((a24==1) && (((( 80 < a12 && (a21==6)) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) ))) && (input == 1)) && (a15==9)))) [L591] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==8) || (a21==9)) || (a21==10)) && (input == 1)))) && (a15==8))) [L597] COND FALSE !(((a24==1) && (((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ((a21==6) && ((-43 < a12) && (11 >= a12)) ))) && (input == 6)) && (a15==9)))) [L603] COND FALSE !(((a15==8) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 2))) && ((-43 < a12) && (11 >= a12)) ))) [L609] COND FALSE !((((((input == 6) && (((a21==6) || (a21==7)) || (a21==8))) && (a15==8)) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) [L615] COND FALSE !(((a24==1) && (((((a21==7) || (a21==8)) && (input == 6)) && (a15==8)) && ((11 < a12) && (80 >= a12)) ))) [L621] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 2)) && (a15==9)) && (a24==1))) [L626] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && (((input == 1) && (a15==8)) && (a24==1))) && (a21==9))) [L632] COND FALSE !(((a24==1) && ((a15==9) && ((input == 2) && (( 80 < a12 && (a21==6)) || (( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))))))) [L638] COND FALSE !(((a24==1) && ((a15==8) && (((input == 2) && ((a21==7) || (a21==8))) && ((11 < a12) && (80 >= a12)) )))) [L644] COND FALSE !(((a24==1) && ((a21==9) && (((input == 5) && (a15==9)) && 80 < a12 )))) [L650] COND FALSE !((( a12 <= -43 && (((input == 1) && (a21==7)) && (a24==1))) && (a15==8))) [L656] COND FALSE !((((a21==9) && (( ((11 < a12) && (80 >= a12)) && (input == 3)) && (a24==1))) && (a15==8))) [L662] COND FALSE !((((a15==8) && ((((a21==8) || (a21==9)) && (input == 2)) && (a24==1))) && 80 < a12 )) [L668] COND FALSE !((( 80 < a12 && ((a24==1) && (((a21==8) || (a21==9)) && (input == 4)))) && (a15==8))) [L674] COND FALSE !(((a21==9) && ((a15==9) && ((a24==1) && ( 80 < a12 && (input == 1)))))) [L677] COND FALSE !(((a15==8) && (((input == 3) && ((((a21==10) && ((11 < a12) && (80 >= a12)) ) || ((a21==6) && 80 < a12 )) || ( 80 < a12 && (a21==7)))) && (a24==1)))) [L683] COND FALSE !(((a24==1) && ( 80 < a12 && ((a21==9) && ((a15==9) && (input == 4)))))) [L688] COND FALSE !(((a15==8) && (((input == 6) && (( 80 < a12 && (a21==7)) || (((a21==10) && ((11 < a12) && (80 >= a12)) ) || ( 80 < a12 && (a21==6))))) && (a24==1)))) [L694] COND FALSE !(((a15==9) && ((a24==1) && ( ((-43 < a12) && (11 >= a12)) && ((input == 1) && ((a21==9) || (a21==10))))))) [L700] COND FALSE !(((((( 80 < a12 && (a15==8)) && (a21==10)) || ((a21==6) && ((a15==9) && a12 <= -43 ))) && (input == 6)) && (a24==1))) [L706] COND FALSE !(((((a15==8) && (((a21==8) || (a21==9)) && (input == 1))) && (a24==1)) && 80 < a12 )) [L712] COND FALSE !((((a24==1) && ((((a21==7) && 80 < a12 ) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ((a21==6) && 80 < a12 ))) && (input == 2))) && (a15==8))) [L718] COND FALSE !(((a24==1) && ( ((-43 < a12) && (11 >= a12)) && (((((a21==6) || (a21==7)) || (a21==8)) && (input == 4)) && (a15==8))))) [L724] COND FALSE !((((a15==8) && (((a21==7) && (input == 4)) && (a24==1))) && a12 <= -43 )) [L730] COND TRUE ((a21==9) && (((a24==1) && ((input == 2) && ((-43 < a12) && (11 >= a12)) )) && (a15==8))) [L731] a12 = (((a12 - -61) - -3) - -1) [L732] a21 = 8 [L734] RET return 26; [L888] EXPR calculate_output(input) [L888] output = calculate_output(input) [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND TRUE ((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8)) [L187] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. UNKNOWN Result, 256.1s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 77.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2044 SDtfs, 16325 SDslu, 2920 SDs, 0 SdLazy, 21508 SolverSat, 4452 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 66.0s Time, PredicateUnifierStatistics: 18 DeclaredPredicates, 2642 GetRequests, 2431 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2830occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 162.7s AbstIntTime, 10 AbstIntIterations, 9 AbstIntStrong, 0.995688871865009 AbsIntWeakeningRatio, 0.09512485136741974 AbsIntAvgWeakeningVarsNumRemoved, 906.1224732461355 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 1692 StatesRemovedByMinimization, 9 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/Problem14_label06_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_10-43-59-040.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label06_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_10-43-59-040.csv Completed graceful shutdown