java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label55_false-unreach-call.c


--------------------------------------------------------------------------------


This is Ultimate 0.1.23-1dbac8b
[2018-10-26 19:03:30,398 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-10-26 19:03:30,404 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-10-26 19:03:30,421 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-10-26 19:03:30,421 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-10-26 19:03:30,423 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-10-26 19:03:30,424 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-10-26 19:03:30,426 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-10-26 19:03:30,428 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-10-26 19:03:30,429 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-10-26 19:03:30,433 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-10-26 19:03:30,433 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-10-26 19:03:30,434 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-10-26 19:03:30,438 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-10-26 19:03:30,439 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-10-26 19:03:30,440 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-10-26 19:03:30,441 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-10-26 19:03:30,443 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-10-26 19:03:30,445 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-10-26 19:03:30,446 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-10-26 19:03:30,447 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-10-26 19:03:30,448 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-10-26 19:03:30,450 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-10-26 19:03:30,450 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-10-26 19:03:30,451 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-10-26 19:03:30,451 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-10-26 19:03:30,452 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-10-26 19:03:30,453 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-10-26 19:03:30,454 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-10-26 19:03:30,455 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-10-26 19:03:30,455 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-10-26 19:03:30,456 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-10-26 19:03:30,456 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-10-26 19:03:30,456 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-10-26 19:03:30,457 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-10-26 19:03:30,458 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-10-26 19:03:30,458 INFO  L98         SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf
[2018-10-26 19:03:30,483 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-10-26 19:03:30,483 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-10-26 19:03:30,486 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-10-26 19:03:30,486 INFO  L133        SettingsManager]:  * to procedures, called more than once=true
[2018-10-26 19:03:30,487 INFO  L131        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-10-26 19:03:30,487 INFO  L133        SettingsManager]:  * Create parallel compositions if possible=false
[2018-10-26 19:03:30,487 INFO  L133        SettingsManager]:  * Use SBE=true
[2018-10-26 19:03:30,488 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-10-26 19:03:30,488 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-10-26 19:03:30,488 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-10-26 19:03:30,488 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2018-10-26 19:03:30,488 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-10-26 19:03:30,489 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2018-10-26 19:03:30,489 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2018-10-26 19:03:30,489 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2018-10-26 19:03:30,489 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-10-26 19:03:30,489 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-10-26 19:03:30,490 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-10-26 19:03:30,490 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-10-26 19:03:30,490 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-10-26 19:03:30,490 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-10-26 19:03:30,490 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-10-26 19:03:30,491 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-10-26 19:03:30,491 INFO  L133        SettingsManager]:  * Trace refinement strategy=CAMEL
[2018-10-26 19:03:30,491 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-10-26 19:03:30,491 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-10-26 19:03:30,491 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-10-26 19:03:30,492 INFO  L133        SettingsManager]:  * To the following directory=dump/
[2018-10-26 19:03:30,542 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-10-26 19:03:30,560 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-10-26 19:03:30,564 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-10-26 19:03:30,566 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-10-26 19:03:30,566 INFO  L276        PluginConnector]: CDTParser initialized
[2018-10-26 19:03:30,567 INFO  L418   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label55_false-unreach-call.c
[2018-10-26 19:03:30,636 INFO  L218              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/bcdf3ba4a/68e9c84aca0f45fead996949b7340409/FLAG065109026
[2018-10-26 19:03:31,171 INFO  L298              CDTParser]: Found 1 translation units.
[2018-10-26 19:03:31,175 INFO  L158              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label55_false-unreach-call.c
[2018-10-26 19:03:31,200 INFO  L346              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/bcdf3ba4a/68e9c84aca0f45fead996949b7340409/FLAG065109026
[2018-10-26 19:03:31,225 INFO  L354              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/bcdf3ba4a/68e9c84aca0f45fead996949b7340409
[2018-10-26 19:03:31,239 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-10-26 19:03:31,242 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2018-10-26 19:03:31,244 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-10-26 19:03:31,247 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-10-26 19:03:31,251 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-10-26 19:03:31,252 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:03:31" (1/1) ...
[2018-10-26 19:03:31,256 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ea74f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:03:31, skipping insertion in model container
[2018-10-26 19:03:31,256 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:03:31" (1/1) ...
[2018-10-26 19:03:31,269 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2018-10-26 19:03:31,356 INFO  L174         MainTranslator]: Built tables and reachable declarations
[2018-10-26 19:03:31,868 INFO  L202          PostProcessor]: Analyzing one entry point: main
[2018-10-26 19:03:31,873 INFO  L189         MainTranslator]: Completed pre-run
[2018-10-26 19:03:32,032 INFO  L202          PostProcessor]: Analyzing one entry point: main
[2018-10-26 19:03:32,053 INFO  L193         MainTranslator]: Completed translation
[2018-10-26 19:03:32,054 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:03:32 WrapperNode
[2018-10-26 19:03:32,054 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-10-26 19:03:32,055 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-10-26 19:03:32,055 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-10-26 19:03:32,055 INFO  L276        PluginConnector]: Boogie Procedure Inliner initialized
[2018-10-26 19:03:32,067 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:03:32" (1/1) ...
[2018-10-26 19:03:32,095 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:03:32" (1/1) ...
[2018-10-26 19:03:32,293 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-10-26 19:03:32,293 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-10-26 19:03:32,294 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-10-26 19:03:32,294 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-10-26 19:03:32,305 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:03:32" (1/1) ...
[2018-10-26 19:03:32,305 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:03:32" (1/1) ...
[2018-10-26 19:03:32,318 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:03:32" (1/1) ...
[2018-10-26 19:03:32,318 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:03:32" (1/1) ...
[2018-10-26 19:03:32,357 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:03:32" (1/1) ...
[2018-10-26 19:03:32,377 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:03:32" (1/1) ...
[2018-10-26 19:03:32,388 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:03:32" (1/1) ...
[2018-10-26 19:03:32,399 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-10-26 19:03:32,400 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-10-26 19:03:32,400 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-10-26 19:03:32,400 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-10-26 19:03:32,401 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:03:32" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 19:03:32,476 INFO  L130     BoogieDeclarations]: Found specification of procedure exit
[2018-10-26 19:03:32,476 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-10-26 19:03:32,476 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-10-26 19:03:35,785 INFO  L341             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-10-26 19:03:35,786 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:03:35 BoogieIcfgContainer
[2018-10-26 19:03:35,786 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-10-26 19:03:35,787 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-10-26 19:03:35,787 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-10-26 19:03:35,791 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-10-26 19:03:35,791 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:03:31" (1/3) ...
[2018-10-26 19:03:35,792 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a5abdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:03:35, skipping insertion in model container
[2018-10-26 19:03:35,792 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:03:32" (2/3) ...
[2018-10-26 19:03:35,793 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a5abdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:03:35, skipping insertion in model container
[2018-10-26 19:03:35,793 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:03:35" (3/3) ...
[2018-10-26 19:03:35,795 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem10_label55_false-unreach-call.c
[2018-10-26 19:03:35,806 INFO  L136   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-10-26 19:03:35,815 INFO  L148   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2018-10-26 19:03:35,833 INFO  L257      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2018-10-26 19:03:35,870 INFO  L135   ementStrategyFactory]: Using default assertion order modulation
[2018-10-26 19:03:35,871 INFO  L382      AbstractCegarLoop]: Interprodecural is true
[2018-10-26 19:03:35,871 INFO  L383      AbstractCegarLoop]: Hoare is true
[2018-10-26 19:03:35,871 INFO  L384      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-10-26 19:03:35,871 INFO  L385      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-10-26 19:03:35,872 INFO  L386      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-10-26 19:03:35,872 INFO  L387      AbstractCegarLoop]: Difference is false
[2018-10-26 19:03:35,872 INFO  L388      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-10-26 19:03:35,872 INFO  L393      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-10-26 19:03:35,895 INFO  L276                IsEmpty]: Start isEmpty. Operand 207 states.
[2018-10-26 19:03:35,902 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-10-26 19:03:35,903 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 19:03:35,904 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-26 19:03:35,907 INFO  L424      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 19:03:35,912 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 19:03:35,912 INFO  L82        PathProgramCache]: Analyzing trace with hash -686802918, now seen corresponding path program 1 times
[2018-10-26 19:03:35,914 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-26 19:03:35,914 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-26 19:03:35,959 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 19:03:35,959 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 19:03:35,960 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 19:03:36,010 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 19:03:36,221 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-26 19:03:36,223 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-26 19:03:36,224 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-10-26 19:03:36,228 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-10-26 19:03:36,240 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-10-26 19:03:36,241 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-10-26 19:03:36,244 INFO  L87              Difference]: Start difference. First operand 207 states. Second operand 4 states.
[2018-10-26 19:03:38,916 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-26 19:03:38,917 INFO  L93              Difference]: Finished difference Result 713 states and 1265 transitions.
[2018-10-26 19:03:38,917 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2018-10-26 19:03:38,919 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 19
[2018-10-26 19:03:38,920 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-26 19:03:38,943 INFO  L225             Difference]: With dead ends: 713
[2018-10-26 19:03:38,943 INFO  L226             Difference]: Without dead ends: 499
[2018-10-26 19:03:38,948 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-10-26 19:03:38,966 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 499 states.
[2018-10-26 19:03:39,013 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 344.
[2018-10-26 19:03:39,014 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 344 states.
[2018-10-26 19:03:39,016 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 599 transitions.
[2018-10-26 19:03:39,018 INFO  L78                 Accepts]: Start accepts. Automaton has 344 states and 599 transitions. Word has length 19
[2018-10-26 19:03:39,018 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-26 19:03:39,019 INFO  L481      AbstractCegarLoop]: Abstraction has 344 states and 599 transitions.
[2018-10-26 19:03:39,019 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-10-26 19:03:39,019 INFO  L276                IsEmpty]: Start isEmpty. Operand 344 states and 599 transitions.
[2018-10-26 19:03:39,022 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2018-10-26 19:03:39,022 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 19:03:39,023 INFO  L375         BasicCegarLoop]: trace histogram [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]
[2018-10-26 19:03:39,023 INFO  L424      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 19:03:39,023 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 19:03:39,024 INFO  L82        PathProgramCache]: Analyzing trace with hash 1054909102, now seen corresponding path program 1 times
[2018-10-26 19:03:39,024 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-26 19:03:39,024 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-26 19:03:39,026 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 19:03:39,026 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 19:03:39,026 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 19:03:39,091 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 19:03:39,382 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-26 19:03:39,383 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-26 19:03:39,383 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-10-26 19:03:39,385 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-10-26 19:03:39,385 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-10-26 19:03:39,386 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-10-26 19:03:39,386 INFO  L87              Difference]: Start difference. First operand 344 states and 599 transitions. Second operand 4 states.
[2018-10-26 19:03:41,112 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-26 19:03:41,112 INFO  L93              Difference]: Finished difference Result 1246 states and 2268 transitions.
[2018-10-26 19:03:41,120 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2018-10-26 19:03:41,120 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 86
[2018-10-26 19:03:41,121 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-26 19:03:41,128 INFO  L225             Difference]: With dead ends: 1246
[2018-10-26 19:03:41,128 INFO  L226             Difference]: Without dead ends: 904
[2018-10-26 19:03:41,131 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-10-26 19:03:41,135 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 904 states.
[2018-10-26 19:03:41,190 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904.
[2018-10-26 19:03:41,191 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 904 states.
[2018-10-26 19:03:41,195 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1415 transitions.
[2018-10-26 19:03:41,195 INFO  L78                 Accepts]: Start accepts. Automaton has 904 states and 1415 transitions. Word has length 86
[2018-10-26 19:03:41,196 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-26 19:03:41,196 INFO  L481      AbstractCegarLoop]: Abstraction has 904 states and 1415 transitions.
[2018-10-26 19:03:41,196 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-10-26 19:03:41,196 INFO  L276                IsEmpty]: Start isEmpty. Operand 904 states and 1415 transitions.
[2018-10-26 19:03:41,201 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2018-10-26 19:03:41,202 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 19:03:41,202 INFO  L375         BasicCegarLoop]: trace histogram [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]
[2018-10-26 19:03:41,202 INFO  L424      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 19:03:41,202 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 19:03:41,203 INFO  L82        PathProgramCache]: Analyzing trace with hash -947602477, now seen corresponding path program 1 times
[2018-10-26 19:03:41,203 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-26 19:03:41,203 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-26 19:03:41,204 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 19:03:41,204 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 19:03:41,204 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 19:03:41,232 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 19:03:41,629 WARN  L179               SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22
[2018-10-26 19:03:41,751 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-26 19:03:41,752 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-26 19:03:41,752 INFO  L225   ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-26 19:03:41,766 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 19:03:41,816 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 19:03:41,828 INFO  L273         TraceCheckSpWp]: Computing forward predicates...
[2018-10-26 19:03:41,996 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2018-10-26 19:03:42,031 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-10-26 19:03:42,031 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6
[2018-10-26 19:03:42,032 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-10-26 19:03:42,033 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-10-26 19:03:42,033 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42
[2018-10-26 19:03:42,033 INFO  L87              Difference]: Start difference. First operand 904 states and 1415 transitions. Second operand 7 states.
[2018-10-26 19:03:47,092 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-26 19:03:47,092 INFO  L93              Difference]: Finished difference Result 3766 states and 6014 transitions.
[2018-10-26 19:03:47,093 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2018-10-26 19:03:47,093 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 103
[2018-10-26 19:03:47,093 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-26 19:03:47,109 INFO  L225             Difference]: With dead ends: 3766
[2018-10-26 19:03:47,110 INFO  L226             Difference]: Without dead ends: 2864
[2018-10-26 19:03:47,112 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56
[2018-10-26 19:03:47,115 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2864 states.
[2018-10-26 19:03:47,177 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 2864.
[2018-10-26 19:03:47,178 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2864 states.
[2018-10-26 19:03:47,191 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2864 states and 4219 transitions.
[2018-10-26 19:03:47,191 INFO  L78                 Accepts]: Start accepts. Automaton has 2864 states and 4219 transitions. Word has length 103
[2018-10-26 19:03:47,192 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-26 19:03:47,192 INFO  L481      AbstractCegarLoop]: Abstraction has 2864 states and 4219 transitions.
[2018-10-26 19:03:47,192 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-10-26 19:03:47,192 INFO  L276                IsEmpty]: Start isEmpty. Operand 2864 states and 4219 transitions.
[2018-10-26 19:03:47,207 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 234
[2018-10-26 19:03:47,207 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 19:03:47,210 INFO  L375         BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 19:03:47,210 INFO  L424      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 19:03:47,210 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 19:03:47,211 INFO  L82        PathProgramCache]: Analyzing trace with hash -1535513089, now seen corresponding path program 1 times
[2018-10-26 19:03:47,211 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-26 19:03:47,211 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-26 19:03:47,212 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 19:03:47,212 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 19:03:47,212 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 19:03:47,271 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 19:03:47,706 INFO  L134       CoverageAnalysis]: Checked inductivity of 108 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-26 19:03:47,706 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-26 19:03:47,706 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-10-26 19:03:47,707 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-10-26 19:03:47,707 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-10-26 19:03:47,707 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2018-10-26 19:03:47,708 INFO  L87              Difference]: Start difference. First operand 2864 states and 4219 transitions. Second operand 5 states.
[2018-10-26 19:03:51,178 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-26 19:03:51,178 INFO  L93              Difference]: Finished difference Result 6006 states and 8926 transitions.
[2018-10-26 19:03:51,184 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-10-26 19:03:51,184 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 233
[2018-10-26 19:03:51,186 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-26 19:03:51,193 INFO  L225             Difference]: With dead ends: 6006
[2018-10-26 19:03:51,193 INFO  L226             Difference]: Without dead ends: 1405
[2018-10-26 19:03:51,199 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2018-10-26 19:03:51,200 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1405 states.
[2018-10-26 19:03:51,223 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1265.
[2018-10-26 19:03:51,224 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1265 states.
[2018-10-26 19:03:51,226 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1538 transitions.
[2018-10-26 19:03:51,227 INFO  L78                 Accepts]: Start accepts. Automaton has 1265 states and 1538 transitions. Word has length 233
[2018-10-26 19:03:51,227 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-26 19:03:51,227 INFO  L481      AbstractCegarLoop]: Abstraction has 1265 states and 1538 transitions.
[2018-10-26 19:03:51,227 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-10-26 19:03:51,228 INFO  L276                IsEmpty]: Start isEmpty. Operand 1265 states and 1538 transitions.
[2018-10-26 19:03:51,231 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 250
[2018-10-26 19:03:51,231 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 19:03:51,232 INFO  L375         BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 19:03:51,232 INFO  L424      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 19:03:51,232 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 19:03:51,232 INFO  L82        PathProgramCache]: Analyzing trace with hash 1235761703, now seen corresponding path program 1 times
[2018-10-26 19:03:51,232 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-26 19:03:51,233 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-26 19:03:51,233 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 19:03:51,234 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 19:03:51,234 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 19:03:51,255 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 19:03:51,551 INFO  L134       CoverageAnalysis]: Checked inductivity of 124 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2018-10-26 19:03:51,551 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-26 19:03:51,551 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-10-26 19:03:51,552 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-10-26 19:03:51,552 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-10-26 19:03:51,552 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-10-26 19:03:51,553 INFO  L87              Difference]: Start difference. First operand 1265 states and 1538 transitions. Second operand 4 states.
[2018-10-26 19:03:54,594 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-26 19:03:54,594 INFO  L93              Difference]: Finished difference Result 2388 states and 2926 transitions.
[2018-10-26 19:03:54,598 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2018-10-26 19:03:54,598 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 249
[2018-10-26 19:03:54,599 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-26 19:03:54,604 INFO  L225             Difference]: With dead ends: 2388
[2018-10-26 19:03:54,605 INFO  L226             Difference]: Without dead ends: 1265
[2018-10-26 19:03:54,606 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-10-26 19:03:54,608 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1265 states.
[2018-10-26 19:03:54,630 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1265.
[2018-10-26 19:03:54,630 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1265 states.
[2018-10-26 19:03:54,632 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1458 transitions.
[2018-10-26 19:03:54,633 INFO  L78                 Accepts]: Start accepts. Automaton has 1265 states and 1458 transitions. Word has length 249
[2018-10-26 19:03:54,633 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-26 19:03:54,633 INFO  L481      AbstractCegarLoop]: Abstraction has 1265 states and 1458 transitions.
[2018-10-26 19:03:54,633 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-10-26 19:03:54,634 INFO  L276                IsEmpty]: Start isEmpty. Operand 1265 states and 1458 transitions.
[2018-10-26 19:03:54,639 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 270
[2018-10-26 19:03:54,639 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 19:03:54,640 INFO  L375         BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 19:03:54,640 INFO  L424      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 19:03:54,640 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 19:03:54,641 INFO  L82        PathProgramCache]: Analyzing trace with hash -463560359, now seen corresponding path program 1 times
[2018-10-26 19:03:54,641 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-26 19:03:54,641 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-26 19:03:54,642 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 19:03:54,642 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 19:03:54,642 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 19:03:54,708 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-10-26 19:03:54,762 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-10-26 19:03:54,837 INFO  L442         BasicCegarLoop]: Counterexample might be feasible
[2018-10-26 19:03:55,028 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 07:03:55 BoogieIcfgContainer
[2018-10-26 19:03:55,028 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-10-26 19:03:55,029 INFO  L168              Benchmark]: Toolchain (without parser) took 23789.97 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB.
[2018-10-26 19:03:55,030 INFO  L168              Benchmark]: CDTParser took 0.23 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-10-26 19:03:55,031 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 811.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB.
[2018-10-26 19:03:55,033 INFO  L168              Benchmark]: Boogie Procedure Inliner took 238.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -825.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB.
[2018-10-26 19:03:55,034 INFO  L168              Benchmark]: Boogie Preprocessor took 105.87 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-10-26 19:03:55,034 INFO  L168              Benchmark]: RCFGBuilder took 3386.48 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.2 MB). Peak memory consumption was 105.2 MB. Max. memory is 7.1 GB.
[2018-10-26 19:03:55,036 INFO  L168              Benchmark]: TraceAbstraction took 19241.17 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 356.5 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -391.5 MB). There was no memory consumed. Max. memory is 7.1 GB.
[2018-10-26 19:03:55,042 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.23 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 811.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 238.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -825.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 105.87 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB.
 * RCFGBuilder took 3386.48 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.2 MB). Peak memory consumption was 105.2 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 19241.17 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 356.5 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -391.5 MB). There was no memory consumed. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 58]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L7]                int inputC = 3;
[L8]                int inputD = 4;
[L9]                int inputE = 5;
[L10]               int inputF = 6;
[L11]               int inputB = 2;
[L14]               int a1 = 23;
[L15]               int a19 = 9;
[L16]               int a10 = 0;
[L17]               int a12 = 0;
[L18]               int a4 = 14;
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L579]              int output = -1;
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L582]  COND TRUE   1
[L585]              int input;
[L586]              input = __VERIFIER_nondet_int()
[L587]  COND FALSE  !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L590]  CALL, EXPR  calculate_output(input)
[L21]   COND FALSE  !((((((a10==4) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L24]   COND FALSE  !((((((a10==2) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L27]   COND FALSE  !((((((a10==0) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==6)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L30]   COND FALSE  !((((((a10==2) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==8)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L33]   COND FALSE  !((((((a10==4) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==6)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L36]   COND FALSE  !((((((a10==2) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L39]   COND FALSE  !((((((a10==3) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L42]   COND FALSE  !((((((a10==4) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==8)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L45]   COND FALSE  !((((((a10==1) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L48]   COND FALSE  !((((((a10==2) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L51]   COND FALSE  !((((((a10==1) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==7)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L54]   COND FALSE  !((((((a10==0) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==8)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L57]   COND FALSE  !((((((a10==4) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==8)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L60]   COND FALSE  !((((((a10==2) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==8)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L63]   COND FALSE  !((((((a10==0) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L66]   COND FALSE  !((((((a10==1) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==8)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L69]   COND FALSE  !((((((a10==2) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L72]   COND FALSE  !((((((a10==4) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L75]   COND FALSE  !((((((a10==1) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==6)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L78]   COND FALSE  !((((((a10==3) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L81]   COND FALSE  !((((((a10==0) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==8)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L84]   COND FALSE  !((((((a10==0) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L87]   COND FALSE  !((((((a10==0) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L90]   COND FALSE  !((((((a10==0) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==7)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L93]   COND FALSE  !((((((a10==4) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L96]   COND FALSE  !((((((a10==3) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==6)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L99]   COND FALSE  !((((((a10==4) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==7)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L102]  COND FALSE  !((((((a10==4) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L105]  COND FALSE  !((((((a10==2) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==7)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L108]  COND FALSE  !((((((a10==1) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==8)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L111]  COND FALSE  !((((((a10==1) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==6)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L114]  COND FALSE  !((((((a10==0) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==7)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L117]  COND FALSE  !((((((a10==1) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L120]  COND FALSE  !((((((a10==4) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L123]  COND FALSE  !((((((a10==2) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L126]  COND FALSE  !((((((a10==3) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L129]  COND FALSE  !((((((a10==3) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L132]  COND FALSE  !((((((a10==3) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==7)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L135]  COND FALSE  !((((((a10==3) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L138]  COND FALSE  !((((((a10==2) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==6)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L141]  COND FALSE  !((((((a10==1) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==7)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L144]  COND FALSE  !((((((a10==0) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L147]  COND FALSE  !((((((a10==2) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==6)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L150]  COND FALSE  !((((((a10==0) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L153]  COND FALSE  !((((((a10==3) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==8)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L156]  COND FALSE  !((((((a10==4) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==7)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L159]  COND FALSE  !((((((a10==1) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L162]  COND FALSE  !((((((a10==0) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L165]  COND FALSE  !((((((a10==4) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L168]  COND FALSE  !((((((a10==3) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L171]  COND FALSE  !((((((a10==2) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L174]  COND FALSE  !((((((a10==1) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L177]  COND FALSE  !((((((a10==4) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==6)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L180]  COND FALSE  !((((((a10==0) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==6)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L183]  COND FALSE  !((((((a10==2) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==7)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L186]  COND FALSE  !((((((a10==3) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==6)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L189]  COND FALSE  !((((((a10==3) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==8)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L192]  COND FALSE  !((((((a10==3) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==7)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L195]  COND FALSE  !((((((a10==1) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L198]  COND FALSE  !((((((a10==0) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==9)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L201]  COND FALSE  !((((((a10==1) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L205]  COND FALSE  !((((a10==4) && ( 218 < a1  && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L210]  COND FALSE  !(((a4==14) && (((a12==0) && (((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L215]  COND FALSE  !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) &&  218 < a1 ))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L220]  COND FALSE  !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1  && (input == 3)) && (a4==14))))))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L225]  COND FALSE  !(((a19==10) && (((a4==14) && (((((a10==0) &&   ((38 < a1) && (218 >= a1)) ) || ((a10==0) &&  218 < a1 )) || ((a10==1) &&  a1 <=  -13 )) && (input == 5))) && (a12==0))))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L231]  COND FALSE  !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ))) && (a10==3)))))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L236]  COND FALSE  !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9))))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L239]  COND FALSE  !((((a12==0) && (  ((-13 < a1) && (38 >= a1))  && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L244]  COND FALSE  !((((a19==9) && (((input == 6) && (( 218 < a1  && (a10==0)) || ( a1 <=  -13  && (a10==1)))) && (a4==14))) && (a12==0)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L249]  COND FALSE  !((  ((38 < a1) && (218 >= a1))  && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0))))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L254]  COND FALSE  !((((a4==14) && ((((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L260]  COND FALSE  !((((a4==14) && ((((((a10==2) &&   ((38 < a1) && (218 >= a1)) ) || ((a10==2) &&  218 < a1 )) || ( a1 <=  -13  && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L265]  COND FALSE  !((((a10==1) && (((a12==0) && ((input == 6) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L271]  COND FALSE  !(((((((input == 5) && (a4==14)) &&  218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L277]  COND FALSE  !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) &&   ((38 < a1) && (218 >= a1)) ) || ( 218 < a1  && (a10==0))) || ((a10==1) &&  a1 <=  -13 )))))))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L283]  COND FALSE  !((((a12==0) && ((((a19==9) && (input == 4)) &&  218 < a1 ) && (a10==1))) && (a4==14)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L286]  COND FALSE  !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) &&  218 < a1 ))))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L291]  COND FALSE  !((((a4==14) && (((input == 4) && (((  ((38 < a1) && (218 >= a1))  && (a10==2)) || ((a10==2) &&  218 < a1 )) || ( a1 <=  -13  && (a10==3)))) && (a19==9))) && (a12==0)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L296]  COND FALSE  !(((((a12==0) && ((((a10==0) &&  218 < a1 ) || ((a10==1) &&  a1 <=  -13 )) && (input == 2))) && (a19==9)) && (a4==14)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L301]  COND FALSE  !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) &&  218 < a1 ) || ( a1 <=  -13  && (a10==4)))))) && (a19==9)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L306]  COND FALSE  !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L312]  COND FALSE  !(((a19==9) && (((a10==4) && ( 218 < a1  && ((a4==14) && (input == 6)))) && (a12==0))))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L317]  COND FALSE  !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L320]  COND FALSE  !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2))))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L323]  COND FALSE  !((((((a12==0) && ((input == 4) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L326]  COND FALSE  !((((a4==14) && (((a12==0) && ( 218 < a1  && (input == 6))) && (a19==10))) && (a10==1)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L329]  COND FALSE  !(((((((input == 2) && ( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L335]  COND FALSE  !((((((( 218 < a1  && (a10==0)) || ((a10==1) &&  a1 <=  -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L340]  COND FALSE  !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) &&  218 < a1 ) || ( a1 <=  -13  && (a10==4)))) && (a4==14)))))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L345]  COND FALSE  !((((a10==3) && (((a19==9) && ((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L351]  COND FALSE  !((((a12==0) && ((a10==1) && ( 218 < a1  && ((a19==9) && (input == 6))))) && (a4==14)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L354]  COND FALSE  !(((a10==0) && ((a12==0) && (((( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14)))))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L357]  COND FALSE  !((((a10==4) && ((((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L360]  COND FALSE  !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && ((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 4)))))))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L365]  COND FALSE  !(((a4==14) && ((a19==9) && (((( a1 <=  -13  && (a10==3)) || ((  ((38 < a1) && (218 >= a1))  && (a10==2)) || ((a10==2) &&  218 < a1 ))) && (input == 3)) && (a12==0)))))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L370]  COND FALSE  !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a19==10)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L375]  COND FALSE  !(((a4==14) && (((a12==0) && ( 218 < a1  && ((a19==9) && (input == 3)))) && (a10==4))))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L378]  COND FALSE  !((((a4==14) && ((a12==0) && ((((a10==3) &&  218 < a1 ) || ((a10==4) &&  a1 <=  -13 )) && (input == 4)))) && (a19==9)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L383]  COND FALSE  !((((a12==0) && (((a10==4) && ((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L388]  COND FALSE  !(((a19==9) && ((a4==14) && (((input == 5) && (((  ((38 < a1) && (218 >= a1))  && (a10==2)) || ((a10==2) &&  218 < a1 )) || ((a10==3) &&  a1 <=  -13 ))) && (a12==0)))))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L393]  COND FALSE  !(((a12==0) && (((a19==9) && ((((a10==0) &&  218 < a1 ) || ( a1 <=  -13  && (a10==1))) && (input == 5))) && (a4==14))))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L398]  COND FALSE  !(( 218 < a1  && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14))))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L403]  COND FALSE  !((((a12==0) && ((a19==9) && ((((a10==3) &&  a1 <=  -13 ) || (((a10==2) &&   ((38 < a1) && (218 >= a1)) ) || ( 218 < a1  && (a10==2)))) && (input == 6)))) && (a4==14)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L408]  COND FALSE  !(((a19==9) && ((a12==0) && (((( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2)))))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L414]  COND FALSE  !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) &&   ((-13 < a1) && (38 >= a1)) )) && (a4==14)))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L419]  COND FALSE  !(((a12==0) && ((a4==14) && ( 218 < a1  && (((a10==1) && (input == 4)) && (a19==10))))))
        VAL         [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L425]  COND TRUE   ((((((input == 3) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))
[L426]              a1 = ((((a1 / 5) * 5) / 5) + 505228)
[L427]              a10 = 1
[L429]  RET         return 25;
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L590]  EXPR        calculate_output(input)
[L590]              output = calculate_output(input)
[L582]  COND TRUE   1
[L585]              int input;
[L586]              input = __VERIFIER_nondet_int()
[L587]  COND FALSE  !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L590]  CALL, EXPR  calculate_output(input)
[L21]   COND FALSE  !((((((a10==4) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L24]   COND FALSE  !((((((a10==2) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L27]   COND FALSE  !((((((a10==0) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==6)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L30]   COND FALSE  !((((((a10==2) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==8)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L33]   COND FALSE  !((((((a10==4) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==6)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L36]   COND FALSE  !((((((a10==2) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L39]   COND FALSE  !((((((a10==3) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L42]   COND FALSE  !((((((a10==4) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==8)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L45]   COND FALSE  !((((((a10==1) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L48]   COND FALSE  !((((((a10==2) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L51]   COND FALSE  !((((((a10==1) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==7)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L54]   COND FALSE  !((((((a10==0) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==8)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L57]   COND FALSE  !((((((a10==4) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==8)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L60]   COND FALSE  !((((((a10==2) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==8)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L63]   COND FALSE  !((((((a10==0) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L66]   COND FALSE  !((((((a10==1) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==8)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L69]   COND FALSE  !((((((a10==2) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L72]   COND FALSE  !((((((a10==4) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L75]   COND FALSE  !((((((a10==1) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==6)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L78]   COND FALSE  !((((((a10==3) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L81]   COND FALSE  !((((((a10==0) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==8)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L84]   COND FALSE  !((((((a10==0) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L87]   COND FALSE  !((((((a10==0) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L90]   COND FALSE  !((((((a10==0) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==7)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L93]   COND FALSE  !((((((a10==4) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L96]   COND FALSE  !((((((a10==3) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==6)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L99]   COND FALSE  !((((((a10==4) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==7)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L102]  COND FALSE  !((((((a10==4) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L105]  COND FALSE  !((((((a10==2) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==7)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L108]  COND FALSE  !((((((a10==1) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==8)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L111]  COND FALSE  !((((((a10==1) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==6)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L114]  COND FALSE  !((((((a10==0) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==7)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L117]  COND FALSE  !((((((a10==1) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L120]  COND FALSE  !((((((a10==4) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L123]  COND FALSE  !((((((a10==2) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L126]  COND FALSE  !((((((a10==3) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L129]  COND FALSE  !((((((a10==3) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L132]  COND FALSE  !((((((a10==3) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==7)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L135]  COND FALSE  !((((((a10==3) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L138]  COND FALSE  !((((((a10==2) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==6)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L141]  COND FALSE  !((((((a10==1) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==7)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L144]  COND FALSE  !((((((a10==0) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L147]  COND FALSE  !((((((a10==2) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==6)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L150]  COND FALSE  !((((((a10==0) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L153]  COND FALSE  !((((((a10==3) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==8)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L156]  COND FALSE  !((((((a10==4) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==7)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L159]  COND FALSE  !((((((a10==1) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L162]  COND FALSE  !((((((a10==0) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L165]  COND FALSE  !((((((a10==4) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L168]  COND FALSE  !((((((a10==3) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L171]  COND FALSE  !((((((a10==2) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L174]  COND FALSE  !((((((a10==1) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L177]  COND FALSE  !((((((a10==4) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==6)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L180]  COND FALSE  !((((((a10==0) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==6)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L183]  COND FALSE  !((((((a10==2) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==7)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L186]  COND FALSE  !((((((a10==3) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==6)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L189]  COND FALSE  !((((((a10==3) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==8)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L192]  COND FALSE  !((((((a10==3) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==7)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L195]  COND FALSE  !((((((a10==1) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L198]  COND FALSE  !((((((a10==0) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==9)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L201]  COND FALSE  !((((((a10==1) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L205]  COND FALSE  !((((a10==4) && ( 218 < a1  && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L210]  COND FALSE  !(((a4==14) && (((a12==0) && (((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L215]  COND FALSE  !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) &&  218 < a1 ))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L220]  COND FALSE  !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1  && (input == 3)) && (a4==14))))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L225]  COND FALSE  !(((a19==10) && (((a4==14) && (((((a10==0) &&   ((38 < a1) && (218 >= a1)) ) || ((a10==0) &&  218 < a1 )) || ((a10==1) &&  a1 <=  -13 )) && (input == 5))) && (a12==0))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L231]  COND FALSE  !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ))) && (a10==3)))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L236]  COND FALSE  !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L239]  COND FALSE  !((((a12==0) && (  ((-13 < a1) && (38 >= a1))  && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L244]  COND FALSE  !((((a19==9) && (((input == 6) && (( 218 < a1  && (a10==0)) || ( a1 <=  -13  && (a10==1)))) && (a4==14))) && (a12==0)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L249]  COND FALSE  !((  ((38 < a1) && (218 >= a1))  && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L254]  COND FALSE  !((((a4==14) && ((((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L260]  COND FALSE  !((((a4==14) && ((((((a10==2) &&   ((38 < a1) && (218 >= a1)) ) || ((a10==2) &&  218 < a1 )) || ( a1 <=  -13  && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L265]  COND FALSE  !((((a10==1) && (((a12==0) && ((input == 6) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L271]  COND FALSE  !(((((((input == 5) && (a4==14)) &&  218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L277]  COND FALSE  !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) &&   ((38 < a1) && (218 >= a1)) ) || ( 218 < a1  && (a10==0))) || ((a10==1) &&  a1 <=  -13 )))))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L283]  COND FALSE  !((((a12==0) && ((((a19==9) && (input == 4)) &&  218 < a1 ) && (a10==1))) && (a4==14)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L286]  COND FALSE  !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) &&  218 < a1 ))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L291]  COND FALSE  !((((a4==14) && (((input == 4) && (((  ((38 < a1) && (218 >= a1))  && (a10==2)) || ((a10==2) &&  218 < a1 )) || ( a1 <=  -13  && (a10==3)))) && (a19==9))) && (a12==0)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L296]  COND FALSE  !(((((a12==0) && ((((a10==0) &&  218 < a1 ) || ((a10==1) &&  a1 <=  -13 )) && (input == 2))) && (a19==9)) && (a4==14)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L301]  COND FALSE  !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) &&  218 < a1 ) || ( a1 <=  -13  && (a10==4)))))) && (a19==9)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L306]  COND FALSE  !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L312]  COND FALSE  !(((a19==9) && (((a10==4) && ( 218 < a1  && ((a4==14) && (input == 6)))) && (a12==0))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L317]  COND FALSE  !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L320]  COND FALSE  !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L323]  COND FALSE  !((((((a12==0) && ((input == 4) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L326]  COND FALSE  !((((a4==14) && (((a12==0) && ( 218 < a1  && (input == 6))) && (a19==10))) && (a10==1)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L329]  COND FALSE  !(((((((input == 2) && ( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L335]  COND FALSE  !((((((( 218 < a1  && (a10==0)) || ((a10==1) &&  a1 <=  -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L340]  COND FALSE  !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) &&  218 < a1 ) || ( a1 <=  -13  && (a10==4)))) && (a4==14)))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L345]  COND FALSE  !((((a10==3) && (((a19==9) && ((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L351]  COND FALSE  !((((a12==0) && ((a10==1) && ( 218 < a1  && ((a19==9) && (input == 6))))) && (a4==14)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L354]  COND FALSE  !(((a10==0) && ((a12==0) && (((( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14)))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L357]  COND FALSE  !((((a10==4) && ((((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L360]  COND FALSE  !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && ((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 4)))))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L365]  COND FALSE  !(((a4==14) && ((a19==9) && (((( a1 <=  -13  && (a10==3)) || ((  ((38 < a1) && (218 >= a1))  && (a10==2)) || ((a10==2) &&  218 < a1 ))) && (input == 3)) && (a12==0)))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L370]  COND FALSE  !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a19==10)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L375]  COND FALSE  !(((a4==14) && (((a12==0) && ( 218 < a1  && ((a19==9) && (input == 3)))) && (a10==4))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L378]  COND FALSE  !((((a4==14) && ((a12==0) && ((((a10==3) &&  218 < a1 ) || ((a10==4) &&  a1 <=  -13 )) && (input == 4)))) && (a19==9)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L383]  COND FALSE  !((((a12==0) && (((a10==4) && ((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L388]  COND FALSE  !(((a19==9) && ((a4==14) && (((input == 5) && (((  ((38 < a1) && (218 >= a1))  && (a10==2)) || ((a10==2) &&  218 < a1 )) || ((a10==3) &&  a1 <=  -13 ))) && (a12==0)))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L393]  COND FALSE  !(((a12==0) && (((a19==9) && ((((a10==0) &&  218 < a1 ) || ( a1 <=  -13  && (a10==1))) && (input == 5))) && (a4==14))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L398]  COND FALSE  !(( 218 < a1  && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L403]  COND FALSE  !((((a12==0) && ((a19==9) && ((((a10==3) &&  a1 <=  -13 ) || (((a10==2) &&   ((38 < a1) && (218 >= a1)) ) || ( 218 < a1  && (a10==2)))) && (input == 6)))) && (a4==14)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L408]  COND FALSE  !(((a19==9) && ((a12==0) && (((( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2)))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L414]  COND FALSE  !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) &&   ((-13 < a1) && (38 >= a1)) )) && (a4==14)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L419]  COND FALSE  !(((a12==0) && ((a4==14) && ( 218 < a1  && (((a10==1) && (input == 4)) && (a19==10))))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L425]  COND FALSE  !(((((((input == 3) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L430]  COND FALSE  !((((a4==14) && (((( a1 <=  -13  && (a10==1)) || (((a10==0) &&   ((38 < a1) && (218 >= a1)) ) || ( 218 < a1  && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L436]  COND FALSE  !(((a19==9) && ((((input == 4) && (( 218 < a1  && (a10==0)) || ((a10==1) &&  a1 <=  -13 ))) && (a12==0)) && (a4==14))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L442]  COND FALSE  !((((a19==10) && ((a12==0) && ((((a10==1) &&  a1 <=  -13 ) || ((  ((38 < a1) && (218 >= a1))  && (a10==0)) || ((a10==0) &&  218 < a1 ))) && (input == 3)))) && (a4==14)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L448]  COND FALSE  !(((a19==9) && (((a4==14) && ((((a10==3) &&  218 < a1 ) || ( a1 <=  -13  && (a10==4))) && (input == 5))) && (a12==0))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L454]  COND FALSE  !((((a12==0) && ((((input == 5) && (a19==10)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L460]  COND FALSE  !(((a19==9) && ((a4==14) && ((((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0)))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L465]  COND FALSE  !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14)))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L471]  COND FALSE  !(( 218 < a1  && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L476]  COND FALSE  !((((a12==0) && ((a19==9) && (((input == 3) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L481]  COND FALSE  !((((((a4==14) && (  ((38 < a1) && (218 >= a1))  && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L487]  COND FALSE  !((((a19==10) && ((a10==1) && ((a12==0) && (  ((-13 < a1) && (38 >= a1))  && (input == 5))))) && (a4==14)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L493]  COND FALSE  !(((((a10==1) && (((input == 5) &&  218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L499]  COND FALSE  !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) &&  218 < a1 ) || ((a10==4) &&  a1 <=  -13 ))))) && (a12==0)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L504]  COND FALSE  !((((a4==14) && (((a19==9) && ((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L509]  COND FALSE  !(((a4==14) && (((a19==9) && (((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L514]  COND FALSE  !((((a4==14) && ((((input == 6) && ( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L517]  COND FALSE  !(((a12==0) && ((a4==14) && (((( a1 <=  -13  && (a10==1)) || (((a10==0) &&   ((38 < a1) && (218 >= a1)) ) || ( 218 < a1  && (a10==0)))) && (input == 2)) && (a19==10)))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L523]  COND FALSE  !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) ))))) && (a4==14)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L526]  COND FALSE  !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) )) && (a10==0))))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L529]  COND FALSE  !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) )))) && (a4==14))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L534]  COND FALSE  !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) )) && (a12==0))))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L540]  COND FALSE  !(((a12==0) && (((((input == 6) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L545]  COND FALSE  !(((a4==14) && (((a12==0) && ((a19==9) && ((input == 6) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) )))) && (a10==4))))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L548]  COND FALSE  !((((((  ((38 < a1) && (218 >= a1))  && (input == 3)) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L554]  COND FALSE  !((((a4==14) && (((( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) ) && (input == 4)) && (a12==0)) && (a19==9))) && (a10==2)))
        VAL         [a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L557]  COND TRUE   ((a12==0) && ((( 218 < a1  && ((a19==9) && (input == 5))) && (a10==1)) && (a4==14)))
[L558]              a1 = ((((a1 * 9)/ 10) + 58620) - 603783)
[L559]              a10 = 4
[L560]              a19 = 8
[L562]  RET         return -1;
        VAL         [a1=-90455, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L590]  EXPR        calculate_output(input)
[L590]              output = calculate_output(input)
[L582]  COND TRUE   1
[L585]              int input;
[L586]              input = __VERIFIER_nondet_int()
[L587]  COND FALSE  !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L590]  CALL        calculate_output(input)
[L21]   COND FALSE  !((((((a10==4) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [a1=-90455, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L24]   COND FALSE  !((((((a10==2) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [a1=-90455, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L27]   COND FALSE  !((((((a10==0) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==6)))
        VAL         [a1=-90455, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L30]   COND FALSE  !((((((a10==2) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==8)))
        VAL         [a1=-90455, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L33]   COND FALSE  !((((((a10==4) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==6)))
        VAL         [a1=-90455, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L36]   COND FALSE  !((((((a10==2) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
        VAL         [a1=-90455, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L39]   COND FALSE  !((((((a10==3) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
        VAL         [a1=-90455, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L42]   COND FALSE  !((((((a10==4) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==8)))
        VAL         [a1=-90455, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L45]   COND FALSE  !((((((a10==1) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
        VAL         [a1=-90455, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L48]   COND FALSE  !((((((a10==2) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
        VAL         [a1=-90455, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L51]   COND FALSE  !((((((a10==1) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==7)))
        VAL         [a1=-90455, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L54]   COND FALSE  !((((((a10==0) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==8)))
        VAL         [a1=-90455, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L57]   COND TRUE   (((((a10==4) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==8))
        VAL         [a1=-90455, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L58]               __VERIFIER_error()
        VAL         [a1=-90455, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 207 locations, 1 error locations. UNSAFE Result, 19.1s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 16.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 631 SDtfs, 2721 SDslu, 361 SDs, 0 SdLazy, 4836 SolverSat, 1180 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2864occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 295 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1062 NumberOfCodeBlocks, 1062 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 787 ConstructedInterpolants, 0 QuantifiedInterpolants, 422147 SizeOfPredicates, 1 NumberOfNonLiveVariables, 164 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 276/280 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...