java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42_false-unreach-call.c


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


This is Ultimate 0.1.23-dd2f093
[2018-07-24 11:43:47,041 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-07-24 11:43:47,044 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-07-24 11:43:47,058 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-07-24 11:43:47,058 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-07-24 11:43:47,059 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-07-24 11:43:47,060 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-07-24 11:43:47,064 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-07-24 11:43:47,065 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-07-24 11:43:47,066 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-07-24 11:43:47,067 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-07-24 11:43:47,067 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-07-24 11:43:47,068 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-07-24 11:43:47,069 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-07-24 11:43:47,071 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-07-24 11:43:47,071 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-07-24 11:43:47,072 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-07-24 11:43:47,074 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-07-24 11:43:47,076 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-07-24 11:43:47,077 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-07-24 11:43:47,078 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-07-24 11:43:47,080 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-07-24 11:43:47,082 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-07-24 11:43:47,082 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-07-24 11:43:47,083 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-07-24 11:43:47,083 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-07-24 11:43:47,084 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-07-24 11:43:47,085 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-07-24 11:43:47,086 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-07-24 11:43:47,087 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-07-24 11:43:47,087 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-07-24 11:43:47,088 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-07-24 11:43:47,088 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-07-24 11:43:47,088 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-07-24 11:43:47,089 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-07-24 11:43:47,090 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-07-24 11:43:47,090 INFO  L98         SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf
[2018-07-24 11:43:47,117 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-07-24 11:43:47,117 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-07-24 11:43:47,118 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-07-24 11:43:47,118 INFO  L133        SettingsManager]:  * User list type=DISABLED
[2018-07-24 11:43:47,119 INFO  L133        SettingsManager]:  * calls to implemented procedures=false
[2018-07-24 11:43:47,119 INFO  L131        SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-07-24 11:43:47,119 INFO  L133        SettingsManager]:  * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain
[2018-07-24 11:43:47,119 INFO  L133        SettingsManager]:  * Abstract domain=CompoundDomain
[2018-07-24 11:43:47,119 INFO  L133        SettingsManager]:  * Log string format=TERM
[2018-07-24 11:43:47,120 INFO  L133        SettingsManager]:  * Check feasibility of abstract posts with an SMT solver=true
[2018-07-24 11:43:47,120 INFO  L133        SettingsManager]:  * Interval Domain=false
[2018-07-24 11:43:47,121 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-07-24 11:43:47,121 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-07-24 11:43:47,121 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-07-24 11:43:47,122 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2018-07-24 11:43:47,122 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-07-24 11:43:47,122 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2018-07-24 11:43:47,122 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2018-07-24 11:43:47,124 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2018-07-24 11:43:47,124 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-07-24 11:43:47,124 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-07-24 11:43:47,124 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-07-24 11:43:47,124 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-07-24 11:43:47,125 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-07-24 11:43:47,125 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-07-24 11:43:47,125 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-07-24 11:43:47,125 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-07-24 11:43:47,126 INFO  L133        SettingsManager]:  * Trace refinement strategy=RUBBER_TAIPAN
[2018-07-24 11:43:47,126 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-07-24 11:43:47,126 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-07-24 11:43:47,126 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-07-24 11:43:47,126 INFO  L133        SettingsManager]:  * To the following directory=dump/
[2018-07-24 11:43:47,127 INFO  L133        SettingsManager]:  * Abstract interpretation Mode=USE_PREDICATES
[2018-07-24 11:43:47,193 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-07-24 11:43:47,207 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-07-24 11:43:47,213 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-07-24 11:43:47,215 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-07-24 11:43:47,215 INFO  L276        PluginConnector]: CDTParser initialized
[2018-07-24 11:43:47,216 INFO  L418   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42_false-unreach-call.c
[2018-07-24 11:43:47,570 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8aca75bd/f8132241d3994f4282252b02d1e891a7/FLAGc5b88f699
[2018-07-24 11:43:47,828 INFO  L276              CDTParser]: Found 1 translation units.
[2018-07-24 11:43:47,828 INFO  L158              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label42_false-unreach-call.c
[2018-07-24 11:43:47,848 INFO  L324              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8aca75bd/f8132241d3994f4282252b02d1e891a7/FLAGc5b88f699
[2018-07-24 11:43:47,869 INFO  L332              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8aca75bd/f8132241d3994f4282252b02d1e891a7
[2018-07-24 11:43:47,881 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-07-24 11:43:47,883 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2018-07-24 11:43:47,884 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-07-24 11:43:47,884 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-07-24 11:43:47,892 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-07-24 11:43:47,893 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 11:43:47" (1/1) ...
[2018-07-24 11:43:47,896 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74c5d332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:47, skipping insertion in model container
[2018-07-24 11:43:47,896 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 11:43:47" (1/1) ...
[2018-07-24 11:43:48,108 INFO  L179           PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode 
[2018-07-24 11:43:48,366 INFO  L175          PostProcessor]: Settings: Checked method=main
[2018-07-24 11:43:48,384 INFO  L422         MainDispatcher]: Starting main dispatcher in SV-COMP mode 
[2018-07-24 11:43:48,509 INFO  L175          PostProcessor]: Settings: Checked method=main
[2018-07-24 11:43:48,557 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:48 WrapperNode
[2018-07-24 11:43:48,557 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-07-24 11:43:48,558 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-07-24 11:43:48,558 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-07-24 11:43:48,558 INFO  L276        PluginConnector]: Boogie Procedure Inliner initialized
[2018-07-24 11:43:48,569 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:48" (1/1) ...
[2018-07-24 11:43:48,602 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:48" (1/1) ...
[2018-07-24 11:43:48,676 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-07-24 11:43:48,676 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-07-24 11:43:48,677 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-07-24 11:43:48,677 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-07-24 11:43:48,689 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:48" (1/1) ...
[2018-07-24 11:43:48,690 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:48" (1/1) ...
[2018-07-24 11:43:48,703 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:48" (1/1) ...
[2018-07-24 11:43:48,704 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:48" (1/1) ...
[2018-07-24 11:43:48,744 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:48" (1/1) ...
[2018-07-24 11:43:48,909 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:48" (1/1) ...
[2018-07-24 11:43:48,928 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:48" (1/1) ...
[2018-07-24 11:43:48,948 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-07-24 11:43:48,949 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-07-24 11:43:48,949 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-07-24 11:43:48,949 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-07-24 11:43:48,951 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:48" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-07-24 11:43:49,021 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-07-24 11:43:49,021 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-07-24 11:43:49,022 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-07-24 11:43:49,022 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-07-24 11:43:49,022 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2018-07-24 11:43:49,022 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2018-07-24 11:43:49,022 INFO  L130     BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_output
[2018-07-24 11:43:49,022 INFO  L138     BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_output
[2018-07-24 11:43:53,258 INFO  L261             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-07-24 11:43:53,259 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 11:43:53 BoogieIcfgContainer
[2018-07-24 11:43:53,259 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-07-24 11:43:53,260 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-07-24 11:43:53,260 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-07-24 11:43:53,264 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-07-24 11:43:53,264 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 11:43:47" (1/3) ...
[2018-07-24 11:43:53,265 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d281165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 11:43:53, skipping insertion in model container
[2018-07-24 11:43:53,265 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:48" (2/3) ...
[2018-07-24 11:43:53,266 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d281165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 11:43:53, skipping insertion in model container
[2018-07-24 11:43:53,266 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 11:43:53" (3/3) ...
[2018-07-24 11:43:53,273 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem10_label42_false-unreach-call.c
[2018-07-24 11:43:53,285 INFO  L132   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-07-24 11:43:53,294 INFO  L144   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2018-07-24 11:43:53,356 INFO  L128   ementStrategyFactory]: Using default assertion order modulation
[2018-07-24 11:43:53,356 INFO  L373      AbstractCegarLoop]: Interprodecural is true
[2018-07-24 11:43:53,357 INFO  L374      AbstractCegarLoop]: Hoare is true
[2018-07-24 11:43:53,357 INFO  L375      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-07-24 11:43:53,357 INFO  L376      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-07-24 11:43:53,357 INFO  L377      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-07-24 11:43:53,358 INFO  L378      AbstractCegarLoop]: Difference is false
[2018-07-24 11:43:53,358 INFO  L379      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-07-24 11:43:53,358 INFO  L384      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-07-24 11:43:53,392 INFO  L276                IsEmpty]: Start isEmpty. Operand 216 states.
[2018-07-24 11:43:53,400 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2018-07-24 11:43:53,400 INFO  L345         BasicCegarLoop]: Found error trace
[2018-07-24 11:43:53,401 INFO  L353         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-24 11:43:53,402 INFO  L414      AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]===
[2018-07-24 11:43:53,407 INFO  L82        PathProgramCache]: Analyzing trace with hash -1762855796, now seen corresponding path program 1 times
[2018-07-24 11:43:53,410 INFO  L69    tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy
[2018-07-24 11:43:53,465 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-24 11:43:53,466 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-07-24 11:43:53,466 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-24 11:43:53,466 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-07-24 11:43:53,538 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-24 11:43:53,875 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-24 11:43:53,883 INFO  L309   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-07-24 11:43:53,883 INFO  L324   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-07-24 11:43:53,884 INFO  L258   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-07-24 11:43:53,890 INFO  L450      AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-07-24 11:43:53,908 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-07-24 11:43:53,909 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-07-24 11:43:53,912 INFO  L87              Difference]: Start difference. First operand 216 states. Second operand 4 states.
[2018-07-24 11:43:56,639 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-24 11:43:56,639 INFO  L93              Difference]: Finished difference Result 737 states and 1298 transitions.
[2018-07-24 11:43:56,640 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2018-07-24 11:43:56,641 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 24
[2018-07-24 11:43:56,641 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-24 11:43:56,665 INFO  L225             Difference]: With dead ends: 737
[2018-07-24 11:43:56,666 INFO  L226             Difference]: Without dead ends: 515
[2018-07-24 11:43:56,680 INFO  L573         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-07-24 11:43:56,699 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 515 states.
[2018-07-24 11:43:56,794 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515.
[2018-07-24 11:43:56,796 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 515 states.
[2018-07-24 11:43:56,801 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 848 transitions.
[2018-07-24 11:43:56,803 INFO  L78                 Accepts]: Start accepts. Automaton has 515 states and 848 transitions. Word has length 24
[2018-07-24 11:43:56,803 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-07-24 11:43:56,804 INFO  L471      AbstractCegarLoop]: Abstraction has 515 states and 848 transitions.
[2018-07-24 11:43:56,804 INFO  L472      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-07-24 11:43:56,804 INFO  L276                IsEmpty]: Start isEmpty. Operand 515 states and 848 transitions.
[2018-07-24 11:43:56,810 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2018-07-24 11:43:56,810 INFO  L345         BasicCegarLoop]: Found error trace
[2018-07-24 11:43:56,810 INFO  L353         BasicCegarLoop]: trace histogram [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]
[2018-07-24 11:43:56,811 INFO  L414      AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]===
[2018-07-24 11:43:56,811 INFO  L82        PathProgramCache]: Analyzing trace with hash 1704491627, now seen corresponding path program 1 times
[2018-07-24 11:43:56,813 INFO  L69    tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy
[2018-07-24 11:43:56,815 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-24 11:43:56,815 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-07-24 11:43:56,815 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-24 11:43:56,815 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-07-24 11:43:56,914 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-24 11:43:57,272 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-24 11:43:57,272 INFO  L309   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-07-24 11:43:57,272 INFO  L324   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-07-24 11:43:57,273 INFO  L258   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-07-24 11:43:57,275 INFO  L450      AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-07-24 11:43:57,275 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-07-24 11:43:57,275 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2018-07-24 11:43:57,275 INFO  L87              Difference]: Start difference. First operand 515 states and 848 transitions. Second operand 6 states.
[2018-07-24 11:44:00,323 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-24 11:44:00,324 INFO  L93              Difference]: Finished difference Result 1863 states and 3251 transitions.
[2018-07-24 11:44:00,324 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2018-07-24 11:44:00,324 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 99
[2018-07-24 11:44:00,325 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-24 11:44:00,338 INFO  L225             Difference]: With dead ends: 1863
[2018-07-24 11:44:00,338 INFO  L226             Difference]: Without dead ends: 1354
[2018-07-24 11:44:00,346 INFO  L573         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2018-07-24 11:44:00,348 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1354 states.
[2018-07-24 11:44:00,424 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1331.
[2018-07-24 11:44:00,424 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1331 states.
[2018-07-24 11:44:00,435 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2051 transitions.
[2018-07-24 11:44:00,435 INFO  L78                 Accepts]: Start accepts. Automaton has 1331 states and 2051 transitions. Word has length 99
[2018-07-24 11:44:00,436 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-07-24 11:44:00,436 INFO  L471      AbstractCegarLoop]: Abstraction has 1331 states and 2051 transitions.
[2018-07-24 11:44:00,436 INFO  L472      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-07-24 11:44:00,437 INFO  L276                IsEmpty]: Start isEmpty. Operand 1331 states and 2051 transitions.
[2018-07-24 11:44:00,442 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2018-07-24 11:44:00,443 INFO  L345         BasicCegarLoop]: Found error trace
[2018-07-24 11:44:00,443 INFO  L353         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-24 11:44:00,444 INFO  L414      AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]===
[2018-07-24 11:44:00,445 INFO  L82        PathProgramCache]: Analyzing trace with hash 755920007, now seen corresponding path program 1 times
[2018-07-24 11:44:00,445 INFO  L69    tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy
[2018-07-24 11:44:00,446 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-24 11:44:00,446 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-07-24 11:44:00,446 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-24 11:44:00,447 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-07-24 11:44:00,491 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-24 11:44:00,788 WARN  L169               SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4
[2018-07-24 11:44:00,869 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-24 11:44:00,870 INFO  L309   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-07-24 11:44:00,870 INFO  L324   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-07-24 11:44:00,870 INFO  L258   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-07-24 11:44:00,871 INFO  L450      AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-07-24 11:44:00,871 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-07-24 11:44:00,871 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2018-07-24 11:44:00,872 INFO  L87              Difference]: Start difference. First operand 1331 states and 2051 transitions. Second operand 6 states.
[2018-07-24 11:44:04,899 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-24 11:44:04,900 INFO  L93              Difference]: Finished difference Result 3512 states and 5693 transitions.
[2018-07-24 11:44:04,900 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2018-07-24 11:44:04,900 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 101
[2018-07-24 11:44:04,901 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-24 11:44:04,918 INFO  L225             Difference]: With dead ends: 3512
[2018-07-24 11:44:04,918 INFO  L226             Difference]: Without dead ends: 2187
[2018-07-24 11:44:04,930 INFO  L573         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2018-07-24 11:44:04,932 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2187 states.
[2018-07-24 11:44:05,004 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2165.
[2018-07-24 11:44:05,004 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2165 states.
[2018-07-24 11:44:05,014 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 2165 states and 3178 transitions.
[2018-07-24 11:44:05,015 INFO  L78                 Accepts]: Start accepts. Automaton has 2165 states and 3178 transitions. Word has length 101
[2018-07-24 11:44:05,015 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-07-24 11:44:05,015 INFO  L471      AbstractCegarLoop]: Abstraction has 2165 states and 3178 transitions.
[2018-07-24 11:44:05,016 INFO  L472      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-07-24 11:44:05,016 INFO  L276                IsEmpty]: Start isEmpty. Operand 2165 states and 3178 transitions.
[2018-07-24 11:44:05,025 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 105
[2018-07-24 11:44:05,025 INFO  L345         BasicCegarLoop]: Found error trace
[2018-07-24 11:44:05,025 INFO  L353         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-24 11:44:05,026 INFO  L414      AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]===
[2018-07-24 11:44:05,026 INFO  L82        PathProgramCache]: Analyzing trace with hash -1296418976, now seen corresponding path program 1 times
[2018-07-24 11:44:05,026 INFO  L69    tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy
[2018-07-24 11:44:05,028 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-24 11:44:05,028 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-07-24 11:44:05,028 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-24 11:44:05,028 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-07-24 11:44:05,057 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-24 11:44:05,278 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-24 11:44:05,278 INFO  L297   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-07-24 11:44:05,278 INFO  L191   anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-07-24 11:44:05,287 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-07-24 11:44:05,288 INFO  L288   anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP)
[2018-07-24 11:44:05,349 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-24 11:44:05,369 INFO  L273         TraceCheckSpWp]: Computing forward predicates...
[2018-07-24 11:44:05,574 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-24 11:44:05,574 INFO  L316         TraceCheckSpWp]: Computing backward predicates...
[2018-07-24 11:44:05,812 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-24 11:44:05,834 INFO  L309   seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences.
[2018-07-24 11:44:05,835 INFO  L324   seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8
[2018-07-24 11:44:05,835 INFO  L258   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-07-24 11:44:05,839 INFO  L450      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-07-24 11:44:05,840 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-07-24 11:44:05,840 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2018-07-24 11:44:05,840 INFO  L87              Difference]: Start difference. First operand 2165 states and 3178 transitions. Second operand 3 states.
[2018-07-24 11:44:07,486 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-24 11:44:07,486 INFO  L93              Difference]: Finished difference Result 4762 states and 7150 transitions.
[2018-07-24 11:44:07,487 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-07-24 11:44:07,488 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 104
[2018-07-24 11:44:07,488 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-24 11:44:07,505 INFO  L225             Difference]: With dead ends: 4762
[2018-07-24 11:44:07,506 INFO  L226             Difference]: Without dead ends: 2603
[2018-07-24 11:44:07,519 INFO  L573         BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 207 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2018-07-24 11:44:07,521 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2603 states.
[2018-07-24 11:44:07,586 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 2603.
[2018-07-24 11:44:07,586 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2603 states.
[2018-07-24 11:44:07,597 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2603 states and 3690 transitions.
[2018-07-24 11:44:07,598 INFO  L78                 Accepts]: Start accepts. Automaton has 2603 states and 3690 transitions. Word has length 104
[2018-07-24 11:44:07,599 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-07-24 11:44:07,599 INFO  L471      AbstractCegarLoop]: Abstraction has 2603 states and 3690 transitions.
[2018-07-24 11:44:07,599 INFO  L472      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-07-24 11:44:07,599 INFO  L276                IsEmpty]: Start isEmpty. Operand 2603 states and 3690 transitions.
[2018-07-24 11:44:07,606 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2018-07-24 11:44:07,606 INFO  L345         BasicCegarLoop]: Found error trace
[2018-07-24 11:44:07,607 INFO  L353         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-24 11:44:07,607 INFO  L414      AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]===
[2018-07-24 11:44:07,607 INFO  L82        PathProgramCache]: Analyzing trace with hash 1418455231, now seen corresponding path program 1 times
[2018-07-24 11:44:07,607 INFO  L69    tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy
[2018-07-24 11:44:07,608 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-24 11:44:07,608 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-07-24 11:44:07,609 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-24 11:44:07,609 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-07-24 11:44:07,630 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-24 11:44:07,846 WARN  L169               SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4
[2018-07-24 11:44:08,084 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-07-24 11:44:08,084 INFO  L297   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-07-24 11:44:08,084 INFO  L191   anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-07-24 11:44:08,099 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-07-24 11:44:08,099 INFO  L288   anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP)
[2018-07-24 11:44:08,161 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-24 11:44:08,168 INFO  L273         TraceCheckSpWp]: Computing forward predicates...
[2018-07-24 11:44:08,276 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-24 11:44:08,277 INFO  L316         TraceCheckSpWp]: Computing backward predicates...
[2018-07-24 11:44:08,485 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-24 11:44:08,507 INFO  L309   seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences.
[2018-07-24 11:44:08,507 INFO  L324   seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5
[2018-07-24 11:44:08,508 INFO  L258   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-07-24 11:44:08,508 INFO  L450      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-07-24 11:44:08,508 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-07-24 11:44:08,508 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2018-07-24 11:44:08,509 INFO  L87              Difference]: Start difference. First operand 2603 states and 3690 transitions. Second operand 3 states.
[2018-07-24 11:44:09,695 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-24 11:44:09,696 INFO  L93              Difference]: Finished difference Result 6696 states and 9978 transitions.
[2018-07-24 11:44:09,696 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-07-24 11:44:09,696 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 105
[2018-07-24 11:44:09,697 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-24 11:44:09,723 INFO  L225             Difference]: With dead ends: 6696
[2018-07-24 11:44:09,724 INFO  L226             Difference]: Without dead ends: 4099
[2018-07-24 11:44:09,743 INFO  L573         BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 208 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2018-07-24 11:44:09,747 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4099 states.
[2018-07-24 11:44:09,850 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4099 to 4093.
[2018-07-24 11:44:09,851 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4093 states.
[2018-07-24 11:44:09,865 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4093 states to 4093 states and 5817 transitions.
[2018-07-24 11:44:09,865 INFO  L78                 Accepts]: Start accepts. Automaton has 4093 states and 5817 transitions. Word has length 105
[2018-07-24 11:44:09,866 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-07-24 11:44:09,866 INFO  L471      AbstractCegarLoop]: Abstraction has 4093 states and 5817 transitions.
[2018-07-24 11:44:09,866 INFO  L472      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-07-24 11:44:09,866 INFO  L276                IsEmpty]: Start isEmpty. Operand 4093 states and 5817 transitions.
[2018-07-24 11:44:09,870 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2018-07-24 11:44:09,870 INFO  L345         BasicCegarLoop]: Found error trace
[2018-07-24 11:44:09,870 INFO  L353         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-24 11:44:09,871 INFO  L414      AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]===
[2018-07-24 11:44:09,871 INFO  L82        PathProgramCache]: Analyzing trace with hash -559658369, now seen corresponding path program 1 times
[2018-07-24 11:44:09,871 INFO  L69    tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy
[2018-07-24 11:44:09,872 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-24 11:44:09,872 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-07-24 11:44:09,872 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-24 11:44:09,873 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-07-24 11:44:09,895 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-24 11:44:10,132 WARN  L169               SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4
[2018-07-24 11:44:10,565 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-24 11:44:10,565 INFO  L309   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-07-24 11:44:10,565 INFO  L324   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-07-24 11:44:10,566 INFO  L258   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-07-24 11:44:10,566 INFO  L450      AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-07-24 11:44:10,568 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-07-24 11:44:10,568 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2018-07-24 11:44:10,568 INFO  L87              Difference]: Start difference. First operand 4093 states and 5817 transitions. Second operand 6 states.
[2018-07-24 11:44:13,959 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-24 11:44:13,960 INFO  L93              Difference]: Finished difference Result 9380 states and 13789 transitions.
[2018-07-24 11:44:13,960 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2018-07-24 11:44:13,961 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 137
[2018-07-24 11:44:13,961 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-24 11:44:13,992 INFO  L225             Difference]: With dead ends: 9380
[2018-07-24 11:44:13,992 INFO  L226             Difference]: Without dead ends: 5293
[2018-07-24 11:44:14,017 INFO  L573         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2018-07-24 11:44:14,023 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5293 states.
[2018-07-24 11:44:14,155 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5293 to 5248.
[2018-07-24 11:44:14,155 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5248 states.
[2018-07-24 11:44:14,170 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5248 states to 5248 states and 7174 transitions.
[2018-07-24 11:44:14,170 INFO  L78                 Accepts]: Start accepts. Automaton has 5248 states and 7174 transitions. Word has length 137
[2018-07-24 11:44:14,171 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-07-24 11:44:14,171 INFO  L471      AbstractCegarLoop]: Abstraction has 5248 states and 7174 transitions.
[2018-07-24 11:44:14,171 INFO  L472      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-07-24 11:44:14,171 INFO  L276                IsEmpty]: Start isEmpty. Operand 5248 states and 7174 transitions.
[2018-07-24 11:44:14,184 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 209
[2018-07-24 11:44:14,184 INFO  L345         BasicCegarLoop]: Found error trace
[2018-07-24 11:44:14,185 INFO  L353         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-24 11:44:14,185 INFO  L414      AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]===
[2018-07-24 11:44:14,185 INFO  L82        PathProgramCache]: Analyzing trace with hash 38487992, now seen corresponding path program 1 times
[2018-07-24 11:44:14,185 INFO  L69    tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy
[2018-07-24 11:44:14,186 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-24 11:44:14,186 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-07-24 11:44:14,186 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-24 11:44:14,186 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-07-24 11:44:14,227 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-07-24 11:44:14,264 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-07-24 11:44:14,342 INFO  L419         BasicCegarLoop]: Counterexample might be feasible
[2018-07-24 11:44:14,529 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 11:44:14 BoogieIcfgContainer
[2018-07-24 11:44:14,529 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-07-24 11:44:14,530 INFO  L168              Benchmark]: Toolchain (without parser) took 26647.75 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -905.6 MB). Peak memory consumption was 221.1 MB. Max. memory is 7.1 GB.
[2018-07-24 11:44:14,531 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-07-24 11:44:14,532 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 673.40 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB.
[2018-07-24 11:44:14,533 INFO  L168              Benchmark]: Boogie Procedure Inliner took 118.17 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB.
[2018-07-24 11:44:14,534 INFO  L168              Benchmark]: Boogie Preprocessor took 271.85 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 787.0 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -875.6 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB.
[2018-07-24 11:44:14,535 INFO  L168              Benchmark]: RCFGBuilder took 4310.57 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 106.9 MB). Peak memory consumption was 106.9 MB. Max. memory is 7.1 GB.
[2018-07-24 11:44:14,536 INFO  L168              Benchmark]: TraceAbstraction took 21268.96 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 339.7 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -192.4 MB). Peak memory consumption was 147.3 MB. Max. memory is 7.1 GB.
[2018-07-24 11:44:14,541 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 673.40 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 118.17 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 271.85 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 787.0 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -875.6 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 4310.57 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 106.9 MB). Peak memory consumption was 106.9 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 21268.96 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 339.7 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -192.4 MB). Peak memory consumption was 147.3 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 55]: 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         [\old(a1)=254632, \old(a10)=254629, \old(a12)=254633, \old(a19)=254637, \old(a4)=254631, \old(inputB)=254636, \old(inputC)=254634, \old(inputD)=254635, \old(inputE)=254630, \old(inputF)=254628, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1]
[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))
        VAL         [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1]
[L590]  CALL, EXPR  calculate_output(input)
        VAL         [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L21]   COND FALSE  !((((((a10==4) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, 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         [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L210]  COND TRUE   ((a4==14) && (((a12==0) && (((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))
[L211]              a1 = (((a1 + -15535) - 211896) / 5)
[L212]              a10 = 2
[L214]  RET         return 22;
        VAL         [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L590]  EXPR        calculate_output(input)
        VAL         [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, calculate_output(input)=22, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1]
[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))
        VAL         [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=22]
[L590]  CALL, EXPR  calculate_output(input)
        VAL         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L21]   COND FALSE  !((((((a10==4) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, 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         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L408]  COND TRUE   ((a19==9) && ((a12==0) && (((( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))
[L409]              a1 = ((((a1 % 299890)+ 300108) * 1) * 1)
[L410]              a10 = 0
[L411]              a19 = 8
[L413]  RET         return -1;
        VAL         [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L590]  EXPR        calculate_output(input)
        VAL         [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=254627, a10=0, a12=0, a19=8, a4=14, calculate_output(input)=-1, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=22]
[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))
        VAL         [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=254627, a10=0, a12=0, a19=8, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1]
[L590]  CALL        calculate_output(input)
        VAL         [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L21]   COND FALSE  !((((((a10==4) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
        VAL         [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, 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         [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, 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         [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, 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         [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, 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         [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, 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         [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, 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         [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, 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         [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, 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         [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, 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         [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, 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         [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L54]   COND TRUE   (((((a10==0) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==8))
        VAL         [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L55]               __VERIFIER_error()
        VAL         [\old(a1)=254627, \old(a10)=0, \old(a19)=8, a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 216 locations, 1 error locations. UNSAFE Result, 21.1s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 16.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 822 SDtfs, 3339 SDslu, 493 SDs, 0 SdLazy, 4956 SolverSat, 1159 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 469 GetRequests, 425 SyntacticMatches, 12 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5248occurred in iteration=6, 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.6s AutomataMinimizationTime, 6 MinimizatonAttempts, 96 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 987 NumberOfCodeBlocks, 987 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 978 ConstructedInterpolants, 0 QuantifiedInterpolants, 399145 SizeOfPredicates, 4 NumberOfNonLiveVariables, 481 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 132/153 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label42_false-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_11-44-14-558.csv
Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label42_false-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_11-44-14-558.csv
Received shutdown request...