./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label55.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 9bd2c7ff
Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label55.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5f075a4b49a2356a49381d6b415c5ab1ced0304fad6c6d6641d95ed6b897506f
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-9bd2c7f
[2023-11-19 07:54:57,943 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-19 07:54:58,060 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf
[2023-11-19 07:54:58,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-19 07:54:58,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-19 07:54:58,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-19 07:54:58,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-19 07:54:58,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-19 07:54:58,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-19 07:54:58,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-19 07:54:58,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-19 07:54:58,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-19 07:54:58,123 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-19 07:54:58,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-19 07:54:58,124 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-11-19 07:54:58,124 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-19 07:54:58,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-19 07:54:58,125 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-19 07:54:58,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-19 07:54:58,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-11-19 07:54:58,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-19 07:54:58,130 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-11-19 07:54:58,130 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-19 07:54:58,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-11-19 07:54:58,133 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-19 07:54:58,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-19 07:54:58,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-19 07:54:58,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-19 07:54:58,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:54:58,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-19 07:54:58,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-19 07:54:58,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-19 07:54:58,137 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-11-19 07:54:58,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-19 07:54:58,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-19 07:54:58,138 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-19 07:54:58,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-19 07:54:58,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-19 07:54:58,138 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-19 07:54:58,139 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/bin/uautomizer-verify-uCwYo4JHxu
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5f075a4b49a2356a49381d6b415c5ab1ced0304fad6c6d6641d95ed6b897506f
[2023-11-19 07:54:58,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-19 07:54:58,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-19 07:54:58,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-19 07:54:58,440 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-19 07:54:58,440 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-19 07:54:58,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/eca-rers2012/Problem10_label55.c
[2023-11-19 07:55:01,525 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-19 07:55:01,819 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-19 07:55:01,820 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/sv-benchmarks/c/eca-rers2012/Problem10_label55.c
[2023-11-19 07:55:01,839 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/bin/uautomizer-verify-uCwYo4JHxu/data/3248189fa/fab089b1f7d0418288d7ca4726a792a2/FLAG3ac0b5cc9
[2023-11-19 07:55:01,855 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/bin/uautomizer-verify-uCwYo4JHxu/data/3248189fa/fab089b1f7d0418288d7ca4726a792a2
[2023-11-19 07:55:01,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-19 07:55:01,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-19 07:55:01,861 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-19 07:55:01,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-19 07:55:01,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-19 07:55:01,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:55:01" (1/1) ...
[2023-11-19 07:55:01,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d1d887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:01, skipping insertion in model container
[2023-11-19 07:55:01,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:55:01" (1/1) ...
[2023-11-19 07:55:01,921 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-19 07:55:02,091 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/sv-benchmarks/c/eca-rers2012/Problem10_label55.c[2278,2291]
[2023-11-19 07:55:02,316 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:55:02,335 INFO L202 MainTranslator]: Completed pre-run
[2023-11-19 07:55:02,361 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/sv-benchmarks/c/eca-rers2012/Problem10_label55.c[2278,2291]
[2023-11-19 07:55:02,499 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:55:02,524 INFO L206 MainTranslator]: Completed translation
[2023-11-19 07:55:02,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:02 WrapperNode
[2023-11-19 07:55:02,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-19 07:55:02,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-19 07:55:02,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-19 07:55:02,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-19 07:55:02,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:02" (1/1) ...
[2023-11-19 07:55:02,564 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:02" (1/1) ...
[2023-11-19 07:55:02,644 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598
[2023-11-19 07:55:02,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-19 07:55:02,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-19 07:55:02,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-19 07:55:02,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-19 07:55:02,656 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:02" (1/1) ...
[2023-11-19 07:55:02,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:02" (1/1) ...
[2023-11-19 07:55:02,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:02" (1/1) ...
[2023-11-19 07:55:02,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:02" (1/1) ...
[2023-11-19 07:55:02,697 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:02" (1/1) ...
[2023-11-19 07:55:02,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:02" (1/1) ...
[2023-11-19 07:55:02,711 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:02" (1/1) ...
[2023-11-19 07:55:02,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:02" (1/1) ...
[2023-11-19 07:55:02,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-19 07:55:02,730 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-19 07:55:02,730 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-19 07:55:02,730 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-19 07:55:02,731 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:02" (1/1) ...
[2023-11-19 07:55:02,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:55:02,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:55:02,766 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-19 07:55:02,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-19 07:55:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-19 07:55:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-19 07:55:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-19 07:55:02,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-19 07:55:02,924 INFO L236 CfgBuilder]: Building ICFG
[2023-11-19 07:55:02,927 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-19 07:55:04,214 INFO L277 CfgBuilder]: Performing block encoding
[2023-11-19 07:55:04,225 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-19 07:55:04,226 INFO L302 CfgBuilder]: Removed 1 assume(true) statements.
[2023-11-19 07:55:04,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:55:04 BoogieIcfgContainer
[2023-11-19 07:55:04,232 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-19 07:55:04,234 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-19 07:55:04,235 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-19 07:55:04,238 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-19 07:55:04,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:55:01" (1/3) ...
[2023-11-19 07:55:04,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6200bbd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:55:04, skipping insertion in model container
[2023-11-19 07:55:04,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:02" (2/3) ...
[2023-11-19 07:55:04,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6200bbd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:55:04, skipping insertion in model container
[2023-11-19 07:55:04,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:55:04" (3/3) ...
[2023-11-19 07:55:04,242 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label55.c
[2023-11-19 07:55:04,262 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-19 07:55:04,262 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-11-19 07:55:04,321 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-19 07:55:04,328 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3dd1520d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-19 07:55:04,329 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-11-19 07:55:04,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:04,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2023-11-19 07:55:04,342 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:55:04,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:55:04,344 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:55:04,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:55:04,350 INFO L85 PathProgramCache]: Analyzing trace with hash 567305786, now seen corresponding path program 1 times
[2023-11-19 07:55:04,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:55:04,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613379026]
[2023-11-19 07:55:04,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:55:04,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:55:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:55:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:55:04,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:55:04,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613379026]
[2023-11-19 07:55:04,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613379026] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:55:04,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:55:04,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:55:04,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501261352]
[2023-11-19 07:55:04,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:55:04,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:55:04,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:55:04,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:55:04,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:55:04,828 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:05,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:55:05,909 INFO L93 Difference]: Finished difference Result 567 states and 981 transitions.
[2023-11-19 07:55:05,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:55:05,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18
[2023-11-19 07:55:05,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:55:05,928 INFO L225 Difference]: With dead ends: 567
[2023-11-19 07:55:05,931 INFO L226 Difference]: Without dead ends: 282
[2023-11-19 07:55:05,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:55:05,946 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 182 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2023-11-19 07:55:05,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 32 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2023-11-19 07:55:05,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states.
[2023-11-19 07:55:06,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282.
[2023-11-19 07:55:06,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.5373665480427046) internal successors, (432), 281 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:06,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions.
[2023-11-19 07:55:06,025 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 18
[2023-11-19 07:55:06,026 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:55:06,026 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions.
[2023-11-19 07:55:06,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions.
[2023-11-19 07:55:06,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2023-11-19 07:55:06,032 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:55:06,033 INFO L195 NwaCegarLoop]: trace histogram [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]
[2023-11-19 07:55:06,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-19 07:55:06,033 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:55:06,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:55:06,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1389370406, now seen corresponding path program 1 times
[2023-11-19 07:55:06,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:55:06,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273063098]
[2023-11-19 07:55:06,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:55:06,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:55:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:55:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:55:06,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:55:06,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273063098]
[2023-11-19 07:55:06,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273063098] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:55:06,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:55:06,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:55:06,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562601178]
[2023-11-19 07:55:06,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:55:06,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:55:06,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:55:06,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:55:06,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:55:06,601 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:07,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:55:07,179 INFO L93 Difference]: Finished difference Result 840 states and 1291 transitions.
[2023-11-19 07:55:07,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:55:07,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84
[2023-11-19 07:55:07,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:55:07,191 INFO L225 Difference]: With dead ends: 840
[2023-11-19 07:55:07,192 INFO L226 Difference]: Without dead ends: 560
[2023-11-19 07:55:07,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:55:07,196 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 147 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2023-11-19 07:55:07,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 21 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2023-11-19 07:55:07,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states.
[2023-11-19 07:55:07,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 421.
[2023-11-19 07:55:07,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.5142857142857142) internal successors, (636), 420 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 636 transitions.
[2023-11-19 07:55:07,252 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 636 transitions. Word has length 84
[2023-11-19 07:55:07,253 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:55:07,253 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 636 transitions.
[2023-11-19 07:55:07,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:07,254 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 636 transitions.
[2023-11-19 07:55:07,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2023-11-19 07:55:07,258 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:55:07,259 INFO L195 NwaCegarLoop]: trace histogram [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]
[2023-11-19 07:55:07,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-19 07:55:07,260 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:55:07,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:55:07,260 INFO L85 PathProgramCache]: Analyzing trace with hash 816432992, now seen corresponding path program 1 times
[2023-11-19 07:55:07,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:55:07,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159108786]
[2023-11-19 07:55:07,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:55:07,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:55:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:55:07,574 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:55:07,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:55:07,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159108786]
[2023-11-19 07:55:07,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159108786] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:55:07,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:55:07,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:55:07,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770503445]
[2023-11-19 07:55:07,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:55:07,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:55:07,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:55:07,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:55:07,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:55:07,578 INFO L87 Difference]: Start difference. First operand 421 states and 636 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:08,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:55:08,198 INFO L93 Difference]: Finished difference Result 979 states and 1474 transitions.
[2023-11-19 07:55:08,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:55:08,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101
[2023-11-19 07:55:08,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:55:08,203 INFO L225 Difference]: With dead ends: 979
[2023-11-19 07:55:08,203 INFO L226 Difference]: Without dead ends: 560
[2023-11-19 07:55:08,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:55:08,205 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 59 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2023-11-19 07:55:08,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 57 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2023-11-19 07:55:08,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states.
[2023-11-19 07:55:08,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560.
[2023-11-19 07:55:08,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.4400715563506261) internal successors, (805), 559 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:08,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 805 transitions.
[2023-11-19 07:55:08,227 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 805 transitions. Word has length 101
[2023-11-19 07:55:08,228 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:55:08,228 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 805 transitions.
[2023-11-19 07:55:08,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:08,229 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 805 transitions.
[2023-11-19 07:55:08,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168
[2023-11-19 07:55:08,236 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:55:08,236 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:55:08,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-19 07:55:08,236 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:55:08,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:55:08,237 INFO L85 PathProgramCache]: Analyzing trace with hash -294718988, now seen corresponding path program 1 times
[2023-11-19 07:55:08,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:55:08,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405132531]
[2023-11-19 07:55:08,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:55:08,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:55:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:55:08,640 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked.
[2023-11-19 07:55:08,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:55:08,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405132531]
[2023-11-19 07:55:08,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405132531] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-19 07:55:08,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87383165]
[2023-11-19 07:55:08,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:55:08,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 07:55:08,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:55:08,646 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-19 07:55:08,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-11-19 07:55:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:55:08,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 2 conjunts are in the unsatisfiable core
[2023-11-19 07:55:08,816 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 07:55:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked.
[2023-11-19 07:55:09,271 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-19 07:55:09,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87383165] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:55:09,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-19 07:55:09,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2023-11-19 07:55:09,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466762500]
[2023-11-19 07:55:09,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:55:09,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:55:09,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:55:09,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:55:09,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:55:09,274 INFO L87 Difference]: Start difference. First operand 560 states and 805 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:09,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:55:09,861 INFO L93 Difference]: Finished difference Result 979 states and 1439 transitions.
[2023-11-19 07:55:09,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:55:09,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167
[2023-11-19 07:55:09,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:55:09,869 INFO L225 Difference]: With dead ends: 979
[2023-11-19 07:55:09,869 INFO L226 Difference]: Without dead ends: 977
[2023-11-19 07:55:09,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:55:09,880 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 96 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2023-11-19 07:55:09,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 11 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2023-11-19 07:55:09,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states.
[2023-11-19 07:55:09,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 560.
[2023-11-19 07:55:09,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.4400715563506261) internal successors, (805), 559 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:09,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 805 transitions.
[2023-11-19 07:55:09,912 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 805 transitions. Word has length 167
[2023-11-19 07:55:09,913 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:55:09,913 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 805 transitions.
[2023-11-19 07:55:09,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:09,914 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 805 transitions.
[2023-11-19 07:55:09,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206
[2023-11-19 07:55:09,920 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:55:09,920 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:55:09,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-11-19 07:55:10,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 07:55:10,136 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:55:10,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:55:10,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1685768235, now seen corresponding path program 1 times
[2023-11-19 07:55:10,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:55:10,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239374973]
[2023-11-19 07:55:10,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:55:10,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:55:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:55:10,425 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked.
[2023-11-19 07:55:10,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:55:10,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239374973]
[2023-11-19 07:55:10,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239374973] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:55:10,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:55:10,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:55:10,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859046151]
[2023-11-19 07:55:10,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:55:10,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:55:10,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:55:10,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:55:10,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:55:10,431 INFO L87 Difference]: Start difference. First operand 560 states and 805 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:10,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:55:10,981 INFO L93 Difference]: Finished difference Result 1257 states and 1812 transitions.
[2023-11-19 07:55:10,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:55:10,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205
[2023-11-19 07:55:10,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:55:10,987 INFO L225 Difference]: With dead ends: 1257
[2023-11-19 07:55:10,987 INFO L226 Difference]: Without dead ends: 699
[2023-11-19 07:55:10,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:55:10,989 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 55 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2023-11-19 07:55:10,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 34 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2023-11-19 07:55:10,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states.
[2023-11-19 07:55:11,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699.
[2023-11-19 07:55:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.32378223495702) internal successors, (924), 698 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 924 transitions.
[2023-11-19 07:55:11,016 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 924 transitions. Word has length 205
[2023-11-19 07:55:11,016 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:55:11,016 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 924 transitions.
[2023-11-19 07:55:11,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 924 transitions.
[2023-11-19 07:55:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217
[2023-11-19 07:55:11,020 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:55:11,021 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:55:11,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-19 07:55:11,021 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:55:11,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:55:11,025 INFO L85 PathProgramCache]: Analyzing trace with hash -137348628, now seen corresponding path program 1 times
[2023-11-19 07:55:11,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:55:11,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906699993]
[2023-11-19 07:55:11,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:55:11,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:55:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:55:11,343 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2023-11-19 07:55:11,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:55:11,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906699993]
[2023-11-19 07:55:11,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906699993] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:55:11,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:55:11,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:55:11,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038495114]
[2023-11-19 07:55:11,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:55:11,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:55:11,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:55:11,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:55:11,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:55:11,350 INFO L87 Difference]: Start difference. First operand 699 states and 924 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:11,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:55:11,915 INFO L93 Difference]: Finished difference Result 1535 states and 2070 transitions.
[2023-11-19 07:55:11,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:55:11,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 216
[2023-11-19 07:55:11,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:55:11,925 INFO L225 Difference]: With dead ends: 1535
[2023-11-19 07:55:11,926 INFO L226 Difference]: Without dead ends: 977
[2023-11-19 07:55:11,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:55:11,933 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 65 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2023-11-19 07:55:11,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 82 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2023-11-19 07:55:11,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states.
[2023-11-19 07:55:11,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977.
[2023-11-19 07:55:11,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.2469262295081966) internal successors, (1217), 976 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1217 transitions.
[2023-11-19 07:55:11,964 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1217 transitions. Word has length 216
[2023-11-19 07:55:11,965 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:55:11,965 INFO L495 AbstractCegarLoop]: Abstraction has 977 states and 1217 transitions.
[2023-11-19 07:55:11,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:11,966 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1217 transitions.
[2023-11-19 07:55:11,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222
[2023-11-19 07:55:11,969 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:55:11,970 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:55:11,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-19 07:55:11,970 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:55:11,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:55:11,971 INFO L85 PathProgramCache]: Analyzing trace with hash 443723181, now seen corresponding path program 1 times
[2023-11-19 07:55:11,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:55:11,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561979902]
[2023-11-19 07:55:11,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:55:11,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:55:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:55:12,243 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:55:12,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:55:12,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561979902]
[2023-11-19 07:55:12,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561979902] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:55:12,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:55:12,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:55:12,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822267344]
[2023-11-19 07:55:12,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:55:12,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:55:12,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:55:12,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:55:12,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:55:12,247 INFO L87 Difference]: Start difference. First operand 977 states and 1217 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:12,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:55:12,769 INFO L93 Difference]: Finished difference Result 1952 states and 2467 transitions.
[2023-11-19 07:55:12,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:55:12,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221
[2023-11-19 07:55:12,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:55:12,777 INFO L225 Difference]: With dead ends: 1952
[2023-11-19 07:55:12,777 INFO L226 Difference]: Without dead ends: 1116
[2023-11-19 07:55:12,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:55:12,779 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 7 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2023-11-19 07:55:12,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 215 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2023-11-19 07:55:12,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states.
[2023-11-19 07:55:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116.
[2023-11-19 07:55:12,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.2251121076233185) internal successors, (1366), 1115 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:12,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1366 transitions.
[2023-11-19 07:55:12,812 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1366 transitions. Word has length 221
[2023-11-19 07:55:12,812 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:55:12,812 INFO L495 AbstractCegarLoop]: Abstraction has 1116 states and 1366 transitions.
[2023-11-19 07:55:12,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:12,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1366 transitions.
[2023-11-19 07:55:12,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231
[2023-11-19 07:55:12,817 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:55:12,817 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:55:12,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-19 07:55:12,817 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:55:12,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:55:12,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1409112351, now seen corresponding path program 1 times
[2023-11-19 07:55:12,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:55:12,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644063968]
[2023-11-19 07:55:12,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:55:12,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:55:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:55:13,368 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:55:13,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:55:13,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644063968]
[2023-11-19 07:55:13,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644063968] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:55:13,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:55:13,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-19 07:55:13,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908910219]
[2023-11-19 07:55:13,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:55:13,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-19 07:55:13,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:55:13,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-19 07:55:13,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2023-11-19 07:55:13,373 INFO L87 Difference]: Start difference. First operand 1116 states and 1366 transitions. Second operand has 7 states, 7 states have (on average 32.857142857142854) internal successors, (230), 6 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:13,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:55:13,886 INFO L93 Difference]: Finished difference Result 2146 states and 2641 transitions.
[2023-11-19 07:55:13,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-11-19 07:55:13,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.857142857142854) internal successors, (230), 6 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 230
[2023-11-19 07:55:13,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:55:13,893 INFO L225 Difference]: With dead ends: 2146
[2023-11-19 07:55:13,893 INFO L226 Difference]: Without dead ends: 1116
[2023-11-19 07:55:13,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2023-11-19 07:55:13,896 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2023-11-19 07:55:13,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 23 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2023-11-19 07:55:13,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states.
[2023-11-19 07:55:13,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116.
[2023-11-19 07:55:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.2188340807174889) internal successors, (1359), 1115 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:13,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1359 transitions.
[2023-11-19 07:55:13,936 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1359 transitions. Word has length 230
[2023-11-19 07:55:13,936 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:55:13,936 INFO L495 AbstractCegarLoop]: Abstraction has 1116 states and 1359 transitions.
[2023-11-19 07:55:13,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.857142857142854) internal successors, (230), 6 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:55:13,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1359 transitions.
[2023-11-19 07:55:13,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267
[2023-11-19 07:55:13,941 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:55:13,942 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:55:13,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-19 07:55:13,942 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:55:13,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:55:13,943 INFO L85 PathProgramCache]: Analyzing trace with hash -322932551, now seen corresponding path program 1 times
[2023-11-19 07:55:13,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:55:13,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016605556]
[2023-11-19 07:55:13,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:55:13,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:55:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:55:14,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 07:55:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:55:14,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 07:55:14,173 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-11-19 07:55:14,174 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2023-11-19 07:55:14,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-19 07:55:14,182 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:55:14,190 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-11-19 07:55:14,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:55:14 BoogieIcfgContainer
[2023-11-19 07:55:14,344 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-19 07:55:14,345 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-19 07:55:14,345 INFO L270 PluginConnector]: Initializing Witness Printer...
[2023-11-19 07:55:14,345 INFO L274 PluginConnector]: Witness Printer initialized
[2023-11-19 07:55:14,346 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:55:04" (3/4) ...
[2023-11-19 07:55:14,347 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2023-11-19 07:55:14,503 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml
[2023-11-19 07:55:14,503 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-19 07:55:14,504 INFO L158 Benchmark]: Toolchain (without parser) took 12644.53ms. Allocated memory was 159.4MB in the beginning and 251.7MB in the end (delta: 92.3MB). Free memory was 109.6MB in the beginning and 208.2MB in the end (delta: -98.7MB). Peak memory consumption was 141.2MB. Max. memory is 16.1GB.
[2023-11-19 07:55:14,504 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 159.4MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-19 07:55:14,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 664.87ms. Allocated memory is still 159.4MB. Free memory was 109.3MB in the beginning and 80.8MB in the end (delta: 28.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB.
[2023-11-19 07:55:14,505 INFO L158 Benchmark]: Boogie Procedure Inliner took 118.10ms. Allocated memory is still 159.4MB. Free memory was 80.8MB in the beginning and 73.0MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2023-11-19 07:55:14,505 INFO L158 Benchmark]: Boogie Preprocessor took 83.67ms. Allocated memory is still 159.4MB. Free memory was 73.0MB in the beginning and 68.2MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2023-11-19 07:55:14,505 INFO L158 Benchmark]: RCFGBuilder took 1502.32ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 68.2MB in the beginning and 99.6MB in the end (delta: -31.4MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB.
[2023-11-19 07:55:14,506 INFO L158 Benchmark]: TraceAbstraction took 10109.90ms. Allocated memory was 207.6MB in the beginning and 251.7MB in the end (delta: 44.0MB). Free memory was 98.6MB in the beginning and 78.4MB in the end (delta: 20.2MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB.
[2023-11-19 07:55:14,506 INFO L158 Benchmark]: Witness Printer took 158.20ms. Allocated memory is still 251.7MB. Free memory was 78.4MB in the beginning and 208.2MB in the end (delta: -129.8MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB.
[2023-11-19 07:55:14,508 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.29ms. Allocated memory is still 159.4MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 664.87ms. Allocated memory is still 159.4MB. Free memory was 109.3MB in the beginning and 80.8MB in the end (delta: 28.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 118.10ms. Allocated memory is still 159.4MB. Free memory was 80.8MB in the beginning and 73.0MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 83.67ms. Allocated memory is still 159.4MB. Free memory was 73.0MB in the beginning and 68.2MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* RCFGBuilder took 1502.32ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 68.2MB in the beginning and 99.6MB in the end (delta: -31.4MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB.
* TraceAbstraction took 10109.90ms. Allocated memory was 207.6MB in the beginning and 251.7MB in the end (delta: 44.0MB). Free memory was 98.6MB in the beginning and 78.4MB in the end (delta: 20.2MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB.
* Witness Printer took 158.20ms. Allocated memory is still 251.7MB. Free memory was 78.4MB in the beginning and 208.2MB in the end (delta: -129.8MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- CounterExampleResult [Line: 68]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L17] int inputC = 3;
[L18] int inputD = 4;
[L19] int inputE = 5;
[L20] int inputF = 6;
[L21] int inputB = 2;
[L24] int a1 = 23;
[L25] int a19 = 9;
[L26] int a10 = 0;
[L27] int a12 = 0;
[L28] int a4 = 14;
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L589] int output = -1;
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1]
[L592] COND TRUE 1
[L595] int input;
[L596] EXPR input = __VERIFIER_nondet_int()
[L597] COND FALSE, EXPR !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L600] CALL, EXPR calculate_output(input)
[L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 ))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14))))))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L235] 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(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3)))))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9))))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0))))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L270] 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(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L287] 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(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 ))))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L301] 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(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0))))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2))))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14)))))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14)))))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)))))))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L375] 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(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4))))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L398] 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(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14))))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14))))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L413] 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(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2)))))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14)))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10))))))
VAL [\old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L435] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))
[L436] a1 = ((((a1 / 5) * 5) / 5) + 505228)
[L437] a10 = 1
[L439] return 25;
VAL [\old(input)=3, \result=25, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L600] RET, EXPR calculate_output(input)
[L600] EXPR output = calculate_output(input)
[L593-L601] {
// read input
int input;
input = __VERIFIER_nondet_int();
if ((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2;
// operate eca engine
output = calculate_output(input);
}
VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25]
[L592] COND TRUE 1
[L595] int input;
[L596] EXPR input = __VERIFIER_nondet_int()
[L597] COND FALSE, EXPR !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L600] CALL, EXPR calculate_output(input)
[L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 ))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14))))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L235] 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(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3)))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L270] 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(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L287] 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(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 ))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L301] 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(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14)))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14)))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)))))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L375] 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(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L398] 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(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L413] 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(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2)))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10))))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L435] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L440] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L446] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L452] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L458] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L464] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L470] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0)))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L475] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14)))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L481] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L486] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L491] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L497] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L503] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L509] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L514] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L519] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L524] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L527] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10)))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L533] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L536] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0))))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L539] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L544] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0))))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L550] COND FALSE !(((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L555] COND FALSE !(((a4==14) && (((a12==0) && ((a19==9) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a10==4))))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L558] COND FALSE !(((((( ((38 < a1) && (218 >= a1)) && (input == 3)) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L564] COND FALSE !((((a4==14) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 4)) && (a12==0)) && (a19==9))) && (a10==2)))
VAL [\old(input)=5, a10=1, a12=0, a19=9, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L567] COND TRUE ((a12==0) && ((( 218 < a1 && ((a19==9) && (input == 5))) && (a10==1)) && (a4==14)))
[L568] a1 = ((((a1 * 9)/ 10) + 58620) - 603783)
[L569] a10 = 4
[L570] a19 = 8
[L572] return -1;
VAL [\old(input)=5, \result=-1, a10=4, a12=0, a19=8, a1=-90455, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L600] RET, EXPR calculate_output(input)
[L600] EXPR output = calculate_output(input)
[L593-L601] {
// read input
int input;
input = __VERIFIER_nondet_int();
if ((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2;
// operate eca engine
output = calculate_output(input);
}
VAL [a10=4, a12=0, a19=8, a1=-90455, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1]
[L592] COND TRUE 1
[L595] int input;
[L596] input = __VERIFIER_nondet_int()
[L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L600] CALL calculate_output(input)
[L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [\old(input)=6, a10=4, a12=0, a19=8, a1=-90455, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [\old(input)=6, a10=4, a12=0, a19=8, a1=-90455, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [\old(input)=6, a10=4, a12=0, a19=8, a1=-90455, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [\old(input)=6, a10=4, a12=0, a19=8, a1=-90455, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [\old(input)=6, a10=4, a12=0, a19=8, a1=-90455, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [\old(input)=6, a10=4, a12=0, a19=8, a1=-90455, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [\old(input)=6, a10=4, a12=0, a19=8, a1=-90455, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [\old(input)=6, a10=4, a12=0, a19=8, a1=-90455, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [\old(input)=6, a10=4, a12=0, a19=8, a1=-90455, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [\old(input)=6, a10=4, a12=0, a19=8, a1=-90455, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [\old(input)=6, a10=4, a12=0, a19=8, a1=-90455, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [\old(input)=6, a10=4, a12=0, a19=8, a1=-90455, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L67] COND TRUE (((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))
VAL [\old(input)=6, a10=4, a12=0, a19=8, a1=-90455, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L68] reach_error()
VAL [\old(input)=6, a10=4, a12=0, a19=8, a1=-90455, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 753 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 753 mSDsluCounter, 475 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 525 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3146 IncrementalHoareTripleChecker+Invalid, 3671 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 525 mSolverCounterUnsat, 430 mSDtfsCounter, 3146 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1116occurred in iteration=7, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 556 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1675 NumberOfCodeBlocks, 1675 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1400 ConstructedInterpolants, 0 QuantifiedInterpolants, 5024 SizeOfPredicates, 0 NumberOfNonLiveVariables, 267 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 565/626 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2023-11-19 07:55:14,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e2f7612-6562-4e8c-8bb2-595faa77cadf/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE