java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label32_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 04:08:01,467 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 04:08:01,470 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 04:08:01,485 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 04:08:01,485 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 04:08:01,487 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 04:08:01,488 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 04:08:01,490 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 04:08:01,493 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 04:08:01,499 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 04:08:01,500 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 04:08:01,503 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 04:08:01,505 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 04:08:01,508 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 04:08:01,509 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 04:08:01,510 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 04:08:01,512 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 04:08:01,516 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 04:08:01,518 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 04:08:01,519 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 04:08:01,521 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 04:08:01,522 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 04:08:01,524 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 04:08:01,524 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 04:08:01,524 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 04:08:01,525 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 04:08:01,526 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 04:08:01,526 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 04:08:01,527 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 04:08:01,530 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 04:08:01,530 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 04:08:01,531 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 04:08:01,531 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 04:08:01,531 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 04:08:01,532 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 04:08:01,534 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 04:08:01,535 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf [2018-09-19 04:08:01,559 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 04:08:01,559 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 04:08:01,560 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 04:08:01,560 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 04:08:01,561 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 04:08:01,561 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 04:08:01,561 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 04:08:01,561 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 04:08:01,561 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 04:08:01,562 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 04:08:01,562 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 04:08:01,562 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 04:08:01,563 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 04:08:01,563 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 04:08:01,563 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 04:08:01,563 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 04:08:01,563 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 04:08:01,563 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 04:08:01,564 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 04:08:01,564 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 04:08:01,564 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 04:08:01,564 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 04:08:01,564 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 04:08:01,565 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 04:08:01,565 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 04:08:01,565 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 04:08:01,565 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 04:08:01,565 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 04:08:01,566 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 04:08:01,566 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 04:08:01,566 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 04:08:01,566 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 04:08:01,566 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 04:08:01,566 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 04:08:01,617 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 04:08:01,630 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 04:08:01,633 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 04:08:01,635 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 04:08:01,635 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 04:08:01,636 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label32_true-unreach-call_false-termination.c [2018-09-19 04:08:01,966 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6439798b9/64a5a32262d34886889d72ed122ed2b1/FLAG51b4be7b9 [2018-09-19 04:08:02,235 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 04:08:02,240 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label32_true-unreach-call_false-termination.c [2018-09-19 04:08:02,265 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6439798b9/64a5a32262d34886889d72ed122ed2b1/FLAG51b4be7b9 [2018-09-19 04:08:02,283 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6439798b9/64a5a32262d34886889d72ed122ed2b1 [2018-09-19 04:08:02,294 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 04:08:02,296 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 04:08:02,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 04:08:02,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 04:08:02,304 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 04:08:02,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:08:02" (1/1) ... [2018-09-19 04:08:02,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b2376b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:08:02, skipping insertion in model container [2018-09-19 04:08:02,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:08:02" (1/1) ... [2018-09-19 04:08:02,320 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 04:08:02,876 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 04:08:02,894 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 04:08:03,066 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 04:08:03,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:08:03 WrapperNode [2018-09-19 04:08:03,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 04:08:03,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 04:08:03,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 04:08:03,126 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 04:08:03,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:08:03" (1/1) ... [2018-09-19 04:08:03,167 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:08:03" (1/1) ... [2018-09-19 04:08:03,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 04:08:03,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 04:08:03,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 04:08:03,265 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 04:08:03,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:08:03" (1/1) ... [2018-09-19 04:08:03,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:08:03" (1/1) ... [2018-09-19 04:08:03,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:08:03" (1/1) ... [2018-09-19 04:08:03,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:08:03" (1/1) ... [2018-09-19 04:08:03,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:08:03" (1/1) ... [2018-09-19 04:08:03,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:08:03" (1/1) ... [2018-09-19 04:08:03,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:08:03" (1/1) ... [2018-09-19 04:08:03,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 04:08:03,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 04:08:03,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 04:08:03,530 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 04:08:03,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:08:03" (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 04:08:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 04:08:03,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 04:08:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 04:08:03,605 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 04:08:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 04:08:03,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 04:08:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 04:08:03,606 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 04:08:07,354 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 04:08:07,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:08:07 BoogieIcfgContainer [2018-09-19 04:08:07,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 04:08:07,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 04:08:07,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 04:08:07,362 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 04:08:07,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 04:08:02" (1/3) ... [2018-09-19 04:08:07,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31edde26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:08:07, skipping insertion in model container [2018-09-19 04:08:07,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:08:03" (2/3) ... [2018-09-19 04:08:07,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31edde26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:08:07, skipping insertion in model container [2018-09-19 04:08:07,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:08:07" (3/3) ... [2018-09-19 04:08:07,365 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label32_true-unreach-call_false-termination.c [2018-09-19 04:08:07,375 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 04:08:07,384 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 04:08:07,435 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 04:08:07,436 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 04:08:07,436 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 04:08:07,437 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 04:08:07,437 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 04:08:07,437 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 04:08:07,437 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 04:08:07,438 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 04:08:07,438 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 04:08:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-09-19 04:08:07,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-19 04:08:07,476 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:08:07,477 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] [2018-09-19 04:08:07,478 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:08:07,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1019361724, now seen corresponding path program 1 times [2018-09-19 04:08:07,487 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:08:07,489 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-09-19 04:08:07,492 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], [397], [399], [952], [956], [962], [966], [973], [974], [975], [977] [2018-09-19 04:08:07,556 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:08:07,556 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:08:09,033 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 04:08:09,035 INFO L272 AbstractInterpreter]: Visited 61 different actions 61 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 04:08:09,052 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 04:08:09,853 INFO L232 lantSequenceWeakener]: Weakened 60 states. On average, predicates are now at 80.73% of their original sizes. [2018-09-19 04:08:09,853 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 04:08:10,140 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 04:08:10,141 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 04:08:10,142 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 04:08:10,142 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 04:08:10,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 04:08:10,155 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 04:08:10,156 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 04:08:10,159 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 6 states. [2018-09-19 04:08:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 04:08:14,783 INFO L93 Difference]: Finished difference Result 693 states and 1229 transitions. [2018-09-19 04:08:14,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 04:08:14,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-09-19 04:08:14,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 04:08:14,803 INFO L225 Difference]: With dead ends: 693 [2018-09-19 04:08:14,803 INFO L226 Difference]: Without dead ends: 436 [2018-09-19 04:08:14,811 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 61 GetRequests, 57 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 04:08:14,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-09-19 04:08:14,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2018-09-19 04:08:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-09-19 04:08:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 615 transitions. [2018-09-19 04:08:14,894 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 615 transitions. Word has length 62 [2018-09-19 04:08:14,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 04:08:14,895 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 615 transitions. [2018-09-19 04:08:14,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 04:08:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 615 transitions. [2018-09-19 04:08:14,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-19 04:08:14,905 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:08:14,905 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:08:14,906 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:08:14,906 INFO L82 PathProgramCache]: Analyzing trace with hash -364807277, now seen corresponding path program 1 times [2018-09-19 04:08:14,906 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:08:14,906 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2018-09-19 04:08:14,907 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], [397], [399], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-19 04:08:14,913 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:08:14,913 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:08:18,785 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 04:08:18,786 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 04:08:18,791 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 04:08:19,768 INFO L232 lantSequenceWeakener]: Weakened 145 states. On average, predicates are now at 78.77% of their original sizes. [2018-09-19 04:08:19,768 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 04:08:20,375 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 04:08:20,376 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 04:08:20,376 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 04:08:20,376 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 04:08:20,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 04:08:20,378 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 04:08:20,379 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-19 04:08:20,379 INFO L87 Difference]: Start difference. First operand 434 states and 615 transitions. Second operand 14 states. [2018-09-19 04:08:32,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 04:08:32,750 INFO L93 Difference]: Finished difference Result 1340 states and 2335 transitions. [2018-09-19 04:08:32,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 04:08:32,751 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 147 [2018-09-19 04:08:32,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 04:08:32,762 INFO L225 Difference]: With dead ends: 1340 [2018-09-19 04:08:32,762 INFO L226 Difference]: Without dead ends: 1095 [2018-09-19 04:08:32,767 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 159 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2018-09-19 04:08:32,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-09-19 04:08:32,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 850. [2018-09-19 04:08:32,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-09-19 04:08:32,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1058 transitions. [2018-09-19 04:08:32,837 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1058 transitions. Word has length 147 [2018-09-19 04:08:32,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 04:08:32,839 INFO L480 AbstractCegarLoop]: Abstraction has 850 states and 1058 transitions. [2018-09-19 04:08:32,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 04:08:32,839 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1058 transitions. [2018-09-19 04:08:32,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-09-19 04:08:32,850 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:08:32,851 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:08:32,851 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:08:32,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1415713537, now seen corresponding path program 1 times [2018-09-19 04:08:32,851 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:08:32,852 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 174 with the following transitions: [2018-09-19 04:08:32,852 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], [397], [399], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-19 04:08:32,858 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:08:32,858 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:08:38,574 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 04:08:38,575 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 04:08:38,589 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 04:08:39,705 INFO L232 lantSequenceWeakener]: Weakened 171 states. On average, predicates are now at 78.54% of their original sizes. [2018-09-19 04:08:39,705 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 04:08:40,162 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 04:08:40,163 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 04:08:40,163 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 04:08:40,163 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 04:08:40,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 04:08:40,164 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 04:08:40,164 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 04:08:40,164 INFO L87 Difference]: Start difference. First operand 850 states and 1058 transitions. Second operand 11 states. [2018-09-19 04:08:47,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 04:08:47,830 INFO L93 Difference]: Finished difference Result 1283 states and 1842 transitions. [2018-09-19 04:08:47,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 04:08:47,837 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 173 [2018-09-19 04:08:47,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 04:08:47,845 INFO L225 Difference]: With dead ends: 1283 [2018-09-19 04:08:47,845 INFO L226 Difference]: Without dead ends: 1038 [2018-09-19 04:08:47,847 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 180 GetRequests, 163 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 04:08:47,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2018-09-19 04:08:47,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1035. [2018-09-19 04:08:47,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2018-09-19 04:08:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1256 transitions. [2018-09-19 04:08:47,894 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1256 transitions. Word has length 173 [2018-09-19 04:08:47,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 04:08:47,894 INFO L480 AbstractCegarLoop]: Abstraction has 1035 states and 1256 transitions. [2018-09-19 04:08:47,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 04:08:47,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1256 transitions. [2018-09-19 04:08:47,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-09-19 04:08:47,900 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:08:47,900 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, 2, 2, 2, 2, 2, 2, 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 04:08:47,900 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:08:47,901 INFO L82 PathProgramCache]: Analyzing trace with hash 295076816, now seen corresponding path program 1 times [2018-09-19 04:08:47,901 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:08:47,901 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 259 with the following transitions: [2018-09-19 04:08:47,902 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], [397], [399], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [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 04:08:47,906 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:08:47,906 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:08:55,151 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 04:08:55,152 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 04:08:55,189 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 04:08:57,076 INFO L232 lantSequenceWeakener]: Weakened 256 states. On average, predicates are now at 78.15% of their original sizes. [2018-09-19 04:08:57,076 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 04:08:57,788 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 04:08:57,789 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 04:08:57,789 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-09-19 04:08:57,790 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 04:08:57,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-19 04:08:57,791 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-19 04:08:57,792 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-09-19 04:08:57,792 INFO L87 Difference]: Start difference. First operand 1035 states and 1256 transitions. Second operand 16 states. [2018-09-19 04:09:10,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 04:09:10,004 INFO L93 Difference]: Finished difference Result 2673 states and 3868 transitions. [2018-09-19 04:09:10,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-19 04:09:10,009 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 258 [2018-09-19 04:09:10,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 04:09:10,021 INFO L225 Difference]: With dead ends: 2673 [2018-09-19 04:09:10,021 INFO L226 Difference]: Without dead ends: 2012 [2018-09-19 04:09:10,026 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 276 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=260, Invalid=930, Unknown=0, NotChecked=0, Total=1190 [2018-09-19 04:09:10,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2018-09-19 04:09:10,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 1652. [2018-09-19 04:09:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2018-09-19 04:09:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 1949 transitions. [2018-09-19 04:09:10,085 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 1949 transitions. Word has length 258 [2018-09-19 04:09:10,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 04:09:10,085 INFO L480 AbstractCegarLoop]: Abstraction has 1652 states and 1949 transitions. [2018-09-19 04:09:10,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-19 04:09:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 1949 transitions. [2018-09-19 04:09:10,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-09-19 04:09:10,092 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:09:10,092 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 04:09:10,092 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:09:10,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1771854323, now seen corresponding path program 1 times [2018-09-19 04:09:10,093 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:09:10,093 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 284 with the following transitions: [2018-09-19 04:09:10,093 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], [397], [399], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-19 04:09:10,108 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:09:10,109 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:09:14,761 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 04:09:24,116 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 04:09:24,117 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 04:09:24,132 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 04:09:25,935 INFO L232 lantSequenceWeakener]: Weakened 281 states. On average, predicates are now at 78.08% of their original sizes. [2018-09-19 04:09:25,935 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 04:09:26,163 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 04:09:26,163 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 04:09:26,164 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 04:09:26,164 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 04:09:26,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 04:09:26,165 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 04:09:26,165 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 04:09:26,165 INFO L87 Difference]: Start difference. First operand 1652 states and 1949 transitions. Second operand 10 states. [2018-09-19 04:09:32,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 04:09:32,901 INFO L93 Difference]: Finished difference Result 2091 states and 2739 transitions. [2018-09-19 04:09:32,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 04:09:32,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 283 [2018-09-19 04:09:32,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 04:09:32,911 INFO L225 Difference]: With dead ends: 2091 [2018-09-19 04:09:32,911 INFO L226 Difference]: Without dead ends: 1846 [2018-09-19 04:09:32,913 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 290 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 04:09:32,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2018-09-19 04:09:32,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1839. [2018-09-19 04:09:32,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1839 states. [2018-09-19 04:09:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2167 transitions. [2018-09-19 04:09:32,965 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2167 transitions. Word has length 283 [2018-09-19 04:09:32,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 04:09:32,966 INFO L480 AbstractCegarLoop]: Abstraction has 1839 states and 2167 transitions. [2018-09-19 04:09:32,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 04:09:32,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2167 transitions. [2018-09-19 04:09:32,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-09-19 04:09:32,975 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:09:32,975 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 04:09:32,975 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:09:32,976 INFO L82 PathProgramCache]: Analyzing trace with hash 655880743, now seen corresponding path program 1 times [2018-09-19 04:09:32,976 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:09:32,976 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 362 with the following transitions: [2018-09-19 04:09:32,976 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], [397], [399], [402], [410], [418], [426], [434], [442], [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 04:09:32,980 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:09:32,980 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:09:38,027 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 04:09:52,856 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 04:09:52,857 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 04:09:52,864 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 04:09:54,875 INFO L232 lantSequenceWeakener]: Weakened 359 states. On average, predicates are now at 77.93% of their original sizes. [2018-09-19 04:09:54,875 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 04:09:55,330 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 04:09:55,331 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 04:09:55,331 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 04:09:55,331 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 04:09:55,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 04:09:55,332 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 04:09:55,333 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-09-19 04:09:55,333 INFO L87 Difference]: Start difference. First operand 1839 states and 2167 transitions. Second operand 14 states. [2018-09-19 04:10:06,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 04:10:06,746 INFO L93 Difference]: Finished difference Result 2871 states and 3949 transitions. [2018-09-19 04:10:06,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-19 04:10:06,747 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 361 [2018-09-19 04:10:06,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 04:10:06,758 INFO L225 Difference]: With dead ends: 2871 [2018-09-19 04:10:06,759 INFO L226 Difference]: Without dead ends: 2439 [2018-09-19 04:10:06,762 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 380 GetRequests, 348 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 04:10:06,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states. [2018-09-19 04:10:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 2046. [2018-09-19 04:10:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2046 states. [2018-09-19 04:10:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 2424 transitions. [2018-09-19 04:10:06,823 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 2424 transitions. Word has length 361 [2018-09-19 04:10:06,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 04:10:06,824 INFO L480 AbstractCegarLoop]: Abstraction has 2046 states and 2424 transitions. [2018-09-19 04:10:06,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 04:10:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 2424 transitions. [2018-09-19 04:10:06,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-09-19 04:10:06,834 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:10:06,834 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 04:10:06,835 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:10:06,835 INFO L82 PathProgramCache]: Analyzing trace with hash 297719647, now seen corresponding path program 1 times [2018-09-19 04:10:06,835 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:10:06,835 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 366 with the following transitions: [2018-09-19 04:10:06,836 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], [397], [399], [402], [410], [418], [426], [434], [442], [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 04:10:06,839 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:10:06,839 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:10:11,367 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 04:10:31,529 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 04:10:31,530 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 04:10:31,552 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 04:10:33,463 INFO L232 lantSequenceWeakener]: Weakened 363 states. On average, predicates are now at 77.92% of their original sizes. [2018-09-19 04:10:33,463 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 04:10:33,712 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 04:10:33,712 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 04:10:33,713 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 04:10:33,713 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 04:10:33,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 04:10:33,714 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 04:10:33,714 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 04:10:33,714 INFO L87 Difference]: Start difference. First operand 2046 states and 2424 transitions. Second operand 10 states. [2018-09-19 04:10:40,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 04:10:40,443 INFO L93 Difference]: Finished difference Result 2880 states and 3695 transitions. [2018-09-19 04:10:40,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 04:10:40,444 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 365 [2018-09-19 04:10:40,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 04:10:40,455 INFO L225 Difference]: With dead ends: 2880 [2018-09-19 04:10:40,455 INFO L226 Difference]: Without dead ends: 2241 [2018-09-19 04:10:40,458 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 372 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 04:10:40,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2018-09-19 04:10:40,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2231. [2018-09-19 04:10:40,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2018-09-19 04:10:40,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2642 transitions. [2018-09-19 04:10:40,521 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2642 transitions. Word has length 365 [2018-09-19 04:10:40,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 04:10:40,522 INFO L480 AbstractCegarLoop]: Abstraction has 2231 states and 2642 transitions. [2018-09-19 04:10:40,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 04:10:40,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2642 transitions. [2018-09-19 04:10:40,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-09-19 04:10:40,530 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:10:40,530 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 04:10:40,530 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:10:40,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1492465152, now seen corresponding path program 1 times [2018-09-19 04:10:40,531 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:10:40,531 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 387 with the following transitions: [2018-09-19 04:10:40,531 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], [397], [399], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [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 04:10:40,534 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:10:40,534 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:10:45,014 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 04:10:59,508 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 04:10:59,509 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 04:10:59,516 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 04:11:01,550 INFO L232 lantSequenceWeakener]: Weakened 384 states. On average, predicates are now at 77.88% of their original sizes. [2018-09-19 04:11:01,550 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 04:11:01,971 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 04:11:01,972 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 04:11:01,972 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 04:11:01,972 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 04:11:01,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 04:11:01,973 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 04:11:01,973 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-09-19 04:11:01,973 INFO L87 Difference]: Start difference. First operand 2231 states and 2642 transitions. Second operand 14 states. [2018-09-19 04:11:14,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 04:11:14,903 INFO L93 Difference]: Finished difference Result 3661 states and 4914 transitions. [2018-09-19 04:11:14,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-19 04:11:14,904 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 386 [2018-09-19 04:11:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 04:11:14,914 INFO L225 Difference]: With dead ends: 3661 [2018-09-19 04:11:14,914 INFO L226 Difference]: Without dead ends: 2837 [2018-09-19 04:11:14,918 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 405 GetRequests, 373 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 04:11:14,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2837 states. [2018-09-19 04:11:14,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2837 to 2442. [2018-09-19 04:11:14,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2442 states. [2018-09-19 04:11:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 2905 transitions. [2018-09-19 04:11:14,992 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 2905 transitions. Word has length 386 [2018-09-19 04:11:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 04:11:14,993 INFO L480 AbstractCegarLoop]: Abstraction has 2442 states and 2905 transitions. [2018-09-19 04:11:14,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 04:11:14,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 2905 transitions. [2018-09-19 04:11:15,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-09-19 04:11:15,002 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:11:15,002 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, 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, 2, 2, 2, 2, 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 04:11:15,003 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:11:15,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1125340525, now seen corresponding path program 1 times [2018-09-19 04:11:15,003 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:11:15,003 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 444 with the following transitions: [2018-09-19 04:11:15,004 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], [397], [399], [402], [410], [418], [426], [434], [442], [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 04:11:15,007 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:11:15,007 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:11:19,517 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 04:11:47,316 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 04:11:47,316 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 04:11:47,323 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 04:11:49,479 INFO L232 lantSequenceWeakener]: Weakened 441 states. On average, predicates are now at 77.83% of their original sizes. [2018-09-19 04:11:49,480 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 04:11:49,919 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 04:11:49,920 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 04:11:49,920 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 04:11:49,920 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 04:11:49,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 04:11:49,921 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 04:11:49,921 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-09-19 04:11:49,921 INFO L87 Difference]: Start difference. First operand 2442 states and 2905 transitions. Second operand 14 states. [2018-09-19 04:11:59,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 04:11:59,397 INFO L93 Difference]: Finished difference Result 4083 states and 5187 transitions. [2018-09-19 04:11:59,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-19 04:11:59,398 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 443 [2018-09-19 04:11:59,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 04:11:59,410 INFO L225 Difference]: With dead ends: 4083 [2018-09-19 04:11:59,410 INFO L226 Difference]: Without dead ends: 3048 [2018-09-19 04:11:59,413 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 462 GetRequests, 430 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 04:11:59,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3048 states. [2018-09-19 04:11:59,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3048 to 2647. [2018-09-19 04:11:59,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2647 states. [2018-09-19 04:11:59,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 3163 transitions. [2018-09-19 04:11:59,490 INFO L78 Accepts]: Start accepts. Automaton has 2647 states and 3163 transitions. Word has length 443 [2018-09-19 04:11:59,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 04:11:59,491 INFO L480 AbstractCegarLoop]: Abstraction has 2647 states and 3163 transitions. [2018-09-19 04:11:59,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 04:11:59,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 3163 transitions. [2018-09-19 04:11:59,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-09-19 04:11:59,499 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:11:59,500 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:11:59,500 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:11:59,500 INFO L82 PathProgramCache]: Analyzing trace with hash 229849379, now seen corresponding path program 1 times [2018-09-19 04:11:59,501 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:11:59,501 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 444 with the following transitions: [2018-09-19 04:11:59,501 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], [397], [399], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [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 04:11:59,505 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:11:59,505 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:12:05,304 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-19 04:12:14,110 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-19 04:12:14,110 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-19 04:12:14,111 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 04:12:14,168 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 04:12:14,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 04:12:14 BoogieIcfgContainer [2018-09-19 04:12:14,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 04:12:14,170 INFO L168 Benchmark]: Toolchain (without parser) took 251875.54 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.8 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-09-19 04:12:14,172 INFO L168 Benchmark]: CDTParser took 0.19 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 04:12:14,172 INFO L168 Benchmark]: CACSL2BoogieTranslator took 827.80 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.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-09-19 04:12:14,173 INFO L168 Benchmark]: Boogie Procedure Inliner took 139.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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 04:12:14,175 INFO L168 Benchmark]: Boogie Preprocessor took 264.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 802.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -905.0 MB). Peak memory consumption was 33.1 MB. Max. memory is 7.1 GB. [2018-09-19 04:12:14,176 INFO L168 Benchmark]: RCFGBuilder took 3825.44 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 120.4 MB). Peak memory consumption was 120.4 MB. Max. memory is 7.1 GB. [2018-09-19 04:12:14,177 INFO L168 Benchmark]: TraceAbstraction took 246812.69 ms. Allocated memory was 2.3 GB in the beginning and 4.3 GB in the end (delta: 1.9 GB). Free memory was 2.2 GB in the beginning and 3.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 04:12:14,182 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.19 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 827.80 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.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 139.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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 264.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 802.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -905.0 MB). Peak memory consumption was 33.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3825.44 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 120.4 MB). Peak memory consumption was 120.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 246812.69 ms. Allocated memory was 2.3 GB in the beginning and 4.3 GB in the end (delta: 1.9 GB). Free memory was 2.2 GB in the beginning and 3.8 GB in the end (delta: -1.7 GB). 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: 169]: 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 TRUE ((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9)) [L169] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. UNKNOWN Result, 246.7s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 84.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2044 SDtfs, 14962 SDslu, 4089 SDs, 0 SdLazy, 26523 SolverSat, 4464 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 72.5s Time, PredicateUnifierStatistics: 18 DeclaredPredicates, 2585 GetRequests, 2378 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1322 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2647occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 143.0s AbstIntTime, 10 AbstIntIterations, 9 AbstIntStrong, 0.9955945823067707 AbsIntWeakeningRatio, 0.09720534629404617 AbsIntAvgWeakeningVarsNumRemoved, 921.7233697853381 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 1816 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_label32_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_04-12-14-201.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label32_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_04-12-14-201.csv Completed graceful shutdown