./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label25.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label25.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 a416c03462f8e833544e0a8c7a769c7a529ab7531b377c23818c9ffe8eca1bdc --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:09:13,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:09:13,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:09:13,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:09:13,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:09:13,983 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:09:13,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:09:13,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:09:13,985 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:09:13,985 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:09:13,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:09:13,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:09:13,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:09:13,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:09:13,987 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:09:13,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:09:13,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:09:13,987 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:09:13,987 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:09:13,988 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:09:13,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:09:13,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:09:13,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:09:13,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:09:13,988 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:09:13,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:09:13,988 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:09:13,988 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:09:13,988 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:09:13,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:09:13,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:09:13,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:09:13,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:09:13,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:09:13,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:09:13,989 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:09:13,990 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:09:13,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:09:13,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:09:13,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:09:13,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:09:13,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:09:13,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:09:13,990 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> a416c03462f8e833544e0a8c7a769c7a529ab7531b377c23818c9ffe8eca1bdc [2025-03-16 15:09:14,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:09:14,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:09:14,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:09:14,209 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:09:14,209 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:09:14,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label25.c [2025-03-16 15:09:15,306 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a5b10d8/c2cce60cb9d540bb9af0f56950f26116/FLAG75130b3c5 [2025-03-16 15:09:15,663 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:09:15,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label25.c [2025-03-16 15:09:15,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a5b10d8/c2cce60cb9d540bb9af0f56950f26116/FLAG75130b3c5 [2025-03-16 15:09:15,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a5b10d8/c2cce60cb9d540bb9af0f56950f26116 [2025-03-16 15:09:15,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:09:15,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:09:15,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:09:15,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:09:15,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:09:15,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:09:15" (1/1) ... [2025-03-16 15:09:15,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc0bd47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:15, skipping insertion in model container [2025-03-16 15:09:15,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:09:15" (1/1) ... [2025-03-16 15:09:15,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:09:16,032 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label25.c[3069,3082] [2025-03-16 15:09:16,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:09:16,329 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:09:16,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label25.c[3069,3082] [2025-03-16 15:09:16,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:09:16,503 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:09:16,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:16 WrapperNode [2025-03-16 15:09:16,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:09:16,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:09:16,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:09:16,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:09:16,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:16" (1/1) ... [2025-03-16 15:09:16,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:16" (1/1) ... [2025-03-16 15:09:16,644 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-03-16 15:09:16,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:09:16,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:09:16,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:09:16,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:09:16,651 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:16" (1/1) ... [2025-03-16 15:09:16,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:16" (1/1) ... [2025-03-16 15:09:16,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:16" (1/1) ... [2025-03-16 15:09:16,758 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:09:16,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:16" (1/1) ... [2025-03-16 15:09:16,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:16" (1/1) ... [2025-03-16 15:09:16,811 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:16" (1/1) ... [2025-03-16 15:09:16,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:16" (1/1) ... [2025-03-16 15:09:16,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:16" (1/1) ... [2025-03-16 15:09:16,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:16" (1/1) ... [2025-03-16 15:09:16,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:09:16,884 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:09:16,884 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:09:16,884 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:09:16,885 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:16" (1/1) ... [2025-03-16 15:09:16,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:09:16,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:09:16,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:09:16,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:09:16,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:09:16,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:09:16,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:09:16,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:09:16,984 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:09:16,986 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:09:18,798 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-03-16 15:09:18,860 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-03-16 15:09:18,860 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:09:18,871 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:09:18,871 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:09:18,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:09:18 BoogieIcfgContainer [2025-03-16 15:09:18,871 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:09:18,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:09:18,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:09:18,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:09:18,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:09:15" (1/3) ... [2025-03-16 15:09:18,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aee52a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:09:18, skipping insertion in model container [2025-03-16 15:09:18,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:09:16" (2/3) ... [2025-03-16 15:09:18,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aee52a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:09:18, skipping insertion in model container [2025-03-16 15:09:18,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:09:18" (3/3) ... [2025-03-16 15:09:18,877 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label25.c [2025-03-16 15:09:18,886 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:09:18,887 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label25.c that has 1 procedures, 363 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:09:18,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:09:18,945 INFO L333 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, 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;@3604caec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:09:18,945 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:09:18,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 363 states, 361 states have (on average 1.9058171745152355) internal successors, (688), 362 states have internal predecessors, (688), 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) [2025-03-16 15:09:18,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 15:09:18,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:18,955 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:18,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:18,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:18,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1696735185, now seen corresponding path program 1 times [2025-03-16 15:09:18,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:18,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343560802] [2025-03-16 15:09:18,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:18,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:19,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 15:09:19,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 15:09:19,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:19,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:09:19,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:19,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343560802] [2025-03-16 15:09:19,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343560802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:19,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:19,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:09:19,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345850612] [2025-03-16 15:09:19,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:19,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:09:19,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:19,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:09:19,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:09:19,081 INFO L87 Difference]: Start difference. First operand has 363 states, 361 states have (on average 1.9058171745152355) internal successors, (688), 362 states have internal predecessors, (688), 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 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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) [2025-03-16 15:09:19,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:19,127 INFO L93 Difference]: Finished difference Result 725 states and 1375 transitions. [2025-03-16 15:09:19,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:09:19,129 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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 23 [2025-03-16 15:09:19,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:19,137 INFO L225 Difference]: With dead ends: 725 [2025-03-16 15:09:19,138 INFO L226 Difference]: Without dead ends: 360 [2025-03-16 15:09:19,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:09:19,146 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:19,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:09:19,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-16 15:09:19,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-16 15:09:19,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.7353760445682451) internal successors, (623), 359 states have internal predecessors, (623), 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) [2025-03-16 15:09:19,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2025-03-16 15:09:19,196 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 23 [2025-03-16 15:09:19,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:19,196 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2025-03-16 15:09:19,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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) [2025-03-16 15:09:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2025-03-16 15:09:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 15:09:19,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:19,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:19,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:09:19,197 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:19,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:19,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1507765299, now seen corresponding path program 1 times [2025-03-16 15:09:19,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:19,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051318558] [2025-03-16 15:09:19,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:19,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:19,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 15:09:19,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 15:09:19,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:19,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:09:19,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:19,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051318558] [2025-03-16 15:09:19,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051318558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:19,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:19,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:09:19,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716659359] [2025-03-16 15:09:19,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:19,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:19,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:19,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:19,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:19,298 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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) [2025-03-16 15:09:20,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:20,962 INFO L93 Difference]: Finished difference Result 1046 states and 1824 transitions. [2025-03-16 15:09:20,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:20,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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 23 [2025-03-16 15:09:20,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:20,965 INFO L225 Difference]: With dead ends: 1046 [2025-03-16 15:09:20,965 INFO L226 Difference]: Without dead ends: 687 [2025-03-16 15:09:20,966 INFO L434 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 [2025-03-16 15:09:20,966 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 313 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:20,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 193 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:09:20,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-03-16 15:09:20,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 679. [2025-03-16 15:09:20,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 678 states have (on average 1.6106194690265487) internal successors, (1092), 678 states have internal predecessors, (1092), 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) [2025-03-16 15:09:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1092 transitions. [2025-03-16 15:09:20,991 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1092 transitions. Word has length 23 [2025-03-16 15:09:20,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:20,991 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 1092 transitions. [2025-03-16 15:09:20,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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) [2025-03-16 15:09:20,992 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1092 transitions. [2025-03-16 15:09:20,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 15:09:20,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:20,994 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:09:20,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:09:20,995 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:20,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:20,996 INFO L85 PathProgramCache]: Analyzing trace with hash -769773431, now seen corresponding path program 1 times [2025-03-16 15:09:20,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:20,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416653809] [2025-03-16 15:09:20,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:20,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:21,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 15:09:21,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 15:09:21,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:21,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:09:21,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:21,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416653809] [2025-03-16 15:09:21,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416653809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:21,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:21,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:09:21,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393664100] [2025-03-16 15:09:21,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:21,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:21,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:21,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:21,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:21,250 INFO L87 Difference]: Start difference. First operand 679 states and 1092 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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) [2025-03-16 15:09:22,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:22,339 INFO L93 Difference]: Finished difference Result 1963 states and 3170 transitions. [2025-03-16 15:09:22,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:22,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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 91 [2025-03-16 15:09:22,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:22,343 INFO L225 Difference]: With dead ends: 1963 [2025-03-16 15:09:22,343 INFO L226 Difference]: Without dead ends: 1285 [2025-03-16 15:09:22,344 INFO L434 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 [2025-03-16 15:09:22,344 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 282 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:22,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 360 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:09:22,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2025-03-16 15:09:22,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1280. [2025-03-16 15:09:22,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 1.3956215793588742) internal successors, (1785), 1279 states have internal predecessors, (1785), 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) [2025-03-16 15:09:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1785 transitions. [2025-03-16 15:09:22,371 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1785 transitions. Word has length 91 [2025-03-16 15:09:22,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:22,372 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1785 transitions. [2025-03-16 15:09:22,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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) [2025-03-16 15:09:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1785 transitions. [2025-03-16 15:09:22,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 15:09:22,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:22,373 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:09:22,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:09:22,373 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:22,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:22,374 INFO L85 PathProgramCache]: Analyzing trace with hash -543141643, now seen corresponding path program 1 times [2025-03-16 15:09:22,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:22,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850906732] [2025-03-16 15:09:22,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:22,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:22,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 15:09:22,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 15:09:22,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:22,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:22,545 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:09:22,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:22,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850906732] [2025-03-16 15:09:22,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850906732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:22,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:22,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:09:22,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251670896] [2025-03-16 15:09:22,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:22,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:22,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:22,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:22,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:22,546 INFO L87 Difference]: Start difference. First operand 1280 states and 1785 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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) [2025-03-16 15:09:23,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:23,678 INFO L93 Difference]: Finished difference Result 3765 states and 5245 transitions. [2025-03-16 15:09:23,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:23,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 99 [2025-03-16 15:09:23,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:23,688 INFO L225 Difference]: With dead ends: 3765 [2025-03-16 15:09:23,688 INFO L226 Difference]: Without dead ends: 2486 [2025-03-16 15:09:23,691 INFO L434 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 [2025-03-16 15:09:23,694 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 304 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:23,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 634 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:09:23,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2025-03-16 15:09:23,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2486. [2025-03-16 15:09:23,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2485 states have (on average 1.2446680080482897) internal successors, (3093), 2485 states have internal predecessors, (3093), 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) [2025-03-16 15:09:23,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3093 transitions. [2025-03-16 15:09:23,732 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3093 transitions. Word has length 99 [2025-03-16 15:09:23,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:23,732 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 3093 transitions. [2025-03-16 15:09:23,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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) [2025-03-16 15:09:23,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3093 transitions. [2025-03-16 15:09:23,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 15:09:23,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:23,733 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:09:23,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:09:23,733 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:23,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:23,734 INFO L85 PathProgramCache]: Analyzing trace with hash -2027881989, now seen corresponding path program 1 times [2025-03-16 15:09:23,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:23,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667155424] [2025-03-16 15:09:23,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:23,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:23,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 15:09:23,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 15:09:23,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:23,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:23,871 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:09:23,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:23,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667155424] [2025-03-16 15:09:23,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667155424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:23,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:23,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:09:23,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200618090] [2025-03-16 15:09:23,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:23,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:23,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:23,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:23,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:23,872 INFO L87 Difference]: Start difference. First operand 2486 states and 3093 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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) [2025-03-16 15:09:24,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:24,978 INFO L93 Difference]: Finished difference Result 6172 states and 7858 transitions. [2025-03-16 15:09:24,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:24,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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 105 [2025-03-16 15:09:24,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:24,987 INFO L225 Difference]: With dead ends: 6172 [2025-03-16 15:09:24,987 INFO L226 Difference]: Without dead ends: 3687 [2025-03-16 15:09:24,990 INFO L434 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 [2025-03-16 15:09:24,990 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 233 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:24,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 362 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:09:24,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3687 states. [2025-03-16 15:09:25,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3687 to 3386. [2025-03-16 15:09:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.2115214180206795) internal successors, (4101), 3385 states have internal predecessors, (4101), 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) [2025-03-16 15:09:25,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 4101 transitions. [2025-03-16 15:09:25,031 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 4101 transitions. Word has length 105 [2025-03-16 15:09:25,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:25,031 INFO L471 AbstractCegarLoop]: Abstraction has 3386 states and 4101 transitions. [2025-03-16 15:09:25,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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) [2025-03-16 15:09:25,031 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 4101 transitions. [2025-03-16 15:09:25,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-16 15:09:25,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:25,033 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:25,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:09:25,033 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:25,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:25,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1817356896, now seen corresponding path program 1 times [2025-03-16 15:09:25,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:25,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12768153] [2025-03-16 15:09:25,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:25,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:25,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-16 15:09:25,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-16 15:09:25,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:25,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:25,309 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 15:09:25,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:25,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12768153] [2025-03-16 15:09:25,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12768153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:25,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:25,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:09:25,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573674732] [2025-03-16 15:09:25,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:25,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:25,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:25,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:25,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:25,311 INFO L87 Difference]: Start difference. First operand 3386 states and 4101 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 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) [2025-03-16 15:09:26,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:26,324 INFO L93 Difference]: Finished difference Result 9171 states and 11159 transitions. [2025-03-16 15:09:26,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:26,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 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 219 [2025-03-16 15:09:26,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:26,337 INFO L225 Difference]: With dead ends: 9171 [2025-03-16 15:09:26,338 INFO L226 Difference]: Without dead ends: 5786 [2025-03-16 15:09:26,342 INFO L434 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 [2025-03-16 15:09:26,342 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 117 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:26,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 318 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:09:26,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5786 states. [2025-03-16 15:09:26,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5786 to 5185. [2025-03-16 15:09:26,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5185 states, 5184 states have (on average 1.177854938271605) internal successors, (6106), 5184 states have internal predecessors, (6106), 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) [2025-03-16 15:09:26,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5185 states to 5185 states and 6106 transitions. [2025-03-16 15:09:26,427 INFO L78 Accepts]: Start accepts. Automaton has 5185 states and 6106 transitions. Word has length 219 [2025-03-16 15:09:26,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:26,428 INFO L471 AbstractCegarLoop]: Abstraction has 5185 states and 6106 transitions. [2025-03-16 15:09:26,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 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) [2025-03-16 15:09:26,429 INFO L276 IsEmpty]: Start isEmpty. Operand 5185 states and 6106 transitions. [2025-03-16 15:09:26,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-16 15:09:26,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:26,432 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:26,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:09:26,432 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:26,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:26,433 INFO L85 PathProgramCache]: Analyzing trace with hash -363645935, now seen corresponding path program 1 times [2025-03-16 15:09:26,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:26,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586969314] [2025-03-16 15:09:26,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:26,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:26,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-16 15:09:26,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-16 15:09:26,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:26,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:26,877 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-16 15:09:26,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:26,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586969314] [2025-03-16 15:09:26,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586969314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:26,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:26,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:09:26,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841294072] [2025-03-16 15:09:26,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:26,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:26,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:26,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:26,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:26,879 INFO L87 Difference]: Start difference. First operand 5185 states and 6106 transitions. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 2 states have internal predecessors, (279), 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) [2025-03-16 15:09:27,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:27,802 INFO L93 Difference]: Finished difference Result 10668 states and 12522 transitions. [2025-03-16 15:09:27,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:27,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 2 states have internal predecessors, (279), 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 300 [2025-03-16 15:09:27,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:27,813 INFO L225 Difference]: With dead ends: 10668 [2025-03-16 15:09:27,813 INFO L226 Difference]: Without dead ends: 5484 [2025-03-16 15:09:27,818 INFO L434 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 [2025-03-16 15:09:27,819 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:27,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 358 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:09:27,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5484 states. [2025-03-16 15:09:27,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5484 to 5484. [2025-03-16 15:09:27,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5484 states, 5483 states have (on average 1.1692504103592924) internal successors, (6411), 5483 states have internal predecessors, (6411), 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) [2025-03-16 15:09:27,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5484 states to 5484 states and 6411 transitions. [2025-03-16 15:09:27,876 INFO L78 Accepts]: Start accepts. Automaton has 5484 states and 6411 transitions. Word has length 300 [2025-03-16 15:09:27,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:27,876 INFO L471 AbstractCegarLoop]: Abstraction has 5484 states and 6411 transitions. [2025-03-16 15:09:27,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 2 states have internal predecessors, (279), 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) [2025-03-16 15:09:27,876 INFO L276 IsEmpty]: Start isEmpty. Operand 5484 states and 6411 transitions. [2025-03-16 15:09:27,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-03-16 15:09:27,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:27,878 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:27,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:09:27,880 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:27,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:27,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1434232155, now seen corresponding path program 1 times [2025-03-16 15:09:27,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:27,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061234487] [2025-03-16 15:09:27,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:27,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:27,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-16 15:09:27,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-16 15:09:27,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:27,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:28,085 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-16 15:09:28,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:28,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061234487] [2025-03-16 15:09:28,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061234487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:28,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:28,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:09:28,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647597465] [2025-03-16 15:09:28,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:28,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:28,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:28,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:28,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:28,087 INFO L87 Difference]: Start difference. First operand 5484 states and 6411 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) [2025-03-16 15:09:29,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:29,346 INFO L93 Difference]: Finished difference Result 12761 states and 15151 transitions. [2025-03-16 15:09:29,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:29,346 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 310 [2025-03-16 15:09:29,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:29,361 INFO L225 Difference]: With dead ends: 12761 [2025-03-16 15:09:29,361 INFO L226 Difference]: Without dead ends: 7577 [2025-03-16 15:09:29,365 INFO L434 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 [2025-03-16 15:09:29,365 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 290 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:29,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 323 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:09:29,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7577 states. [2025-03-16 15:09:29,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7577 to 4882. [2025-03-16 15:09:29,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4882 states, 4881 states have (on average 1.1798811718910058) internal successors, (5759), 4881 states have internal predecessors, (5759), 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) [2025-03-16 15:09:29,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4882 states to 4882 states and 5759 transitions. [2025-03-16 15:09:29,419 INFO L78 Accepts]: Start accepts. Automaton has 4882 states and 5759 transitions. Word has length 310 [2025-03-16 15:09:29,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:29,419 INFO L471 AbstractCegarLoop]: Abstraction has 4882 states and 5759 transitions. [2025-03-16 15:09:29,419 INFO L472 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) [2025-03-16 15:09:29,419 INFO L276 IsEmpty]: Start isEmpty. Operand 4882 states and 5759 transitions. [2025-03-16 15:09:29,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-03-16 15:09:29,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:29,447 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:29,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:09:29,447 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:29,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:29,448 INFO L85 PathProgramCache]: Analyzing trace with hash 300418018, now seen corresponding path program 1 times [2025-03-16 15:09:29,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:29,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936625919] [2025-03-16 15:09:29,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:29,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:29,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-16 15:09:29,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-16 15:09:29,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:29,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:29,749 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:09:29,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:29,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936625919] [2025-03-16 15:09:29,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936625919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:29,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:29,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:09:29,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788465396] [2025-03-16 15:09:29,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:29,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:29,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:29,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:29,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:29,752 INFO L87 Difference]: Start difference. First operand 4882 states and 5759 transitions. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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) [2025-03-16 15:09:30,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:30,724 INFO L93 Difference]: Finished difference Result 11269 states and 13600 transitions. [2025-03-16 15:09:30,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:30,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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 375 [2025-03-16 15:09:30,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:30,737 INFO L225 Difference]: With dead ends: 11269 [2025-03-16 15:09:30,737 INFO L226 Difference]: Without dead ends: 6687 [2025-03-16 15:09:30,741 INFO L434 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 [2025-03-16 15:09:30,742 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 250 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:30,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 600 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:09:30,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6687 states. [2025-03-16 15:09:30,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6687 to 6385. [2025-03-16 15:09:30,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6385 states, 6384 states have (on average 1.157111528822055) internal successors, (7387), 6384 states have internal predecessors, (7387), 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) [2025-03-16 15:09:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6385 states to 6385 states and 7387 transitions. [2025-03-16 15:09:30,826 INFO L78 Accepts]: Start accepts. Automaton has 6385 states and 7387 transitions. Word has length 375 [2025-03-16 15:09:30,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:30,826 INFO L471 AbstractCegarLoop]: Abstraction has 6385 states and 7387 transitions. [2025-03-16 15:09:30,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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) [2025-03-16 15:09:30,827 INFO L276 IsEmpty]: Start isEmpty. Operand 6385 states and 7387 transitions. [2025-03-16 15:09:30,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-16 15:09:30,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:30,830 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:30,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:09:30,830 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:30,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:30,832 INFO L85 PathProgramCache]: Analyzing trace with hash 702514806, now seen corresponding path program 1 times [2025-03-16 15:09:30,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:30,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588019895] [2025-03-16 15:09:30,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:30,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:30,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-16 15:09:30,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-16 15:09:30,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:30,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:31,023 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-16 15:09:31,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:31,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588019895] [2025-03-16 15:09:31,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588019895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:31,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:31,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:09:31,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333314855] [2025-03-16 15:09:31,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:31,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:31,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:31,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:31,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:31,025 INFO L87 Difference]: Start difference. First operand 6385 states and 7387 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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) [2025-03-16 15:09:32,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:32,441 INFO L93 Difference]: Finished difference Result 14264 states and 16843 transitions. [2025-03-16 15:09:32,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:32,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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 391 [2025-03-16 15:09:32,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:32,454 INFO L225 Difference]: With dead ends: 14264 [2025-03-16 15:09:32,454 INFO L226 Difference]: Without dead ends: 8179 [2025-03-16 15:09:32,458 INFO L434 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 [2025-03-16 15:09:32,459 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 245 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:32,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 617 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:09:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8179 states. [2025-03-16 15:09:32,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8179 to 7876. [2025-03-16 15:09:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7876 states, 7875 states have (on average 1.1445079365079365) internal successors, (9013), 7875 states have internal predecessors, (9013), 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) [2025-03-16 15:09:32,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7876 states to 7876 states and 9013 transitions. [2025-03-16 15:09:32,520 INFO L78 Accepts]: Start accepts. Automaton has 7876 states and 9013 transitions. Word has length 391 [2025-03-16 15:09:32,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:32,520 INFO L471 AbstractCegarLoop]: Abstraction has 7876 states and 9013 transitions. [2025-03-16 15:09:32,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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) [2025-03-16 15:09:32,520 INFO L276 IsEmpty]: Start isEmpty. Operand 7876 states and 9013 transitions. [2025-03-16 15:09:32,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-03-16 15:09:32,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:32,526 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:32,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:09:32,526 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:32,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:32,527 INFO L85 PathProgramCache]: Analyzing trace with hash -646243342, now seen corresponding path program 1 times [2025-03-16 15:09:32,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:32,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931721325] [2025-03-16 15:09:32,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:32,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:32,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-03-16 15:09:32,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-03-16 15:09:32,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:32,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:32,693 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2025-03-16 15:09:32,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:32,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931721325] [2025-03-16 15:09:32,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931721325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:32,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:32,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:09:32,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470358306] [2025-03-16 15:09:32,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:32,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:32,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:32,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:32,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:32,695 INFO L87 Difference]: Start difference. First operand 7876 states and 9013 transitions. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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) [2025-03-16 15:09:33,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:33,624 INFO L93 Difference]: Finished difference Result 17843 states and 20677 transitions. [2025-03-16 15:09:33,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:33,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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 487 [2025-03-16 15:09:33,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:33,640 INFO L225 Difference]: With dead ends: 17843 [2025-03-16 15:09:33,640 INFO L226 Difference]: Without dead ends: 10267 [2025-03-16 15:09:33,647 INFO L434 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 [2025-03-16 15:09:33,647 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 391 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:33,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 444 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:09:33,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10267 states. [2025-03-16 15:09:33,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10267 to 10267. [2025-03-16 15:09:33,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10267 states, 10266 states have (on average 1.1468926553672316) internal successors, (11774), 10266 states have internal predecessors, (11774), 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) [2025-03-16 15:09:33,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10267 states to 10267 states and 11774 transitions. [2025-03-16 15:09:33,733 INFO L78 Accepts]: Start accepts. Automaton has 10267 states and 11774 transitions. Word has length 487 [2025-03-16 15:09:33,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:33,733 INFO L471 AbstractCegarLoop]: Abstraction has 10267 states and 11774 transitions. [2025-03-16 15:09:33,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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) [2025-03-16 15:09:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 10267 states and 11774 transitions. [2025-03-16 15:09:33,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2025-03-16 15:09:33,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:33,737 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:33,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:09:33,737 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:33,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:33,738 INFO L85 PathProgramCache]: Analyzing trace with hash -972608041, now seen corresponding path program 1 times [2025-03-16 15:09:33,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:33,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36913578] [2025-03-16 15:09:33,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:33,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:33,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 511 statements into 1 equivalence classes. [2025-03-16 15:09:33,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 511 of 511 statements. [2025-03-16 15:09:33,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:33,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:34,096 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-16 15:09:34,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:34,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36913578] [2025-03-16 15:09:34,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36913578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:34,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:34,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:09:34,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677833747] [2025-03-16 15:09:34,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:34,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:34,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:34,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:34,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:34,098 INFO L87 Difference]: Start difference. First operand 10267 states and 11774 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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) [2025-03-16 15:09:35,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:35,175 INFO L93 Difference]: Finished difference Result 25032 states and 28937 transitions. [2025-03-16 15:09:35,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:35,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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 511 [2025-03-16 15:09:35,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:35,195 INFO L225 Difference]: With dead ends: 25032 [2025-03-16 15:09:35,195 INFO L226 Difference]: Without dead ends: 15065 [2025-03-16 15:09:35,203 INFO L434 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 [2025-03-16 15:09:35,204 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 246 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:35,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 621 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:09:35,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15065 states. [2025-03-16 15:09:35,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15065 to 14456. [2025-03-16 15:09:35,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14456 states, 14455 states have (on average 1.1328951919750951) internal successors, (16376), 14455 states have internal predecessors, (16376), 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) [2025-03-16 15:09:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14456 states to 14456 states and 16376 transitions. [2025-03-16 15:09:35,361 INFO L78 Accepts]: Start accepts. Automaton has 14456 states and 16376 transitions. Word has length 511 [2025-03-16 15:09:35,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:35,362 INFO L471 AbstractCegarLoop]: Abstraction has 14456 states and 16376 transitions. [2025-03-16 15:09:35,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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) [2025-03-16 15:09:35,362 INFO L276 IsEmpty]: Start isEmpty. Operand 14456 states and 16376 transitions. [2025-03-16 15:09:35,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2025-03-16 15:09:35,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:35,368 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2025-03-16 15:09:35,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:09:35,368 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:35,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:35,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1393590147, now seen corresponding path program 1 times [2025-03-16 15:09:35,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:35,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522685424] [2025-03-16 15:09:35,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:35,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:35,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 578 statements into 1 equivalence classes. [2025-03-16 15:09:35,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 578 of 578 statements. [2025-03-16 15:09:35,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:35,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 540 proven. 39 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-16 15:09:35,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:35,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522685424] [2025-03-16 15:09:35,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522685424] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:09:35,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205021910] [2025-03-16 15:09:35,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:35,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:09:35,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:09:35,811 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:09:35,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:09:35,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 578 statements into 1 equivalence classes. [2025-03-16 15:09:35,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 578 of 578 statements. [2025-03-16 15:09:35,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:35,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:35,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 15:09:35,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:09:36,557 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 540 proven. 39 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-16 15:09:36,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:09:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 540 proven. 39 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-16 15:09:37,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205021910] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:09:37,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:09:37,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-16 15:09:37,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468127338] [2025-03-16 15:09:37,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:09:37,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 15:09:37,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:37,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 15:09:37,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:09:37,116 INFO L87 Difference]: Start difference. First operand 14456 states and 16376 transitions. Second operand has 9 states, 9 states have (on average 80.44444444444444) internal successors, (724), 8 states have internal predecessors, (724), 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) [2025-03-16 15:09:41,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:41,433 INFO L93 Difference]: Finished difference Result 37245 states and 41900 transitions. [2025-03-16 15:09:41,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 15:09:41,433 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 80.44444444444444) internal successors, (724), 8 states have internal predecessors, (724), 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 578 [2025-03-16 15:09:41,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:41,455 INFO L225 Difference]: With dead ends: 37245 [2025-03-16 15:09:41,455 INFO L226 Difference]: Without dead ends: 16849 [2025-03-16 15:09:41,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1165 GetRequests, 1151 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-03-16 15:09:41,470 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 2853 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 6152 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2853 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 6839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 6152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:41,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2853 Valid, 267 Invalid, 6839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 6152 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-16 15:09:41,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16849 states. [2025-03-16 15:09:41,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16849 to 12660. [2025-03-16 15:09:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12660 states, 12659 states have (on average 1.066987913737262) internal successors, (13507), 12659 states have internal predecessors, (13507), 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) [2025-03-16 15:09:41,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12660 states to 12660 states and 13507 transitions. [2025-03-16 15:09:41,583 INFO L78 Accepts]: Start accepts. Automaton has 12660 states and 13507 transitions. Word has length 578 [2025-03-16 15:09:41,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:41,584 INFO L471 AbstractCegarLoop]: Abstraction has 12660 states and 13507 transitions. [2025-03-16 15:09:41,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 80.44444444444444) internal successors, (724), 8 states have internal predecessors, (724), 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) [2025-03-16 15:09:41,584 INFO L276 IsEmpty]: Start isEmpty. Operand 12660 states and 13507 transitions. [2025-03-16 15:09:41,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2025-03-16 15:09:41,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:41,589 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:41,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 15:09:41,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 15:09:41,790 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:41,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:41,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1808373084, now seen corresponding path program 1 times [2025-03-16 15:09:41,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:41,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977321089] [2025-03-16 15:09:41,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:41,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:41,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes. [2025-03-16 15:09:41,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements. [2025-03-16 15:09:41,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:41,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:42,020 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2025-03-16 15:09:42,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:42,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977321089] [2025-03-16 15:09:42,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977321089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:42,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:42,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:09:42,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610718364] [2025-03-16 15:09:42,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:42,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:42,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:42,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:42,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:42,023 INFO L87 Difference]: Start difference. First operand 12660 states and 13507 transitions. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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) [2025-03-16 15:09:42,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:42,772 INFO L93 Difference]: Finished difference Result 25317 states and 27023 transitions. [2025-03-16 15:09:42,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:42,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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 603 [2025-03-16 15:09:42,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:42,787 INFO L225 Difference]: With dead ends: 25317 [2025-03-16 15:09:42,787 INFO L226 Difference]: Without dead ends: 12957 [2025-03-16 15:09:42,795 INFO L434 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 [2025-03-16 15:09:42,796 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 436 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:42,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 68 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:09:42,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12957 states. [2025-03-16 15:09:42,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12957 to 12658. [2025-03-16 15:09:42,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12658 states, 12657 states have (on average 1.066840483526902) internal successors, (13503), 12657 states have internal predecessors, (13503), 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) [2025-03-16 15:09:42,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12658 states to 12658 states and 13503 transitions. [2025-03-16 15:09:42,897 INFO L78 Accepts]: Start accepts. Automaton has 12658 states and 13503 transitions. Word has length 603 [2025-03-16 15:09:42,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:42,897 INFO L471 AbstractCegarLoop]: Abstraction has 12658 states and 13503 transitions. [2025-03-16 15:09:42,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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) [2025-03-16 15:09:42,897 INFO L276 IsEmpty]: Start isEmpty. Operand 12658 states and 13503 transitions. [2025-03-16 15:09:42,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2025-03-16 15:09:42,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:42,902 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:42,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:09:42,903 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:42,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:42,903 INFO L85 PathProgramCache]: Analyzing trace with hash -31537858, now seen corresponding path program 1 times [2025-03-16 15:09:42,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:42,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802025842] [2025-03-16 15:09:42,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:42,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:42,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 624 statements into 1 equivalence classes. [2025-03-16 15:09:42,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 624 of 624 statements. [2025-03-16 15:09:42,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:42,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-03-16 15:09:43,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:43,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802025842] [2025-03-16 15:09:43,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802025842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:43,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:43,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:09:43,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390240718] [2025-03-16 15:09:43,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:43,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:43,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:43,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:43,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:43,420 INFO L87 Difference]: Start difference. First operand 12658 states and 13503 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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) [2025-03-16 15:09:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:44,036 INFO L93 Difference]: Finished difference Result 25321 states and 27012 transitions. [2025-03-16 15:09:44,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:44,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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 624 [2025-03-16 15:09:44,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:44,048 INFO L225 Difference]: With dead ends: 25321 [2025-03-16 15:09:44,048 INFO L226 Difference]: Without dead ends: 12664 [2025-03-16 15:09:44,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:44,057 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 350 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:44,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 137 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:09:44,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12664 states. [2025-03-16 15:09:44,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12664 to 12060. [2025-03-16 15:09:44,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12060 states, 12059 states have (on average 1.0539845758354756) internal successors, (12710), 12059 states have internal predecessors, (12710), 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) [2025-03-16 15:09:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12060 states to 12060 states and 12710 transitions. [2025-03-16 15:09:44,190 INFO L78 Accepts]: Start accepts. Automaton has 12060 states and 12710 transitions. Word has length 624 [2025-03-16 15:09:44,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:44,190 INFO L471 AbstractCegarLoop]: Abstraction has 12060 states and 12710 transitions. [2025-03-16 15:09:44,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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) [2025-03-16 15:09:44,190 INFO L276 IsEmpty]: Start isEmpty. Operand 12060 states and 12710 transitions. [2025-03-16 15:09:44,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2025-03-16 15:09:44,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:44,196 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:09:44,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:09:44,196 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:44,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:44,197 INFO L85 PathProgramCache]: Analyzing trace with hash -769907912, now seen corresponding path program 1 times [2025-03-16 15:09:44,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:44,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31419920] [2025-03-16 15:09:44,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:44,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:44,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 648 statements into 1 equivalence classes. [2025-03-16 15:09:44,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 648 of 648 statements. [2025-03-16 15:09:44,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:44,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:44,415 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2025-03-16 15:09:44,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:44,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31419920] [2025-03-16 15:09:44,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31419920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:44,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:44,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:09:44,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40501397] [2025-03-16 15:09:44,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:44,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:44,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:44,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:44,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:44,417 INFO L87 Difference]: Start difference. First operand 12060 states and 12710 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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) [2025-03-16 15:09:45,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:45,156 INFO L93 Difference]: Finished difference Result 27106 states and 28620 transitions. [2025-03-16 15:09:45,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:45,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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 648 [2025-03-16 15:09:45,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:45,170 INFO L225 Difference]: With dead ends: 27106 [2025-03-16 15:09:45,170 INFO L226 Difference]: Without dead ends: 15047 [2025-03-16 15:09:45,177 INFO L434 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 [2025-03-16 15:09:45,178 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 311 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:45,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 179 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:09:45,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15047 states. [2025-03-16 15:09:45,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15047 to 14149. [2025-03-16 15:09:45,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14149 states, 14148 states have (on average 1.048628781453209) internal successors, (14836), 14148 states have internal predecessors, (14836), 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) [2025-03-16 15:09:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14149 states to 14149 states and 14836 transitions. [2025-03-16 15:09:45,272 INFO L78 Accepts]: Start accepts. Automaton has 14149 states and 14836 transitions. Word has length 648 [2025-03-16 15:09:45,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:45,272 INFO L471 AbstractCegarLoop]: Abstraction has 14149 states and 14836 transitions. [2025-03-16 15:09:45,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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) [2025-03-16 15:09:45,272 INFO L276 IsEmpty]: Start isEmpty. Operand 14149 states and 14836 transitions. [2025-03-16 15:09:45,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2025-03-16 15:09:45,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:45,278 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:45,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:09:45,278 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:45,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:45,279 INFO L85 PathProgramCache]: Analyzing trace with hash -824086992, now seen corresponding path program 1 times [2025-03-16 15:09:45,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:45,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038363038] [2025-03-16 15:09:45,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:45,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:45,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 655 statements into 1 equivalence classes. [2025-03-16 15:09:45,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 655 of 655 statements. [2025-03-16 15:09:45,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:45,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:45,773 INFO L134 CoverageAnalysis]: Checked inductivity of 721 backedges. 509 proven. 190 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-16 15:09:45,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:45,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038363038] [2025-03-16 15:09:45,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038363038] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:09:45,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714168534] [2025-03-16 15:09:45,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:45,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:09:45,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:09:45,775 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:09:45,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:09:45,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 655 statements into 1 equivalence classes. [2025-03-16 15:09:45,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 655 of 655 statements. [2025-03-16 15:09:45,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:45,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:45,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:09:45,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:09:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 721 backedges. 446 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2025-03-16 15:09:46,141 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:09:46,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714168534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:46,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:09:46,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-16 15:09:46,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553647614] [2025-03-16 15:09:46,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:46,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:09:46,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:46,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:09:46,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:09:46,142 INFO L87 Difference]: Start difference. First operand 14149 states and 14836 transitions. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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) [2025-03-16 15:09:46,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:46,970 INFO L93 Difference]: Finished difference Result 32789 states and 34451 transitions. [2025-03-16 15:09:46,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:46,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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 655 [2025-03-16 15:09:46,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:46,985 INFO L225 Difference]: With dead ends: 32789 [2025-03-16 15:09:46,985 INFO L226 Difference]: Without dead ends: 18940 [2025-03-16 15:09:46,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 658 GetRequests, 653 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:09:46,996 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 189 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:46,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 191 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:09:47,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18940 states. [2025-03-16 15:09:47,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18940 to 17739. [2025-03-16 15:09:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17739 states, 17738 states have (on average 1.0482579772240388) internal successors, (18594), 17738 states have internal predecessors, (18594), 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) [2025-03-16 15:09:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17739 states to 17739 states and 18594 transitions. [2025-03-16 15:09:47,122 INFO L78 Accepts]: Start accepts. Automaton has 17739 states and 18594 transitions. Word has length 655 [2025-03-16 15:09:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:47,122 INFO L471 AbstractCegarLoop]: Abstraction has 17739 states and 18594 transitions. [2025-03-16 15:09:47,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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) [2025-03-16 15:09:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 17739 states and 18594 transitions. [2025-03-16 15:09:47,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-03-16 15:09:47,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:47,128 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:47,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 15:09:47,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 15:09:47,329 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:47,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:47,329 INFO L85 PathProgramCache]: Analyzing trace with hash -184899429, now seen corresponding path program 1 times [2025-03-16 15:09:47,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:47,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797301786] [2025-03-16 15:09:47,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:47,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:47,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-03-16 15:09:47,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-03-16 15:09:47,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:47,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:47,772 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-03-16 15:09:47,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:47,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797301786] [2025-03-16 15:09:47,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797301786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:47,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:47,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:09:47,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809540653] [2025-03-16 15:09:47,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:47,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:09:47,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:47,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:09:47,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:09:47,774 INFO L87 Difference]: Start difference. First operand 17739 states and 18594 transitions. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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) [2025-03-16 15:09:48,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:48,807 INFO L93 Difference]: Finished difference Result 40270 states and 42250 transitions. [2025-03-16 15:09:48,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:09:48,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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 692 [2025-03-16 15:09:48,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:48,829 INFO L225 Difference]: With dead ends: 40270 [2025-03-16 15:09:48,830 INFO L226 Difference]: Without dead ends: 22831 [2025-03-16 15:09:48,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:09:48,843 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 480 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:48,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 175 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:09:48,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22831 states. [2025-03-16 15:09:48,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22831 to 17739. [2025-03-16 15:09:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17739 states, 17738 states have (on average 1.0482579772240388) internal successors, (18594), 17738 states have internal predecessors, (18594), 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) [2025-03-16 15:09:48,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17739 states to 17739 states and 18594 transitions. [2025-03-16 15:09:48,986 INFO L78 Accepts]: Start accepts. Automaton has 17739 states and 18594 transitions. Word has length 692 [2025-03-16 15:09:48,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:48,986 INFO L471 AbstractCegarLoop]: Abstraction has 17739 states and 18594 transitions. [2025-03-16 15:09:48,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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) [2025-03-16 15:09:48,986 INFO L276 IsEmpty]: Start isEmpty. Operand 17739 states and 18594 transitions. [2025-03-16 15:09:48,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 720 [2025-03-16 15:09:48,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:48,993 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:48,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:09:48,993 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:48,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:48,994 INFO L85 PathProgramCache]: Analyzing trace with hash -375045856, now seen corresponding path program 1 times [2025-03-16 15:09:48,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:48,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378557256] [2025-03-16 15:09:48,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:48,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:49,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 719 statements into 1 equivalence classes. [2025-03-16 15:09:49,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 719 of 719 statements. [2025-03-16 15:09:49,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:49,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:49,427 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 491 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-03-16 15:09:49,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:49,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378557256] [2025-03-16 15:09:49,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378557256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:49,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:49,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:09:49,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866235309] [2025-03-16 15:09:49,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:49,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:49,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:49,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:49,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:49,429 INFO L87 Difference]: Start difference. First operand 17739 states and 18594 transitions. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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) [2025-03-16 15:09:50,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:50,107 INFO L93 Difference]: Finished difference Result 38180 states and 40125 transitions. [2025-03-16 15:09:50,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:50,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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 719 [2025-03-16 15:09:50,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:50,126 INFO L225 Difference]: With dead ends: 38180 [2025-03-16 15:09:50,126 INFO L226 Difference]: Without dead ends: 20741 [2025-03-16 15:09:50,136 INFO L434 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 [2025-03-16 15:09:50,137 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 173 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:50,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 547 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:09:50,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20741 states. [2025-03-16 15:09:50,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20741 to 20442. [2025-03-16 15:09:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20442 states, 20441 states have (on average 1.0453011105131842) internal successors, (21367), 20441 states have internal predecessors, (21367), 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) [2025-03-16 15:09:50,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20442 states to 20442 states and 21367 transitions. [2025-03-16 15:09:50,313 INFO L78 Accepts]: Start accepts. Automaton has 20442 states and 21367 transitions. Word has length 719 [2025-03-16 15:09:50,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:50,313 INFO L471 AbstractCegarLoop]: Abstraction has 20442 states and 21367 transitions. [2025-03-16 15:09:50,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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) [2025-03-16 15:09:50,314 INFO L276 IsEmpty]: Start isEmpty. Operand 20442 states and 21367 transitions. [2025-03-16 15:09:50,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-03-16 15:09:50,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:50,321 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:50,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:09:50,321 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:50,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:50,321 INFO L85 PathProgramCache]: Analyzing trace with hash -971696486, now seen corresponding path program 1 times [2025-03-16 15:09:50,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:50,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914653191] [2025-03-16 15:09:50,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:50,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:50,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-03-16 15:09:50,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-03-16 15:09:50,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:50,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2025-03-16 15:09:50,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:50,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914653191] [2025-03-16 15:09:50,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914653191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:50,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:50,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:09:50,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983194777] [2025-03-16 15:09:50,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:50,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:50,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:50,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:50,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:50,659 INFO L87 Difference]: Start difference. First operand 20442 states and 21367 transitions. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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) [2025-03-16 15:09:51,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:51,435 INFO L93 Difference]: Finished difference Result 43591 states and 45638 transitions. [2025-03-16 15:09:51,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:51,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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 732 [2025-03-16 15:09:51,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:51,456 INFO L225 Difference]: With dead ends: 43591 [2025-03-16 15:09:51,457 INFO L226 Difference]: Without dead ends: 23449 [2025-03-16 15:09:51,466 INFO L434 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 [2025-03-16 15:09:51,467 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 349 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:51,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 123 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:09:51,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23449 states. [2025-03-16 15:09:51,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23449 to 20738. [2025-03-16 15:09:51,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20738 states, 20737 states have (on average 1.0475478613107008) internal successors, (21723), 20737 states have internal predecessors, (21723), 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) [2025-03-16 15:09:51,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20738 states to 20738 states and 21723 transitions. [2025-03-16 15:09:51,622 INFO L78 Accepts]: Start accepts. Automaton has 20738 states and 21723 transitions. Word has length 732 [2025-03-16 15:09:51,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:51,622 INFO L471 AbstractCegarLoop]: Abstraction has 20738 states and 21723 transitions. [2025-03-16 15:09:51,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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) [2025-03-16 15:09:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand 20738 states and 21723 transitions. [2025-03-16 15:09:51,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2025-03-16 15:09:51,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:51,630 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:51,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:09:51,630 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:51,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:51,631 INFO L85 PathProgramCache]: Analyzing trace with hash -590259305, now seen corresponding path program 1 times [2025-03-16 15:09:51,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:51,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937690725] [2025-03-16 15:09:51,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:51,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:51,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 745 statements into 1 equivalence classes. [2025-03-16 15:09:51,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 745 of 745 statements. [2025-03-16 15:09:51,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:51,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:52,479 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 567 proven. 188 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-03-16 15:09:52,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:52,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937690725] [2025-03-16 15:09:52,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937690725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:09:52,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891766935] [2025-03-16 15:09:52,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:52,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:09:52,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:09:52,481 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:09:52,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:09:52,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 745 statements into 1 equivalence classes. [2025-03-16 15:09:52,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 745 of 745 statements. [2025-03-16 15:09:52,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:52,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:52,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:09:52,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:09:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-16 15:09:52,852 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:09:52,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891766935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:52,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:09:52,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-16 15:09:52,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935619586] [2025-03-16 15:09:52,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:52,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:09:52,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:52,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:09:52,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:09:52,854 INFO L87 Difference]: Start difference. First operand 20738 states and 21723 transitions. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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) [2025-03-16 15:09:53,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:53,972 INFO L93 Difference]: Finished difference Result 49569 states and 51977 transitions. [2025-03-16 15:09:53,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:09:53,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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 745 [2025-03-16 15:09:53,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:54,000 INFO L225 Difference]: With dead ends: 49569 [2025-03-16 15:09:54,001 INFO L226 Difference]: Without dead ends: 29131 [2025-03-16 15:09:54,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 748 GetRequests, 743 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:09:54,016 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 508 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:54,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 152 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:09:54,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29131 states. [2025-03-16 15:09:54,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29131 to 24933. [2025-03-16 15:09:54,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24933 states, 24932 states have (on average 1.0514198620247073) internal successors, (26214), 24932 states have internal predecessors, (26214), 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) [2025-03-16 15:09:54,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24933 states to 24933 states and 26214 transitions. [2025-03-16 15:09:54,233 INFO L78 Accepts]: Start accepts. Automaton has 24933 states and 26214 transitions. Word has length 745 [2025-03-16 15:09:54,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:54,233 INFO L471 AbstractCegarLoop]: Abstraction has 24933 states and 26214 transitions. [2025-03-16 15:09:54,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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) [2025-03-16 15:09:54,233 INFO L276 IsEmpty]: Start isEmpty. Operand 24933 states and 26214 transitions. [2025-03-16 15:09:54,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 756 [2025-03-16 15:09:54,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:54,242 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:09:54,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 15:09:54,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:09:54,443 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:54,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:54,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1479861606, now seen corresponding path program 1 times [2025-03-16 15:09:54,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:54,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392045997] [2025-03-16 15:09:54,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:54,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:54,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 755 statements into 1 equivalence classes. [2025-03-16 15:09:54,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 755 of 755 statements. [2025-03-16 15:09:54,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:54,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 469 proven. 0 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2025-03-16 15:09:54,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:54,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392045997] [2025-03-16 15:09:54,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392045997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:54,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:54,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:09:54,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729227635] [2025-03-16 15:09:54,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:54,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:54,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:54,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:54,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:54,636 INFO L87 Difference]: Start difference. First operand 24933 states and 26214 transitions. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 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) [2025-03-16 15:09:55,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:55,203 INFO L93 Difference]: Finished difference Result 43234 states and 45513 transitions. [2025-03-16 15:09:55,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:55,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 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 755 [2025-03-16 15:09:55,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:55,221 INFO L225 Difference]: With dead ends: 43234 [2025-03-16 15:09:55,222 INFO L226 Difference]: Without dead ends: 18601 [2025-03-16 15:09:55,235 INFO L434 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 [2025-03-16 15:09:55,236 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 341 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:55,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 358 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:09:55,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18601 states. [2025-03-16 15:09:55,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18601 to 16807. [2025-03-16 15:09:55,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16807 states, 16806 states have (on average 1.0378436272759728) internal successors, (17442), 16806 states have internal predecessors, (17442), 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) [2025-03-16 15:09:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16807 states to 16807 states and 17442 transitions. [2025-03-16 15:09:55,436 INFO L78 Accepts]: Start accepts. Automaton has 16807 states and 17442 transitions. Word has length 755 [2025-03-16 15:09:55,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:55,437 INFO L471 AbstractCegarLoop]: Abstraction has 16807 states and 17442 transitions. [2025-03-16 15:09:55,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 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) [2025-03-16 15:09:55,437 INFO L276 IsEmpty]: Start isEmpty. Operand 16807 states and 17442 transitions. [2025-03-16 15:09:55,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 858 [2025-03-16 15:09:55,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:55,447 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:55,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 15:09:55,448 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:55,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:55,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1622765421, now seen corresponding path program 1 times [2025-03-16 15:09:55,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:55,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119938961] [2025-03-16 15:09:55,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:55,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:55,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 857 statements into 1 equivalence classes. [2025-03-16 15:09:55,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 857 of 857 statements. [2025-03-16 15:09:55,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:55,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 652 proven. 188 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-16 15:09:56,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:56,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119938961] [2025-03-16 15:09:56,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119938961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:09:56,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514281772] [2025-03-16 15:09:56,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:56,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:09:56,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:09:56,297 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:09:56,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 15:09:56,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 857 statements into 1 equivalence classes. [2025-03-16 15:09:56,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 857 of 857 statements. [2025-03-16 15:09:56,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:56,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:56,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:09:56,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:09:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 750 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-16 15:09:56,789 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:09:56,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514281772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:56,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:09:56,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:09:56,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073416307] [2025-03-16 15:09:56,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:56,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:56,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:56,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:56,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:09:56,791 INFO L87 Difference]: Start difference. First operand 16807 states and 17442 transitions. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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) [2025-03-16 15:09:57,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:57,471 INFO L93 Difference]: Finished difference Result 36021 states and 37362 transitions. [2025-03-16 15:09:57,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:57,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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 857 [2025-03-16 15:09:57,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:57,491 INFO L225 Difference]: With dead ends: 36021 [2025-03-16 15:09:57,491 INFO L226 Difference]: Without dead ends: 19514 [2025-03-16 15:09:57,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 860 GetRequests, 856 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:09:57,503 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 241 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:57,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 103 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:09:57,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19514 states. [2025-03-16 15:09:57,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19514 to 16807. [2025-03-16 15:09:57,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16807 states, 16806 states have (on average 1.0377246221587528) internal successors, (17440), 16806 states have internal predecessors, (17440), 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) [2025-03-16 15:09:57,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16807 states to 16807 states and 17440 transitions. [2025-03-16 15:09:57,672 INFO L78 Accepts]: Start accepts. Automaton has 16807 states and 17440 transitions. Word has length 857 [2025-03-16 15:09:57,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:57,673 INFO L471 AbstractCegarLoop]: Abstraction has 16807 states and 17440 transitions. [2025-03-16 15:09:57,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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) [2025-03-16 15:09:57,673 INFO L276 IsEmpty]: Start isEmpty. Operand 16807 states and 17440 transitions. [2025-03-16 15:09:57,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2025-03-16 15:09:57,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:57,683 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:57,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 15:09:57,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:09:57,884 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:57,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:57,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1713404331, now seen corresponding path program 1 times [2025-03-16 15:09:57,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:57,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862272180] [2025-03-16 15:09:57,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:57,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:57,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 869 statements into 1 equivalence classes. [2025-03-16 15:09:57,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 869 of 869 statements. [2025-03-16 15:09:57,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:57,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:58,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-03-16 15:09:58,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:58,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862272180] [2025-03-16 15:09:58,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862272180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:58,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:58,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:09:58,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775430746] [2025-03-16 15:09:58,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:58,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:09:58,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:58,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:09:58,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:09:58,753 INFO L87 Difference]: Start difference. First operand 16807 states and 17440 transitions. Second operand has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 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) [2025-03-16 15:09:59,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:59,907 INFO L93 Difference]: Finished difference Result 43565 states and 45195 transitions. [2025-03-16 15:09:59,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:09:59,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 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 869 [2025-03-16 15:09:59,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:59,932 INFO L225 Difference]: With dead ends: 43565 [2025-03-16 15:09:59,932 INFO L226 Difference]: Without dead ends: 27058 [2025-03-16 15:09:59,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:09:59,943 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 338 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:59,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 142 Invalid, 1811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:09:59,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27058 states. [2025-03-16 15:10:00,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27058 to 16807. [2025-03-16 15:10:00,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16807 states, 16806 states have (on average 1.0377246221587528) internal successors, (17440), 16806 states have internal predecessors, (17440), 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) [2025-03-16 15:10:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16807 states to 16807 states and 17440 transitions. [2025-03-16 15:10:00,086 INFO L78 Accepts]: Start accepts. Automaton has 16807 states and 17440 transitions. Word has length 869 [2025-03-16 15:10:00,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:10:00,086 INFO L471 AbstractCegarLoop]: Abstraction has 16807 states and 17440 transitions. [2025-03-16 15:10:00,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 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) [2025-03-16 15:10:00,086 INFO L276 IsEmpty]: Start isEmpty. Operand 16807 states and 17440 transitions. [2025-03-16 15:10:00,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 906 [2025-03-16 15:10:00,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:10:00,095 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:10:00,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 15:10:00,095 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:10:00,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:10:00,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1888341626, now seen corresponding path program 1 times [2025-03-16 15:10:00,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:10:00,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352283538] [2025-03-16 15:10:00,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:10:00,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:10:00,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 905 statements into 1 equivalence classes. [2025-03-16 15:10:00,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 905 of 905 statements. [2025-03-16 15:10:00,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:10:00,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:10:01,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 729 proven. 106 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-16 15:10:01,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:10:01,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352283538] [2025-03-16 15:10:01,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352283538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:10:01,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990651436] [2025-03-16 15:10:01,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:10:01,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:10:01,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:10:01,580 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:10:01,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 15:10:01,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 905 statements into 1 equivalence classes. [2025-03-16 15:10:01,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 905 of 905 statements. [2025-03-16 15:10:01,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:10:01,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:10:01,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 1055 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:10:01,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:10:02,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 729 proven. 106 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-16 15:10:02,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:10:04,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 729 proven. 106 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-16 15:10:04,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990651436] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:10:04,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:10:04,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-16 15:10:04,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978325278] [2025-03-16 15:10:04,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:10:04,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 15:10:04,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:10:04,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 15:10:04,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:10:04,174 INFO L87 Difference]: Start difference. First operand 16807 states and 17440 transitions. Second operand has 10 states, 10 states have (on average 143.5) internal successors, (1435), 9 states have internal predecessors, (1435), 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) [2025-03-16 15:10:06,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:10:06,863 INFO L93 Difference]: Finished difference Result 43214 states and 44798 transitions. [2025-03-16 15:10:06,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 15:10:06,863 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 143.5) internal successors, (1435), 9 states have internal predecessors, (1435), 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 905 [2025-03-16 15:10:06,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:10:06,887 INFO L225 Difference]: With dead ends: 43214 [2025-03-16 15:10:06,887 INFO L226 Difference]: Without dead ends: 26707 [2025-03-16 15:10:06,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1818 GetRequests, 1805 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-03-16 15:10:06,899 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 1572 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4605 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 4937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 4605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:10:06,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1572 Valid, 143 Invalid, 4937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 4605 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:10:06,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26707 states. [2025-03-16 15:10:07,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26707 to 21592. [2025-03-16 15:10:07,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21592 states, 21591 states have (on average 1.0369135287851419) internal successors, (22388), 21591 states have internal predecessors, (22388), 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) [2025-03-16 15:10:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21592 states to 21592 states and 22388 transitions. [2025-03-16 15:10:07,098 INFO L78 Accepts]: Start accepts. Automaton has 21592 states and 22388 transitions. Word has length 905 [2025-03-16 15:10:07,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:10:07,098 INFO L471 AbstractCegarLoop]: Abstraction has 21592 states and 22388 transitions. [2025-03-16 15:10:07,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 143.5) internal successors, (1435), 9 states have internal predecessors, (1435), 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) [2025-03-16 15:10:07,099 INFO L276 IsEmpty]: Start isEmpty. Operand 21592 states and 22388 transitions. [2025-03-16 15:10:07,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 918 [2025-03-16 15:10:07,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:10:07,108 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:10:07,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 15:10:07,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-16 15:10:07,309 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:10:07,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:10:07,309 INFO L85 PathProgramCache]: Analyzing trace with hash 2128110328, now seen corresponding path program 1 times [2025-03-16 15:10:07,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:10:07,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114053301] [2025-03-16 15:10:07,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:10:07,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:10:07,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 917 statements into 1 equivalence classes. [2025-03-16 15:10:07,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 917 of 917 statements. [2025-03-16 15:10:07,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:10:07,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 15:10:07,438 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 15:10:07,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 917 statements into 1 equivalence classes. [2025-03-16 15:10:07,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 917 of 917 statements. [2025-03-16 15:10:07,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:10:07,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 15:10:07,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 15:10:07,728 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 15:10:07,729 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:10:07,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 15:10:07,732 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:10:07,980 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:10:07,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:10:07 BoogieIcfgContainer [2025-03-16 15:10:07,982 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:10:07,983 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:10:07,983 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:10:07,983 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:10:07,985 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:09:18" (3/4) ... [2025-03-16 15:10:07,986 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-16 15:10:08,232 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 921. [2025-03-16 15:10:08,412 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:10:08,413 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:10:08,414 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:10:08,415 INFO L158 Benchmark]: Toolchain (without parser) took 52559.48ms. Allocated memory was 142.6MB in the beginning and 981.5MB in the end (delta: 838.9MB). Free memory was 99.9MB in the beginning and 681.0MB in the end (delta: -581.1MB). Peak memory consumption was 251.2MB. Max. memory is 16.1GB. [2025-03-16 15:10:08,415 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:10:08,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 649.04ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 88.3MB in the end (delta: 11.6MB). Peak memory consumption was 80.5MB. Max. memory is 16.1GB. [2025-03-16 15:10:08,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 138.87ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 50.3MB in the end (delta: 38.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-16 15:10:08,415 INFO L158 Benchmark]: Boogie Preprocessor took 237.56ms. Allocated memory is still 142.6MB. Free memory was 50.3MB in the beginning and 75.1MB in the end (delta: -24.8MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. [2025-03-16 15:10:08,416 INFO L158 Benchmark]: IcfgBuilder took 1987.59ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 75.1MB in the beginning and 191.8MB in the end (delta: -116.8MB). Peak memory consumption was 192.9MB. Max. memory is 16.1GB. [2025-03-16 15:10:08,416 INFO L158 Benchmark]: TraceAbstraction took 49109.88ms. Allocated memory was 352.3MB in the beginning and 981.5MB in the end (delta: 629.1MB). Free memory was 191.8MB in the beginning and 776.9MB in the end (delta: -585.1MB). Peak memory consumption was 386.6MB. Max. memory is 16.1GB. [2025-03-16 15:10:08,416 INFO L158 Benchmark]: Witness Printer took 430.98ms. Allocated memory is still 981.5MB. Free memory was 776.9MB in the beginning and 681.0MB in the end (delta: 96.0MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2025-03-16 15:10:08,417 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.28ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 649.04ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 88.3MB in the end (delta: 11.6MB). Peak memory consumption was 80.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 138.87ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 50.3MB in the end (delta: 38.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 237.56ms. Allocated memory is still 142.6MB. Free memory was 50.3MB in the beginning and 75.1MB in the end (delta: -24.8MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1987.59ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 75.1MB in the beginning and 191.8MB in the end (delta: -116.8MB). Peak memory consumption was 192.9MB. Max. memory is 16.1GB. * TraceAbstraction took 49109.88ms. Allocated memory was 352.3MB in the beginning and 981.5MB in the end (delta: 629.1MB). Free memory was 191.8MB in the beginning and 776.9MB in the end (delta: -585.1MB). Peak memory consumption was 386.6MB. Max. memory is 16.1GB. * Witness Printer took 430.98ms. Allocated memory is still 981.5MB. Free memory was 776.9MB in the beginning and 681.0MB in the end (delta: 96.0MB). Peak memory consumption was 92.3MB. 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: 89]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int inputD = 4; [L19] int inputB = 2; [L20] int inputE = 5; [L21] int inputA = 1; [L22] int inputF = 6; [L23] int inputC = 3; [L26] int a4 = -89; [L27] int a29 = -127; [L28] int a2 = 1; [L29] int a0 = -44; [L1773] int output = -1; VAL [a0=-44, a29=-127, a2=1, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1776] COND TRUE 1 [L1779] int input; [L1780] input = __VERIFIER_nondet_int() [L1781] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1784] CALL, EXPR calculate_output(input) [L34] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((((a2==1) && a4 <= -86 ) && -61 < a0 ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L218] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 1) && (((a2==3) && a29 <= -144 ) || (((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2)))))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L229] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==2) && ( a29 <= -144 && (input == 3))) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((( a0 <= -147 && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==4)))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !(((((a2==3) && ((input == 3) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && -61 < a0 ) && a4 <= -86 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !(((((input == 5) && (( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (( 43 < a29 && (a2==1)) || ((a2==2) && a29 <= -144 )))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L263] COND FALSE !(((((( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((( -61 < a0 && ((((a2==3) && a29 <= -144 ) || (( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ( 43 < a29 && (a2==2)))) && (input == 2))) && a4 <= -86 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !(((((a2==4) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((((input == 4) && 43 < a29 ) && (a2==1)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L288] COND FALSE !((( -61 < a0 && (((( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 1))) && a4 <= -86 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L295] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==3))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L302] COND FALSE !((((a2==2) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !((((((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !(((a2==4) && ( -61 < a0 && ( a4 <= -86 && ((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !((((((input == 3) && -61 < a0 ) && a4 <= -86 ) && ((-16 < a29) && (43 >= a29)) ) && (a2==5))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L337] COND FALSE !(((a2==1) && ( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L343] COND FALSE !((( -61 < a0 && ( 43 < a29 && ((input == 4) && (a2==5)))) && a4 <= -86 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L346] COND FALSE !(((((((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==3) && 43 < a29 ) || ( a29 <= -144 && (a2==4)))) && (input == 5)) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(( 43 < a29 && (( -61 < a0 && ( a4 <= -86 && (input == 1))) && (a2==5)))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !((( a4 <= -86 && ( 43 < a29 && ((input == 2) && -61 < a0 ))) && (a2==3))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L371] COND FALSE !(((((input == 6) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !((((( ((-98 < a0) && (-61 >= a0)) && (input == 3)) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !(((( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L390] COND FALSE !(((( a4 <= -86 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1))) && (a2==1)) && -61 < a0 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( -61 < a0 && ((( 43 < a29 && (input == 6)) && (a2==5)) && a4 <= -86 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 3) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (a2==5))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && ((-86 < a4) && (-42 >= a4)) )) && (a2==4))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && (a2==4))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !((((((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 ) && (input == 6)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((a2==3) && (((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) && (a2==5))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==3) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((((a2==3) && (( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2))) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L455] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && (a2==5)) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) )) && (a2==4))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(((((((a2==5) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 ))) && (input == 2)) && a4 <= -86 ) && -61 < a0 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L472] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (( ((-98 < a0) && (-61 >= a0)) && (input == 6)) && (a2==2))) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && ( a4 <= -86 && (((input == 6) && -61 < a0 ) && (a2==5))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L484] COND FALSE !((( ((-16 < a29) && (43 >= a29)) && (((input == 4) && -61 < a0 ) && a4 <= -86 )) && (a2==5))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 5) && ((( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ((a2==2) && 43 < a29 )) || ( a29 <= -144 && (a2==3))))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L496] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && (((input == 1) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==2))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L501] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 6) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && (a2==2))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((input == 3) && ((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L512] COND FALSE !(((( a0 <= -147 && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-98 < a0) && (-61 >= a0)) ) && (a2==1))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( a29 <= -144 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 3) && (a2==5)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L530] COND FALSE !(((a2==4) && ( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && a0 <= -147 )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L539] COND FALSE !((((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L552] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && ( a0 <= -147 && ( ((-16 < a29) && (43 >= a29)) && (input == 5)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L556] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( a0 <= -147 && ((( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2)))) && (input == 4))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L567] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==2) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)) && ((-98 < a0) && (-61 >= a0)) )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==5) && ( 43 < a29 && (input == 3)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L584] COND FALSE !(( -61 < a0 && ( a4 <= -86 && (((a2==3) && (input == 4)) && 43 < a29 )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L597] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 )) || ((a2==2) && a29 <= -144 )) && (input == 6))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L604] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L616] COND FALSE !((((a2==2) && (( ((-144 < a29) && (-16 >= a29)) && (input == 1)) && ((-86 < a4) && (-42 >= a4)) )) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L623] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 6) && (((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L630] COND FALSE !(((((a2==1) && ((input == 5) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L637] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )))) && (a2==2))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L644] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && (( a0 <= -147 && (input == 2)) && 43 < a29 )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L651] COND FALSE !(((a2==1) && ( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) && a0 <= -147 )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L662] COND FALSE !(((((a2==1) && ((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L667] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==1) && ((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L672] COND FALSE !(( a0 <= -147 && ((a2==2) && ( ((-86 < a4) && (-42 >= a4)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 2)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L678] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ((((( 43 < a29 && (a2==2)) || ((a2==3) && a29 <= -144 )) || ((a2==3) && ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L685] COND FALSE !(((((a2==5) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L691] COND FALSE !(((a2==2) && ( ((-98 < a0) && (-61 >= a0)) && (( a29 <= -144 && (input == 1)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L697] COND FALSE !(((( a4 <= -86 && ( -61 < a0 && (input == 5))) && (a2==5)) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L703] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 6)) && (a2==4)) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L717] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 4)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ((-98 < a0) && (-61 >= a0)) )) && a29 <= -144 ) && (a2==2))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L728] COND FALSE !(((a2==1) && ((((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L735] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((((a2==4) && 43 < a29 ) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 3))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L742] COND FALSE !((((a2==5) && (((input == 5) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L745] COND FALSE !(((( ((-16 < a29) && (43 >= a29)) && ((input == 1) && ((-147 < a0) && (-98 >= a0)) )) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L752] COND FALSE !((( a4 <= -86 && ((input == 6) && ((((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ((a2==2) && 43 < a29 )) || ((a2==3) && a29 <= -144 )))) && -61 < a0 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L758] COND FALSE !(((( -61 < a0 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 5))) && a4 <= -86 ) && (a2==3))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L764] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==2)) || ((a2==3) && a29 <= -144 ))) && (input == 5))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L771] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 6) && ((-86 < a4) && (-42 >= a4)) ) && (a2==1)) && 43 < a29 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L778] COND FALSE !(( a0 <= -147 && ((((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L784] COND FALSE !(((((a2==1) && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L789] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((a2==4) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L796] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 4) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L803] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 && (a2==2)) || (( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 ))) && (input == 4))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L814] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && (( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L821] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && (a2==2))) && a0 <= -147 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L827] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==3) && ( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L834] COND FALSE !(((a2==5) && ((( a0 <= -147 && (input == 5)) && 43 < a29 ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L839] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && (( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && (input == 3))) && a0 <= -147 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L850] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((a2==4) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L855] COND FALSE !((( a4 <= -86 && ((input == 3) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) )))) && -61 < a0 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L861] COND FALSE !(((a2==4) && ((((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L865] COND FALSE !(((a2==5) && ((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L872] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) && 43 < a29 ) || ( a29 <= -144 && (a2==3)))) && (input == 1))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L878] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && a0 <= -147 ) && (a2==5)))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L884] COND FALSE !(( a4 <= -86 && ( -61 < a0 && ((input == 5) && ((( 43 < a29 && (a2==4)) || ( a29 <= -144 && (a2==5))) || ((a2==5) && ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L890] COND FALSE !(((a2==3) && ( a4 <= -86 && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1)) && -61 < a0 )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L895] COND FALSE !(((a2==5) && ((((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L905] COND FALSE !((((( -61 < a0 && (input == 2)) && 43 < a29 ) && a4 <= -86 ) && (a2==5))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L911] COND FALSE !((((((input == 1) && (a2==1)) && 43 < a29 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L917] COND FALSE !(((((a2==2) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L922] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 6) && 43 < a29 ) && (a2==2))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L929] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && (a2==3)))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L935] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 1) && (a2==5)) && ((-86 < a4) && (-42 >= a4)) )) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L940] COND FALSE !((((a2==1) && ( a0 <= -147 && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 6)))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L945] COND FALSE !(((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==4))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L952] COND FALSE !((((a2==1) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L958] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && ((input == 5) && (a2==2)))) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L965] COND FALSE !((( -61 < a0 && ((a2==1) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)))) && a4 <= -86 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L969] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((((((a2==1) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )) && (input == 5)) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L976] COND FALSE !((((( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && ((-16 < a29) && (43 >= a29)) ) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L983] COND FALSE !(( a4 <= -86 && ((( 43 < a29 && (input == 5)) && -61 < a0 ) && (a2==3)))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L989] COND FALSE !((((a2==4) && ( a4 <= -86 && ((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )))) && -61 < a0 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L995] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 6)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==1)))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1002] COND FALSE !(((((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6)) && ((-86 < a4) && (-42 >= a4)) ) && (a2==2)) && a0 <= -147 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1008] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && (a2==4))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1014] COND FALSE !((((((input == 1) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) ) && (a2==5)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1021] COND FALSE !(((( ((-98 < a0) && (-61 >= a0)) && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1026] COND FALSE !((((a2==4) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1029] COND FALSE !((((a2==2) && (( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) )) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1036] COND FALSE !(((a2==5) && ( ((-86 < a4) && (-42 >= a4)) && (( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && a29 <= -144 )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1040] COND FALSE !(( a4 <= -86 && ((((((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2))) || ((a2==3) && a29 <= -144 )) && (input == 3)) && -61 < a0 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1045] COND FALSE !(((a2==2) && ( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 1)) && a0 <= -147 )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1048] COND FALSE !(( a0 <= -147 && ((((((a2==3) && 43 < a29 ) || ( a29 <= -144 && (a2==4))) || ((a2==4) && ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1054] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (( a0 <= -147 && ((a2==5) && (input == 1))) && 43 < a29 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1059] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) )) && (a2==5))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1072] COND FALSE !((((a2==2) && (((input == 4) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1084] COND FALSE !((((((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1091] COND FALSE !(( a4 <= -86 && (((input == 6) && ((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) ))) && -61 < a0 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1096] COND FALSE !(((a2==1) && (( 43 < a29 && ((input == 2) && ((-98 < a0) && (-61 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1101] COND FALSE !((((((input == 4) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && a4 <= -86 ) && (a2==3)) && -61 < a0 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1108] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==4))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1118] COND FALSE !(((a2==2) && (((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1125] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1132] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && (((input == 2) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && (a2==5))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1138] COND FALSE !(( 43 < a29 && ( a4 <= -86 && ( -61 < a0 && ((a2==3) && (input == 3)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1144] COND FALSE !((((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) ) && (a2==3))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1155] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( a0 <= -147 && ((( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (( 43 < a29 && (a2==1)) || ((a2==2) && a29 <= -144 ))) && (input == 1))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1160] COND FALSE !(((a2==4) && ((((input == 3) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1166] COND FALSE !(((a2==4) && ((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 1)) && a4 <= -86 ) && -61 < a0 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1172] COND FALSE !((((a2==4) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 4)) && ((-98 < a0) && (-61 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1178] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ( 43 < a29 && ((input == 3) && (a2==1)))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1182] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((a2==1) && ( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1188] COND FALSE !(( a0 <= -147 && (((((a2==2) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2)))) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1194] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 2) && (a2==2))) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1200] COND FALSE !((((( ((-98 < a0) && (-61 >= a0)) && (input == 2)) && a29 <= -144 ) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1207] COND FALSE !((((a2==5) && ( -61 < a0 && ((input == 5) && 43 < a29 ))) && a4 <= -86 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1213] COND FALSE !((((( a0 <= -147 && (input == 6)) && (a2==5)) && 43 < a29 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1218] COND FALSE !(( 43 < a29 && ((((input == 4) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1222] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && ((a2==1) && ((input == 3) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1228] COND FALSE !(( -61 < a0 && (((input == 1) && ((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2)))) && a4 <= -86 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1234] COND FALSE !(((( ((-98 < a0) && (-61 >= a0)) && ((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1241] COND FALSE !(((a2==3) && (( ((-98 < a0) && (-61 >= a0)) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1247] COND FALSE !(( -61 < a0 && ((((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2))) && (input == 2)) && a4 <= -86 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1253] COND FALSE !(((((input == 1) && (( a29 <= -144 && (a2==2)) || (( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 )))) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1259] COND FALSE !(((( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && (input == 3))) && (a2==5)) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1265] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 5)) && a0 <= -147 )) && (a2==3))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1271] COND FALSE !(((a2==2) && ((((input == 3) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1274] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && (input == 2))) && (a2==5)) && a29 <= -144 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1281] COND FALSE !((( -61 < a0 && ((input == 5) && ((((a2==1) && 43 < a29 ) || ((a2==2) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2))))) && a4 <= -86 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1287] COND FALSE !(((a2==1) && ((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1293] COND FALSE !(((( ((-147 < a0) && (-98 >= a0)) && ((a2==2) && (input == 6))) && ((-86 < a4) && (-42 >= a4)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1299] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ( 43 < a29 && (((a2==2) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1310] COND FALSE !(((((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ) && (a2==3))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1316] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && (( ((-86 < a4) && (-42 >= a4)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 4))) && (a2==3)))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1323] COND FALSE !(((a2==1) && (((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 6)) && a4 <= -86 ) && -61 < a0 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1327] COND FALSE !(( -61 < a0 && ( a4 <= -86 && (((input == 5) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && (a2==1))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1331] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((((input == 5) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-98 < a0) && (-61 >= a0)) ) && (a2==4)))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1343] COND FALSE !((( a0 <= -147 && (((input == 1) && ((-86 < a4) && (-42 >= a4)) ) && (a2==1))) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1348] COND FALSE !((( -61 < a0 && ((((a2==5) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 ))) && (input == 6))) && a4 <= -86 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1354] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ((a2==5) && (((input == 4) && ( 43 < a29 || ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1360] COND FALSE !((( a0 <= -147 && (((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==4))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1369] COND FALSE !(((((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 6)) && a4 <= -86 ) && (a2==3)) && -61 < a0 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1375] COND FALSE !((((((input == 6) && a29 <= -144 ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1381] COND FALSE !((((((input == 4) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) && a0 <= -147 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1388] COND FALSE !(( -61 < a0 && (((a2==3) && ( a4 <= -86 && (input == 1))) && 43 < a29 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1395] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 6) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && (a2==5))) && a0 <= -147 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1398] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((a2==4) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 4)))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1404] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 5)) && ((-98 < a0) && (-61 >= a0)) )) && (a2==3))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1418] COND FALSE !(( a4 <= -86 && ((((((a2==1) && 43 < a29 ) || ((a2==2) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2))) && (input == 4)) && -61 < a0 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1423] COND FALSE !((((a2==3) && (((input == 5) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1429] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && (((a2==3) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1441] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((a2==2) && ( ((-144 < a29) && (-16 >= a29)) && (input == 5)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1448] COND FALSE !(((((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) && 43 < a29 ) || ((a2==3) && a29 <= -144 ))) && (input == 6)) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1459] COND FALSE !(((a2==3) && ( ((-147 < a0) && (-98 >= a0)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1466] COND FALSE !(((((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 1)) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1471] COND FALSE !(((a2==2) && (( ((-98 < a0) && (-61 >= a0)) && ((input == 5) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1476] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 5)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1483] COND FALSE !(((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 1)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==4))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1488] COND FALSE !((((((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1492] COND FALSE !((( a0 <= -147 && ((input == 3) && ((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1498] COND FALSE !(( -61 < a0 && (((input == 4) && (( ((-144 < a29) && (-16 >= a29)) && (a2==5)) || (((a2==4) && 43 < a29 ) || ((a2==5) && a29 <= -144 )))) && a4 <= -86 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1504] COND FALSE !(((a2==4) && ( ((-147 < a0) && (-98 >= a0)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 5)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1511] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 1)) && (a2==4))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1518] COND FALSE !((((( ((-86 < a4) && (-42 >= a4)) && (input == 5)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==2)) && 43 < a29 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1521] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==2) && (( 43 < a29 && (input == 1)) && ((-98 < a0) && (-61 >= a0)) )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1526] COND FALSE !(((a2==5) && ( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1532] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 1)))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1538] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && (((a2==1) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 1))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1543] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((((((a2==2) && 43 < a29 ) || ((a2==3) && a29 <= -144 )) || ((a2==3) && ((-144 < a29) && (-16 >= a29)) )) && (input == 3)) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1550] COND FALSE !(( a0 <= -147 && ((((a2==1) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ) && ((-16 < a29) && (43 >= a29)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1557] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && ( ((-147 < a0) && (-98 >= a0)) && ((a2==2) && ((input == 2) && ((-86 < a4) && (-42 >= a4)) ))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1564] COND FALSE !((((a2==1) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)) && a4 <= -86 )) && -61 < a0 )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1569] COND FALSE !(((a2==4) && (( ((-86 < a4) && (-42 >= a4)) && ((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1576] COND FALSE !((( a0 <= -147 && (((input == 6) && ((-86 < a4) && (-42 >= a4)) ) && (a2==1))) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1580] COND FALSE !(( a4 <= -86 && (((((a2==3) && a29 <= -144 ) || (((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2)))) && (input == 4)) && -61 < a0 ))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1592] COND FALSE !(( ((-144 < a29) && (-16 >= a29)) && ((a2==2) && (( ((-86 < a4) && (-42 >= a4)) && (input == 6)) && ((-147 < a0) && (-98 >= a0)) )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1599] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) && (a2==4))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1605] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 1)) && a0 <= -147 )))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1612] COND FALSE !(((( ((-16 < a29) && (43 >= a29)) && ( ((-86 < a4) && (-42 >= a4)) && (input == 2))) && a0 <= -147 ) && (a2==1))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1616] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) && (input == 3)) && (a2==2))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1622] COND FALSE !(((a2==3) && ( ((-98 < a0) && (-61 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1633] COND FALSE !(( a4 <= -86 && (( -61 < a0 && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 6))) && (a2==4)))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1639] COND FALSE !(( a4 <= -86 && ( ((-16 < a29) && (43 >= a29)) && (( -61 < a0 && (input == 2)) && (a2==5))))) VAL [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1645] COND TRUE (((a2==1) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && a4 <= -86 )) && -61 < a0 ) [L1646] a29 = (((a29 / 5) / 5) + 4459) [L1647] a2 = 2 [L1649] return 22; VAL [\result=22, a0=-44, a29=4454, a2=2, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1784] RET, EXPR calculate_output(input) [L1784] output = calculate_output(input) [L1776] COND TRUE 1 [L1779] int input; [L1780] input = __VERIFIER_nondet_int() [L1781] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1784] CALL, EXPR calculate_output(input) [L34] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((((a2==1) && a4 <= -86 ) && -61 < a0 ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L218] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 1) && (((a2==3) && a29 <= -144 ) || (((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2)))))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L229] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==2) && ( a29 <= -144 && (input == 3))) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((( a0 <= -147 && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==4)))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !(((((a2==3) && ((input == 3) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && -61 < a0 ) && a4 <= -86 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !(((((input == 5) && (( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (( 43 < a29 && (a2==1)) || ((a2==2) && a29 <= -144 )))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L263] COND FALSE !(((((( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((( -61 < a0 && ((((a2==3) && a29 <= -144 ) || (( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ( 43 < a29 && (a2==2)))) && (input == 2))) && a4 <= -86 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !(((((a2==4) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((((input == 4) && 43 < a29 ) && (a2==1)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L288] COND FALSE !((( -61 < a0 && (((( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 1))) && a4 <= -86 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L295] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==3))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L302] COND FALSE !((((a2==2) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !((((((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !(((a2==4) && ( -61 < a0 && ( a4 <= -86 && ((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !((((((input == 3) && -61 < a0 ) && a4 <= -86 ) && ((-16 < a29) && (43 >= a29)) ) && (a2==5))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L337] COND FALSE !(((a2==1) && ( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L343] COND FALSE !((( -61 < a0 && ( 43 < a29 && ((input == 4) && (a2==5)))) && a4 <= -86 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L346] COND FALSE !(((((((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==3) && 43 < a29 ) || ( a29 <= -144 && (a2==4)))) && (input == 5)) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(( 43 < a29 && (( -61 < a0 && ( a4 <= -86 && (input == 1))) && (a2==5)))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !((( a4 <= -86 && ( 43 < a29 && ((input == 2) && -61 < a0 ))) && (a2==3))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L371] COND FALSE !(((((input == 6) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !((((( ((-98 < a0) && (-61 >= a0)) && (input == 3)) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !(((( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L390] COND FALSE !(((( a4 <= -86 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1))) && (a2==1)) && -61 < a0 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( -61 < a0 && ((( 43 < a29 && (input == 6)) && (a2==5)) && a4 <= -86 ))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 3) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (a2==5))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && ((-86 < a4) && (-42 >= a4)) )) && (a2==4))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && (a2==4))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !((((((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 ) && (input == 6)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((a2==3) && (((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) && (a2==5))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==3) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((((a2==3) && (( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2))) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L455] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && (a2==5)) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) )) && (a2==4))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(((((((a2==5) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 ))) && (input == 2)) && a4 <= -86 ) && -61 < a0 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L472] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (( ((-98 < a0) && (-61 >= a0)) && (input == 6)) && (a2==2))) && a29 <= -144 )) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && ( a4 <= -86 && (((input == 6) && -61 < a0 ) && (a2==5))))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L484] COND FALSE !((( ((-16 < a29) && (43 >= a29)) && (((input == 4) && -61 < a0 ) && a4 <= -86 )) && (a2==5))) VAL [a0=-44, a29=4454, a2=2, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND TRUE ( -61 < a0 && ( a4 <= -86 && ((input == 5) && ((( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ((a2==2) && 43 < a29 )) || ( a29 <= -144 && (a2==3)))))) [L490] a4 = (((((a4 % 21)+ -47) + 367614) + 116418) + -484038) [L491] a0 = ((((a0 / 5) / 5) % 24)+ -122) [L492] a29 = (((a29 / 5) + 298882) - 164223) [L493] a2 = 3 [L495] return 21; VAL [\result=21, a0=-123, a29=135549, a2=3, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1784] RET, EXPR calculate_output(input) [L1784] output = calculate_output(input) [L1776] COND TRUE 1 [L1779] int input; [L1780] input = __VERIFIER_nondet_int() [L1781] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1784] CALL, EXPR calculate_output(input) [L34] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((((a2==1) && a4 <= -86 ) && -61 < a0 ) && a29 <= -144 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L218] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 1) && (((a2==3) && a29 <= -144 ) || (((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2)))))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L229] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==2) && ( a29 <= -144 && (input == 3))) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((( a0 <= -147 && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==4)))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !(((((a2==3) && ((input == 3) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && -61 < a0 ) && a4 <= -86 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !(((((input == 5) && (( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (( 43 < a29 && (a2==1)) || ((a2==2) && a29 <= -144 )))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L263] COND FALSE !(((((( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((( -61 < a0 && ((((a2==3) && a29 <= -144 ) || (( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ( 43 < a29 && (a2==2)))) && (input == 2))) && a4 <= -86 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !(((((a2==4) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((((input == 4) && 43 < a29 ) && (a2==1)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L288] COND FALSE !((( -61 < a0 && (((( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 1))) && a4 <= -86 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L295] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==3))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L302] COND FALSE !((((a2==2) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !((((((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !(((a2==4) && ( -61 < a0 && ( a4 <= -86 && ((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !((((((input == 3) && -61 < a0 ) && a4 <= -86 ) && ((-16 < a29) && (43 >= a29)) ) && (a2==5))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L337] COND FALSE !(((a2==1) && ( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L343] COND FALSE !((( -61 < a0 && ( 43 < a29 && ((input == 4) && (a2==5)))) && a4 <= -86 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L346] COND FALSE !(((((((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==3) && 43 < a29 ) || ( a29 <= -144 && (a2==4)))) && (input == 5)) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(( 43 < a29 && (( -61 < a0 && ( a4 <= -86 && (input == 1))) && (a2==5)))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !((( a4 <= -86 && ( 43 < a29 && ((input == 2) && -61 < a0 ))) && (a2==3))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L371] COND FALSE !(((((input == 6) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !((((( ((-98 < a0) && (-61 >= a0)) && (input == 3)) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !(((( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L390] COND FALSE !(((( a4 <= -86 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1))) && (a2==1)) && -61 < a0 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( -61 < a0 && ((( 43 < a29 && (input == 6)) && (a2==5)) && a4 <= -86 ))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 3) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (a2==5))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && ((-86 < a4) && (-42 >= a4)) )) && (a2==4))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && (a2==4))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !((((((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 ) && (input == 6)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((a2==3) && (((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) && (a2==5))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==3) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((((a2==3) && (( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2))) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L455] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && (a2==5)) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) )) && (a2==4))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(((((((a2==5) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 ))) && (input == 2)) && a4 <= -86 ) && -61 < a0 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L472] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (( ((-98 < a0) && (-61 >= a0)) && (input == 6)) && (a2==2))) && a29 <= -144 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && ( a4 <= -86 && (((input == 6) && -61 < a0 ) && (a2==5))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L484] COND FALSE !((( ((-16 < a29) && (43 >= a29)) && (((input == 4) && -61 < a0 ) && a4 <= -86 )) && (a2==5))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 5) && ((( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ((a2==2) && 43 < a29 )) || ( a29 <= -144 && (a2==3))))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L496] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && (((input == 1) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==2))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L501] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 6) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && (a2==2))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((input == 3) && ((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L512] COND FALSE !(((( a0 <= -147 && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-98 < a0) && (-61 >= a0)) ) && (a2==1))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( a29 <= -144 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 3) && (a2==5)))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L530] COND FALSE !(((a2==4) && ( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && a0 <= -147 )))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L539] COND FALSE !((((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L552] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && ( a0 <= -147 && ( ((-16 < a29) && (43 >= a29)) && (input == 5)))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L556] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( a0 <= -147 && ((( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2)))) && (input == 4))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L567] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==2) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)) && ((-98 < a0) && (-61 >= a0)) )))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==5) && ( 43 < a29 && (input == 3)))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L584] COND FALSE !(( -61 < a0 && ( a4 <= -86 && (((a2==3) && (input == 4)) && 43 < a29 )))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L597] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 )) || ((a2==2) && a29 <= -144 )) && (input == 6))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L604] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L616] COND FALSE !((((a2==2) && (( ((-144 < a29) && (-16 >= a29)) && (input == 1)) && ((-86 < a4) && (-42 >= a4)) )) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L623] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 6) && (((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L630] COND FALSE !(((((a2==1) && ((input == 5) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L637] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )))) && (a2==2))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L644] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && (( a0 <= -147 && (input == 2)) && 43 < a29 )))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L651] COND FALSE !(((a2==1) && ( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) && a0 <= -147 )))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L662] COND FALSE !(((((a2==1) && ((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L667] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==1) && ((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L672] COND FALSE !(( a0 <= -147 && ((a2==2) && ( ((-86 < a4) && (-42 >= a4)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 2)))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L678] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ((((( 43 < a29 && (a2==2)) || ((a2==3) && a29 <= -144 )) || ((a2==3) && ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L685] COND FALSE !(((((a2==5) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L691] COND FALSE !(((a2==2) && ( ((-98 < a0) && (-61 >= a0)) && (( a29 <= -144 && (input == 1)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L697] COND FALSE !(((( a4 <= -86 && ( -61 < a0 && (input == 5))) && (a2==5)) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L703] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 6)) && (a2==4)) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L717] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 4)))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ((-98 < a0) && (-61 >= a0)) )) && a29 <= -144 ) && (a2==2))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L728] COND FALSE !(((a2==1) && ((((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L735] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((((a2==4) && 43 < a29 ) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 3))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L742] COND FALSE !((((a2==5) && (((input == 5) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L745] COND FALSE !(((( ((-16 < a29) && (43 >= a29)) && ((input == 1) && ((-147 < a0) && (-98 >= a0)) )) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L752] COND FALSE !((( a4 <= -86 && ((input == 6) && ((((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ((a2==2) && 43 < a29 )) || ((a2==3) && a29 <= -144 )))) && -61 < a0 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L758] COND FALSE !(((( -61 < a0 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 5))) && a4 <= -86 ) && (a2==3))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L764] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==2)) || ((a2==3) && a29 <= -144 ))) && (input == 5))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L771] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 6) && ((-86 < a4) && (-42 >= a4)) ) && (a2==1)) && 43 < a29 ))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L778] COND FALSE !(( a0 <= -147 && ((((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L784] COND FALSE !(((((a2==1) && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L789] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((a2==4) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L796] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 4) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L803] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 && (a2==2)) || (( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 ))) && (input == 4))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L814] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && (( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L821] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && (a2==2))) && a0 <= -147 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L827] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==3) && ( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L834] COND FALSE !(((a2==5) && ((( a0 <= -147 && (input == 5)) && 43 < a29 ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L839] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && (( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && (input == 3))) && a0 <= -147 ))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L850] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((a2==4) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L855] COND FALSE !((( a4 <= -86 && ((input == 3) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) )))) && -61 < a0 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L861] COND FALSE !(((a2==4) && ((((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L865] COND FALSE !(((a2==5) && ((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 ))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L872] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) && 43 < a29 ) || ( a29 <= -144 && (a2==3)))) && (input == 1))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L878] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && a0 <= -147 ) && (a2==5)))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L884] COND FALSE !(( a4 <= -86 && ( -61 < a0 && ((input == 5) && ((( 43 < a29 && (a2==4)) || ( a29 <= -144 && (a2==5))) || ((a2==5) && ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L890] COND FALSE !(((a2==3) && ( a4 <= -86 && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1)) && -61 < a0 )))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L895] COND FALSE !(((a2==5) && ((((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L905] COND FALSE !((((( -61 < a0 && (input == 2)) && 43 < a29 ) && a4 <= -86 ) && (a2==5))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L911] COND FALSE !((((((input == 1) && (a2==1)) && 43 < a29 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L917] COND FALSE !(((((a2==2) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L922] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 6) && 43 < a29 ) && (a2==2))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L929] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && (a2==3)))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L935] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 1) && (a2==5)) && ((-86 < a4) && (-42 >= a4)) )) && a29 <= -144 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L940] COND FALSE !((((a2==1) && ( a0 <= -147 && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 6)))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L945] COND FALSE !(((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==4))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L952] COND FALSE !((((a2==1) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L958] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && ((input == 5) && (a2==2)))) && a29 <= -144 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L965] COND FALSE !((( -61 < a0 && ((a2==1) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)))) && a4 <= -86 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L969] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((((((a2==1) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )) && (input == 5)) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L976] COND FALSE !((((( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && ((-16 < a29) && (43 >= a29)) ) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L983] COND FALSE !(( a4 <= -86 && ((( 43 < a29 && (input == 5)) && -61 < a0 ) && (a2==3)))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L989] COND FALSE !((((a2==4) && ( a4 <= -86 && ((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )))) && -61 < a0 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L995] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 6)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==1)))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1002] COND FALSE !(((((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6)) && ((-86 < a4) && (-42 >= a4)) ) && (a2==2)) && a0 <= -147 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1008] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && (a2==4))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1014] COND FALSE !((((((input == 1) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) ) && (a2==5)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1021] COND FALSE !(((( ((-98 < a0) && (-61 >= a0)) && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1026] COND FALSE !((((a2==4) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1029] COND FALSE !((((a2==2) && (( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) )) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1036] COND FALSE !(((a2==5) && ( ((-86 < a4) && (-42 >= a4)) && (( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && a29 <= -144 )))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1040] COND FALSE !(( a4 <= -86 && ((((((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2))) || ((a2==3) && a29 <= -144 )) && (input == 3)) && -61 < a0 ))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1045] COND FALSE !(((a2==2) && ( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 1)) && a0 <= -147 )))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1048] COND FALSE !(( a0 <= -147 && ((((((a2==3) && 43 < a29 ) || ( a29 <= -144 && (a2==4))) || ((a2==4) && ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1054] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (( a0 <= -147 && ((a2==5) && (input == 1))) && 43 < a29 ))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1059] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) )) && (a2==5))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1072] COND FALSE !((((a2==2) && (((input == 4) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1084] COND FALSE !((((((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1091] COND FALSE !(( a4 <= -86 && (((input == 6) && ((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) ))) && -61 < a0 ))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1096] COND FALSE !(((a2==1) && (( 43 < a29 && ((input == 2) && ((-98 < a0) && (-61 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1101] COND FALSE !((((((input == 4) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && a4 <= -86 ) && (a2==3)) && -61 < a0 )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1108] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==4))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1118] COND FALSE !(((a2==2) && (((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1125] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1132] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && (((input == 2) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && (a2==5))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1138] COND FALSE !(( 43 < a29 && ( a4 <= -86 && ( -61 < a0 && ((a2==3) && (input == 3)))))) VAL [a0=-123, a29=135549, a2=3, a4=-58, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1144] COND TRUE (((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) ) && (a2==3)) VAL [a0=-123, a29=135549, a2=3, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1145] COND FALSE !(((-98 < a0) && (-61 >= a0))) [L1150] a0 = (((a0 - 401265) / 5) + -135803) [L1151] a29 = ((((a29 % 299978)+ 300021) - 0) * 1) [L1152] a2 = 4 VAL [a0=-216080, a29=435570, a2=4, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1154] return 22; VAL [\result=22, a0=-216080, a29=435570, a2=4, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1784] RET, EXPR calculate_output(input) [L1784] output = calculate_output(input) [L1776] COND TRUE 1 [L1779] int input; [L1780] input = __VERIFIER_nondet_int() [L1781] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1784] CALL, EXPR calculate_output(input) [L34] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((((a2==1) && a4 <= -86 ) && -61 < a0 ) && a29 <= -144 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L218] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 1) && (((a2==3) && a29 <= -144 ) || (((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2)))))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L229] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==2) && ( a29 <= -144 && (input == 3))) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((( a0 <= -147 && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==4)))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !(((((a2==3) && ((input == 3) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && -61 < a0 ) && a4 <= -86 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !(((((input == 5) && (( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (( 43 < a29 && (a2==1)) || ((a2==2) && a29 <= -144 )))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L263] COND FALSE !(((((( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((( -61 < a0 && ((((a2==3) && a29 <= -144 ) || (( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ( 43 < a29 && (a2==2)))) && (input == 2))) && a4 <= -86 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !(((((a2==4) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((((input == 4) && 43 < a29 ) && (a2==1)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L288] COND FALSE !((( -61 < a0 && (((( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 1))) && a4 <= -86 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L295] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==3))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L302] COND FALSE !((((a2==2) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !((((((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !(((a2==4) && ( -61 < a0 && ( a4 <= -86 && ((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !((((((input == 3) && -61 < a0 ) && a4 <= -86 ) && ((-16 < a29) && (43 >= a29)) ) && (a2==5))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L337] COND FALSE !(((a2==1) && ( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L343] COND FALSE !((( -61 < a0 && ( 43 < a29 && ((input == 4) && (a2==5)))) && a4 <= -86 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L346] COND FALSE !(((((((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==3) && 43 < a29 ) || ( a29 <= -144 && (a2==4)))) && (input == 5)) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(( 43 < a29 && (( -61 < a0 && ( a4 <= -86 && (input == 1))) && (a2==5)))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !((( a4 <= -86 && ( 43 < a29 && ((input == 2) && -61 < a0 ))) && (a2==3))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L371] COND FALSE !(((((input == 6) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !((((( ((-98 < a0) && (-61 >= a0)) && (input == 3)) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !(((( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L390] COND FALSE !(((( a4 <= -86 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1))) && (a2==1)) && -61 < a0 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( -61 < a0 && ((( 43 < a29 && (input == 6)) && (a2==5)) && a4 <= -86 ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 3) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (a2==5))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && ((-86 < a4) && (-42 >= a4)) )) && (a2==4))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && (a2==4))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !((((((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 ) && (input == 6)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((a2==3) && (((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) && (a2==5))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==3) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((((a2==3) && (( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2))) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L455] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && (a2==5)) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) )) && (a2==4))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(((((((a2==5) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 ))) && (input == 2)) && a4 <= -86 ) && -61 < a0 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L472] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (( ((-98 < a0) && (-61 >= a0)) && (input == 6)) && (a2==2))) && a29 <= -144 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && ( a4 <= -86 && (((input == 6) && -61 < a0 ) && (a2==5))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L484] COND FALSE !((( ((-16 < a29) && (43 >= a29)) && (((input == 4) && -61 < a0 ) && a4 <= -86 )) && (a2==5))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 5) && ((( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ((a2==2) && 43 < a29 )) || ( a29 <= -144 && (a2==3))))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L496] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && (((input == 1) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==2))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L501] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 6) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && (a2==2))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((input == 3) && ((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L512] COND FALSE !(((( a0 <= -147 && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-98 < a0) && (-61 >= a0)) ) && (a2==1))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( a29 <= -144 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 3) && (a2==5)))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L530] COND FALSE !(((a2==4) && ( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && a0 <= -147 )))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L539] COND FALSE !((((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L552] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && ( a0 <= -147 && ( ((-16 < a29) && (43 >= a29)) && (input == 5)))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L556] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( a0 <= -147 && ((( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2)))) && (input == 4))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L567] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==2) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)) && ((-98 < a0) && (-61 >= a0)) )))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==5) && ( 43 < a29 && (input == 3)))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L584] COND FALSE !(( -61 < a0 && ( a4 <= -86 && (((a2==3) && (input == 4)) && 43 < a29 )))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L597] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 )) || ((a2==2) && a29 <= -144 )) && (input == 6))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L604] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L616] COND FALSE !((((a2==2) && (( ((-144 < a29) && (-16 >= a29)) && (input == 1)) && ((-86 < a4) && (-42 >= a4)) )) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L623] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 6) && (((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L630] COND FALSE !(((((a2==1) && ((input == 5) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L637] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )))) && (a2==2))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L644] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && (( a0 <= -147 && (input == 2)) && 43 < a29 )))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L651] COND FALSE !(((a2==1) && ( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) && a0 <= -147 )))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L662] COND FALSE !(((((a2==1) && ((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L667] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==1) && ((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L672] COND FALSE !(( a0 <= -147 && ((a2==2) && ( ((-86 < a4) && (-42 >= a4)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 2)))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L678] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ((((( 43 < a29 && (a2==2)) || ((a2==3) && a29 <= -144 )) || ((a2==3) && ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L685] COND FALSE !(((((a2==5) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L691] COND FALSE !(((a2==2) && ( ((-98 < a0) && (-61 >= a0)) && (( a29 <= -144 && (input == 1)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L697] COND FALSE !(((( a4 <= -86 && ( -61 < a0 && (input == 5))) && (a2==5)) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L703] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 6)) && (a2==4)) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L717] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 4)))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ((-98 < a0) && (-61 >= a0)) )) && a29 <= -144 ) && (a2==2))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L728] COND FALSE !(((a2==1) && ((((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L735] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((((a2==4) && 43 < a29 ) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 3))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L742] COND FALSE !((((a2==5) && (((input == 5) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L745] COND FALSE !(((( ((-16 < a29) && (43 >= a29)) && ((input == 1) && ((-147 < a0) && (-98 >= a0)) )) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L752] COND FALSE !((( a4 <= -86 && ((input == 6) && ((((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ((a2==2) && 43 < a29 )) || ((a2==3) && a29 <= -144 )))) && -61 < a0 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L758] COND FALSE !(((( -61 < a0 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 5))) && a4 <= -86 ) && (a2==3))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L764] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==2)) || ((a2==3) && a29 <= -144 ))) && (input == 5))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L771] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 6) && ((-86 < a4) && (-42 >= a4)) ) && (a2==1)) && 43 < a29 ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L778] COND FALSE !(( a0 <= -147 && ((((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L784] COND FALSE !(((((a2==1) && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L789] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((a2==4) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L796] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 4) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L803] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 && (a2==2)) || (( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 ))) && (input == 4))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L814] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && (( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L821] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && (a2==2))) && a0 <= -147 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L827] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==3) && ( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L834] COND FALSE !(((a2==5) && ((( a0 <= -147 && (input == 5)) && 43 < a29 ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L839] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && (( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && (input == 3))) && a0 <= -147 ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L850] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((a2==4) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L855] COND FALSE !((( a4 <= -86 && ((input == 3) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) )))) && -61 < a0 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L861] COND FALSE !(((a2==4) && ((((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L865] COND FALSE !(((a2==5) && ((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L872] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) && 43 < a29 ) || ( a29 <= -144 && (a2==3)))) && (input == 1))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L878] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && a0 <= -147 ) && (a2==5)))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L884] COND FALSE !(( a4 <= -86 && ( -61 < a0 && ((input == 5) && ((( 43 < a29 && (a2==4)) || ( a29 <= -144 && (a2==5))) || ((a2==5) && ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L890] COND FALSE !(((a2==3) && ( a4 <= -86 && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1)) && -61 < a0 )))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L895] COND FALSE !(((a2==5) && ((((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L905] COND FALSE !((((( -61 < a0 && (input == 2)) && 43 < a29 ) && a4 <= -86 ) && (a2==5))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L911] COND FALSE !((((((input == 1) && (a2==1)) && 43 < a29 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L917] COND FALSE !(((((a2==2) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L922] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 6) && 43 < a29 ) && (a2==2))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L929] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && (a2==3)))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L935] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 1) && (a2==5)) && ((-86 < a4) && (-42 >= a4)) )) && a29 <= -144 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L940] COND FALSE !((((a2==1) && ( a0 <= -147 && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 6)))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L945] COND FALSE !(((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==4))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L952] COND FALSE !((((a2==1) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L958] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && ((input == 5) && (a2==2)))) && a29 <= -144 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L965] COND FALSE !((( -61 < a0 && ((a2==1) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)))) && a4 <= -86 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L969] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((((((a2==1) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )) && (input == 5)) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L976] COND FALSE !((((( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && ((-16 < a29) && (43 >= a29)) ) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L983] COND FALSE !(( a4 <= -86 && ((( 43 < a29 && (input == 5)) && -61 < a0 ) && (a2==3)))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L989] COND FALSE !((((a2==4) && ( a4 <= -86 && ((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )))) && -61 < a0 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L995] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 6)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==1)))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1002] COND FALSE !(((((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6)) && ((-86 < a4) && (-42 >= a4)) ) && (a2==2)) && a0 <= -147 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1008] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && (a2==4))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1014] COND FALSE !((((((input == 1) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) ) && (a2==5)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1021] COND FALSE !(((( ((-98 < a0) && (-61 >= a0)) && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1026] COND FALSE !((((a2==4) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1029] COND FALSE !((((a2==2) && (( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) )) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1036] COND FALSE !(((a2==5) && ( ((-86 < a4) && (-42 >= a4)) && (( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && a29 <= -144 )))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1040] COND FALSE !(( a4 <= -86 && ((((((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2))) || ((a2==3) && a29 <= -144 )) && (input == 3)) && -61 < a0 ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1045] COND FALSE !(((a2==2) && ( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 1)) && a0 <= -147 )))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1048] COND FALSE !(( a0 <= -147 && ((((((a2==3) && 43 < a29 ) || ( a29 <= -144 && (a2==4))) || ((a2==4) && ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1054] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (( a0 <= -147 && ((a2==5) && (input == 1))) && 43 < a29 ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1059] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) )) && (a2==5))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1072] COND FALSE !((((a2==2) && (((input == 4) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1084] COND FALSE !((((((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1091] COND FALSE !(( a4 <= -86 && (((input == 6) && ((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) ))) && -61 < a0 ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1096] COND FALSE !(((a2==1) && (( 43 < a29 && ((input == 2) && ((-98 < a0) && (-61 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1101] COND FALSE !((((((input == 4) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && a4 <= -86 ) && (a2==3)) && -61 < a0 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1108] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==4))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1118] COND FALSE !(((a2==2) && (((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1125] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1132] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && (((input == 2) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && (a2==5))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1138] COND FALSE !(( 43 < a29 && ( a4 <= -86 && ( -61 < a0 && ((a2==3) && (input == 3)))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1144] COND FALSE !((((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) ) && (a2==3))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1155] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( a0 <= -147 && ((( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (( 43 < a29 && (a2==1)) || ((a2==2) && a29 <= -144 ))) && (input == 1))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1160] COND FALSE !(((a2==4) && ((((input == 3) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1166] COND FALSE !(((a2==4) && ((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 1)) && a4 <= -86 ) && -61 < a0 ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1172] COND FALSE !((((a2==4) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 4)) && ((-98 < a0) && (-61 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1178] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ( 43 < a29 && ((input == 3) && (a2==1)))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1182] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((a2==1) && ( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1188] COND FALSE !(( a0 <= -147 && (((((a2==2) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2)))) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1194] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 2) && (a2==2))) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1200] COND FALSE !((((( ((-98 < a0) && (-61 >= a0)) && (input == 2)) && a29 <= -144 ) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1207] COND FALSE !((((a2==5) && ( -61 < a0 && ((input == 5) && 43 < a29 ))) && a4 <= -86 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1213] COND FALSE !((((( a0 <= -147 && (input == 6)) && (a2==5)) && 43 < a29 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1218] COND FALSE !(( 43 < a29 && ((((input == 4) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1222] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && ((a2==1) && ((input == 3) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1228] COND FALSE !(( -61 < a0 && (((input == 1) && ((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2)))) && a4 <= -86 ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1234] COND FALSE !(((( ((-98 < a0) && (-61 >= a0)) && ((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1241] COND FALSE !(((a2==3) && (( ((-98 < a0) && (-61 >= a0)) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1247] COND FALSE !(( -61 < a0 && ((((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2))) && (input == 2)) && a4 <= -86 ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1253] COND FALSE !(((((input == 1) && (( a29 <= -144 && (a2==2)) || (( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 )))) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1259] COND FALSE !(((( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && (input == 3))) && (a2==5)) && 43 < a29 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1265] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 5)) && a0 <= -147 )) && (a2==3))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1271] COND FALSE !(((a2==2) && ((((input == 3) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1274] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && (input == 2))) && (a2==5)) && a29 <= -144 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1281] COND FALSE !((( -61 < a0 && ((input == 5) && ((((a2==1) && 43 < a29 ) || ((a2==2) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2))))) && a4 <= -86 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1287] COND FALSE !(((a2==1) && ((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1293] COND FALSE !(((( ((-147 < a0) && (-98 >= a0)) && ((a2==2) && (input == 6))) && ((-86 < a4) && (-42 >= a4)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1299] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ( 43 < a29 && (((a2==2) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1310] COND FALSE !(((((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ) && (a2==3))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1316] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && (( ((-86 < a4) && (-42 >= a4)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 4))) && (a2==3)))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1323] COND FALSE !(((a2==1) && (((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 6)) && a4 <= -86 ) && -61 < a0 ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1327] COND FALSE !(( -61 < a0 && ( a4 <= -86 && (((input == 5) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && (a2==1))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1331] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((((input == 5) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-98 < a0) && (-61 >= a0)) ) && (a2==4)))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1343] COND FALSE !((( a0 <= -147 && (((input == 1) && ((-86 < a4) && (-42 >= a4)) ) && (a2==1))) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1348] COND FALSE !((( -61 < a0 && ((((a2==5) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 ))) && (input == 6))) && a4 <= -86 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1354] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ((a2==5) && (((input == 4) && ( 43 < a29 || ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1360] COND FALSE !((( a0 <= -147 && (((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==4))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1369] COND FALSE !(((((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 6)) && a4 <= -86 ) && (a2==3)) && -61 < a0 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1375] COND FALSE !((((((input == 6) && a29 <= -144 ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1381] COND FALSE !((((((input == 4) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) && a0 <= -147 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1388] COND FALSE !(( -61 < a0 && (((a2==3) && ( a4 <= -86 && (input == 1))) && 43 < a29 ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1395] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 6) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && (a2==5))) && a0 <= -147 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1398] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((a2==4) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 4)))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1404] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 5)) && ((-98 < a0) && (-61 >= a0)) )) && (a2==3))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1418] COND FALSE !(( a4 <= -86 && ((((((a2==1) && 43 < a29 ) || ((a2==2) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2))) && (input == 4)) && -61 < a0 ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1423] COND FALSE !((((a2==3) && (((input == 5) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1429] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && (((a2==3) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1441] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((a2==2) && ( ((-144 < a29) && (-16 >= a29)) && (input == 5)))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1448] COND FALSE !(((((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) && 43 < a29 ) || ((a2==3) && a29 <= -144 ))) && (input == 6)) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1459] COND FALSE !(((a2==3) && ( ((-147 < a0) && (-98 >= a0)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1466] COND FALSE !(((((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 1)) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1471] COND FALSE !(((a2==2) && (( ((-98 < a0) && (-61 >= a0)) && ((input == 5) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1476] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 5)))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1483] COND FALSE !(((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 1)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==4))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1488] COND FALSE !((((((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1492] COND FALSE !((( a0 <= -147 && ((input == 3) && ((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1498] COND FALSE !(( -61 < a0 && (((input == 4) && (( ((-144 < a29) && (-16 >= a29)) && (a2==5)) || (((a2==4) && 43 < a29 ) || ((a2==5) && a29 <= -144 )))) && a4 <= -86 ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1504] COND FALSE !(((a2==4) && ( ((-147 < a0) && (-98 >= a0)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 5)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1511] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 1)) && (a2==4))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1518] COND FALSE !((((( ((-86 < a4) && (-42 >= a4)) && (input == 5)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==2)) && 43 < a29 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1521] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==2) && (( 43 < a29 && (input == 1)) && ((-98 < a0) && (-61 >= a0)) )))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1526] COND FALSE !(((a2==5) && ( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6)))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1532] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 1)))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1538] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && (((a2==1) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 1))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1543] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((((((a2==2) && 43 < a29 ) || ((a2==3) && a29 <= -144 )) || ((a2==3) && ((-144 < a29) && (-16 >= a29)) )) && (input == 3)) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1550] COND FALSE !(( a0 <= -147 && ((((a2==1) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ) && ((-16 < a29) && (43 >= a29)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1557] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && ( ((-147 < a0) && (-98 >= a0)) && ((a2==2) && ((input == 2) && ((-86 < a4) && (-42 >= a4)) ))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1564] COND FALSE !((((a2==1) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)) && a4 <= -86 )) && -61 < a0 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1569] COND FALSE !(((a2==4) && (( ((-86 < a4) && (-42 >= a4)) && ((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1576] COND FALSE !((( a0 <= -147 && (((input == 6) && ((-86 < a4) && (-42 >= a4)) ) && (a2==1))) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1580] COND FALSE !(( a4 <= -86 && (((((a2==3) && a29 <= -144 ) || (((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2)))) && (input == 4)) && -61 < a0 ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1592] COND FALSE !(( ((-144 < a29) && (-16 >= a29)) && ((a2==2) && (( ((-86 < a4) && (-42 >= a4)) && (input == 6)) && ((-147 < a0) && (-98 >= a0)) )))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1599] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) && (a2==4))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1605] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 1)) && a0 <= -147 )))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1612] COND FALSE !(((( ((-16 < a29) && (43 >= a29)) && ( ((-86 < a4) && (-42 >= a4)) && (input == 2))) && a0 <= -147 ) && (a2==1))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1616] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) && (input == 3)) && (a2==2))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1622] COND FALSE !(((a2==3) && ( ((-98 < a0) && (-61 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1633] COND FALSE !(( a4 <= -86 && (( -61 < a0 && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 6))) && (a2==4)))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1639] COND FALSE !(( a4 <= -86 && ( ((-16 < a29) && (43 >= a29)) && (( -61 < a0 && (input == 2)) && (a2==5))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1645] COND FALSE !((((a2==1) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && a4 <= -86 )) && -61 < a0 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1650] COND FALSE !((( ((-16 < a29) && (43 >= a29)) && ( a4 <= -86 && ( -61 < a0 && (input == 1)))) && (a2==5))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1657] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==5))))) [L1665] CALL, EXPR calculate_output2(input) [L1671] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 3) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==4)) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1678] COND FALSE !((((a2==3) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 6) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )))) && a0 <= -147 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1682] COND FALSE !(( -61 < a0 && ( a4 <= -86 && (( 43 < a29 && (input == 6)) && (a2==3))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1688] COND FALSE !(( a0 <= -147 && ((((((a2==3) && 43 < a29 ) || ((a2==4) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==4))) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1695] COND FALSE !(((a2==2) && ( ((-144 < a29) && (-16 >= a29)) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 3) && ((-147 < a0) && (-98 >= a0)) ))))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1704] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((a2==4) && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1711] COND FALSE !((((((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && (a2==3)) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1716] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) )) && (a2==3))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1719] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && (((a2==5) && ((input == 5) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1732] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && ((input == 2) && (((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) && 43 < a29 ) || ( a29 <= -144 && (a2==3)))))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1739] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 ) && (input == 3)))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1745] COND FALSE !(((((a2==4) && ((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1752] COND FALSE !((((a2==5) && ( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 5)))) && a0 <= -147 )) VAL [a0=-216080, a29=435570, a2=4, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1759] COND TRUE ((a2==4) && ( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3))))) [L1760] a4 = (((a4 / 5) + -251576) * 2) [L1761] a0 = (((((a0 + 0) % 24)+ -113) / 5) - 105) [L1762] a29 = (((((a29 / 5) - -479587) - -287) % 29)+ 3) [L1763] a2 = 2 [L1765] return -1; VAL [\result=-1, a0=-129, a29=12, a2=2, a4=-503174, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1665] RET, EXPR calculate_output2(input) [L1665] return calculate_output2(input); [L1784] RET, EXPR calculate_output(input) [L1784] output = calculate_output(input) [L1776] COND TRUE 1 [L1779] int input; [L1780] input = __VERIFIER_nondet_int() [L1781] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1784] CALL calculate_output(input) [L34] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-129, a29=12, a2=2, a4=-503174, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-129, a29=12, a2=2, a4=-503174, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-129, a29=12, a2=2, a4=-503174, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-129, a29=12, a2=2, a4=-503174, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-129, a29=12, a2=2, a4=-503174, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-129, a29=12, a2=2, a4=-503174, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-129, a29=12, a2=2, a4=-503174, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-129, a29=12, a2=2, a4=-503174, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-129, a29=12, a2=2, a4=-503174, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-129, a29=12, a2=2, a4=-503174, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-129, a29=12, a2=2, a4=-503174, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-129, a29=12, a2=2, a4=-503174, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-129, a29=12, a2=2, a4=-503174, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-129, a29=12, a2=2, a4=-503174, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-129, a29=12, a2=2, a4=-503174, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-129, a29=12, a2=2, a4=-503174, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-129, a29=12, a2=2, a4=-503174, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-129, a29=12, a2=2, a4=-503174, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND TRUE ((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) ) VAL [a0=-129, a29=12, a2=2, a4=-503174, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] reach_error() VAL [a0=-129, a29=12, a2=2, a4=-503174, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 363 locations, 688 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.8s, OverallIterations: 26, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 29.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10917 SdHoareTripleChecker+Valid, 26.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10917 mSDsluCounter, 8041 SdHoareTripleChecker+Invalid, 22.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1088 mSDsCounter, 4325 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31847 IncrementalHoareTripleChecker+Invalid, 36172 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4325 mSolverCounterUnsat, 6953 mSDtfsCounter, 31847 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5309 GetRequests, 5246 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24933occurred in iteration=21, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 44182 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 12.7s InterpolantComputationTime, 16973 NumberOfCodeBlocks, 16973 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 17507 ConstructedInterpolants, 0 QuantifiedInterpolants, 69653 SizeOfPredicates, 5 NumberOfNonLiveVariables, 4452 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 32 InterpolantComputations, 23 PerfectInterpolantSequences, 17512/18513 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-16 15:10:08,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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