java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem16_label12_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 10:57:51,533 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 10:57:51,536 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 10:57:51,549 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 10:57:51,549 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 10:57:51,551 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 10:57:51,552 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 10:57:51,554 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 10:57:51,556 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 10:57:51,557 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 10:57:51,558 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 10:57:51,558 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 10:57:51,559 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 10:57:51,560 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 10:57:51,562 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 10:57:51,562 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 10:57:51,564 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 10:57:51,566 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 10:57:51,568 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 10:57:51,570 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 10:57:51,571 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 10:57:51,572 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 10:57:51,575 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 10:57:51,575 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 10:57:51,575 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 10:57:51,577 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 10:57:51,578 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 10:57:51,579 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 10:57:51,579 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 10:57:51,583 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 10:57:51,583 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 10:57:51,584 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 10:57:51,584 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 10:57:51,584 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 10:57:51,587 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 10:57:51,588 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 10:57:51,588 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf [2018-09-19 10:57:51,604 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 10:57:51,605 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 10:57:51,606 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 10:57:51,606 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 10:57:51,606 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 10:57:51,606 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 10:57:51,607 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-19 10:57:51,607 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 10:57:51,607 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2018-09-19 10:57:51,607 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 10:57:51,607 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 10:57:51,608 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 10:57:51,608 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 10:57:51,609 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 10:57:51,609 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 10:57:51,609 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 10:57:51,609 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 10:57:51,609 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 10:57:51,610 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 10:57:51,610 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 10:57:51,610 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 10:57:51,610 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 10:57:51,611 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 10:57:51,611 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 10:57:51,611 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 10:57:51,611 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 10:57:51,611 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 10:57:51,611 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 10:57:51,612 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 10:57:51,612 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 10:57:51,612 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 10:57:51,612 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 10:57:51,612 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 10:57:51,613 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 10:57:51,613 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 10:57:51,671 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 10:57:51,689 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 10:57:51,695 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 10:57:51,698 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 10:57:51,698 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 10:57:51,699 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label12_true-unreach-call.c [2018-09-19 10:57:52,097 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc3c801d/4f164e90190a47bfbbd10da45bae7681/FLAG4df56af51 [2018-09-19 10:57:52,475 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 10:57:52,476 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label12_true-unreach-call.c [2018-09-19 10:57:52,499 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc3c801d/4f164e90190a47bfbbd10da45bae7681/FLAG4df56af51 [2018-09-19 10:57:52,524 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc3c801d/4f164e90190a47bfbbd10da45bae7681 [2018-09-19 10:57:52,536 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 10:57:52,540 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 10:57:52,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 10:57:52,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 10:57:52,549 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 10:57:52,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 10:57:52" (1/1) ... [2018-09-19 10:57:52,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5325c081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:57:52, skipping insertion in model container [2018-09-19 10:57:52,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 10:57:52" (1/1) ... [2018-09-19 10:57:52,567 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 10:57:53,370 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 10:57:53,392 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 10:57:53,629 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 10:57:53,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:57:53 WrapperNode [2018-09-19 10:57:53,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 10:57:53,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 10:57:53,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 10:57:53,757 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 10:57:53,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:57:53" (1/1) ... [2018-09-19 10:57:53,835 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:57:53" (1/1) ... [2018-09-19 10:57:53,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 10:57:53,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 10:57:53,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 10:57:53,954 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 10:57:54,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:57:53" (1/1) ... [2018-09-19 10:57:54,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:57:53" (1/1) ... [2018-09-19 10:57:54,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:57:53" (1/1) ... [2018-09-19 10:57:54,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:57:53" (1/1) ... [2018-09-19 10:57:54,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:57:53" (1/1) ... [2018-09-19 10:57:54,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:57:53" (1/1) ... [2018-09-19 10:57:54,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:57:53" (1/1) ... [2018-09-19 10:57:54,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 10:57:54,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 10:57:54,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 10:57:54,478 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 10:57:54,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:57:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 10:57:54,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 10:57:54,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 10:57:54,566 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-09-19 10:57:54,566 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-09-19 10:57:54,566 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 10:57:54,567 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 10:57:54,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 10:57:54,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 10:57:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 10:57:54,569 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 10:58:00,951 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 10:58:00,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 10:58:00 BoogieIcfgContainer [2018-09-19 10:58:00,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 10:58:00,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 10:58:00,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 10:58:00,958 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 10:58:00,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 10:57:52" (1/3) ... [2018-09-19 10:58:00,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298f0a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 10:58:00, skipping insertion in model container [2018-09-19 10:58:00,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:57:53" (2/3) ... [2018-09-19 10:58:00,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298f0a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 10:58:00, skipping insertion in model container [2018-09-19 10:58:00,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 10:58:00" (3/3) ... [2018-09-19 10:58:00,962 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label12_true-unreach-call.c [2018-09-19 10:58:00,974 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 10:58:00,985 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 10:58:01,048 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 10:58:01,049 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 10:58:01,049 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 10:58:01,050 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 10:58:01,050 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 10:58:01,050 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 10:58:01,050 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 10:58:01,050 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 10:58:01,050 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 10:58:01,088 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-09-19 10:58:01,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-19 10:58:01,098 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:58:01,099 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] [2018-09-19 10:58:01,101 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:58:01,108 INFO L82 PathProgramCache]: Analyzing trace with hash 806508676, now seen corresponding path program 1 times [2018-09-19 10:58:01,111 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:58:01,112 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-09-19 10:58:01,116 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [447], [449], [1556], [1560], [1566], [1570], [1579], [1580], [1581], [1583] [2018-09-19 10:58:01,181 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:58:01,181 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:58:02,352 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:58:02,354 INFO L272 AbstractInterpreter]: Visited 45 different actions 45 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 10:58:02,388 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:58:03,098 INFO L232 lantSequenceWeakener]: Weakened 44 states. On average, predicates are now at 80.33% of their original sizes. [2018-09-19 10:58:03,098 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:58:03,391 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:58:03,392 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:58:03,393 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 10:58:03,393 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:58:03,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 10:58:03,407 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 10:58:03,408 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 10:58:03,411 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 6 states. [2018-09-19 10:58:12,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:58:12,035 INFO L93 Difference]: Finished difference Result 1158 states and 2145 transitions. [2018-09-19 10:58:12,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 10:58:12,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-09-19 10:58:12,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:58:12,061 INFO L225 Difference]: With dead ends: 1158 [2018-09-19 10:58:12,061 INFO L226 Difference]: Without dead ends: 746 [2018-09-19 10:58:12,073 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 10:58:12,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-09-19 10:58:12,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2018-09-19 10:58:12,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-09-19 10:58:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1075 transitions. [2018-09-19 10:58:12,201 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1075 transitions. Word has length 46 [2018-09-19 10:58:12,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:58:12,201 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 1075 transitions. [2018-09-19 10:58:12,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 10:58:12,202 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1075 transitions. [2018-09-19 10:58:12,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-19 10:58:12,211 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:58:12,212 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:58:12,212 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:58:12,212 INFO L82 PathProgramCache]: Analyzing trace with hash -392093146, now seen corresponding path program 1 times [2018-09-19 10:58:12,213 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:58:12,213 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 139 with the following transitions: [2018-09-19 10:58:12,215 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [447], [449], [452], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [760], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-19 10:58:12,229 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:58:12,229 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:58:14,351 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:58:18,259 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:58:18,259 INFO L272 AbstractInterpreter]: Visited 99 different actions 284 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:58:18,266 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:58:19,143 INFO L232 lantSequenceWeakener]: Weakened 136 states. On average, predicates are now at 78.33% of their original sizes. [2018-09-19 10:58:19,143 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:58:19,602 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:58:19,603 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:58:19,603 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 10:58:19,603 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:58:19,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 10:58:19,605 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 10:58:19,605 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 10:58:19,605 INFO L87 Difference]: Start difference. First operand 744 states and 1075 transitions. Second operand 11 states. [2018-09-19 10:58:34,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:58:34,140 INFO L93 Difference]: Finished difference Result 1772 states and 3024 transitions. [2018-09-19 10:58:34,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 10:58:34,141 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 138 [2018-09-19 10:58:34,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:58:34,154 INFO L225 Difference]: With dead ends: 1772 [2018-09-19 10:58:34,154 INFO L226 Difference]: Without dead ends: 1372 [2018-09-19 10:58:34,160 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 146 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2018-09-19 10:58:34,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2018-09-19 10:58:34,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1094. [2018-09-19 10:58:34,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-09-19 10:58:34,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1441 transitions. [2018-09-19 10:58:34,218 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1441 transitions. Word has length 138 [2018-09-19 10:58:34,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:58:34,219 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 1441 transitions. [2018-09-19 10:58:34,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 10:58:34,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1441 transitions. [2018-09-19 10:58:34,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-19 10:58:34,225 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:58:34,225 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:58:34,225 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:58:34,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1736803042, now seen corresponding path program 1 times [2018-09-19 10:58:34,226 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:58:34,226 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 175 with the following transitions: [2018-09-19 10:58:34,227 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [447], [449], [452], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [904], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-19 10:58:34,234 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:58:34,234 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:58:37,359 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:58:42,719 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:58:42,719 INFO L272 AbstractInterpreter]: Visited 135 different actions 392 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:58:42,739 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:58:43,846 INFO L232 lantSequenceWeakener]: Weakened 172 states. On average, predicates are now at 78.11% of their original sizes. [2018-09-19 10:58:43,846 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:58:44,426 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:58:44,427 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:58:44,427 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 10:58:44,427 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:58:44,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 10:58:44,428 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 10:58:44,428 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 10:58:44,429 INFO L87 Difference]: Start difference. First operand 1094 states and 1441 transitions. Second operand 11 states. [2018-09-19 10:58:57,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:58:57,747 INFO L93 Difference]: Finished difference Result 2749 states and 4050 transitions. [2018-09-19 10:58:57,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 10:58:57,753 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 174 [2018-09-19 10:58:57,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:58:57,767 INFO L225 Difference]: With dead ends: 2749 [2018-09-19 10:58:57,767 INFO L226 Difference]: Without dead ends: 1999 [2018-09-19 10:58:57,771 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 182 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-09-19 10:58:57,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2018-09-19 10:58:57,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1450. [2018-09-19 10:58:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2018-09-19 10:58:57,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 1815 transitions. [2018-09-19 10:58:57,844 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 1815 transitions. Word has length 174 [2018-09-19 10:58:57,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:58:57,845 INFO L480 AbstractCegarLoop]: Abstraction has 1450 states and 1815 transitions. [2018-09-19 10:58:57,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 10:58:57,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 1815 transitions. [2018-09-19 10:58:57,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-09-19 10:58:57,860 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:58:57,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:58:57,861 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:58:57,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1792614206, now seen corresponding path program 1 times [2018-09-19 10:58:57,861 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:58:57,862 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 287 with the following transitions: [2018-09-19 10:58:57,863 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [447], [449], [452], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1352], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-19 10:58:57,879 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:58:57,880 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:59:09,507 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:59:09,507 INFO L272 AbstractInterpreter]: Visited 247 different actions 488 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:59:09,515 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:59:10,795 INFO L232 lantSequenceWeakener]: Weakened 284 states. On average, predicates are now at 77.78% of their original sizes. [2018-09-19 10:59:10,796 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:59:11,179 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:59:11,179 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:59:11,180 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 10:59:11,180 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:59:11,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 10:59:11,181 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 10:59:11,181 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 10:59:11,181 INFO L87 Difference]: Start difference. First operand 1450 states and 1815 transitions. Second operand 13 states. [2018-09-19 10:59:26,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:59:26,952 INFO L93 Difference]: Finished difference Result 2897 states and 3954 transitions. [2018-09-19 10:59:26,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 10:59:26,954 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 286 [2018-09-19 10:59:26,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:59:26,965 INFO L225 Difference]: With dead ends: 2897 [2018-09-19 10:59:26,965 INFO L226 Difference]: Without dead ends: 1793 [2018-09-19 10:59:26,969 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 296 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2018-09-19 10:59:26,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2018-09-19 10:59:27,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1790. [2018-09-19 10:59:27,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1790 states. [2018-09-19 10:59:27,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2172 transitions. [2018-09-19 10:59:27,023 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 2172 transitions. Word has length 286 [2018-09-19 10:59:27,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:59:27,024 INFO L480 AbstractCegarLoop]: Abstraction has 1790 states and 2172 transitions. [2018-09-19 10:59:27,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 10:59:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2172 transitions. [2018-09-19 10:59:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-09-19 10:59:27,029 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:59:27,030 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:59:27,030 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:59:27,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1290886738, now seen corresponding path program 1 times [2018-09-19 10:59:27,030 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:59:27,031 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 295 with the following transitions: [2018-09-19 10:59:27,031 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [447], [449], [452], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1384], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-19 10:59:27,042 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:59:27,042 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:59:44,714 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:59:44,715 INFO L272 AbstractInterpreter]: Visited 255 different actions 752 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:59:44,723 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:59:45,952 INFO L232 lantSequenceWeakener]: Weakened 292 states. On average, predicates are now at 77.76% of their original sizes. [2018-09-19 10:59:45,952 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:59:46,391 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:59:46,391 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:59:46,391 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 10:59:46,391 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:59:46,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 10:59:46,392 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 10:59:46,392 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-19 10:59:46,393 INFO L87 Difference]: Start difference. First operand 1790 states and 2172 transitions. Second operand 14 states. [2018-09-19 11:00:02,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 11:00:02,122 INFO L93 Difference]: Finished difference Result 3242 states and 4318 transitions. [2018-09-19 11:00:02,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-19 11:00:02,128 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 294 [2018-09-19 11:00:02,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 11:00:02,138 INFO L225 Difference]: With dead ends: 3242 [2018-09-19 11:00:02,138 INFO L226 Difference]: Without dead ends: 2138 [2018-09-19 11:00:02,142 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 306 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=529, Unknown=0, NotChecked=0, Total=702 [2018-09-19 11:00:02,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2018-09-19 11:00:02,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 2132. [2018-09-19 11:00:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2018-09-19 11:00:02,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2533 transitions. [2018-09-19 11:00:02,211 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2533 transitions. Word has length 294 [2018-09-19 11:00:02,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 11:00:02,212 INFO L480 AbstractCegarLoop]: Abstraction has 2132 states and 2533 transitions. [2018-09-19 11:00:02,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 11:00:02,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2533 transitions. [2018-09-19 11:00:02,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-09-19 11:00:02,222 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 11:00:02,223 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 11:00:02,223 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 11:00:02,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1876218656, now seen corresponding path program 1 times [2018-09-19 11:00:02,225 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 11:00:02,225 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 379 with the following transitions: [2018-09-19 11:00:02,226 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [447], [449], [452], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [760], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1352], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-19 11:00:02,234 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 11:00:02,234 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 11:00:03,975 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 11:00:27,122 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 11:00:27,123 INFO L272 AbstractInterpreter]: Visited 248 different actions 983 times. Merged at 7 different actions 24 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 11:00:27,128 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 11:00:29,141 INFO L232 lantSequenceWeakener]: Weakened 376 states. On average, predicates are now at 77.68% of their original sizes. [2018-09-19 11:00:29,142 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 11:00:29,428 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 11:00:29,428 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 11:00:29,429 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 11:00:29,429 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 11:00:29,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 11:00:29,430 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 11:00:29,430 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 11:00:29,430 INFO L87 Difference]: Start difference. First operand 2132 states and 2533 transitions. Second operand 11 states. [2018-09-19 11:00:45,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 11:00:45,730 INFO L93 Difference]: Finished difference Result 4495 states and 5901 transitions. [2018-09-19 11:00:45,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-19 11:00:45,731 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 378 [2018-09-19 11:00:45,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 11:00:45,744 INFO L225 Difference]: With dead ends: 4495 [2018-09-19 11:00:45,745 INFO L226 Difference]: Without dead ends: 3049 [2018-09-19 11:00:45,750 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 388 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-09-19 11:00:45,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3049 states. [2018-09-19 11:00:45,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3049 to 2489. [2018-09-19 11:00:45,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2489 states. [2018-09-19 11:00:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 2917 transitions. [2018-09-19 11:00:45,818 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 2917 transitions. Word has length 378 [2018-09-19 11:00:45,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 11:00:45,819 INFO L480 AbstractCegarLoop]: Abstraction has 2489 states and 2917 transitions. [2018-09-19 11:00:45,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 11:00:45,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 2917 transitions. [2018-09-19 11:00:45,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-09-19 11:00:45,828 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 11:00:45,828 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 11:00:45,829 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 11:00:45,829 INFO L82 PathProgramCache]: Analyzing trace with hash 769125413, now seen corresponding path program 1 times [2018-09-19 11:00:45,829 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 11:00:45,830 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 396 with the following transitions: [2018-09-19 11:00:45,830 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [447], [449], [452], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [796], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1384], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-19 11:00:45,836 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 11:00:45,836 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 11:00:53,218 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 11:01:10,184 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 11:01:10,184 INFO L272 AbstractInterpreter]: Visited 256 different actions 1013 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 11:01:10,194 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 11:01:11,935 INFO L232 lantSequenceWeakener]: Weakened 393 states. On average, predicates are now at 77.66% of their original sizes. [2018-09-19 11:01:11,935 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 11:01:12,311 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 11:01:12,312 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 11:01:12,312 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 11:01:12,312 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 11:01:12,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 11:01:12,313 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 11:01:12,313 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 11:01:12,314 INFO L87 Difference]: Start difference. First operand 2489 states and 2917 transitions. Second operand 13 states. [2018-09-19 11:01:27,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 11:01:27,518 INFO L93 Difference]: Finished difference Result 4647 states and 5816 transitions. [2018-09-19 11:01:27,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 11:01:27,519 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 395 [2018-09-19 11:01:27,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 11:01:27,527 INFO L225 Difference]: With dead ends: 4647 [2018-09-19 11:01:27,528 INFO L226 Difference]: Without dead ends: 2844 [2018-09-19 11:01:27,533 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 405 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2018-09-19 11:01:27,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2018-09-19 11:01:27,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 2833. [2018-09-19 11:01:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2833 states. [2018-09-19 11:01:27,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2833 states to 2833 states and 3297 transitions. [2018-09-19 11:01:27,603 INFO L78 Accepts]: Start accepts. Automaton has 2833 states and 3297 transitions. Word has length 395 [2018-09-19 11:01:27,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 11:01:27,604 INFO L480 AbstractCegarLoop]: Abstraction has 2833 states and 3297 transitions. [2018-09-19 11:01:27,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 11:01:27,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2833 states and 3297 transitions. [2018-09-19 11:01:27,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-09-19 11:01:27,610 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 11:01:27,611 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 11:01:27,611 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 11:01:27,612 INFO L82 PathProgramCache]: Analyzing trace with hash -637896744, now seen corresponding path program 1 times [2018-09-19 11:01:27,612 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 11:01:27,612 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 415 with the following transitions: [2018-09-19 11:01:27,612 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [447], [449], [452], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [904], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1352], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-19 11:01:27,618 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 11:01:27,618 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 11:01:30,099 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 11:01:50,587 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 11:01:50,588 INFO L272 AbstractInterpreter]: Visited 248 different actions 983 times. Merged at 7 different actions 24 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 11:01:50,596 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 11:01:52,215 INFO L232 lantSequenceWeakener]: Weakened 412 states. On average, predicates are now at 77.64% of their original sizes. [2018-09-19 11:01:52,215 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 11:01:52,494 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 11:01:52,494 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 11:01:52,495 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 11:01:52,495 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 11:01:52,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 11:01:52,496 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 11:01:52,496 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 11:01:52,496 INFO L87 Difference]: Start difference. First operand 2833 states and 3297 transitions. Second operand 11 states. [2018-09-19 11:02:10,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 11:02:10,681 INFO L93 Difference]: Finished difference Result 6453 states and 8031 transitions. [2018-09-19 11:02:10,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-19 11:02:10,693 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 414 [2018-09-19 11:02:10,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 11:02:10,708 INFO L225 Difference]: With dead ends: 6453 [2018-09-19 11:02:10,708 INFO L226 Difference]: Without dead ends: 4306 [2018-09-19 11:02:10,713 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 424 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-09-19 11:02:10,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4306 states. [2018-09-19 11:02:10,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4306 to 3188. [2018-09-19 11:02:10,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2018-09-19 11:02:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 3680 transitions. [2018-09-19 11:02:10,810 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 3680 transitions. Word has length 414 [2018-09-19 11:02:10,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 11:02:10,811 INFO L480 AbstractCegarLoop]: Abstraction has 3188 states and 3680 transitions. [2018-09-19 11:02:10,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 11:02:10,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 3680 transitions. [2018-09-19 11:02:10,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-09-19 11:02:10,818 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 11:02:10,819 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 11:02:10,819 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 11:02:10,819 INFO L82 PathProgramCache]: Analyzing trace with hash 680644076, now seen corresponding path program 1 times [2018-09-19 11:02:10,819 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 11:02:10,820 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 453 with the following transitions: [2018-09-19 11:02:10,820 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [447], [449], [452], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1024], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1384], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-09-19 11:02:10,825 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 11:02:10,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) Received shutdown request... [2018-09-19 11:02:12,369 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-19 11:02:12,370 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-19 11:02:12,371 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 11:02:12,436 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 11:02:12,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 11:02:12 BoogieIcfgContainer [2018-09-19 11:02:12,437 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 11:02:12,438 INFO L168 Benchmark]: Toolchain (without parser) took 259900.58 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -391.1 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-09-19 11:02:12,440 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 11:02:12,440 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1214.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. [2018-09-19 11:02:12,441 INFO L168 Benchmark]: Boogie Procedure Inliner took 197.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-19 11:02:12,442 INFO L168 Benchmark]: Boogie Preprocessor took 522.98 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 839.9 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -987.3 MB). Peak memory consumption was 61.1 MB. Max. memory is 7.1 GB. [2018-09-19 11:02:12,443 INFO L168 Benchmark]: RCFGBuilder took 6475.48 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 260.3 MB). Peak memory consumption was 260.3 MB. Max. memory is 7.1 GB. [2018-09-19 11:02:12,444 INFO L168 Benchmark]: TraceAbstraction took 251482.95 ms. Allocated memory was 2.4 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 1.8 GB in the end (delta: 209.1 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-09-19 11:02:12,450 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.51 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 1214.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 197.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 522.98 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 839.9 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -987.3 MB). Peak memory consumption was 61.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6475.48 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 260.3 MB). Peak memory consumption was 260.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251482.95 ms. Allocated memory was 2.4 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 1.8 GB in the end (delta: 209.1 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 124]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L8] int inputB = 2; [L9] int inputE = 5; [L10] int inputD = 4; [L11] int inputF = 6; [L12] int inputC = 3; [L13] int inputA = 1; [L16] int a15 = 3; [L17] int a18 = -87; [L18] int a16 = 11; [L19] int a12 = 5; [L1770] int output = -1; [L1773] COND TRUE 1 [L1776] int input; [L1777] input = __VERIFIER_nondet_int() [L1778] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1781] CALL, EXPR calculate_output(input) [L24] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L27] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==9))) [L30] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L33] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L36] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==6))) [L39] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==9))) [L42] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L45] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==5))) [L48] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L51] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==7))) [L54] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==6))) [L57] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L60] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==8))) [L63] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L66] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L69] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L72] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L75] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L78] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L81] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==8))) [L84] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L87] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L90] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L93] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L96] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L99] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L102] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==7))) [L105] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L108] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==8))) [L111] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==6))) [L114] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L117] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L120] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L123] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L126] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L129] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L132] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L135] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L138] COND FALSE !(((((a16==11) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L141] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==7))) [L144] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L147] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L150] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L153] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L156] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L159] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==9))) [L162] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L165] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L168] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L171] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L174] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L177] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L180] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L183] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L186] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L189] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==5))) [L192] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==5))) [L195] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L198] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L201] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L204] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L208] COND FALSE !(((a15==3) && ((a16==12) && ((input == 6) && ((((a12==7) && 134 < a18 ) || ( a18 <= -156 && (a12==8))) || ((a12==8) && ((-156 < a18) && (-79 >= a18)) )))))) [L213] COND FALSE !(((((a15==3) && ((a12==7) && (input == 3))) && (a16==12)) && ((-156 < a18) && (-79 >= a18)) )) [L218] COND FALSE !(((((input == 2) && (((a12==7) && ((-156 < a18) && (-79 >= a18)) ) || (((a12==6) && 134 < a18 ) || ((a12==7) && a18 <= -156 )))) && (a16==9)) && (a15==4))) [L223] COND FALSE !(((a15==4) && ((((input == 1) && ( ((-79 < a18) && (134 >= a18)) || 134 < a18 )) && (a16==10)) && (a12==5)))) [L229] COND FALSE !(((a16==8) && ((a15==4) && ((a12==8) && ((input == 4) && ((-79 < a18) && (134 >= a18)) ))))) [L235] COND FALSE !((((a12==8) && ((a15==4) && ( ((-79 < a18) && (134 >= a18)) && (input == 1)))) && (a16==8))) [L240] COND FALSE !((( ((-79 < a18) && (134 >= a18)) && ((a16==12) && ((a15==3) && (input == 6)))) && (a12==7))) [L246] COND FALSE !((((a12==7) && ((( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 6)) && (a16==11))) && (a15==3))) [L252] COND FALSE !((((a12==5) && (((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 ) && (input == 5)) && (a15==4))) && (a16==8))) [L257] COND FALSE !(((a12==5) && ((((input == 1) && (a16==8)) && a18 <= -156 ) && (a15==4)))) [L262] COND FALSE !((( ((-156 < a18) && (-79 >= a18)) && (((a15==3) && (input == 5)) && (a12==7))) && (a16==12))) [L268] COND FALSE !((((((input == 3) && (a16==8)) && (a12==7)) && ((-79 < a18) && (134 >= a18)) ) && (a15==4))) [L274] COND FALSE !(((a16==10) && ((a12==5) && (((input == 3) && ((-156 < a18) && (-79 >= a18)) ) && (a15==4))))) [L279] COND FALSE !(((((a16==8) && ((a12==6) && (input == 2))) && a18 <= -156 ) && (a15==4))) [L285] COND FALSE !((((a15==4) && ((a12==5) && (( 134 < a18 || ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (input == 4)))) && (a16==8))) [L290] COND FALSE !((((a12==8) && ((a15==4) && ((input == 3) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))) && (a16==9))) [L297] COND FALSE !((((((a16==12) && (input == 1)) && (a12==9)) && 134 < a18 ) && (a15==3))) [L303] COND FALSE !(((((a15==4) && ((input == 1) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ))) && (a16==9)) && (a12==5))) [L309] COND FALSE !(( 134 < a18 && ((a12==6) && ((a16==10) && ((input == 1) && (a15==4)))))) [L315] COND FALSE !((((a12==6) && ( a18 <= -156 && ((a16==8) && (input == 1)))) && (a15==4))) [L321] COND FALSE !(((a15==3) && ((a16==12) && ((((a12==8) && 134 < a18 ) || ( a18 <= -156 && (a12==9))) && (input == 1))))) [L327] COND FALSE !(((a16==12) && ((a12==9) && ((a15==3) && ((input == 2) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L333] COND FALSE !(((((a16==11) && ((input == 5) && ((-156 < a18) && (-79 >= a18)) )) && (a15==3)) && (a12==5))) [L338] COND FALSE !(((a16==9) && ((((input == 3) && (a15==4)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9)))) [L345] COND FALSE !(((((( ((-156 < a18) && (-79 >= a18)) && (a12==8)) || (( 134 < a18 && (a12==7)) || ( a18 <= -156 && (a12==8)))) && (input == 3)) && (a15==3)) && (a16==12))) [L350] COND FALSE !(((a16==11) && (((a12==8) && ((input == 1) && (a15==3))) && a18 <= -156 ))) [L356] COND FALSE !((((((((a12==7) && 134 < a18 ) || ((a12==8) && a18 <= -156 )) || ( ((-156 < a18) && (-79 >= a18)) && (a12==8))) && (input == 4)) && (a15==3)) && (a16==12))) [L361] COND FALSE !((((a15==4) && (((input == 3) && ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (a12==7))) && (a16==8))) [L367] COND FALSE !(((a16==8) && ((( ((-79 < a18) && (134 >= a18)) && (input == 3)) && (a12==9)) && (a15==4)))) [L373] COND FALSE !(((a16==8) && ((a12==6) && ((a15==4) && ((input == 2) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))))) [L380] COND FALSE !((((a16==12) && (((( 134 < a18 && (a12==7)) || ( a18 <= -156 && (a12==8))) || ((a12==8) && ((-156 < a18) && (-79 >= a18)) )) && (input == 1))) && (a15==3))) [L386] COND FALSE !(((a15==3) && (((( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 6)) && (a16==11)) && (a12==5)))) [L391] COND FALSE !(((a15==4) && ((a12==8) && ((a16==9) && ((input == 5) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))))) [L398] COND FALSE !(( ((-79 < a18) && (134 >= a18)) && (((a16==8) && ((a15==4) && (input == 1))) && (a12==9)))) [L404] COND FALSE !(((a16==9) && (((input == 3) && ((((a12==6) && 134 < a18 ) || ((a12==7) && a18 <= -156 )) || ( ((-156 < a18) && (-79 >= a18)) && (a12==7)))) && (a15==4)))) [L411] COND FALSE !((((input == 1) && (((( ((-79 < a18) && (134 >= a18)) && (a16==11)) && (a12==9)) || (( 134 < a18 && (a16==11)) && (a12==9))) || (( a18 <= -156 && (a16==12)) && (a12==5)))) && (a15==3))) [L417] COND FALSE !(((a15==4) && ((a12==6) && ((a16==8) && ((input == 3) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))))) [L424] COND FALSE !(((a15==3) && ((a16==12) && ((a12==5) && ((input == 1) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L427] COND FALSE !((((a16==10) && (((input == 2) && ( ((-79 < a18) && (134 >= a18)) || 134 < a18 )) && (a15==4))) && (a12==5))) [L434] COND FALSE !(((a16==11) && ((a15==3) && (((a12==8) && (input == 5)) && a18 <= -156 )))) [L440] COND FALSE !((((a16==8) && (((input == 4) && (a15==4)) && (a12==5))) && a18 <= -156 )) [L443] COND FALSE !(((a16==8) && (((((a12==9) && ((-156 < a18) && (-79 >= a18)) ) || (( 134 < a18 && (a12==8)) || ( a18 <= -156 && (a12==9)))) && (input == 3)) && (a15==4)))) [L449] COND FALSE !((((((a12==5) && (input == 6)) && (a16==12)) && 134 < a18 ) && (a15==3))) [L454] COND FALSE !(((a15==4) && ((a16==9) && ((a12==6) && ((input == 5) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L457] COND FALSE !((((a15==3) && ((a16==11) && ((input == 3) && (a12==8)))) && a18 <= -156 )) [L463] COND FALSE !(((a15==3) && (( ((-79 < a18) && (134 >= a18)) && ((a16==12) && (input == 2))) && (a12==7)))) [L469] COND FALSE !(((((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 6)) && (a16==12)) && (a15==3)) && (a12==9))) [L476] COND FALSE !(((a12==9) && ((((input == 6) && a18 <= -156 ) && (a16==9)) && (a15==4)))) [L483] COND FALSE !(((a12==6) && ((a15==4) && (( 134 < a18 && (input == 3)) && (a16==10))))) [L489] COND FALSE !(((((( ((-79 < a18) && (134 >= a18)) || ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (input == 2)) && (a12==6)) && (a16==12)) && (a15==3))) [L495] COND FALSE !(((a12==8) && ((((input == 2) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (a16==11)) && (a15==3)))) [L501] COND FALSE !(((a16==10) && ((a15==4) && ((a12==5) && ((input == 3) && ( ((-79 < a18) && (134 >= a18)) || 134 < a18 )))))) [L508] COND FALSE !(((a15==4) && ((a16==9) && ((input == 2) && (((a12==5) && 134 < a18 ) || ( a18 <= -156 && (a12==6))))))) [L515] COND FALSE !(((((( 134 < a18 && (a12==8)) || ( a18 <= -156 && (a12==9))) && (input == 5)) && (a15==3)) && (a16==12))) [L521] COND FALSE !(((a16==11) && ((a15==3) && ((( ((-156 < a18) && (-79 >= a18)) && (a12==7)) || (( 134 < a18 && (a12==6)) || ( a18 <= -156 && (a12==7)))) && (input == 3))))) [L527] COND FALSE !(((a15==4) && ((((input == 4) && a18 <= -156 ) && (a12==9)) && (a16==9)))) [L533] COND FALSE !(((a15==4) && (((a12==5) && ((input == 5) && a18 <= -156 )) && (a16==8)))) [L538] COND FALSE !((((((input == 2) && (a12==5)) && ((-156 < a18) && (-79 >= a18)) ) && (a15==4)) && (a16==10))) [L543] COND FALSE !((((a15==3) && ((a12==5) && ((input == 6) && (a16==11)))) && ((-156 < a18) && (-79 >= a18)) )) [L548] COND FALSE !((((a15==4) && ((a16==9) && ((input == 6) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))) && (a12==8))) [L554] COND FALSE !(((a16==11) && ((a15==3) && ((input == 3) && (((a12==9) && ((-156 < a18) && (-79 >= a18)) ) || (( 134 < a18 && (a12==8)) || ((a12==9) && a18 <= -156 ))))))) [L560] COND FALSE !(((((a12==6) && ((( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ) || ((-79 < a18) && (134 >= a18)) ) && (input == 1))) && (a15==4)) && (a16==10))) [L567] COND FALSE !(((a15==4) && (((( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ) && (input == 6)) && (a12==7)) && (a16==8)))) [L573] COND FALSE !(((a12==6) && ((a15==3) && (((input == 6) && (( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ) || ((-79 < a18) && (134 >= a18)) )) && (a16==12))))) [L578] COND FALSE !((((a15==4) && ( ((-79 < a18) && (134 >= a18)) && ((input == 5) && (a12==9)))) && (a16==8))) [L584] COND FALSE !(((a16==8) && ((((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 ) && (input == 3)) && (a12==5)) && (a15==4)))) [L589] COND FALSE !(((a16==12) && ((a12==5) && ((a15==3) && ((input == 6) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L594] COND FALSE !((((a12==7) && ((a15==4) && ((input == 4) && ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )))) && (a16==8))) [L600] COND FALSE !(((((input == 4) && (((a12==9) && ((-156 < a18) && (-79 >= a18)) ) || (( 134 < a18 && (a12==8)) || ( a18 <= -156 && (a12==9))))) && (a16==8)) && (a15==4))) [L606] COND FALSE !((((a12==5) && ( ((-156 < a18) && (-79 >= a18)) && ((a15==4) && (input == 6)))) && (a16==10))) [L612] COND FALSE !(((a15==4) && ( ((-79 < a18) && (134 >= a18)) && (((input == 3) && (a12==8)) && (a16==8))))) [L618] COND FALSE !((((a15==4) && ((input == 3) && (((a12==8) && ((-156 < a18) && (-79 >= a18)) ) || (( 134 < a18 && (a12==7)) || ((a12==8) && a18 <= -156 ))))) && (a16==8))) [L624] COND FALSE !(((a15==4) && ((a16==9) && ((( ((-156 < a18) && (-79 >= a18)) && (a12==7)) || (((a12==6) && 134 < a18 ) || ((a12==7) && a18 <= -156 ))) && (input == 4))))) [L631] COND FALSE !(((a16==8) && (( a18 <= -156 && ((input == 5) && (a15==4))) && (a12==6)))) [L636] COND FALSE !(((a16==8) && (((( 134 < a18 || ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (input == 6)) && (a15==4)) && (a12==5)))) [L641] COND FALSE !(((( ((-79 < a18) && (134 >= a18)) && ((input == 4) && (a15==3))) && (a16==12)) && (a12==8))) [L648] COND FALSE !(((((((a12==9) && ((a16==9) && ((-79 < a18) && (134 >= a18)) )) || ((a12==9) && ((a16==9) && 134 < a18 ))) || ((a12==5) && ((a16==10) && a18 <= -156 ))) && (input == 6)) && (a15==4))) [L655] COND FALSE !(((a12==9) && ((a15==4) && (((input == 4) && (a16==8)) && ((-79 < a18) && (134 >= a18)) )))) [L661] COND FALSE !(((((a16==12) && ((a15==3) && (input == 6))) && (a12==9)) && 134 < a18 )) [L664] COND FALSE !(((a12==7) && ((a15==4) && (( ((-79 < a18) && (134 >= a18)) && (input == 1)) && (a16==8))))) [L670] COND FALSE !(((a15==4) && ((((input == 5) && 134 < a18 ) && (a16==10)) && (a12==6)))) [L677] COND FALSE !((((a15==3) && (((input == 2) && (a12==9)) && 134 < a18 )) && (a16==12))) [L680] COND FALSE !(((((( 134 < a18 && (a12==8)) || ((a12==9) && a18 <= -156 )) && (input == 3)) && (a15==3)) && (a16==12))) [L686] COND FALSE !((((((a16==11) && (input == 2)) && (a15==3)) && (a12==5)) && ((-156 < a18) && (-79 >= a18)) )) [L691] COND FALSE !(((a12==5) && ((a16==12) && (((input == 3) && (a15==3)) && 134 < a18 )))) [L696] COND FALSE !((((a15==4) && ((a12==6) && ((input == 5) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))) && (a16==8))) [L703] COND FALSE !(((((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 5)) && (a15==3)) && (a12==5)) && (a16==12))) [L706] COND FALSE !((((a12==9) && (((a15==3) && (input == 4)) && 134 < a18 )) && (a16==12))) [L712] COND FALSE !(((a15==3) && ((a16==11) && ((a12==5) && (( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 1)))))) [L717] COND FALSE !(((a15==4) && ((((a12==9) && (input == 3)) && a18 <= -156 ) && (a16==9)))) [L723] COND FALSE !(((a12==5) && ((a15==4) && (((input == 1) && (a16==10)) && ((-156 < a18) && (-79 >= a18)) )))) [L728] COND FALSE !(((((a16==9) && ((input == 2) && (a15==4))) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L734] COND FALSE !((((a12==5) && ((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 2)) && (a16==9))) && (a15==4))) [L741] COND FALSE !(((a15==3) && ((a16==11) && (((((a12==6) && 134 < a18 ) || ( a18 <= -156 && (a12==7))) || ( ((-156 < a18) && (-79 >= a18)) && (a12==7))) && (input == 6))))) [L746] COND FALSE !((((a12==8) && ((a16==11) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 3)))) && (a15==3))) [L752] COND FALSE !(((a16==12) && (( 134 < a18 && ((a12==9) && (input == 3))) && (a15==3)))) [L758] COND FALSE !(((((a12==8) && (( 134 < a18 || ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (input == 4))) && (a15==4)) && (a16==9))) [L763] COND FALSE !(((((((a16==12) && a18 <= -156 ) && (a12==5)) || (((a12==9) && ((a16==11) && ((-79 < a18) && (134 >= a18)) )) || ((a12==9) && ((a16==11) && 134 < a18 )))) && (input == 5)) && (a15==3))) [L769] COND FALSE !(((a16==12) && (((a15==3) && ((input == 3) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ))) && (a12==9)))) [L775] COND FALSE !((((((input == 4) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (a16==12)) && (a12==5)) && (a15==3))) [L778] COND FALSE !(((a15==3) && (((( a18 <= -156 && (a16==12)) && (a12==5)) || ((( ((-79 < a18) && (134 >= a18)) && (a16==11)) && (a12==9)) || (( 134 < a18 && (a16==11)) && (a12==9)))) && (input == 2)))) [L784] COND FALSE !((((a12==6) && ((a15==4) && (( ((-79 < a18) && (134 >= a18)) || ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (input == 5)))) && (a16==10))) [L789] COND FALSE !(((a15==4) && ((a16==9) && (((input == 5) && a18 <= -156 ) && (a12==9))))) [L796] COND FALSE !(((a15==3) && ((a12==9) && ((a16==12) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 4)))))) [L802] COND FALSE !((((((input == 2) && a18 <= -156 ) && (a16==9)) && (a15==4)) && (a12==9))) [L808] COND FALSE !((((((a12==9) && ((a16==8) && 134 < a18 )) || (( a18 <= -156 && (a16==9)) && (a12==5))) && (input == 4)) && (a15==4))) [L815] COND FALSE !(((a12==5) && ((a16==10) && (((input == 6) && ( ((-79 < a18) && (134 >= a18)) || 134 < a18 )) && (a15==4))))) [L822] COND FALSE !(((((input == 6) && (((a12==9) && ((-156 < a18) && (-79 >= a18)) ) || (((a12==8) && 134 < a18 ) || ( a18 <= -156 && (a12==9))))) && (a16==8)) && (a15==4))) [L828] COND FALSE !(((a15==3) && (((a12==8) && ((input == 5) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ))) && (a16==11)))) [L834] COND FALSE !(((a16==12) && ((a15==3) && (((((a12==7) && 134 < a18 ) || ((a12==8) && a18 <= -156 )) || ( ((-156 < a18) && (-79 >= a18)) && (a12==8))) && (input == 2))))) [L840] COND FALSE !(((a15==3) && ((((((a12==8) && 134 < a18 ) || ((a12==9) && a18 <= -156 )) || ((a12==9) && ((-156 < a18) && (-79 >= a18)) )) && (input == 6)) && (a16==11)))) [L846] COND FALSE !(((((a16==8) && ((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 ) && (input == 1))) && (a15==4)) && (a12==5))) [L851] COND FALSE !(((a12==8) && ((a16==11) && ((a15==3) && ((input == 1) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L857] COND FALSE !(((((input == 1) && (((a12==9) && ((-156 < a18) && (-79 >= a18)) ) || (( 134 < a18 && (a12==8)) || ((a12==9) && a18 <= -156 )))) && (a15==3)) && (a16==11))) [L863] COND FALSE !((((((( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ) || ((-79 < a18) && (134 >= a18)) ) && (input == 1)) && (a12==6)) && (a15==3)) && (a16==11))) [L869] COND FALSE !(((((a12==8) && ((input == 2) && (a16==8))) && ((-79 < a18) && (134 >= a18)) ) && (a15==4))) [L875] COND FALSE !(((a15==4) && ((((((a12==6) && 134 < a18 ) || ((a12==7) && a18 <= -156 )) || ( ((-156 < a18) && (-79 >= a18)) && (a12==7))) && (input == 5)) && (a16==9)))) [L882] COND FALSE !((((((input == 4) && (a15==3)) && a18 <= -156 ) && (a12==8)) && (a16==11))) [L888] COND FALSE !((((a16==11) && (((a15==3) && (input == 2)) && a18 <= -156 )) && (a12==8))) [L894] COND FALSE !(( ((-79 < a18) && (134 >= a18)) && ((a15==4) && (((a16==8) && (input == 4)) && (a12==7))))) [L899] COND FALSE !(((a16==12) && ((((input == 1) && ((-79 < a18) && (134 >= a18)) ) && (a15==3)) && (a12==8)))) [L905] COND FALSE !((((a15==4) && ((((a12==5) && 134 < a18 ) || ((a12==6) && a18 <= -156 )) && (input == 3))) && (a16==9))) [L912] COND FALSE !(((((a16==12) && ( 134 < a18 && (input == 4))) && (a15==3)) && (a12==5))) [L917] COND FALSE !(( ((-156 < a18) && (-79 >= a18)) && ((a15==3) && ((a12==5) && ((a16==11) && (input == 3)))))) [L922] COND FALSE !((((a15==4) && ((((a12==5) && 134 < a18 ) || ((a12==6) && a18 <= -156 )) && (input == 1))) && (a16==9))) [L929] COND FALSE !(((a15==3) && ((a16==12) && ((input == 4) && (((a12==8) && 134 < a18 ) || ((a12==9) && a18 <= -156 )))))) [L935] COND FALSE !(((a16==12) && ( ((-156 < a18) && (-79 >= a18)) && (((a12==7) && (input == 1)) && (a15==3))))) [L942] COND FALSE !(((( ((-79 < a18) && (134 >= a18)) && ((a12==7) && (input == 2))) && (a16==8)) && (a15==4))) [L948] COND FALSE !((((a12==7) && ( ((-79 < a18) && (134 >= a18)) && ((a15==4) && (input == 6)))) && (a16==8))) [L954] COND FALSE !(((a16==10) && ((((input == 4) && (a12==5)) && (a15==4)) && ((-156 < a18) && (-79 >= a18)) ))) [L961] COND FALSE !((((a16==12) && ((( 134 < a18 && (a12==6)) || ((a12==7) && a18 <= -156 )) && (input == 1))) && (a15==3))) [L967] COND FALSE !(((a12==5) && (((a16==10) && (( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 4))) && (a15==4)))) [L974] COND FALSE !(((a16==12) && (((((a12==6) && 134 < a18 ) || ( a18 <= -156 && (a12==7))) && (input == 5)) && (a15==3)))) [L979] COND FALSE !((((a16==9) && ((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 3)) && (a12==6))) && (a15==4))) [L986] COND FALSE !(((a16==9) && ((a15==4) && ((input == 3) && (( a18 <= -156 && (a12==8)) || (( ((-79 < a18) && (134 >= a18)) && (a12==7)) || ( 134 < a18 && (a12==7)))))))) [L993] COND FALSE !(((a15==4) && (((input == 5) && ((((a12==7) && 134 < a18 ) || ( a18 <= -156 && (a12==8))) || ((a12==8) && ((-156 < a18) && (-79 >= a18)) ))) && (a16==8)))) [L999] COND FALSE !(((a16==9) && (((a15==4) && ((input == 1) && a18 <= -156 )) && (a12==9)))) [L1005] COND FALSE !(((a12==6) && ((a16==9) && ((a15==4) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 6)))))) [L1011] COND FALSE !(((a15==4) && ((a16==10) && (((input == 4) && (( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ) || ((-79 < a18) && (134 >= a18)) )) && (a12==6))))) [L1018] COND FALSE !(((((input == 5) && (((a12==8) && a18 <= -156 ) || (( ((-79 < a18) && (134 >= a18)) && (a12==7)) || ( 134 < a18 && (a12==7))))) && (a15==4)) && (a16==9))) [L1025] COND FALSE !(((a16==12) && ( ((-79 < a18) && (134 >= a18)) && (((input == 2) && (a15==3)) && (a12==8))))) [L1031] COND FALSE !(((a15==3) && (((a12==5) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 2))) && (a16==12)))) [L1036] COND FALSE !((((a12==7) && ((a15==3) && (( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 2)))) && (a16==11))) [L1042] COND FALSE !(((a12==6) && ((a15==3) && ((a16==12) && (( ((-79 < a18) && (134 >= a18)) || ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (input == 1)))))) [L1048] COND FALSE !((((a15==4) && ((input == 6) && (((a12==7) && ((-156 < a18) && (-79 >= a18)) ) || (( 134 < a18 && (a12==6)) || ((a12==7) && a18 <= -156 ))))) && (a16==9))) [L1055] COND FALSE !((((a15==3) && ((a16==12) && ((input == 5) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))) && (a12==9))) [L1061] COND FALSE !(((a15==4) && (((( a18 <= -156 && (a16==10)) && (a12==5)) || ((((a16==9) && ((-79 < a18) && (134 >= a18)) ) && (a12==9)) || (( 134 < a18 && (a16==9)) && (a12==9)))) && (input == 4)))) [L1067] COND FALSE !(((a15==3) && ((((a16==12) && (input == 1)) && (a12==7)) && ((-79 < a18) && (134 >= a18)) ))) [L1073] COND FALSE !(((a15==4) && (((a16==9) && ((input == 4) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ))) && (a12==5)))) [L1079] COND FALSE !(((a15==4) && ((input == 3) && ((((a16==10) && a18 <= -156 ) && (a12==5)) || (((a12==9) && ( ((-79 < a18) && (134 >= a18)) && (a16==9))) || ((a12==9) && ((a16==9) && 134 < a18 ))))))) [L1086] COND FALSE !((((a15==3) && ((( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 1)) && (a12==7))) && (a16==11))) [L1092] COND FALSE !((((a12==5) && ( 134 < a18 && ((a16==12) && (input == 2)))) && (a15==3))) [L1097] COND FALSE !((((input == 1) && ((((a16==8) && 134 < a18 ) && (a12==9)) || (((a16==9) && a18 <= -156 ) && (a12==5)))) && (a15==4))) [L1103] COND FALSE !(((a12==6) && (((a15==3) && ((input == 5) && (( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ) || ((-79 < a18) && (134 >= a18)) ))) && (a16==12)))) [L1109] COND FALSE !((((a12==6) && ((( ((-79 < a18) && (134 >= a18)) || ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (input == 5)) && (a16==11))) && (a15==3))) [L1114] COND FALSE !(((a16==12) && ((a15==3) && (( ((-79 < a18) && (134 >= a18)) && (input == 5)) && (a12==8))))) [L1120] COND FALSE !(((a12==6) && ((a16==11) && ((( ((-79 < a18) && (134 >= a18)) || ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (input == 6)) && (a15==3))))) [L1125] COND FALSE !(((a12==8) && ((a15==3) && ( ((-79 < a18) && (134 >= a18)) && ((input == 3) && (a16==12)))))) [L1131] COND FALSE !((((a15==4) && (((input == 6) && (a16==8)) && (a12==9))) && ((-79 < a18) && (134 >= a18)) )) [L1137] COND FALSE !((((a16==9) && ((a12==5) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 3)))) && (a15==4))) [L1143] COND FALSE !(((a15==4) && (((a12==6) && ((input == 3) && (a16==8))) && a18 <= -156 ))) [L1149] COND FALSE !(((a16==8) && ((a15==4) && ((a12==6) && ((input == 6) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))))) [L1155] COND FALSE !((((a16==9) && (((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 ) && (input == 2)) && (a15==4))) && (a12==8))) [L1160] COND FALSE !(((a12==5) && (((a16==9) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 6))) && (a15==4)))) [L1166] COND FALSE !((((( a18 <= -156 && (input == 4)) && (a15==4)) && (a12==6)) && (a16==8))) [L1172] COND FALSE !(((a12==6) && (((a16==10) && ((input == 4) && 134 < a18 )) && (a15==4)))) [L1175] COND FALSE !((((a15==3) && ((input == 6) && (( 134 < a18 && (a12==6)) || ((a12==7) && a18 <= -156 )))) && (a16==12))) [L1181] COND FALSE !(((((a15==4) && ((input == 1) && ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ))) && (a12==7)) && (a16==8))) [L1187] COND FALSE !(((a15==3) && ((a16==11) && ((( ((-156 < a18) && (-79 >= a18)) && (a12==7)) || (((a12==6) && 134 < a18 ) || ( a18 <= -156 && (a12==7)))) && (input == 4))))) [L1193] COND FALSE !((((input == 5) && ((((a12==9) && ( ((-79 < a18) && (134 >= a18)) && (a16==9))) || (((a16==9) && 134 < a18 ) && (a12==9))) || (( a18 <= -156 && (a16==10)) && (a12==5)))) && (a15==4))) [L1200] COND FALSE !(((a12==5) && ((a16==11) && (((input == 1) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) )))) [L1205] COND FALSE !(((a16==8) && (((input == 1) && ((( 134 < a18 && (a12==7)) || ((a12==8) && a18 <= -156 )) || ( ((-156 < a18) && (-79 >= a18)) && (a12==8)))) && (a15==4)))) [L1211] COND FALSE !(((a16==9) && ((((input == 2) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (a15==4)) && (a12==6)))) [L1214] COND FALSE !(((a16==11) && ((a15==3) && (((input == 3) && (( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ) || ((-79 < a18) && (134 >= a18)) )) && (a12==6))))) [L1220] COND FALSE !(((a15==4) && ((input == 5) && (((a12==9) && ((a16==8) && 134 < a18 )) || (((a16==9) && a18 <= -156 ) && (a12==5)))))) [L1227] COND FALSE !(((a15==4) && ((input == 2) && ((( 134 < a18 && (a16==8)) && (a12==9)) || ((a12==5) && ((a16==9) && a18 <= -156 )))))) [L1234] COND FALSE !(((((a12==6) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 1))) && (a16==9)) && (a15==4))) [L1241] COND FALSE !(((a15==3) && (((input == 4) && (( 134 < a18 && (a12==6)) || ( a18 <= -156 && (a12==7)))) && (a16==12)))) [L1247] COND TRUE ( ((-156 < a18) && (-79 >= a18)) && (((a12==5) && ((input == 4) && (a15==3))) && (a16==11))) [L1248] a18 = ((((a18 - -196) - -3) - 306144) + 306115) [L1249] RET return 21; [L1781] EXPR calculate_output(input) [L1781] output = calculate_output(input) [L1773] COND TRUE 1 [L1776] int input; [L1777] input = __VERIFIER_nondet_int() [L1778] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1781] CALL, EXPR calculate_output(input) [L24] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L27] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==9))) [L30] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L33] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L36] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==6))) [L39] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==9))) [L42] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L45] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==5))) [L48] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L51] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==7))) [L54] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==6))) [L57] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L60] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==8))) [L63] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L66] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L69] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L72] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L75] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L78] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L81] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==8))) [L84] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L87] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L90] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L93] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L96] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L99] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L102] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==7))) [L105] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L108] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==8))) [L111] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==6))) [L114] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L117] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L120] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L123] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L126] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L129] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L132] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L135] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L138] COND FALSE !(((((a16==11) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L141] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==7))) [L144] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L147] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L150] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L153] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L156] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L159] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==9))) [L162] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L165] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L168] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L171] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L174] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L177] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L180] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L183] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==5))) [L186] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==7))) [L189] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==5))) [L192] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==5))) [L195] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L198] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L201] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L204] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L208] COND FALSE !(((a15==3) && ((a16==12) && ((input == 6) && ((((a12==7) && 134 < a18 ) || ( a18 <= -156 && (a12==8))) || ((a12==8) && ((-156 < a18) && (-79 >= a18)) )))))) [L213] COND FALSE !(((((a15==3) && ((a12==7) && (input == 3))) && (a16==12)) && ((-156 < a18) && (-79 >= a18)) )) [L218] COND FALSE !(((((input == 2) && (((a12==7) && ((-156 < a18) && (-79 >= a18)) ) || (((a12==6) && 134 < a18 ) || ((a12==7) && a18 <= -156 )))) && (a16==9)) && (a15==4))) [L223] COND FALSE !(((a15==4) && ((((input == 1) && ( ((-79 < a18) && (134 >= a18)) || 134 < a18 )) && (a16==10)) && (a12==5)))) [L229] COND FALSE !(((a16==8) && ((a15==4) && ((a12==8) && ((input == 4) && ((-79 < a18) && (134 >= a18)) ))))) [L235] COND FALSE !((((a12==8) && ((a15==4) && ( ((-79 < a18) && (134 >= a18)) && (input == 1)))) && (a16==8))) [L240] COND FALSE !((( ((-79 < a18) && (134 >= a18)) && ((a16==12) && ((a15==3) && (input == 6)))) && (a12==7))) [L246] COND FALSE !((((a12==7) && ((( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 6)) && (a16==11))) && (a15==3))) [L252] COND FALSE !((((a12==5) && (((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 ) && (input == 5)) && (a15==4))) && (a16==8))) [L257] COND FALSE !(((a12==5) && ((((input == 1) && (a16==8)) && a18 <= -156 ) && (a15==4)))) [L262] COND FALSE !((( ((-156 < a18) && (-79 >= a18)) && (((a15==3) && (input == 5)) && (a12==7))) && (a16==12))) [L268] COND FALSE !((((((input == 3) && (a16==8)) && (a12==7)) && ((-79 < a18) && (134 >= a18)) ) && (a15==4))) [L274] COND FALSE !(((a16==10) && ((a12==5) && (((input == 3) && ((-156 < a18) && (-79 >= a18)) ) && (a15==4))))) [L279] COND FALSE !(((((a16==8) && ((a12==6) && (input == 2))) && a18 <= -156 ) && (a15==4))) [L285] COND FALSE !((((a15==4) && ((a12==5) && (( 134 < a18 || ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (input == 4)))) && (a16==8))) [L290] COND FALSE !((((a12==8) && ((a15==4) && ((input == 3) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))) && (a16==9))) [L297] COND FALSE !((((((a16==12) && (input == 1)) && (a12==9)) && 134 < a18 ) && (a15==3))) [L303] COND FALSE !(((((a15==4) && ((input == 1) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ))) && (a16==9)) && (a12==5))) [L309] COND FALSE !(( 134 < a18 && ((a12==6) && ((a16==10) && ((input == 1) && (a15==4)))))) [L315] COND FALSE !((((a12==6) && ( a18 <= -156 && ((a16==8) && (input == 1)))) && (a15==4))) [L321] COND FALSE !(((a15==3) && ((a16==12) && ((((a12==8) && 134 < a18 ) || ( a18 <= -156 && (a12==9))) && (input == 1))))) [L327] COND FALSE !(((a16==12) && ((a12==9) && ((a15==3) && ((input == 2) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L333] COND FALSE !(((((a16==11) && ((input == 5) && ((-156 < a18) && (-79 >= a18)) )) && (a15==3)) && (a12==5))) [L338] COND FALSE !(((a16==9) && ((((input == 3) && (a15==4)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9)))) [L345] COND FALSE !(((((( ((-156 < a18) && (-79 >= a18)) && (a12==8)) || (( 134 < a18 && (a12==7)) || ( a18 <= -156 && (a12==8)))) && (input == 3)) && (a15==3)) && (a16==12))) [L350] COND FALSE !(((a16==11) && (((a12==8) && ((input == 1) && (a15==3))) && a18 <= -156 ))) [L356] COND FALSE !((((((((a12==7) && 134 < a18 ) || ((a12==8) && a18 <= -156 )) || ( ((-156 < a18) && (-79 >= a18)) && (a12==8))) && (input == 4)) && (a15==3)) && (a16==12))) [L361] COND FALSE !((((a15==4) && (((input == 3) && ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (a12==7))) && (a16==8))) [L367] COND FALSE !(((a16==8) && ((( ((-79 < a18) && (134 >= a18)) && (input == 3)) && (a12==9)) && (a15==4)))) [L373] COND FALSE !(((a16==8) && ((a12==6) && ((a15==4) && ((input == 2) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))))) [L380] COND FALSE !((((a16==12) && (((( 134 < a18 && (a12==7)) || ( a18 <= -156 && (a12==8))) || ((a12==8) && ((-156 < a18) && (-79 >= a18)) )) && (input == 1))) && (a15==3))) [L386] COND FALSE !(((a15==3) && (((( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 6)) && (a16==11)) && (a12==5)))) [L391] COND FALSE !(((a15==4) && ((a12==8) && ((a16==9) && ((input == 5) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))))) [L398] COND FALSE !(( ((-79 < a18) && (134 >= a18)) && (((a16==8) && ((a15==4) && (input == 1))) && (a12==9)))) [L404] COND FALSE !(((a16==9) && (((input == 3) && ((((a12==6) && 134 < a18 ) || ((a12==7) && a18 <= -156 )) || ( ((-156 < a18) && (-79 >= a18)) && (a12==7)))) && (a15==4)))) [L411] COND FALSE !((((input == 1) && (((( ((-79 < a18) && (134 >= a18)) && (a16==11)) && (a12==9)) || (( 134 < a18 && (a16==11)) && (a12==9))) || (( a18 <= -156 && (a16==12)) && (a12==5)))) && (a15==3))) [L417] COND FALSE !(((a15==4) && ((a12==6) && ((a16==8) && ((input == 3) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))))) [L424] COND FALSE !(((a15==3) && ((a16==12) && ((a12==5) && ((input == 1) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L427] COND FALSE !((((a16==10) && (((input == 2) && ( ((-79 < a18) && (134 >= a18)) || 134 < a18 )) && (a15==4))) && (a12==5))) [L434] COND FALSE !(((a16==11) && ((a15==3) && (((a12==8) && (input == 5)) && a18 <= -156 )))) [L440] COND FALSE !((((a16==8) && (((input == 4) && (a15==4)) && (a12==5))) && a18 <= -156 )) [L443] COND FALSE !(((a16==8) && (((((a12==9) && ((-156 < a18) && (-79 >= a18)) ) || (( 134 < a18 && (a12==8)) || ( a18 <= -156 && (a12==9)))) && (input == 3)) && (a15==4)))) [L449] COND FALSE !((((((a12==5) && (input == 6)) && (a16==12)) && 134 < a18 ) && (a15==3))) [L454] COND FALSE !(((a15==4) && ((a16==9) && ((a12==6) && ((input == 5) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L457] COND FALSE !((((a15==3) && ((a16==11) && ((input == 3) && (a12==8)))) && a18 <= -156 )) [L463] COND FALSE !(((a15==3) && (( ((-79 < a18) && (134 >= a18)) && ((a16==12) && (input == 2))) && (a12==7)))) [L469] COND FALSE !(((((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 6)) && (a16==12)) && (a15==3)) && (a12==9))) [L476] COND FALSE !(((a12==9) && ((((input == 6) && a18 <= -156 ) && (a16==9)) && (a15==4)))) [L483] COND FALSE !(((a12==6) && ((a15==4) && (( 134 < a18 && (input == 3)) && (a16==10))))) [L489] COND FALSE !(((((( ((-79 < a18) && (134 >= a18)) || ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )) && (input == 2)) && (a12==6)) && (a16==12)) && (a15==3))) [L495] COND FALSE !(((a12==8) && ((((input == 2) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (a16==11)) && (a15==3)))) [L501] COND FALSE !(((a16==10) && ((a15==4) && ((a12==5) && ((input == 3) && ( ((-79 < a18) && (134 >= a18)) || 134 < a18 )))))) [L508] COND FALSE !(((a15==4) && ((a16==9) && ((input == 2) && (((a12==5) && 134 < a18 ) || ( a18 <= -156 && (a12==6))))))) [L515] COND FALSE !(((((( 134 < a18 && (a12==8)) || ( a18 <= -156 && (a12==9))) && (input == 5)) && (a15==3)) && (a16==12))) [L521] COND FALSE !(((a16==11) && ((a15==3) && ((( ((-156 < a18) && (-79 >= a18)) && (a12==7)) || (( 134 < a18 && (a12==6)) || ( a18 <= -156 && (a12==7)))) && (input == 3))))) [L527] COND FALSE !(((a15==4) && ((((input == 4) && a18 <= -156 ) && (a12==9)) && (a16==9)))) [L533] COND FALSE !(((a15==4) && (((a12==5) && ((input == 5) && a18 <= -156 )) && (a16==8)))) [L538] COND FALSE !((((((input == 2) && (a12==5)) && ((-156 < a18) && (-79 >= a18)) ) && (a15==4)) && (a16==10))) [L543] COND FALSE !((((a15==3) && ((a12==5) && ((input == 6) && (a16==11)))) && ((-156 < a18) && (-79 >= a18)) )) [L548] COND FALSE !((((a15==4) && ((a16==9) && ((input == 6) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))) && (a12==8))) [L554] COND FALSE !(((a16==11) && ((a15==3) && ((input == 3) && (((a12==9) && ((-156 < a18) && (-79 >= a18)) ) || (( 134 < a18 && (a12==8)) || ((a12==9) && a18 <= -156 ))))))) [L560] COND FALSE !(((((a12==6) && ((( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ) || ((-79 < a18) && (134 >= a18)) ) && (input == 1))) && (a15==4)) && (a16==10))) [L567] COND FALSE !(((a15==4) && (((( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ) && (input == 6)) && (a12==7)) && (a16==8)))) [L573] COND FALSE !(((a12==6) && ((a15==3) && (((input == 6) && (( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) ) || ((-79 < a18) && (134 >= a18)) )) && (a16==12))))) [L578] COND FALSE !((((a15==4) && ( ((-79 < a18) && (134 >= a18)) && ((input == 5) && (a12==9)))) && (a16==8))) [L584] COND FALSE !(((a16==8) && ((((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 ) && (input == 3)) && (a12==5)) && (a15==4)))) [L589] COND FALSE !(((a16==12) && ((a12==5) && ((a15==3) && ((input == 6) && ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )))))) [L594] COND FALSE !((((a12==7) && ((a15==4) && ((input == 4) && ( a18 <= -156 || ((-156 < a18) && (-79 >= a18)) )))) && (a16==8))) [L600] COND FALSE !(((((input == 4) && (((a12==9) && ((-156 < a18) && (-79 >= a18)) ) || (( 134 < a18 && (a12==8)) || ( a18 <= -156 && (a12==9))))) && (a16==8)) && (a15==4))) [L606] COND FALSE !((((a12==5) && ( ((-156 < a18) && (-79 >= a18)) && ((a15==4) && (input == 6)))) && (a16==10))) [L612] COND FALSE !(((a15==4) && ( ((-79 < a18) && (134 >= a18)) && (((input == 3) && (a12==8)) && (a16==8))))) [L618] COND FALSE !((((a15==4) && ((input == 3) && (((a12==8) && ((-156 < a18) && (-79 >= a18)) ) || (( 134 < a18 && (a12==7)) || ((a12==8) && a18 <= -156 ))))) && (a16==8))) [L624] COND FALSE !(((a15==4) && ((a16==9) && ((( ((-156 < a18) && (-79 >= a18)) && (a12==7)) || (((a12==6) && 134 < a18 ) || ((a12==7) && a18 <= -156 ))) && (input == 4))))) [L631] COND FALSE !(((a16==8) && (( a18 <= -156 && ((input == 5) && (a15==4))) && (a12==6)))) [L636] COND FALSE !(((a16==8) && (((( 134 < a18 || ( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) )) && (input == 6)) && (a15==4)) && (a12==5)))) [L641] COND FALSE !(((( ((-79 < a18) && (134 >= a18)) && ((input == 4) && (a15==3))) && (a16==12)) && (a12==8))) [L648] COND FALSE !(((((((a12==9) && ((a16==9) && ((-79 < a18) && (134 >= a18)) )) || ((a12==9) && ((a16==9) && 134 < a18 ))) || ((a12==5) && ((a16==10) && a18 <= -156 ))) && (input == 6)) && (a15==4))) [L655] COND FALSE !(((a12==9) && ((a15==4) && (((input == 4) && (a16==8)) && ((-79 < a18) && (134 >= a18)) )))) [L661] COND FALSE !(((((a16==12) && ((a15==3) && (input == 6))) && (a12==9)) && 134 < a18 )) [L664] COND FALSE !(((a12==7) && ((a15==4) && (( ((-79 < a18) && (134 >= a18)) && (input == 1)) && (a16==8))))) [L670] COND FALSE !(((a15==4) && ((((input == 5) && 134 < a18 ) && (a16==10)) && (a12==6)))) [L677] COND FALSE !((((a15==3) && (((input == 2) && (a12==9)) && 134 < a18 )) && (a16==12))) [L680] COND FALSE !(((((( 134 < a18 && (a12==8)) || ((a12==9) && a18 <= -156 )) && (input == 3)) && (a15==3)) && (a16==12))) [L686] COND FALSE !((((((a16==11) && (input == 2)) && (a15==3)) && (a12==5)) && ((-156 < a18) && (-79 >= a18)) )) [L691] COND FALSE !(((a12==5) && ((a16==12) && (((input == 3) && (a15==3)) && 134 < a18 )))) [L696] COND FALSE !((((a15==4) && ((a12==6) && ((input == 5) && (( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) || 134 < a18 )))) && (a16==8))) [L703] COND FALSE !(((((( ((-156 < a18) && (-79 >= a18)) || ((-79 < a18) && (134 >= a18)) ) && (input == 5)) && (a15==3)) && (a12==5)) && (a16==12))) [L706] COND FALSE !((((a12==9) && (((a15==3) && (input == 4)) && 134 < a18 )) && (a16==12))) [L712] COND TRUE ((a15==3) && ((a16==11) && ((a12==5) && (( ((-79 < a18) && (134 >= a18)) || 134 < a18 ) && (input == 1))))) [L713] a18 = (((((a18 * 9)/ 10) % 106)- -28) + 1) [L714] a12 = 7 [L716] RET return 26; [L1781] EXPR calculate_output(input) [L1781] output = calculate_output(input) [L1773] COND TRUE 1 [L1776] int input; [L1777] input = __VERIFIER_nondet_int() [L1778] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1781] CALL calculate_output(input) [L24] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L27] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==9))) [L30] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L33] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L36] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==6))) [L39] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==9))) [L42] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==7))) [L45] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==5))) [L48] COND FALSE !(((((a16==10) && (a15==3)) && a18 <= -156 ) && (a12==8))) [L51] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==7))) [L54] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==6))) [L57] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==7))) [L60] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==8))) [L63] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==6))) [L66] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==9))) [L69] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L72] COND FALSE !(((((a16==8) && (a15==3)) && a18 <= -156 ) && (a12==9))) [L75] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L78] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==5))) [L81] COND FALSE !(((((a16==10) && (a15==3)) && 134 < a18 ) && (a12==8))) [L84] COND FALSE !(((((a16==8) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L87] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L90] COND FALSE !(((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L93] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8))) [L96] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==6))) [L99] COND FALSE !(((((a16==9) && (a15==3)) && a18 <= -156 ) && (a12==6))) [L102] COND FALSE !(((((a16==8) && (a15==3)) && 134 < a18 ) && (a12==7))) [L105] COND FALSE !(((((a16==10) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L108] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==8))) [L111] COND FALSE !(((((a16==9) && (a15==3)) && 134 < a18 ) && (a12==6))) [L114] COND FALSE !(((((a16==9) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==9))) [L117] COND FALSE !(((((a16==10) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==8))) [L120] COND FALSE !(((((a16==9) && (a15==3)) && ((-79 < a18) && (134 >= a18)) ) && (a12==5))) [L123] COND TRUE ((((a16==8) && (a15==3)) && ((-156 < a18) && (-79 >= a18)) ) && (a12==8)) [L124] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 410 locations, 1 error locations. UNKNOWN Result, 251.3s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 117.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3183 SDtfs, 14954 SDslu, 3535 SDs, 0 SdLazy, 38321 SolverSat, 4107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 104.9s Time, PredicateUnifierStatistics: 16 DeclaredPredicates, 2192 GetRequests, 2043 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3188occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 118.9s AbstIntTime, 9 AbstIntIterations, 8 AbstIntStrong, 0.9962637765799541 AbsIntWeakeningRatio, 0.0812470477090222 AbsIntAvgWeakeningVarsNumRemoved, 903.764761454889 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 2527 StatesRemovedByMinimization, 8 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/Problem16_label12_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_11-02-12-471.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem16_label12_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_11-02-12-471.csv Completed graceful shutdown