./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label00.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_label00.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 e0fca5dbc26170dee357d8c920e255472ddf26c4f4efecf06bc9180208e51483 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:07:22,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:07:22,209 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:07:22,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:07:22,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:07:22,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:07:22,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:07:22,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:07:22,241 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:07:22,241 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:07:22,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:07:22,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:07:22,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:07:22,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:07:22,243 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:07:22,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:07:22,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:07:22,243 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:07:22,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:07:22,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:07:22,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:07:22,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:07:22,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:07:22,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:07:22,243 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:07:22,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:07:22,243 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:07:22,243 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:07:22,243 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:07:22,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:07:22,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:07:22,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:07:22,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:07:22,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:07:22,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:07:22,244 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:07:22,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:07:22,244 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:07:22,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:07:22,244 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:07:22,244 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:07:22,244 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:07:22,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:07:22,244 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 -> e0fca5dbc26170dee357d8c920e255472ddf26c4f4efecf06bc9180208e51483 [2025-03-16 15:07:22,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:07:22,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:07:22,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:07:22,483 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:07:22,483 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:07:22,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label00.c [2025-03-16 15:07:23,586 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a7863e32/8a8a5774c5594f46a65c18f92d45f52a/FLAGfd0ffae41 [2025-03-16 15:07:23,946 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:07:23,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label00.c [2025-03-16 15:07:23,973 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a7863e32/8a8a5774c5594f46a65c18f92d45f52a/FLAGfd0ffae41 [2025-03-16 15:07:24,159 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a7863e32/8a8a5774c5594f46a65c18f92d45f52a [2025-03-16 15:07:24,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:07:24,162 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:07:24,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:07:24,163 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:07:24,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:07:24,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:07:24" (1/1) ... [2025-03-16 15:07:24,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29eb79d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:24, skipping insertion in model container [2025-03-16 15:07:24,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:07:24" (1/1) ... [2025-03-16 15:07:24,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:07:24,346 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_label00.c[1053,1066] [2025-03-16 15:07:24,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:07:24,659 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:07:24,666 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_label00.c[1053,1066] [2025-03-16 15:07:24,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:07:24,847 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:07:24,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:24 WrapperNode [2025-03-16 15:07:24,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:07:24,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:07:24,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:07:24,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:07:24,854 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:07:24" (1/1) ... [2025-03-16 15:07:24,888 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:07:24" (1/1) ... [2025-03-16 15:07:24,998 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-03-16 15:07:24,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:07:24,999 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:07:24,999 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:07:24,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:07:25,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:24" (1/1) ... [2025-03-16 15:07:25,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:24" (1/1) ... [2025-03-16 15:07:25,030 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:24" (1/1) ... [2025-03-16 15:07:25,122 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:07:25,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:24" (1/1) ... [2025-03-16 15:07:25,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:24" (1/1) ... [2025-03-16 15:07:25,179 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:24" (1/1) ... [2025-03-16 15:07:25,188 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:24" (1/1) ... [2025-03-16 15:07:25,202 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:24" (1/1) ... [2025-03-16 15:07:25,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:24" (1/1) ... [2025-03-16 15:07:25,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:07:25,236 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:07:25,237 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:07:25,237 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:07:25,237 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:24" (1/1) ... [2025-03-16 15:07:25,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:07:25,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:25,262 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:07:25,267 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:07:25,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:07:25,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:07:25,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:07:25,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:07:25,340 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:07:25,342 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:07:27,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-03-16 15:07:27,311 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-03-16 15:07:27,311 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:07:27,331 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:07:27,332 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:07:27,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:07:27 BoogieIcfgContainer [2025-03-16 15:07:27,332 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:07:27,334 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:07:27,334 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:07:27,337 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:07:27,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:07:24" (1/3) ... [2025-03-16 15:07:27,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@635afc1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:07:27, skipping insertion in model container [2025-03-16 15:07:27,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:24" (2/3) ... [2025-03-16 15:07:27,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@635afc1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:07:27, skipping insertion in model container [2025-03-16 15:07:27,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:07:27" (3/3) ... [2025-03-16 15:07:27,341 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label00.c [2025-03-16 15:07:27,351 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:07:27,353 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label00.c that has 1 procedures, 363 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:07:27,406 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:07:27,417 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;@4885191d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:07:27,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:07:27,421 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:07:27,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-16 15:07:27,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:27,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-16 15:07:27,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:27,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:27,431 INFO L85 PathProgramCache]: Analyzing trace with hash 916070047, now seen corresponding path program 1 times [2025-03-16 15:07:27,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:27,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272968630] [2025-03-16 15:07:27,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:27,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:27,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-16 15:07:27,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-16 15:07:27,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:27,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:27,576 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:07:27,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:27,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272968630] [2025-03-16 15:07:27,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272968630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:27,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:27,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:07:27,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457720078] [2025-03-16 15:07:27,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:27,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:27,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:27,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:27,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:27,600 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 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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:07:29,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:29,264 INFO L93 Difference]: Finished difference Result 1032 states and 1981 transitions. [2025-03-16 15:07:29,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:29,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2025-03-16 15:07:29,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:29,276 INFO L225 Difference]: With dead ends: 1032 [2025-03-16 15:07:29,276 INFO L226 Difference]: Without dead ends: 664 [2025-03-16 15:07:29,280 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:07:29,281 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 314 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 325 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.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:29,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 325 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:07:29,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-03-16 15:07:29,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 662. [2025-03-16 15:07:29,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.4826021180030258) internal successors, (980), 661 states have internal predecessors, (980), 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:07:29,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 980 transitions. [2025-03-16 15:07:29,327 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 980 transitions. Word has length 5 [2025-03-16 15:07:29,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:29,327 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 980 transitions. [2025-03-16 15:07:29,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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:07:29,327 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 980 transitions. [2025-03-16 15:07:29,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 15:07:29,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:29,328 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:07:29,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:07:29,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:29,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:29,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1051496387, now seen corresponding path program 1 times [2025-03-16 15:07:29,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:29,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920272413] [2025-03-16 15:07:29,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:29,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:29,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 15:07:29,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 15:07:29,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:29,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:29,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:29,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920272413] [2025-03-16 15:07:29,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920272413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:29,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:29,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:07:29,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393551349] [2025-03-16 15:07:29,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:29,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:29,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:29,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:29,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:29,682 INFO L87 Difference]: Start difference. First operand 662 states and 980 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 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:07:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:30,610 INFO L93 Difference]: Finished difference Result 1623 states and 2314 transitions. [2025-03-16 15:07:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:30,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 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 70 [2025-03-16 15:07:30,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:30,614 INFO L225 Difference]: With dead ends: 1623 [2025-03-16 15:07:30,614 INFO L226 Difference]: Without dead ends: 962 [2025-03-16 15:07:30,615 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:07:30,615 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:30,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 336 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:07:30,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2025-03-16 15:07:30,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2025-03-16 15:07:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 1.3631633714880333) internal successors, (1310), 961 states have internal predecessors, (1310), 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:07:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1310 transitions. [2025-03-16 15:07:30,651 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1310 transitions. Word has length 70 [2025-03-16 15:07:30,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:30,651 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1310 transitions. [2025-03-16 15:07:30,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 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:07:30,652 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1310 transitions. [2025-03-16 15:07:30,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 15:07:30,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:30,653 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:07:30,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:07:30,653 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:30,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:30,656 INFO L85 PathProgramCache]: Analyzing trace with hash 380884854, now seen corresponding path program 1 times [2025-03-16 15:07:30,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:30,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804946925] [2025-03-16 15:07:30,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:30,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:30,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 15:07:30,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 15:07:30,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:30,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:30,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:30,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804946925] [2025-03-16 15:07:30,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804946925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:30,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:30,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:07:30,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598634781] [2025-03-16 15:07:30,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:30,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:07:30,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:30,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:07:30,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:07:30,917 INFO L87 Difference]: Start difference. First operand 962 states and 1310 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 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:07:32,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:32,403 INFO L93 Difference]: Finished difference Result 2239 states and 3196 transitions. [2025-03-16 15:07:32,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:32,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 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 75 [2025-03-16 15:07:32,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:32,408 INFO L225 Difference]: With dead ends: 2239 [2025-03-16 15:07:32,409 INFO L226 Difference]: Without dead ends: 1577 [2025-03-16 15:07:32,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:07:32,410 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 358 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 2134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:32,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 364 Invalid, 2134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 1693 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:07:32,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2025-03-16 15:07:32,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1265. [2025-03-16 15:07:32,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.3053797468354431) internal successors, (1650), 1264 states have internal predecessors, (1650), 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:07:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1650 transitions. [2025-03-16 15:07:32,430 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1650 transitions. Word has length 75 [2025-03-16 15:07:32,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:32,430 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1650 transitions. [2025-03-16 15:07:32,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 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:07:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1650 transitions. [2025-03-16 15:07:32,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 15:07:32,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:32,432 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:07:32,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:07:32,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:32,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:32,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1798398566, now seen corresponding path program 1 times [2025-03-16 15:07:32,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:32,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914746421] [2025-03-16 15:07:32,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:32,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:32,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 15:07:32,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 15:07:32,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:32,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:32,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:32,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:32,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914746421] [2025-03-16 15:07:32,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914746421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:32,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:32,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:32,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792554368] [2025-03-16 15:07:32,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:32,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:32,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:32,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:32,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:32,596 INFO L87 Difference]: Start difference. First operand 1265 states and 1650 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 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:07:34,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:34,691 INFO L93 Difference]: Finished difference Result 4669 states and 6173 transitions. [2025-03-16 15:07:34,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:34,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2025-03-16 15:07:34,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:34,701 INFO L225 Difference]: With dead ends: 4669 [2025-03-16 15:07:34,701 INFO L226 Difference]: Without dead ends: 3405 [2025-03-16 15:07:34,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:07:34,703 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 560 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 2238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:34,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 343 Invalid, 2238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 15:07:34,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2025-03-16 15:07:34,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 3380. [2025-03-16 15:07:34,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3380 states, 3379 states have (on average 1.237348327907665) internal successors, (4181), 3379 states have internal predecessors, (4181), 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:07:34,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 4181 transitions. [2025-03-16 15:07:34,747 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 4181 transitions. Word has length 96 [2025-03-16 15:07:34,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:34,747 INFO L471 AbstractCegarLoop]: Abstraction has 3380 states and 4181 transitions. [2025-03-16 15:07:34,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 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:07:34,748 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 4181 transitions. [2025-03-16 15:07:34,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 15:07:34,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:34,752 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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:07:34,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:07:34,753 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:34,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:34,753 INFO L85 PathProgramCache]: Analyzing trace with hash 804989085, now seen corresponding path program 1 times [2025-03-16 15:07:34,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:34,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660902395] [2025-03-16 15:07:34,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:34,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:34,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 15:07:34,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 15:07:34,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:34,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:34,906 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-16 15:07:34,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:34,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660902395] [2025-03-16 15:07:34,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660902395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:34,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:34,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:07:34,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988647528] [2025-03-16 15:07:34,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:34,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:34,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:34,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:34,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:34,909 INFO L87 Difference]: Start difference. First operand 3380 states and 4181 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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:07:36,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:36,044 INFO L93 Difference]: Finished difference Result 8562 states and 10759 transitions. [2025-03-16 15:07:36,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:36,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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 162 [2025-03-16 15:07:36,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:36,058 INFO L225 Difference]: With dead ends: 8562 [2025-03-16 15:07:36,058 INFO L226 Difference]: Without dead ends: 5482 [2025-03-16 15:07:36,063 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:07:36,064 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:36,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 337 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:07:36,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5482 states. [2025-03-16 15:07:36,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5482 to 5477. [2025-03-16 15:07:36,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5477 states, 5476 states have (on average 1.1694667640613587) internal successors, (6404), 5476 states have internal predecessors, (6404), 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:07:36,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5477 states to 5477 states and 6404 transitions. [2025-03-16 15:07:36,146 INFO L78 Accepts]: Start accepts. Automaton has 5477 states and 6404 transitions. Word has length 162 [2025-03-16 15:07:36,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:36,147 INFO L471 AbstractCegarLoop]: Abstraction has 5477 states and 6404 transitions. [2025-03-16 15:07:36,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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:07:36,147 INFO L276 IsEmpty]: Start isEmpty. Operand 5477 states and 6404 transitions. [2025-03-16 15:07:36,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-16 15:07:36,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:36,152 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:07:36,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:07:36,153 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:36,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:36,153 INFO L85 PathProgramCache]: Analyzing trace with hash 123542104, now seen corresponding path program 1 times [2025-03-16 15:07:36,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:36,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372508532] [2025-03-16 15:07:36,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:36,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:36,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-16 15:07:36,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-16 15:07:36,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:36,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:36,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:36,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372508532] [2025-03-16 15:07:36,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372508532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:36,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:36,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:07:36,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066378373] [2025-03-16 15:07:36,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:36,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:36,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:36,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:36,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:36,455 INFO L87 Difference]: Start difference. First operand 5477 states and 6404 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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:07:37,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:37,406 INFO L93 Difference]: Finished difference Result 10654 states and 12496 transitions. [2025-03-16 15:07:37,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:37,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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 163 [2025-03-16 15:07:37,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:37,419 INFO L225 Difference]: With dead ends: 10654 [2025-03-16 15:07:37,419 INFO L226 Difference]: Without dead ends: 5477 [2025-03-16 15:07:37,424 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:07:37,425 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 143 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 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:07:37,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 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:07:37,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5477 states. [2025-03-16 15:07:37,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5477 to 5477. [2025-03-16 15:07:37,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5477 states, 5476 states have (on average 1.1683710737764792) internal successors, (6398), 5476 states have internal predecessors, (6398), 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:07:37,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5477 states to 5477 states and 6398 transitions. [2025-03-16 15:07:37,492 INFO L78 Accepts]: Start accepts. Automaton has 5477 states and 6398 transitions. Word has length 163 [2025-03-16 15:07:37,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:37,492 INFO L471 AbstractCegarLoop]: Abstraction has 5477 states and 6398 transitions. [2025-03-16 15:07:37,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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:07:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand 5477 states and 6398 transitions. [2025-03-16 15:07:37,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-16 15:07:37,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:37,494 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:07:37,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:07:37,495 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:37,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:37,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1046957065, now seen corresponding path program 1 times [2025-03-16 15:07:37,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:37,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971917065] [2025-03-16 15:07:37,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:37,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:37,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-16 15:07:37,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-16 15:07:37,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:37,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:37,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:37,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:37,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971917065] [2025-03-16 15:07:37,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971917065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:37,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:37,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:37,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691347538] [2025-03-16 15:07:37,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:37,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:37,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:37,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:37,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:37,638 INFO L87 Difference]: Start difference. First operand 5477 states and 6398 transitions. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 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:07:39,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:39,769 INFO L93 Difference]: Finished difference Result 12183 states and 14318 transitions. [2025-03-16 15:07:39,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:39,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 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 181 [2025-03-16 15:07:39,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:39,785 INFO L225 Difference]: With dead ends: 12183 [2025-03-16 15:07:39,785 INFO L226 Difference]: Without dead ends: 7006 [2025-03-16 15:07:39,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:07:39,791 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 478 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1965 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 2172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:39,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 351 Invalid, 2172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1965 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 15:07:39,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7006 states. [2025-03-16 15:07:39,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7006 to 5785. [2025-03-16 15:07:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5785 states, 5784 states have (on average 1.1799792531120332) internal successors, (6825), 5784 states have internal predecessors, (6825), 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:07:39,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5785 states to 5785 states and 6825 transitions. [2025-03-16 15:07:39,866 INFO L78 Accepts]: Start accepts. Automaton has 5785 states and 6825 transitions. Word has length 181 [2025-03-16 15:07:39,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:39,867 INFO L471 AbstractCegarLoop]: Abstraction has 5785 states and 6825 transitions. [2025-03-16 15:07:39,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 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:07:39,867 INFO L276 IsEmpty]: Start isEmpty. Operand 5785 states and 6825 transitions. [2025-03-16 15:07:39,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-16 15:07:39,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:39,869 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:39,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:07:39,870 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:39,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:39,870 INFO L85 PathProgramCache]: Analyzing trace with hash 750122414, now seen corresponding path program 1 times [2025-03-16 15:07:39,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:39,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986659892] [2025-03-16 15:07:39,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:39,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:39,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-16 15:07:39,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-16 15:07:39,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:39,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:40,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:40,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:40,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986659892] [2025-03-16 15:07:40,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986659892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:40,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:40,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:40,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370173299] [2025-03-16 15:07:40,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:40,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:40,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:40,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:40,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:40,136 INFO L87 Difference]: Start difference. First operand 5785 states and 6825 transitions. Second operand has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 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:07:42,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:42,049 INFO L93 Difference]: Finished difference Result 13093 states and 15498 transitions. [2025-03-16 15:07:42,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:42,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 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 238 [2025-03-16 15:07:42,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:42,069 INFO L225 Difference]: With dead ends: 13093 [2025-03-16 15:07:42,069 INFO L226 Difference]: Without dead ends: 7608 [2025-03-16 15:07:42,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:07:42,075 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 419 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 2403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:42,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 388 Invalid, 2403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:07:42,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7608 states. [2025-03-16 15:07:42,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7608 to 6085. [2025-03-16 15:07:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6085 states, 6084 states have (on average 1.1750493096646943) internal successors, (7149), 6084 states have internal predecessors, (7149), 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:07:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6085 states to 6085 states and 7149 transitions. [2025-03-16 15:07:42,151 INFO L78 Accepts]: Start accepts. Automaton has 6085 states and 7149 transitions. Word has length 238 [2025-03-16 15:07:42,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:42,151 INFO L471 AbstractCegarLoop]: Abstraction has 6085 states and 7149 transitions. [2025-03-16 15:07:42,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 3 states have internal predecessors, (238), 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:07:42,156 INFO L276 IsEmpty]: Start isEmpty. Operand 6085 states and 7149 transitions. [2025-03-16 15:07:42,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-16 15:07:42,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:42,158 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:42,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:07:42,159 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:42,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:42,159 INFO L85 PathProgramCache]: Analyzing trace with hash 388100013, now seen corresponding path program 1 times [2025-03-16 15:07:42,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:42,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470146805] [2025-03-16 15:07:42,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:42,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:42,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-16 15:07:42,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-16 15:07:42,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:42,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:42,340 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-16 15:07:42,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:42,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470146805] [2025-03-16 15:07:42,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470146805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:42,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:42,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:42,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498632485] [2025-03-16 15:07:42,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:42,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:42,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:42,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:42,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:42,342 INFO L87 Difference]: Start difference. First operand 6085 states and 7149 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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:07:43,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:43,726 INFO L93 Difference]: Finished difference Result 14272 states and 17119 transitions. [2025-03-16 15:07:43,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:43,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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 292 [2025-03-16 15:07:43,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:43,739 INFO L225 Difference]: With dead ends: 14272 [2025-03-16 15:07:43,739 INFO L226 Difference]: Without dead ends: 8487 [2025-03-16 15:07:43,744 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:07:43,745 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 310 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:43,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 669 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:07:43,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8487 states. [2025-03-16 15:07:43,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8487 to 8483. [2025-03-16 15:07:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8483 states, 8482 states have (on average 1.1478424899787787) internal successors, (9736), 8482 states have internal predecessors, (9736), 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:07:43,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8483 states to 8483 states and 9736 transitions. [2025-03-16 15:07:43,810 INFO L78 Accepts]: Start accepts. Automaton has 8483 states and 9736 transitions. Word has length 292 [2025-03-16 15:07:43,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:43,810 INFO L471 AbstractCegarLoop]: Abstraction has 8483 states and 9736 transitions. [2025-03-16 15:07:43,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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:07:43,811 INFO L276 IsEmpty]: Start isEmpty. Operand 8483 states and 9736 transitions. [2025-03-16 15:07:43,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-16 15:07:43,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:43,813 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:43,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:07:43,814 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:43,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:43,815 INFO L85 PathProgramCache]: Analyzing trace with hash 566659374, now seen corresponding path program 1 times [2025-03-16 15:07:43,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:43,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16316705] [2025-03-16 15:07:43,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:43,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:43,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-16 15:07:43,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-16 15:07:43,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:43,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:44,038 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-16 15:07:44,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:44,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16316705] [2025-03-16 15:07:44,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16316705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:44,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:44,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:44,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199189343] [2025-03-16 15:07:44,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:44,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:44,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:44,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:44,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:44,040 INFO L87 Difference]: Start difference. First operand 8483 states and 9736 transitions. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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:07:45,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:45,401 INFO L93 Difference]: Finished difference Result 19662 states and 22940 transitions. [2025-03-16 15:07:45,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:45,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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 351 [2025-03-16 15:07:45,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:45,418 INFO L225 Difference]: With dead ends: 19662 [2025-03-16 15:07:45,418 INFO L226 Difference]: Without dead ends: 11479 [2025-03-16 15:07:45,424 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:07:45,425 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 321 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:45,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 632 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:07:45,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11479 states. [2025-03-16 15:07:45,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11479 to 10582. [2025-03-16 15:07:45,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10582 states, 10581 states have (on average 1.1332577261128438) internal successors, (11991), 10581 states have internal predecessors, (11991), 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:07:45,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10582 states to 10582 states and 11991 transitions. [2025-03-16 15:07:45,522 INFO L78 Accepts]: Start accepts. Automaton has 10582 states and 11991 transitions. Word has length 351 [2025-03-16 15:07:45,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:45,523 INFO L471 AbstractCegarLoop]: Abstraction has 10582 states and 11991 transitions. [2025-03-16 15:07:45,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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:07:45,523 INFO L276 IsEmpty]: Start isEmpty. Operand 10582 states and 11991 transitions. [2025-03-16 15:07:45,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-03-16 15:07:45,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:45,527 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:45,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:07:45,527 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:45,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:45,528 INFO L85 PathProgramCache]: Analyzing trace with hash -281331266, now seen corresponding path program 1 times [2025-03-16 15:07:45,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:45,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175385014] [2025-03-16 15:07:45,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:45,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:45,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-03-16 15:07:45,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-03-16 15:07:45,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:45,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:46,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:46,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175385014] [2025-03-16 15:07:46,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175385014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:46,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123622694] [2025-03-16 15:07:46,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:46,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:46,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:46,090 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:07:46,091 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:07:46,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-03-16 15:07:46,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-03-16 15:07:46,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:46,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:46,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 15:07:46,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:46,691 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:46,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:07:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:49,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123622694] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:49,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:07:49,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 9 [2025-03-16 15:07:49,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593452804] [2025-03-16 15:07:49,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:49,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:07:49,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:49,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:07:49,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:07:49,595 INFO L87 Difference]: Start difference. First operand 10582 states and 11991 transitions. Second operand has 5 states, 5 states have (on average 70.4) internal successors, (352), 4 states have internal predecessors, (352), 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:07:53,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:53,512 INFO L93 Difference]: Finished difference Result 26293 states and 30186 transitions. [2025-03-16 15:07:53,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:07:53,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.4) internal successors, (352), 4 states have internal predecessors, (352), 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 352 [2025-03-16 15:07:53,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:53,534 INFO L225 Difference]: With dead ends: 26293 [2025-03-16 15:07:53,534 INFO L226 Difference]: Without dead ends: 16011 [2025-03-16 15:07:53,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 698 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:07:53,542 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 685 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 2214 mSolverCounterSat, 1035 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 3249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1035 IncrementalHoareTripleChecker+Valid, 2214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:53,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 114 Invalid, 3249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1035 Valid, 2214 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-16 15:07:53,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16011 states. [2025-03-16 15:07:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16011 to 11483. [2025-03-16 15:07:53,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11483 states, 11482 states have (on average 1.1698310398885212) internal successors, (13432), 11482 states have internal predecessors, (13432), 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:07:53,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11483 states to 11483 states and 13432 transitions. [2025-03-16 15:07:53,652 INFO L78 Accepts]: Start accepts. Automaton has 11483 states and 13432 transitions. Word has length 352 [2025-03-16 15:07:53,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:53,652 INFO L471 AbstractCegarLoop]: Abstraction has 11483 states and 13432 transitions. [2025-03-16 15:07:53,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.4) internal successors, (352), 4 states have internal predecessors, (352), 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:07:53,652 INFO L276 IsEmpty]: Start isEmpty. Operand 11483 states and 13432 transitions. [2025-03-16 15:07:53,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-03-16 15:07:53,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:53,656 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:53,664 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:07:53,861 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,SelfDestructingSolverStorable10 [2025-03-16 15:07:53,862 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:53,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:53,862 INFO L85 PathProgramCache]: Analyzing trace with hash 899331729, now seen corresponding path program 1 times [2025-03-16 15:07:53,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:53,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970191295] [2025-03-16 15:07:53,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:53,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:53,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-03-16 15:07:53,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-03-16 15:07:53,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:53,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:54,056 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:54,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:54,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970191295] [2025-03-16 15:07:54,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970191295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:54,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:54,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:54,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490283763] [2025-03-16 15:07:54,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:54,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:54,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:54,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:54,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:54,057 INFO L87 Difference]: Start difference. First operand 11483 states and 13432 transitions. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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:07:55,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:55,127 INFO L93 Difference]: Finished difference Result 25665 states and 30680 transitions. [2025-03-16 15:07:55,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:55,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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 368 [2025-03-16 15:07:55,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:55,147 INFO L225 Difference]: With dead ends: 25665 [2025-03-16 15:07:55,147 INFO L226 Difference]: Without dead ends: 14482 [2025-03-16 15:07:55,157 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:07:55,157 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 246 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:55,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 622 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:07:55,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14482 states. [2025-03-16 15:07:55,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14482 to 13577. [2025-03-16 15:07:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13577 states, 13576 states have (on average 1.1612404242781378) internal successors, (15765), 13576 states have internal predecessors, (15765), 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:07:55,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13577 states to 13577 states and 15765 transitions. [2025-03-16 15:07:55,358 INFO L78 Accepts]: Start accepts. Automaton has 13577 states and 15765 transitions. Word has length 368 [2025-03-16 15:07:55,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:55,359 INFO L471 AbstractCegarLoop]: Abstraction has 13577 states and 15765 transitions. [2025-03-16 15:07:55,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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:07:55,360 INFO L276 IsEmpty]: Start isEmpty. Operand 13577 states and 15765 transitions. [2025-03-16 15:07:55,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-03-16 15:07:55,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:55,362 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-16 15:07:55,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:07:55,362 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:55,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:55,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1956846419, now seen corresponding path program 1 times [2025-03-16 15:07:55,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:55,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397148572] [2025-03-16 15:07:55,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:55,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:55,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-16 15:07:55,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-16 15:07:55,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:55,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:55,523 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-16 15:07:55,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:55,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397148572] [2025-03-16 15:07:55,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397148572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:55,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:55,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:55,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626735076] [2025-03-16 15:07:55,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:55,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:55,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:55,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:55,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:55,525 INFO L87 Difference]: Start difference. First operand 13577 states and 15765 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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:07:56,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:56,815 INFO L93 Difference]: Finished difference Result 34646 states and 40387 transitions. [2025-03-16 15:07:56,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:56,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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 414 [2025-03-16 15:07:56,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:56,842 INFO L225 Difference]: With dead ends: 34646 [2025-03-16 15:07:56,842 INFO L226 Difference]: Without dead ends: 21369 [2025-03-16 15:07:56,854 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:07:56,855 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 321 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:56,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 622 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:07:56,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21369 states. [2025-03-16 15:07:57,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21369 to 21055. [2025-03-16 15:07:57,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21055 states, 21054 states have (on average 1.1328963617364871) internal successors, (23852), 21054 states have internal predecessors, (23852), 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:07:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21055 states to 21055 states and 23852 transitions. [2025-03-16 15:07:57,042 INFO L78 Accepts]: Start accepts. Automaton has 21055 states and 23852 transitions. Word has length 414 [2025-03-16 15:07:57,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:57,043 INFO L471 AbstractCegarLoop]: Abstraction has 21055 states and 23852 transitions. [2025-03-16 15:07:57,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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:07:57,043 INFO L276 IsEmpty]: Start isEmpty. Operand 21055 states and 23852 transitions. [2025-03-16 15:07:57,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-16 15:07:57,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:57,046 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:07:57,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:07:57,046 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:57,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:57,047 INFO L85 PathProgramCache]: Analyzing trace with hash 298418553, now seen corresponding path program 1 times [2025-03-16 15:07:57,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:57,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906552694] [2025-03-16 15:07:57,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:57,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:57,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-16 15:07:57,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-16 15:07:57,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:57,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:57,650 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 4 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:57,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:57,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906552694] [2025-03-16 15:07:57,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906552694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:57,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284571500] [2025-03-16 15:07:57,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:57,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:57,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:57,652 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:07:57,653 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:07:57,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-16 15:07:57,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-16 15:07:57,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:57,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:57,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:07:57,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 106 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 15:07:58,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:08:00,511 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 106 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 15:08:00,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284571500] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:08:00,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:08:00,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2025-03-16 15:08:00,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131723187] [2025-03-16 15:08:00,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:08:00,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 15:08:00,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:00,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 15:08:00,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:08:00,513 INFO L87 Difference]: Start difference. First operand 21055 states and 23852 transitions. Second operand has 9 states, 9 states have (on average 113.55555555555556) internal successors, (1022), 8 states have internal predecessors, (1022), 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:08:07,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:07,608 INFO L93 Difference]: Finished difference Result 78435 states and 88597 transitions. [2025-03-16 15:08:07,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-16 15:08:07,610 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 113.55555555555556) internal successors, (1022), 8 states have internal predecessors, (1022), 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 459 [2025-03-16 15:08:07,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:07,673 INFO L225 Difference]: With dead ends: 78435 [2025-03-16 15:08:07,674 INFO L226 Difference]: Without dead ends: 57680 [2025-03-16 15:08:07,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 935 GetRequests, 914 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2025-03-16 15:08:07,695 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 4952 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 6647 mSolverCounterSat, 3079 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4952 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 9726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3079 IncrementalHoareTripleChecker+Valid, 6647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:07,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4952 Valid, 270 Invalid, 9726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3079 Valid, 6647 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2025-03-16 15:08:07,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57680 states. [2025-03-16 15:08:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57680 to 42312. [2025-03-16 15:08:08,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42312 states, 42311 states have (on average 1.1370565573964218) internal successors, (48110), 42311 states have internal predecessors, (48110), 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:08:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42312 states to 42312 states and 48110 transitions. [2025-03-16 15:08:08,202 INFO L78 Accepts]: Start accepts. Automaton has 42312 states and 48110 transitions. Word has length 459 [2025-03-16 15:08:08,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:08,202 INFO L471 AbstractCegarLoop]: Abstraction has 42312 states and 48110 transitions. [2025-03-16 15:08:08,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.55555555555556) internal successors, (1022), 8 states have internal predecessors, (1022), 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:08:08,202 INFO L276 IsEmpty]: Start isEmpty. Operand 42312 states and 48110 transitions. [2025-03-16 15:08:08,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-16 15:08:08,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:08,205 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:08:08,212 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:08:08,405 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,SelfDestructingSolverStorable13 [2025-03-16 15:08:08,406 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:08,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:08,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1138499191, now seen corresponding path program 1 times [2025-03-16 15:08:08,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:08,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094173227] [2025-03-16 15:08:08,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:08,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:08,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-16 15:08:08,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-16 15:08:08,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:08,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:09,002 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 11 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:08:09,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:09,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094173227] [2025-03-16 15:08:09,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094173227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:08:09,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220090279] [2025-03-16 15:08:09,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:09,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:09,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:08:09,005 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:08:09,007 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:08:09,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-16 15:08:09,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-16 15:08:09,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:09,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:09,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 15:08:09,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:08:09,594 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 4 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:08:09,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:08:10,263 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:08:10,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220090279] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:08:10,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:08:10,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 12 [2025-03-16 15:08:10,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790394958] [2025-03-16 15:08:10,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:10,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 15:08:10,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:10,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 15:08:10,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=84, Unknown=0, NotChecked=0, Total=156 [2025-03-16 15:08:10,265 INFO L87 Difference]: Start difference. First operand 42312 states and 48110 transitions. Second operand has 6 states, 6 states have (on average 78.5) internal successors, (471), 5 states have internal predecessors, (471), 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:08:13,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:13,526 INFO L93 Difference]: Finished difference Result 111018 states and 125521 transitions. [2025-03-16 15:08:13,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 15:08:13,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 78.5) internal successors, (471), 5 states have internal predecessors, (471), 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 471 [2025-03-16 15:08:13,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:13,597 INFO L225 Difference]: With dead ends: 111018 [2025-03-16 15:08:13,598 INFO L226 Difference]: Without dead ends: 69006 [2025-03-16 15:08:13,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 945 GetRequests, 933 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=84, Unknown=0, NotChecked=0, Total=156 [2025-03-16 15:08:13,689 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 936 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 1095 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 3615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1095 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:13,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 117 Invalid, 3615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1095 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-16 15:08:13,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69006 states. [2025-03-16 15:08:14,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69006 to 45906. [2025-03-16 15:08:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45906 states, 45905 states have (on average 1.1372181679555604) internal successors, (52204), 45905 states have internal predecessors, (52204), 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:08:14,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45906 states to 45906 states and 52204 transitions. [2025-03-16 15:08:14,204 INFO L78 Accepts]: Start accepts. Automaton has 45906 states and 52204 transitions. Word has length 471 [2025-03-16 15:08:14,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:14,205 INFO L471 AbstractCegarLoop]: Abstraction has 45906 states and 52204 transitions. [2025-03-16 15:08:14,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.5) internal successors, (471), 5 states have internal predecessors, (471), 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:08:14,205 INFO L276 IsEmpty]: Start isEmpty. Operand 45906 states and 52204 transitions. [2025-03-16 15:08:14,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-03-16 15:08:14,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:14,208 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:14,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 15:08:14,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:14,408 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:14,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:14,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1874498125, now seen corresponding path program 1 times [2025-03-16 15:08:14,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:14,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398375801] [2025-03-16 15:08:14,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:14,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:14,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-03-16 15:08:14,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-03-16 15:08:14,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:14,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:15,047 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 12 proven. 227 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-16 15:08:15,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:15,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398375801] [2025-03-16 15:08:15,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398375801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:08:15,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805288178] [2025-03-16 15:08:15,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:15,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:15,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:08:15,050 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:08:15,054 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:08:15,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-03-16 15:08:15,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-03-16 15:08:15,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:15,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:15,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:08:15,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:08:15,176 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-03-16 15:08:15,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:08:15,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805288178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:15,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:08:15,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 15:08:15,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708086470] [2025-03-16 15:08:15,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:15,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:15,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:15,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:15,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:08:15,178 INFO L87 Difference]: Start difference. First operand 45906 states and 52204 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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:08:16,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:16,452 INFO L93 Difference]: Finished difference Result 97489 states and 111072 transitions. [2025-03-16 15:08:16,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:16,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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 489 [2025-03-16 15:08:16,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:16,516 INFO L225 Difference]: With dead ends: 97489 [2025-03-16 15:08:16,516 INFO L226 Difference]: Without dead ends: 51883 [2025-03-16 15:08:16,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:08:16,543 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 410 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:16,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 442 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:08:16,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51883 states. [2025-03-16 15:08:17,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51883 to 43505. [2025-03-16 15:08:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43505 states, 43504 states have (on average 1.1234599117322546) internal successors, (48875), 43504 states have internal predecessors, (48875), 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:08:17,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43505 states to 43505 states and 48875 transitions. [2025-03-16 15:08:17,139 INFO L78 Accepts]: Start accepts. Automaton has 43505 states and 48875 transitions. Word has length 489 [2025-03-16 15:08:17,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:17,139 INFO L471 AbstractCegarLoop]: Abstraction has 43505 states and 48875 transitions. [2025-03-16 15:08:17,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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:08:17,140 INFO L276 IsEmpty]: Start isEmpty. Operand 43505 states and 48875 transitions. [2025-03-16 15:08:17,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-03-16 15:08:17,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:17,146 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:17,152 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:08:17,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 15:08:17,347 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:17,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:17,347 INFO L85 PathProgramCache]: Analyzing trace with hash -600084672, now seen corresponding path program 1 times [2025-03-16 15:08:17,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:17,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868051729] [2025-03-16 15:08:17,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:17,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:17,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-03-16 15:08:17,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-03-16 15:08:17,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:17,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:17,883 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 564 proven. 39 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-16 15:08:17,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:17,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868051729] [2025-03-16 15:08:17,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868051729] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:08:17,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270795100] [2025-03-16 15:08:17,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:17,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:17,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:08:17,885 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:08:17,887 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:08:17,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-03-16 15:08:18,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-03-16 15:08:18,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:18,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:18,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:08:18,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:08:18,209 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-03-16 15:08:18,210 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:08:18,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270795100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:18,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:08:18,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:08:18,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215599424] [2025-03-16 15:08:18,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:18,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:18,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:18,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:18,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:08:18,211 INFO L87 Difference]: Start difference. First operand 43505 states and 48875 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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:08:19,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:19,379 INFO L93 Difference]: Finished difference Result 96872 states and 109170 transitions. [2025-03-16 15:08:19,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:19,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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 563 [2025-03-16 15:08:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:19,435 INFO L225 Difference]: With dead ends: 96872 [2025-03-16 15:08:19,435 INFO L226 Difference]: Without dead ends: 53667 [2025-03-16 15:08:19,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 562 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:08:19,464 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 267 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:19,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 249 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:08:19,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53667 states. [2025-03-16 15:08:19,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53667 to 46787. [2025-03-16 15:08:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46787 states, 46786 states have (on average 1.1196939255332792) internal successors, (52386), 46786 states have internal predecessors, (52386), 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:08:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46787 states to 46787 states and 52386 transitions. [2025-03-16 15:08:19,999 INFO L78 Accepts]: Start accepts. Automaton has 46787 states and 52386 transitions. Word has length 563 [2025-03-16 15:08:20,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:20,000 INFO L471 AbstractCegarLoop]: Abstraction has 46787 states and 52386 transitions. [2025-03-16 15:08:20,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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:08:20,000 INFO L276 IsEmpty]: Start isEmpty. Operand 46787 states and 52386 transitions. [2025-03-16 15:08:20,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-03-16 15:08:20,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:20,005 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1] [2025-03-16 15:08:20,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 15:08:20,205 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,SelfDestructingSolverStorable16 [2025-03-16 15:08:20,206 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:20,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:20,206 INFO L85 PathProgramCache]: Analyzing trace with hash -213713847, now seen corresponding path program 1 times [2025-03-16 15:08:20,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:20,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194886021] [2025-03-16 15:08:20,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:20,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:20,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-03-16 15:08:20,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-03-16 15:08:20,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:20,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:20,541 INFO L134 CoverageAnalysis]: Checked inductivity of 854 backedges. 574 proven. 39 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-03-16 15:08:20,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:20,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194886021] [2025-03-16 15:08:20,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194886021] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:08:20,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839647084] [2025-03-16 15:08:20,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:20,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:20,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:08:20,544 INFO L229 MonitoredProcess]: Starting monitored process 7 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:08:20,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 15:08:20,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-03-16 15:08:20,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-03-16 15:08:20,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:20,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:20,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:08:20,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:08:20,763 INFO L134 CoverageAnalysis]: Checked inductivity of 854 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2025-03-16 15:08:20,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:08:20,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839647084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:20,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:08:20,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:08:20,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943156990] [2025-03-16 15:08:20,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:20,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:20,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:20,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:20,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:08:20,764 INFO L87 Difference]: Start difference. First operand 46787 states and 52386 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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:08:21,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:21,876 INFO L93 Difference]: Finished difference Result 91773 states and 102803 transitions. [2025-03-16 15:08:21,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:21,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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 568 [2025-03-16 15:08:21,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:21,919 INFO L225 Difference]: With dead ends: 91773 [2025-03-16 15:08:21,920 INFO L226 Difference]: Without dead ends: 45286 [2025-03-16 15:08:21,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 567 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:08:21,947 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 325 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:21,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 599 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:08:21,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45286 states. [2025-03-16 15:08:22,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45286 to 44089. [2025-03-16 15:08:22,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44089 states, 44088 states have (on average 1.0832879695155144) internal successors, (47760), 44088 states have internal predecessors, (47760), 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:08:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44089 states to 44089 states and 47760 transitions. [2025-03-16 15:08:22,318 INFO L78 Accepts]: Start accepts. Automaton has 44089 states and 47760 transitions. Word has length 568 [2025-03-16 15:08:22,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:22,318 INFO L471 AbstractCegarLoop]: Abstraction has 44089 states and 47760 transitions. [2025-03-16 15:08:22,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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:08:22,319 INFO L276 IsEmpty]: Start isEmpty. Operand 44089 states and 47760 transitions. [2025-03-16 15:08:22,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2025-03-16 15:08:22,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:22,323 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:08:22,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 15:08:22,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 15:08:22,523 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:22,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:22,524 INFO L85 PathProgramCache]: Analyzing trace with hash -982721056, now seen corresponding path program 1 times [2025-03-16 15:08:22,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:22,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121736830] [2025-03-16 15:08:22,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:22,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:22,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 578 statements into 1 equivalence classes. [2025-03-16 15:08:22,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 578 of 578 statements. [2025-03-16 15:08:22,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:22,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:23,015 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 461 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-16 15:08:23,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:23,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121736830] [2025-03-16 15:08:23,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121736830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:23,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:23,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:23,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233615525] [2025-03-16 15:08:23,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:23,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:23,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:23,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:23,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:23,017 INFO L87 Difference]: Start difference. First operand 44089 states and 47760 transitions. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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:08:24,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:24,334 INFO L93 Difference]: Finished difference Result 99539 states and 107691 transitions. [2025-03-16 15:08:24,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:24,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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:08:24,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:24,395 INFO L225 Difference]: With dead ends: 99539 [2025-03-16 15:08:24,395 INFO L226 Difference]: Without dead ends: 55750 [2025-03-16 15:08:24,423 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:08:24,424 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 270 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:24,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 245 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:08:24,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55750 states. [2025-03-16 15:08:24,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55750 to 49172. [2025-03-16 15:08:25,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49172 states, 49171 states have (on average 1.0783388582701185) internal successors, (53023), 49171 states have internal predecessors, (53023), 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:08:25,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49172 states to 49172 states and 53023 transitions. [2025-03-16 15:08:25,056 INFO L78 Accepts]: Start accepts. Automaton has 49172 states and 53023 transitions. Word has length 578 [2025-03-16 15:08:25,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:25,056 INFO L471 AbstractCegarLoop]: Abstraction has 49172 states and 53023 transitions. [2025-03-16 15:08:25,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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:08:25,056 INFO L276 IsEmpty]: Start isEmpty. Operand 49172 states and 53023 transitions. [2025-03-16 15:08:25,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2025-03-16 15:08:25,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:25,062 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:08:25,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:08:25,062 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:25,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:25,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1321282480, now seen corresponding path program 1 times [2025-03-16 15:08:25,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:25,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8858266] [2025-03-16 15:08:25,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:25,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:25,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes. [2025-03-16 15:08:25,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements. [2025-03-16 15:08:25,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:25,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1033 backedges. 665 proven. 39 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2025-03-16 15:08:25,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:25,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8858266] [2025-03-16 15:08:25,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8858266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:08:25,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451179342] [2025-03-16 15:08:25,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:25,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:25,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:08:25,416 INFO L229 MonitoredProcess]: Starting monitored process 8 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:08:25,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 15:08:25,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes. [2025-03-16 15:08:25,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements. [2025-03-16 15:08:25,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:25,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:25,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 15:08:25,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:08:26,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1033 backedges. 665 proven. 39 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2025-03-16 15:08:26,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:08:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1033 backedges. 665 proven. 39 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2025-03-16 15:08:26,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451179342] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:08:26,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:08:26,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-16 15:08:26,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970163629] [2025-03-16 15:08:26,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:08:26,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 15:08:26,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:26,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 15:08:26,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:08:26,430 INFO L87 Difference]: Start difference. First operand 49172 states and 53023 transitions. Second operand has 9 states, 9 states have (on average 77.88888888888889) internal successors, (701), 8 states have internal predecessors, (701), 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:08:30,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:30,315 INFO L93 Difference]: Finished difference Result 103434 states and 111204 transitions. [2025-03-16 15:08:30,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 15:08:30,316 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 77.88888888888889) internal successors, (701), 8 states have internal predecessors, (701), 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 633 [2025-03-16 15:08:30,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:30,357 INFO L225 Difference]: With dead ends: 103434 [2025-03-16 15:08:30,357 INFO L226 Difference]: Without dead ends: 41692 [2025-03-16 15:08:30,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1275 GetRequests, 1261 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-03-16 15:08:30,389 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 3109 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 5435 mSolverCounterSat, 629 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3109 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 6064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 629 IncrementalHoareTripleChecker+Valid, 5435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:30,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3109 Valid, 223 Invalid, 6064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [629 Valid, 5435 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-16 15:08:30,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41692 states. [2025-03-16 15:08:30,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41692 to 30905. [2025-03-16 15:08:30,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30905 states, 30904 states have (on average 1.0378591768055916) internal successors, (32074), 30904 states have internal predecessors, (32074), 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:08:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30905 states to 30905 states and 32074 transitions. [2025-03-16 15:08:30,822 INFO L78 Accepts]: Start accepts. Automaton has 30905 states and 32074 transitions. Word has length 633 [2025-03-16 15:08:30,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:30,822 INFO L471 AbstractCegarLoop]: Abstraction has 30905 states and 32074 transitions. [2025-03-16 15:08:30,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 77.88888888888889) internal successors, (701), 8 states have internal predecessors, (701), 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:08:30,823 INFO L276 IsEmpty]: Start isEmpty. Operand 30905 states and 32074 transitions. [2025-03-16 15:08:30,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2025-03-16 15:08:30,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:30,827 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:08:30,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 15:08:31,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:31,028 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:31,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:31,028 INFO L85 PathProgramCache]: Analyzing trace with hash -567705634, now seen corresponding path program 1 times [2025-03-16 15:08:31,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:31,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338139086] [2025-03-16 15:08:31,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:31,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:31,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 646 statements into 1 equivalence classes. [2025-03-16 15:08:31,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 646 of 646 statements. [2025-03-16 15:08:31,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:31,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:31,639 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 11 proven. 464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:08:31,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:31,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338139086] [2025-03-16 15:08:31,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338139086] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:08:31,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315312066] [2025-03-16 15:08:31,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:31,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:31,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:08:31,641 INFO L229 MonitoredProcess]: Starting monitored process 9 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:08:31,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 15:08:31,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 646 statements into 1 equivalence classes. [2025-03-16 15:08:31,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 646 of 646 statements. [2025-03-16 15:08:31,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:31,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:31,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 15:08:31,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:08:32,219 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 0 proven. 475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:08:32,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:08:34,661 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:08:34,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315312066] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:08:34,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:08:34,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 13 [2025-03-16 15:08:34,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609295504] [2025-03-16 15:08:34,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:34,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 15:08:34,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:34,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 15:08:34,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2025-03-16 15:08:34,663 INFO L87 Difference]: Start difference. First operand 30905 states and 32074 transitions. Second operand has 6 states, 6 states have (on average 107.66666666666667) internal successors, (646), 5 states have internal predecessors, (646), 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:08:37,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-03-16 15:08:39,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-03-16 15:08:40,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:40,230 INFO L93 Difference]: Finished difference Result 63927 states and 66328 transitions. [2025-03-16 15:08:40,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 15:08:40,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 107.66666666666667) internal successors, (646), 5 states have internal predecessors, (646), 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 646 [2025-03-16 15:08:40,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:40,263 INFO L225 Difference]: With dead ends: 63927 [2025-03-16 15:08:40,263 INFO L226 Difference]: Without dead ends: 33023 [2025-03-16 15:08:40,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1295 GetRequests, 1283 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2025-03-16 15:08:40,281 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 806 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 515 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 3017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:40,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 104 Invalid, 3017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 2500 Invalid, 2 Unknown, 0 Unchecked, 5.4s Time] [2025-03-16 15:08:40,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33023 states. [2025-03-16 15:08:40,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33023 to 26117. [2025-03-16 15:08:40,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26117 states, 26116 states have (on average 1.0374100168479092) internal successors, (27093), 26116 states have internal predecessors, (27093), 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:08:40,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26117 states to 26117 states and 27093 transitions. [2025-03-16 15:08:40,532 INFO L78 Accepts]: Start accepts. Automaton has 26117 states and 27093 transitions. Word has length 646 [2025-03-16 15:08:40,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:40,532 INFO L471 AbstractCegarLoop]: Abstraction has 26117 states and 27093 transitions. [2025-03-16 15:08:40,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.66666666666667) internal successors, (646), 5 states have internal predecessors, (646), 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:08:40,533 INFO L276 IsEmpty]: Start isEmpty. Operand 26117 states and 27093 transitions. [2025-03-16 15:08:40,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-03-16 15:08:40,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:40,537 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:40,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 15:08:40,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-16 15:08:40,738 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:40,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:40,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1717965878, now seen corresponding path program 1 times [2025-03-16 15:08:40,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:40,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892498481] [2025-03-16 15:08:40,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:40,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:40,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-16 15:08:40,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-16 15:08:40,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:40,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 15:08:40,855 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 15:08:40,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-16 15:08:40,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-16 15:08:40,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:40,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 15:08:40,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 15:08:40,964 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 15:08:40,964 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:08:40,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 15:08:40,968 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] [2025-03-16 15:08:41,108 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:08:41,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:08:41 BoogieIcfgContainer [2025-03-16 15:08:41,110 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:08:41,110 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:08:41,110 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:08:41,111 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:08:41,111 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:07:27" (3/4) ... [2025-03-16 15:08:41,112 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-16 15:08:41,291 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 661. [2025-03-16 15:08:41,459 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:08:41,459 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:08:41,459 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:08:41,460 INFO L158 Benchmark]: Toolchain (without parser) took 77298.07ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 102.9MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 673.1MB. Max. memory is 16.1GB. [2025-03-16 15:08:41,461 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:08:41,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 686.25ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 89.6MB in the end (delta: 13.3MB). Peak memory consumption was 88.6MB. Max. memory is 16.1GB. [2025-03-16 15:08:41,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 149.28ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 52.4MB in the end (delta: 37.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 15:08:41,461 INFO L158 Benchmark]: Boogie Preprocessor took 235.79ms. Allocated memory was 142.6MB in the beginning and 151.0MB in the end (delta: 8.4MB). Free memory was 52.4MB in the beginning and 56.4MB in the end (delta: -4.0MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2025-03-16 15:08:41,461 INFO L158 Benchmark]: IcfgBuilder took 2095.69ms. Allocated memory was 151.0MB in the beginning and 343.9MB in the end (delta: 192.9MB). Free memory was 56.4MB in the beginning and 214.2MB in the end (delta: -157.8MB). Peak memory consumption was 173.9MB. Max. memory is 16.1GB. [2025-03-16 15:08:41,461 INFO L158 Benchmark]: TraceAbstraction took 73776.41ms. Allocated memory was 343.9MB in the beginning and 3.0GB in the end (delta: 2.6GB). Free memory was 214.2MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 506.3MB. Max. memory is 16.1GB. [2025-03-16 15:08:41,461 INFO L158 Benchmark]: Witness Printer took 349.00ms. Allocated memory is still 3.0GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 71.3MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-16 15:08:41,462 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.30ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 686.25ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 89.6MB in the end (delta: 13.3MB). Peak memory consumption was 88.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 149.28ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 52.4MB in the end (delta: 37.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 235.79ms. Allocated memory was 142.6MB in the beginning and 151.0MB in the end (delta: 8.4MB). Free memory was 52.4MB in the beginning and 56.4MB in the end (delta: -4.0MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * IcfgBuilder took 2095.69ms. Allocated memory was 151.0MB in the beginning and 343.9MB in the end (delta: 192.9MB). Free memory was 56.4MB in the beginning and 214.2MB in the end (delta: -157.8MB). Peak memory consumption was 173.9MB. Max. memory is 16.1GB. * TraceAbstraction took 73776.41ms. Allocated memory was 343.9MB in the beginning and 3.0GB in the end (delta: 2.6GB). Free memory was 214.2MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 506.3MB. Max. memory is 16.1GB. * Witness Printer took 349.00ms. Allocated memory is still 3.0GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 71.3MB). Peak memory consumption was 75.5MB. 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: 35]: 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=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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, 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=-44, a29=4454, a2=2, a4=-89, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1040] COND TRUE ( a4 <= -86 && ((((((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2))) || ((a2==3) && a29 <= -144 )) && (input == 3)) && -61 < a0 )) [L1041] a29 = ((((a29 + 0) + 0) % 29)+ 14) [L1042] a2 = 4 [L1044] return 22; VAL [\result=22, a0=-44, a29=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, 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=31, a2=4, a4=-89, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND TRUE ((a2==4) && ( -61 < a0 && ( a4 <= -86 && ((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-44, a29=31, a2=4, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !(43 < a29) [L324] a4 = ((((a4 % 21)+ -46) * 1) + -5) [L325] a0 = ((((a0 + 0) % 299926)+ -300072) * 1) [L326] a29 = ((((a29 + 371124) % 29)- -13) + 2) [L327] a2 = 3 VAL [a0=-300116, a29=28, a2=3, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] return 22; VAL [\result=22, a0=-300116, a29=28, a2=3, a4=-56, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, 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=-300116, a29=28, a2=3, a4=-56, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND TRUE ((((a2==3) && (( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2))) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) ) [L450] a4 = (((a4 + -287863) + -192250) * 1) [L451] a29 = ((((a29 / 5) % 63)+ -80) - 1) [L452] a2 = 1 [L454] return -1; VAL [\result=-1, a0=-300116, a29=-76, a2=1, a4=-480169, 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 calculate_output(input) [L34] COND TRUE ((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) ) VAL [a0=-300116, a29=-76, a2=1, a4=-480169, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L35] reach_error() VAL [a0=-300116, a29=-76, a2=1, a4=-480169, input=3, 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: 73.6s, OverallIterations: 22, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 47.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 15724 SdHoareTripleChecker+Valid, 42.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15724 mSDsluCounter, 7710 SdHoareTripleChecker+Invalid, 37.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1260 mSDsCounter, 9509 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38231 IncrementalHoareTripleChecker+Invalid, 47742 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9509 mSolverCounterUnsat, 6450 mSDtfsCounter, 38231 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6822 GetRequests, 6726 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49172occurred in iteration=19, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 88930 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 12013 NumberOfCodeBlocks, 12013 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 13882 ConstructedInterpolants, 281 QuantifiedInterpolants, 83768 SizeOfPredicates, 5 NumberOfNonLiveVariables, 5235 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 34 InterpolantComputations, 19 PerfectInterpolantSequences, 9558/12057 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:08:41,514 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