./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label30.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label30.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 74ad95c89e825af3e8bd664b54190b589939097fe089144b4a47194abf94e882 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 21:31:20,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 21:31:20,659 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 21:31:20,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 21:31:20,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 21:31:20,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 21:31:20,696 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 21:31:20,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 21:31:20,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 21:31:20,698 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 21:31:20,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 21:31:20,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 21:31:20,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 21:31:20,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 21:31:20,701 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 21:31:20,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 21:31:20,701 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 21:31:20,702 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 21:31:20,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 21:31:20,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 21:31:20,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 21:31:20,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 21:31:20,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 21:31:20,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 21:31:20,704 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 21:31:20,704 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 21:31:20,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 21:31:20,705 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 21:31:20,705 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 21:31:20,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 21:31:20,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 21:31:20,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 21:31:20,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:31:20,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 21:31:20,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 21:31:20,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 21:31:20,707 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 21:31:20,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 21:31:20,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 21:31:20,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 21:31:20,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 21:31:20,709 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 21:31:20,710 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 74ad95c89e825af3e8bd664b54190b589939097fe089144b4a47194abf94e882 [2024-10-23 21:31:20,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 21:31:20,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 21:31:20,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 21:31:20,984 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 21:31:20,984 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 21:31:20,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label30.c [2024-10-23 21:31:22,488 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 21:31:22,871 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 21:31:22,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label30.c [2024-10-23 21:31:22,896 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7efa7bc95/34fd825cf2ed467b995616f6936344a7/FLAG90ac97bd1 [2024-10-23 21:31:22,909 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7efa7bc95/34fd825cf2ed467b995616f6936344a7 [2024-10-23 21:31:22,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 21:31:22,913 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 21:31:22,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 21:31:22,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 21:31:22,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 21:31:22,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:31:22" (1/1) ... [2024-10-23 21:31:22,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2663041d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:31:22, skipping insertion in model container [2024-10-23 21:31:22,923 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:31:22" (1/1) ... [2024-10-23 21:31:23,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 21:31:23,266 WARN L248 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/Problem17_label30.c[3774,3787] [2024-10-23 21:31:23,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:31:23,836 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 21:31:23,857 WARN L248 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/Problem17_label30.c[3774,3787] [2024-10-23 21:31:24,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:31:24,135 INFO L204 MainTranslator]: Completed translation [2024-10-23 21:31:24,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:31:24 WrapperNode [2024-10-23 21:31:24,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 21:31:24,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 21:31:24,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 21:31:24,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 21:31:24,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:31:24" (1/1) ... [2024-10-23 21:31:24,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:31:24" (1/1) ... [2024-10-23 21:31:24,469 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-23 21:31:24,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 21:31:24,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 21:31:24,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 21:31:24,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 21:31:24,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:31:24" (1/1) ... [2024-10-23 21:31:24,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:31:24" (1/1) ... [2024-10-23 21:31:24,519 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:31:24" (1/1) ... [2024-10-23 21:31:24,739 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]. [2024-10-23 21:31:24,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:31:24" (1/1) ... [2024-10-23 21:31:24,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:31:24" (1/1) ... [2024-10-23 21:31:24,848 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:31:24" (1/1) ... [2024-10-23 21:31:24,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:31:24" (1/1) ... [2024-10-23 21:31:24,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:31:24" (1/1) ... [2024-10-23 21:31:25,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:31:24" (1/1) ... [2024-10-23 21:31:25,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 21:31:25,062 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 21:31:25,062 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 21:31:25,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 21:31:25,063 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:31:24" (1/1) ... [2024-10-23 21:31:25,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:31:25,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:31:25,095 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) [2024-10-23 21:31:25,097 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 [2024-10-23 21:31:25,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 21:31:25,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 21:31:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 21:31:25,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 21:31:25,200 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 21:31:25,201 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 21:31:28,268 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-23 21:31:28,269 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 21:31:28,338 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 21:31:28,342 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 21:31:28,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:31:28 BoogieIcfgContainer [2024-10-23 21:31:28,342 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 21:31:28,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 21:31:28,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 21:31:28,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 21:31:28,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 09:31:22" (1/3) ... [2024-10-23 21:31:28,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ecc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:31:28, skipping insertion in model container [2024-10-23 21:31:28,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:31:24" (2/3) ... [2024-10-23 21:31:28,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ecc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:31:28, skipping insertion in model container [2024-10-23 21:31:28,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:31:28" (3/3) ... [2024-10-23 21:31:28,351 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label30.c [2024-10-23 21:31:28,368 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 21:31:28,368 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 21:31:28,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 21:31:28,467 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;@42b445b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 21:31:28,468 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 21:31:28,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 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) [2024-10-23 21:31:28,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-23 21:31:28,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:31:28,483 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:31:28,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:31:28,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:31:28,490 INFO L85 PathProgramCache]: Analyzing trace with hash -435000657, now seen corresponding path program 1 times [2024-10-23 21:31:28,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:31:28,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430010642] [2024-10-23 21:31:28,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:31:28,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:31:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:31:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:31:28,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:31:28,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430010642] [2024-10-23 21:31:28,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430010642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:31:28,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:31:28,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:31:28,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061069459] [2024-10-23 21:31:28,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:31:28,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 21:31:28,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:31:28,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 21:31:28,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 21:31:28,688 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:31:28,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:31:28,770 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-23 21:31:28,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 21:31:28,780 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-23 21:31:28,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:31:28,802 INFO L225 Difference]: With dead ends: 1055 [2024-10-23 21:31:28,802 INFO L226 Difference]: Without dead ends: 526 [2024-10-23 21:31:28,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 21:31:28,815 INFO L432 NwaCegarLoop]: 935 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 21:31:28,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 21:31:28,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-23 21:31:28,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-23 21:31:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 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) [2024-10-23 21:31:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-23 21:31:28,891 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 23 [2024-10-23 21:31:28,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:31:28,891 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-23 21:31:28,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:31:28,892 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-23 21:31:28,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-23 21:31:28,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:31:28,893 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:31:28,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 21:31:28,894 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:31:28,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:31:28,894 INFO L85 PathProgramCache]: Analyzing trace with hash -51117638, now seen corresponding path program 1 times [2024-10-23 21:31:28,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:31:28,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252589821] [2024-10-23 21:31:28,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:31:28,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:31:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:31:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:31:29,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:31:29,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252589821] [2024-10-23 21:31:29,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252589821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:31:29,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:31:29,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:31:29,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005168992] [2024-10-23 21:31:29,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:31:29,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:31:29,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:31:29,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:31:29,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:31:29,083 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:31:31,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:31:31,464 INFO L93 Difference]: Finished difference Result 1522 states and 2728 transitions. [2024-10-23 21:31:31,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:31:31,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-23 21:31:31,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:31:31,470 INFO L225 Difference]: With dead ends: 1522 [2024-10-23 21:31:31,470 INFO L226 Difference]: Without dead ends: 997 [2024-10-23 21:31:31,472 INFO L431 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 [2024-10-23 21:31:31,473 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 487 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-23 21:31:31,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 239 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-23 21:31:31,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2024-10-23 21:31:31,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 981. [2024-10-23 21:31:31,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 1.7081632653061225) internal successors, (1674), 980 states have internal predecessors, (1674), 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) [2024-10-23 21:31:31,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1674 transitions. [2024-10-23 21:31:31,512 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1674 transitions. Word has length 23 [2024-10-23 21:31:31,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:31:31,512 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1674 transitions. [2024-10-23 21:31:31,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:31:31,512 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1674 transitions. [2024-10-23 21:31:31,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-23 21:31:31,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:31:31,515 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:31:31,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 21:31:31,515 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:31:31,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:31:31,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1435741255, now seen corresponding path program 1 times [2024-10-23 21:31:31,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:31:31,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892726640] [2024-10-23 21:31:31,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:31:31,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:31:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:31:31,684 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:31:31,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:31:31,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892726640] [2024-10-23 21:31:31,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892726640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:31:31,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:31:31,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:31:31,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933643813] [2024-10-23 21:31:31,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:31:31,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:31:31,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:31:31,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:31:31,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:31:31,687 INFO L87 Difference]: Start difference. First operand 981 states and 1674 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:31:33,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:31:33,652 INFO L93 Difference]: Finished difference Result 2840 states and 4880 transitions. [2024-10-23 21:31:33,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:31:33,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-10-23 21:31:33,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:31:33,660 INFO L225 Difference]: With dead ends: 2840 [2024-10-23 21:31:33,660 INFO L226 Difference]: Without dead ends: 1860 [2024-10-23 21:31:33,662 INFO L431 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 [2024-10-23 21:31:33,663 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 407 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-23 21:31:33,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 494 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-23 21:31:33,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2024-10-23 21:31:33,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1856. [2024-10-23 21:31:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1855 states have (on average 1.4549865229110512) internal successors, (2699), 1855 states have internal predecessors, (2699), 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) [2024-10-23 21:31:33,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2699 transitions. [2024-10-23 21:31:33,697 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 2699 transitions. Word has length 88 [2024-10-23 21:31:33,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:31:33,698 INFO L471 AbstractCegarLoop]: Abstraction has 1856 states and 2699 transitions. [2024-10-23 21:31:33,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:31:33,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2699 transitions. [2024-10-23 21:31:33,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-23 21:31:33,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:31:33,708 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:31:33,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 21:31:33,708 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:31:33,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:31:33,712 INFO L85 PathProgramCache]: Analyzing trace with hash 761148988, now seen corresponding path program 1 times [2024-10-23 21:31:33,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:31:33,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734636399] [2024-10-23 21:31:33,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:31:33,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:31:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:31:34,142 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:31:34,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:31:34,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734636399] [2024-10-23 21:31:34,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734636399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:31:34,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:31:34,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:31:34,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073148647] [2024-10-23 21:31:34,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:31:34,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:31:34,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:31:34,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:31:34,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:31:34,148 INFO L87 Difference]: Start difference. First operand 1856 states and 2699 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 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) [2024-10-23 21:31:36,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:31:36,457 INFO L93 Difference]: Finished difference Result 4590 states and 6639 transitions. [2024-10-23 21:31:36,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:31:36,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 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 128 [2024-10-23 21:31:36,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:31:36,468 INFO L225 Difference]: With dead ends: 4590 [2024-10-23 21:31:36,468 INFO L226 Difference]: Without dead ends: 2735 [2024-10-23 21:31:36,470 INFO L431 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 [2024-10-23 21:31:36,471 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 352 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-23 21:31:36,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 535 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-23 21:31:36,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2735 states. [2024-10-23 21:31:36,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2735 to 2715. [2024-10-23 21:31:36,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2715 states, 2714 states have (on average 1.3909358879882092) internal successors, (3775), 2714 states have internal predecessors, (3775), 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) [2024-10-23 21:31:36,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 3775 transitions. [2024-10-23 21:31:36,512 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 3775 transitions. Word has length 128 [2024-10-23 21:31:36,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:31:36,513 INFO L471 AbstractCegarLoop]: Abstraction has 2715 states and 3775 transitions. [2024-10-23 21:31:36,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 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) [2024-10-23 21:31:36,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 3775 transitions. [2024-10-23 21:31:36,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-23 21:31:36,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:31:36,516 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:31:36,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 21:31:36,516 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:31:36,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:31:36,517 INFO L85 PathProgramCache]: Analyzing trace with hash 461202957, now seen corresponding path program 1 times [2024-10-23 21:31:36,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:31:36,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910677069] [2024-10-23 21:31:36,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:31:36,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:31:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:31:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:31:36,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:31:36,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910677069] [2024-10-23 21:31:36,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910677069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:31:36,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:31:36,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:31:36,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961160124] [2024-10-23 21:31:36,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:31:36,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:31:36,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:31:36,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:31:36,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:31:36,732 INFO L87 Difference]: Start difference. First operand 2715 states and 3775 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 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) [2024-10-23 21:31:38,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:31:38,454 INFO L93 Difference]: Finished difference Result 6708 states and 9428 transitions. [2024-10-23 21:31:38,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:31:38,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 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 134 [2024-10-23 21:31:38,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:31:38,467 INFO L225 Difference]: With dead ends: 6708 [2024-10-23 21:31:38,468 INFO L226 Difference]: Without dead ends: 3994 [2024-10-23 21:31:38,473 INFO L431 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 [2024-10-23 21:31:38,474 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 347 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:31:38,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-23 21:31:38,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2024-10-23 21:31:38,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3141. [2024-10-23 21:31:38,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 3140 states have (on average 1.2745222929936306) internal successors, (4002), 3140 states have internal predecessors, (4002), 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) [2024-10-23 21:31:38,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 4002 transitions. [2024-10-23 21:31:38,526 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 4002 transitions. Word has length 134 [2024-10-23 21:31:38,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:31:38,528 INFO L471 AbstractCegarLoop]: Abstraction has 3141 states and 4002 transitions. [2024-10-23 21:31:38,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 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) [2024-10-23 21:31:38,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 4002 transitions. [2024-10-23 21:31:38,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-23 21:31:38,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:31:38,534 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:31:38,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 21:31:38,535 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:31:38,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:31:38,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1846940185, now seen corresponding path program 1 times [2024-10-23 21:31:38,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:31:38,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736566490] [2024-10-23 21:31:38,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:31:38,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:31:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:31:38,880 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:31:38,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:31:38,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736566490] [2024-10-23 21:31:38,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736566490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:31:38,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:31:38,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 21:31:38,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807133861] [2024-10-23 21:31:38,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:31:38,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 21:31:38,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:31:38,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 21:31:38,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-23 21:31:38,883 INFO L87 Difference]: Start difference. First operand 3141 states and 4002 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 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) [2024-10-23 21:31:41,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:31:41,204 INFO L93 Difference]: Finished difference Result 8004 states and 10507 transitions. [2024-10-23 21:31:41,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:31:41,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 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 171 [2024-10-23 21:31:41,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:31:41,221 INFO L225 Difference]: With dead ends: 8004 [2024-10-23 21:31:41,222 INFO L226 Difference]: Without dead ends: 4864 [2024-10-23 21:31:41,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-23 21:31:41,227 INFO L432 NwaCegarLoop]: 763 mSDtfsCounter, 593 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 3094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-23 21:31:41,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 924 Invalid, 3094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [622 Valid, 2472 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-23 21:31:41,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4864 states. [2024-10-23 21:31:41,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4864 to 4851. [2024-10-23 21:31:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4851 states, 4850 states have (on average 1.26659793814433) internal successors, (6143), 4850 states have internal predecessors, (6143), 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) [2024-10-23 21:31:41,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4851 states to 4851 states and 6143 transitions. [2024-10-23 21:31:41,315 INFO L78 Accepts]: Start accepts. Automaton has 4851 states and 6143 transitions. Word has length 171 [2024-10-23 21:31:41,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:31:41,315 INFO L471 AbstractCegarLoop]: Abstraction has 4851 states and 6143 transitions. [2024-10-23 21:31:41,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 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) [2024-10-23 21:31:41,316 INFO L276 IsEmpty]: Start isEmpty. Operand 4851 states and 6143 transitions. [2024-10-23 21:31:41,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-23 21:31:41,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:31:41,318 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:31:41,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 21:31:41,318 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:31:41,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:31:41,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1222559832, now seen corresponding path program 1 times [2024-10-23 21:31:41,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:31:41,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505314646] [2024-10-23 21:31:41,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:31:41,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:31:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:31:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-23 21:31:41,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:31:41,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505314646] [2024-10-23 21:31:41,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505314646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:31:41,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:31:41,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:31:41,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979449410] [2024-10-23 21:31:41,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:31:41,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:31:41,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:31:41,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:31:41,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:31:41,479 INFO L87 Difference]: Start difference. First operand 4851 states and 6143 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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) [2024-10-23 21:31:43,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:31:43,294 INFO L93 Difference]: Finished difference Result 12248 states and 15824 transitions. [2024-10-23 21:31:43,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:31:43,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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 177 [2024-10-23 21:31:43,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:31:43,313 INFO L225 Difference]: With dead ends: 12248 [2024-10-23 21:31:43,313 INFO L226 Difference]: Without dead ends: 7398 [2024-10-23 21:31:43,319 INFO L431 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 [2024-10-23 21:31:43,320 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 423 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-23 21:31:43,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 543 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-23 21:31:43,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7398 states. [2024-10-23 21:31:43,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7398 to 4825. [2024-10-23 21:31:43,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4825 states, 4824 states have (on average 1.265339966832504) internal successors, (6104), 4824 states have internal predecessors, (6104), 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) [2024-10-23 21:31:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4825 states to 4825 states and 6104 transitions. [2024-10-23 21:31:43,407 INFO L78 Accepts]: Start accepts. Automaton has 4825 states and 6104 transitions. Word has length 177 [2024-10-23 21:31:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:31:43,408 INFO L471 AbstractCegarLoop]: Abstraction has 4825 states and 6104 transitions. [2024-10-23 21:31:43,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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) [2024-10-23 21:31:43,408 INFO L276 IsEmpty]: Start isEmpty. Operand 4825 states and 6104 transitions. [2024-10-23 21:31:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-23 21:31:43,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:31:43,411 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-23 21:31:43,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 21:31:43,411 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:31:43,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:31:43,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1776975644, now seen corresponding path program 1 times [2024-10-23 21:31:43,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:31:43,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857820051] [2024-10-23 21:31:43,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:31:43,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:31:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:31:43,540 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-23 21:31:43,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:31:43,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857820051] [2024-10-23 21:31:43,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857820051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:31:43,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:31:43,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:31:43,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073696091] [2024-10-23 21:31:43,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:31:43,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:31:43,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:31:43,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:31:43,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:31:43,543 INFO L87 Difference]: Start difference. First operand 4825 states and 6104 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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) [2024-10-23 21:31:45,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:31:45,356 INFO L93 Difference]: Finished difference Result 13485 states and 17136 transitions. [2024-10-23 21:31:45,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:31:45,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 190 [2024-10-23 21:31:45,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:31:45,377 INFO L225 Difference]: With dead ends: 13485 [2024-10-23 21:31:45,377 INFO L226 Difference]: Without dead ends: 7354 [2024-10-23 21:31:45,383 INFO L431 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 [2024-10-23 21:31:45,384 INFO L432 NwaCegarLoop]: 603 mSDtfsCounter, 569 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:31:45,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 632 Invalid, 1822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-23 21:31:45,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7354 states. [2024-10-23 21:31:45,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7354 to 6498. [2024-10-23 21:31:45,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6498 states, 6497 states have (on average 1.187163306141296) internal successors, (7713), 6497 states have internal predecessors, (7713), 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) [2024-10-23 21:31:45,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6498 states to 6498 states and 7713 transitions. [2024-10-23 21:31:45,501 INFO L78 Accepts]: Start accepts. Automaton has 6498 states and 7713 transitions. Word has length 190 [2024-10-23 21:31:45,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:31:45,501 INFO L471 AbstractCegarLoop]: Abstraction has 6498 states and 7713 transitions. [2024-10-23 21:31:45,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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) [2024-10-23 21:31:45,502 INFO L276 IsEmpty]: Start isEmpty. Operand 6498 states and 7713 transitions. [2024-10-23 21:31:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-10-23 21:31:45,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:31:45,506 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:31:45,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-23 21:31:45,506 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:31:45,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:31:45,507 INFO L85 PathProgramCache]: Analyzing trace with hash 2032304414, now seen corresponding path program 1 times [2024-10-23 21:31:45,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:31:45,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673668262] [2024-10-23 21:31:45,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:31:45,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:31:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:31:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 43 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:31:45,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:31:45,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673668262] [2024-10-23 21:31:45,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673668262] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:31:45,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95291780] [2024-10-23 21:31:45,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:31:45,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:31:45,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:31:45,962 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) [2024-10-23 21:31:45,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-23 21:31:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:31:46,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-23 21:31:46,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:31:46,430 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 43 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:31:46,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 21:31:46,831 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:31:46,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95291780] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-23 21:31:46,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-23 21:31:46,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 7 [2024-10-23 21:31:46,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127266636] [2024-10-23 21:31:46,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:31:46,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:31:46,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:31:46,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:31:46,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-23 21:31:46,834 INFO L87 Difference]: Start difference. First operand 6498 states and 7713 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 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) [2024-10-23 21:31:49,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:31:49,183 INFO L93 Difference]: Finished difference Result 21950 states and 25849 transitions. [2024-10-23 21:31:49,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:31:49,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 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 243 [2024-10-23 21:31:49,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:31:49,218 INFO L225 Difference]: With dead ends: 21950 [2024-10-23 21:31:49,219 INFO L226 Difference]: Without dead ends: 15027 [2024-10-23 21:31:49,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-23 21:31:49,231 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 902 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 2076 mSolverCounterSat, 750 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 2826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 750 IncrementalHoareTripleChecker+Valid, 2076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-23 21:31:49,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 115 Invalid, 2826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [750 Valid, 2076 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-23 21:31:49,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15027 states. [2024-10-23 21:31:49,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15027 to 15024. [2024-10-23 21:31:49,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15024 states, 15023 states have (on average 1.1618185448978233) internal successors, (17454), 15023 states have internal predecessors, (17454), 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) [2024-10-23 21:31:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15024 states to 15024 states and 17454 transitions. [2024-10-23 21:31:49,448 INFO L78 Accepts]: Start accepts. Automaton has 15024 states and 17454 transitions. Word has length 243 [2024-10-23 21:31:49,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:31:49,450 INFO L471 AbstractCegarLoop]: Abstraction has 15024 states and 17454 transitions. [2024-10-23 21:31:49,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 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) [2024-10-23 21:31:49,450 INFO L276 IsEmpty]: Start isEmpty. Operand 15024 states and 17454 transitions. [2024-10-23 21:31:49,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-23 21:31:49,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:31:49,454 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:31:49,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-23 21:31:49,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:31:49,655 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:31:49,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:31:49,656 INFO L85 PathProgramCache]: Analyzing trace with hash -979862628, now seen corresponding path program 1 times [2024-10-23 21:31:49,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:31:49,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450498901] [2024-10-23 21:31:49,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:31:49,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:31:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:31:49,809 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-23 21:31:49,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:31:49,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450498901] [2024-10-23 21:31:49,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450498901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:31:49,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:31:49,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:31:49,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893627182] [2024-10-23 21:31:49,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:31:49,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:31:49,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:31:49,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:31:49,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:31:49,811 INFO L87 Difference]: Start difference. First operand 15024 states and 17454 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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) [2024-10-23 21:31:51,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:31:51,479 INFO L93 Difference]: Finished difference Result 34300 states and 39677 transitions. [2024-10-23 21:31:51,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:31:51,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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 261 [2024-10-23 21:31:51,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:31:51,511 INFO L225 Difference]: With dead ends: 34300 [2024-10-23 21:31:51,511 INFO L226 Difference]: Without dead ends: 18845 [2024-10-23 21:31:51,528 INFO L431 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 [2024-10-23 21:31:51,529 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 451 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:31:51,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 314 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-23 21:31:51,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18845 states. [2024-10-23 21:31:51,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18845 to 17142. [2024-10-23 21:31:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17142 states, 17141 states have (on average 1.149407852517356) internal successors, (19702), 17141 states have internal predecessors, (19702), 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) [2024-10-23 21:31:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17142 states to 17142 states and 19702 transitions. [2024-10-23 21:31:51,796 INFO L78 Accepts]: Start accepts. Automaton has 17142 states and 19702 transitions. Word has length 261 [2024-10-23 21:31:51,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:31:51,797 INFO L471 AbstractCegarLoop]: Abstraction has 17142 states and 19702 transitions. [2024-10-23 21:31:51,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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) [2024-10-23 21:31:51,798 INFO L276 IsEmpty]: Start isEmpty. Operand 17142 states and 19702 transitions. [2024-10-23 21:31:51,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-10-23 21:31:51,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:31:51,802 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-23 21:31:51,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-23 21:31:51,803 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:31:51,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:31:51,803 INFO L85 PathProgramCache]: Analyzing trace with hash 2049516963, now seen corresponding path program 1 times [2024-10-23 21:31:51,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:31:51,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004683661] [2024-10-23 21:31:51,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:31:51,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:31:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:31:52,078 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-10-23 21:31:52,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:31:52,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004683661] [2024-10-23 21:31:52,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004683661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:31:52,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:31:52,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:31:52,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201025808] [2024-10-23 21:31:52,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:31:52,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:31:52,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:31:52,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:31:52,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:31:52,081 INFO L87 Difference]: Start difference. First operand 17142 states and 19702 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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) [2024-10-23 21:31:53,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:31:53,745 INFO L93 Difference]: Finished difference Result 37695 states and 43551 transitions. [2024-10-23 21:31:53,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:31:53,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 283 [2024-10-23 21:31:53,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:31:53,784 INFO L225 Difference]: With dead ends: 37695 [2024-10-23 21:31:53,784 INFO L226 Difference]: Without dead ends: 20129 [2024-10-23 21:31:53,805 INFO L431 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 [2024-10-23 21:31:53,806 INFO L432 NwaCegarLoop]: 736 mSDtfsCounter, 430 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:31:53,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 795 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-23 21:31:53,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20129 states. [2024-10-23 21:31:54,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20129 to 20127. [2024-10-23 21:31:54,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20127 states, 20126 states have (on average 1.1397197654774918) internal successors, (22938), 20126 states have internal predecessors, (22938), 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) [2024-10-23 21:31:54,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20127 states to 20127 states and 22938 transitions. [2024-10-23 21:31:54,053 INFO L78 Accepts]: Start accepts. Automaton has 20127 states and 22938 transitions. Word has length 283 [2024-10-23 21:31:54,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:31:54,053 INFO L471 AbstractCegarLoop]: Abstraction has 20127 states and 22938 transitions. [2024-10-23 21:31:54,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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) [2024-10-23 21:31:54,054 INFO L276 IsEmpty]: Start isEmpty. Operand 20127 states and 22938 transitions. [2024-10-23 21:31:54,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2024-10-23 21:31:54,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:31:54,060 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-23 21:31:54,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-23 21:31:54,060 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:31:54,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:31:54,061 INFO L85 PathProgramCache]: Analyzing trace with hash 791766780, now seen corresponding path program 1 times [2024-10-23 21:31:54,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:31:54,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503054647] [2024-10-23 21:31:54,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:31:54,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:31:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:31:54,337 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-23 21:31:54,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:31:54,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503054647] [2024-10-23 21:31:54,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503054647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:31:54,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:31:54,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:31:54,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636503288] [2024-10-23 21:31:54,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:31:54,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:31:54,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:31:54,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:31:54,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:31:54,340 INFO L87 Difference]: Start difference. First operand 20127 states and 22938 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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) [2024-10-23 21:31:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:31:56,070 INFO L93 Difference]: Finished difference Result 47501 states and 54290 transitions. [2024-10-23 21:31:56,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:31:56,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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 317 [2024-10-23 21:31:56,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:31:56,107 INFO L225 Difference]: With dead ends: 47501 [2024-10-23 21:31:56,107 INFO L226 Difference]: Without dead ends: 27375 [2024-10-23 21:31:56,124 INFO L431 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 [2024-10-23 21:31:56,125 INFO L432 NwaCegarLoop]: 730 mSDtfsCounter, 314 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:31:56,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 777 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-23 21:31:56,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27375 states. [2024-10-23 21:31:56,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27375 to 26087. [2024-10-23 21:31:56,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26087 states, 26086 states have (on average 1.1315264893046078) internal successors, (29517), 26086 states have internal predecessors, (29517), 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) [2024-10-23 21:31:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26087 states to 26087 states and 29517 transitions. [2024-10-23 21:31:56,452 INFO L78 Accepts]: Start accepts. Automaton has 26087 states and 29517 transitions. Word has length 317 [2024-10-23 21:31:56,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:31:56,453 INFO L471 AbstractCegarLoop]: Abstraction has 26087 states and 29517 transitions. [2024-10-23 21:31:56,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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) [2024-10-23 21:31:56,454 INFO L276 IsEmpty]: Start isEmpty. Operand 26087 states and 29517 transitions. [2024-10-23 21:31:56,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-10-23 21:31:56,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:31:56,462 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-23 21:31:56,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-23 21:31:56,462 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:31:56,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:31:56,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1734785012, now seen corresponding path program 1 times [2024-10-23 21:31:56,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:31:56,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897128675] [2024-10-23 21:31:56,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:31:56,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:31:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:31:56,915 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 204 proven. 78 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-23 21:31:56,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:31:56,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897128675] [2024-10-23 21:31:56,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897128675] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:31:56,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563462767] [2024-10-23 21:31:56,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:31:56,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:31:56,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:31:56,919 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) [2024-10-23 21:31:56,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-23 21:31:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:31:57,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-23 21:31:57,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:31:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 204 proven. 78 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-23 21:31:57,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 21:31:57,535 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 282 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-23 21:31:57,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563462767] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-23 21:31:57,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-23 21:31:57,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-10-23 21:31:57,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9093045] [2024-10-23 21:31:57,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:31:57,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:31:57,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:31:57,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:31:57,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:31:57,538 INFO L87 Difference]: Start difference. First operand 26087 states and 29517 transitions. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 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) [2024-10-23 21:31:59,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:31:59,964 INFO L93 Difference]: Finished difference Result 64951 states and 74036 transitions. [2024-10-23 21:31:59,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:31:59,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 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 322 [2024-10-23 21:31:59,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:32:00,003 INFO L225 Difference]: With dead ends: 64951 [2024-10-23 21:32:00,003 INFO L226 Difference]: Without dead ends: 38440 [2024-10-23 21:32:00,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:32:00,026 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 815 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 2713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 474 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-23 21:32:00,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 197 Invalid, 2713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [474 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-23 21:32:00,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38440 states. [2024-10-23 21:32:00,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38440 to 34601. [2024-10-23 21:32:00,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34601 states, 34600 states have (on average 1.13742774566474) internal successors, (39355), 34600 states have internal predecessors, (39355), 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) [2024-10-23 21:32:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34601 states to 34601 states and 39355 transitions. [2024-10-23 21:32:00,539 INFO L78 Accepts]: Start accepts. Automaton has 34601 states and 39355 transitions. Word has length 322 [2024-10-23 21:32:00,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:32:00,539 INFO L471 AbstractCegarLoop]: Abstraction has 34601 states and 39355 transitions. [2024-10-23 21:32:00,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 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) [2024-10-23 21:32:00,540 INFO L276 IsEmpty]: Start isEmpty. Operand 34601 states and 39355 transitions. [2024-10-23 21:32:00,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2024-10-23 21:32:00,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:32:00,552 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:32:00,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-23 21:32:00,752 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,SelfDestructingSolverStorable12 [2024-10-23 21:32:00,753 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:32:00,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:32:00,753 INFO L85 PathProgramCache]: Analyzing trace with hash 117004548, now seen corresponding path program 1 times [2024-10-23 21:32:00,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:32:00,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436803234] [2024-10-23 21:32:00,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:32:00,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:32:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:32:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-10-23 21:32:01,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:32:01,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436803234] [2024-10-23 21:32:01,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436803234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:32:01,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:32:01,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:32:01,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395923154] [2024-10-23 21:32:01,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:32:01,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:32:01,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:32:01,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:32:01,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:32:01,169 INFO L87 Difference]: Start difference. First operand 34601 states and 39355 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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) [2024-10-23 21:32:02,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:32:02,864 INFO L93 Difference]: Finished difference Result 87944 states and 99520 transitions. [2024-10-23 21:32:02,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:32:02,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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 447 [2024-10-23 21:32:02,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:32:02,922 INFO L225 Difference]: With dead ends: 87944 [2024-10-23 21:32:02,923 INFO L226 Difference]: Without dead ends: 53344 [2024-10-23 21:32:02,952 INFO L431 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 [2024-10-23 21:32:02,952 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 360 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:32:02,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 257 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-23 21:32:02,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53344 states. [2024-10-23 21:32:03,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53344 to 50766. [2024-10-23 21:32:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50766 states, 50765 states have (on average 1.1218950064020488) internal successors, (56953), 50765 states have internal predecessors, (56953), 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) [2024-10-23 21:32:03,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50766 states to 50766 states and 56953 transitions. [2024-10-23 21:32:03,874 INFO L78 Accepts]: Start accepts. Automaton has 50766 states and 56953 transitions. Word has length 447 [2024-10-23 21:32:03,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:32:03,875 INFO L471 AbstractCegarLoop]: Abstraction has 50766 states and 56953 transitions. [2024-10-23 21:32:03,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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) [2024-10-23 21:32:03,875 INFO L276 IsEmpty]: Start isEmpty. Operand 50766 states and 56953 transitions. [2024-10-23 21:32:03,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2024-10-23 21:32:03,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:32:03,888 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:32:03,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-23 21:32:03,888 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:32:03,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:32:03,889 INFO L85 PathProgramCache]: Analyzing trace with hash -210425192, now seen corresponding path program 1 times [2024-10-23 21:32:03,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:32:03,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637635198] [2024-10-23 21:32:03,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:32:03,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:32:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:32:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 495 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-23 21:32:04,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:32:04,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637635198] [2024-10-23 21:32:04,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637635198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:32:04,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:32:04,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:32:04,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476202569] [2024-10-23 21:32:04,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:32:04,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:32:04,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:32:04,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:32:04,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:32:04,534 INFO L87 Difference]: Start difference. First operand 50766 states and 56953 transitions. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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) [2024-10-23 21:32:06,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:32:06,132 INFO L93 Difference]: Finished difference Result 116043 states and 130399 transitions. [2024-10-23 21:32:06,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:32:06,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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 454 [2024-10-23 21:32:06,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:32:06,213 INFO L225 Difference]: With dead ends: 116043 [2024-10-23 21:32:06,213 INFO L226 Difference]: Without dead ends: 65278 [2024-10-23 21:32:06,236 INFO L431 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 [2024-10-23 21:32:06,239 INFO L432 NwaCegarLoop]: 722 mSDtfsCounter, 366 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-23 21:32:06,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 779 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-23 21:32:06,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65278 states. [2024-10-23 21:32:06,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65278 to 65268. [2024-10-23 21:32:06,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65268 states, 65267 states have (on average 1.1070219253221383) internal successors, (72252), 65267 states have internal predecessors, (72252), 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) [2024-10-23 21:32:07,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65268 states to 65268 states and 72252 transitions. [2024-10-23 21:32:07,380 INFO L78 Accepts]: Start accepts. Automaton has 65268 states and 72252 transitions. Word has length 454 [2024-10-23 21:32:07,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:32:07,381 INFO L471 AbstractCegarLoop]: Abstraction has 65268 states and 72252 transitions. [2024-10-23 21:32:07,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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) [2024-10-23 21:32:07,386 INFO L276 IsEmpty]: Start isEmpty. Operand 65268 states and 72252 transitions. [2024-10-23 21:32:07,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2024-10-23 21:32:07,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:32:07,400 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:32:07,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-23 21:32:07,400 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:32:07,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:32:07,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1181352669, now seen corresponding path program 1 times [2024-10-23 21:32:07,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:32:07,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924094191] [2024-10-23 21:32:07,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:32:07,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:32:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:32:08,121 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-23 21:32:08,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:32:08,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924094191] [2024-10-23 21:32:08,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924094191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:32:08,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:32:08,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 21:32:08,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373021542] [2024-10-23 21:32:08,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:32:08,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:32:08,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:32:08,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:32:08,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:32:08,124 INFO L87 Difference]: Start difference. First operand 65268 states and 72252 transitions. Second operand has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 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) [2024-10-23 21:32:10,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:32:10,593 INFO L93 Difference]: Finished difference Result 151863 states and 168110 transitions. [2024-10-23 21:32:10,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:32:10,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 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 456 [2024-10-23 21:32:10,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:32:10,707 INFO L225 Difference]: With dead ends: 151863 [2024-10-23 21:32:10,707 INFO L226 Difference]: Without dead ends: 86596 [2024-10-23 21:32:10,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:32:10,748 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 779 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2258 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 2665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 2258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-23 21:32:10,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 194 Invalid, 2665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 2258 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-23 21:32:10,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86596 states. [2024-10-23 21:32:11,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86596 to 83610. [2024-10-23 21:32:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83610 states, 83609 states have (on average 1.1066870791421977) internal successors, (92529), 83609 states have internal predecessors, (92529), 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) [2024-10-23 21:32:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83610 states to 83610 states and 92529 transitions. [2024-10-23 21:32:11,837 INFO L78 Accepts]: Start accepts. Automaton has 83610 states and 92529 transitions. Word has length 456 [2024-10-23 21:32:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:32:11,837 INFO L471 AbstractCegarLoop]: Abstraction has 83610 states and 92529 transitions. [2024-10-23 21:32:11,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 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) [2024-10-23 21:32:11,838 INFO L276 IsEmpty]: Start isEmpty. Operand 83610 states and 92529 transitions. [2024-10-23 21:32:11,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2024-10-23 21:32:11,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:32:11,849 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:32:11,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-23 21:32:11,850 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:32:11,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:32:11,850 INFO L85 PathProgramCache]: Analyzing trace with hash -885259697, now seen corresponding path program 1 times [2024-10-23 21:32:11,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:32:11,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432582246] [2024-10-23 21:32:11,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:32:11,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:32:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:32:13,497 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 440 proven. 82 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-23 21:32:13,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:32:13,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432582246] [2024-10-23 21:32:13,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432582246] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:32:13,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916557215] [2024-10-23 21:32:13,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:32:13,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:32:13,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:32:13,500 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) [2024-10-23 21:32:13,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-23 21:32:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:32:13,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 21:32:13,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:32:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 570 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-23 21:32:14,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:32:14,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916557215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:32:14,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:32:14,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-23 21:32:14,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927732953] [2024-10-23 21:32:14,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:32:14,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:32:14,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:32:14,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:32:14,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:32:14,080 INFO L87 Difference]: Start difference. First operand 83610 states and 92529 transitions. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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) [2024-10-23 21:32:15,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:32:15,984 INFO L93 Difference]: Finished difference Result 174034 states and 192464 transitions. [2024-10-23 21:32:15,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:32:15,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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 476 [2024-10-23 21:32:15,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:32:16,074 INFO L225 Difference]: With dead ends: 174034 [2024-10-23 21:32:16,075 INFO L226 Difference]: Without dead ends: 90425 [2024-10-23 21:32:16,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 475 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:32:16,095 INFO L432 NwaCegarLoop]: 692 mSDtfsCounter, 348 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:32:16,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 747 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-23 21:32:16,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90425 states. [2024-10-23 21:32:16,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90425 to 87014. [2024-10-23 21:32:16,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87014 states, 87013 states have (on average 1.1051796857940768) internal successors, (96165), 87013 states have internal predecessors, (96165), 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) [2024-10-23 21:32:17,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87014 states to 87014 states and 96165 transitions. [2024-10-23 21:32:17,244 INFO L78 Accepts]: Start accepts. Automaton has 87014 states and 96165 transitions. Word has length 476 [2024-10-23 21:32:17,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:32:17,245 INFO L471 AbstractCegarLoop]: Abstraction has 87014 states and 96165 transitions. [2024-10-23 21:32:17,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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) [2024-10-23 21:32:17,245 INFO L276 IsEmpty]: Start isEmpty. Operand 87014 states and 96165 transitions. [2024-10-23 21:32:17,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2024-10-23 21:32:17,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:32:17,253 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2024-10-23 21:32:17,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-23 21:32:17,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:32:17,453 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:32:17,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:32:17,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1196037671, now seen corresponding path program 1 times [2024-10-23 21:32:17,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:32:17,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669369381] [2024-10-23 21:32:17,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:32:17,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:32:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:32:18,130 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-23 21:32:18,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:32:18,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669369381] [2024-10-23 21:32:18,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669369381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:32:18,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:32:18,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:32:18,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610522224] [2024-10-23 21:32:18,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:32:18,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:32:18,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:32:18,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:32:18,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:32:18,134 INFO L87 Difference]: Start difference. First operand 87014 states and 96165 transitions. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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) [2024-10-23 21:32:20,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:32:20,211 INFO L93 Difference]: Finished difference Result 182567 states and 201474 transitions. [2024-10-23 21:32:20,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:32:20,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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 499 [2024-10-23 21:32:20,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:32:20,315 INFO L225 Difference]: With dead ends: 182567 [2024-10-23 21:32:20,315 INFO L226 Difference]: Without dead ends: 95554 [2024-10-23 21:32:20,332 INFO L431 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 [2024-10-23 21:32:20,333 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 406 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:32:20,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 200 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-23 21:32:20,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95554 states. [2024-10-23 21:32:21,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95554 to 85739. [2024-10-23 21:32:21,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85739 states, 85738 states have (on average 1.1051225827521052) internal successors, (94751), 85738 states have internal predecessors, (94751), 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) [2024-10-23 21:32:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85739 states to 85739 states and 94751 transitions. [2024-10-23 21:32:21,244 INFO L78 Accepts]: Start accepts. Automaton has 85739 states and 94751 transitions. Word has length 499 [2024-10-23 21:32:21,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:32:21,245 INFO L471 AbstractCegarLoop]: Abstraction has 85739 states and 94751 transitions. [2024-10-23 21:32:21,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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) [2024-10-23 21:32:21,245 INFO L276 IsEmpty]: Start isEmpty. Operand 85739 states and 94751 transitions. [2024-10-23 21:32:21,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2024-10-23 21:32:21,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:32:21,254 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:32:21,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-23 21:32:21,255 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:32:21,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:32:21,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1807918178, now seen corresponding path program 1 times [2024-10-23 21:32:21,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:32:21,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086654183] [2024-10-23 21:32:21,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:32:21,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:32:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:32:22,571 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 485 proven. 82 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-10-23 21:32:22,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:32:22,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086654183] [2024-10-23 21:32:22,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086654183] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:32:22,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091102297] [2024-10-23 21:32:22,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:32:22,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:32:22,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:32:22,574 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) [2024-10-23 21:32:22,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-23 21:32:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:32:22,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 21:32:22,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:32:24,413 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-23 21:32:24,413 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:32:24,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091102297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:32:24,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:32:24,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-23 21:32:24,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124947228] [2024-10-23 21:32:24,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:32:24,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:32:24,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:32:24,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:32:24,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-23 21:32:24,416 INFO L87 Difference]: Start difference. First operand 85739 states and 94751 transitions. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:32:29,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-23 21:32:30,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:32:30,215 INFO L93 Difference]: Finished difference Result 193223 states and 213412 transitions. [2024-10-23 21:32:30,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:32:30,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 534 [2024-10-23 21:32:30,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:32:30,339 INFO L225 Difference]: With dead ends: 193223 [2024-10-23 21:32:30,340 INFO L226 Difference]: Without dead ends: 107485 [2024-10-23 21:32:30,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 533 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-23 21:32:30,398 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 310 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 115 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:32:30,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 329 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1216 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2024-10-23 21:32:30,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107485 states. [2024-10-23 21:32:31,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107485 to 104916. [2024-10-23 21:32:31,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104916 states, 104915 states have (on average 1.0931420673878853) internal successors, (114687), 104915 states have internal predecessors, (114687), 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) [2024-10-23 21:32:31,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104916 states to 104916 states and 114687 transitions. [2024-10-23 21:32:31,763 INFO L78 Accepts]: Start accepts. Automaton has 104916 states and 114687 transitions. Word has length 534 [2024-10-23 21:32:31,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:32:31,763 INFO L471 AbstractCegarLoop]: Abstraction has 104916 states and 114687 transitions. [2024-10-23 21:32:31,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:32:31,763 INFO L276 IsEmpty]: Start isEmpty. Operand 104916 states and 114687 transitions. [2024-10-23 21:32:31,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2024-10-23 21:32:31,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:32:31,773 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:32:31,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-23 21:32:31,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:32:31,973 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:32:31,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:32:31,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1275377567, now seen corresponding path program 1 times [2024-10-23 21:32:31,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:32:31,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707407656] [2024-10-23 21:32:31,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:32:31,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:32:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-23 21:32:32,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-23 21:32:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-23 21:32:32,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-23 21:32:32,326 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-23 21:32:32,328 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 21:32:32,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-23 21:32:32,332 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:32:32,500 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 21:32:32,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 09:32:32 BoogieIcfgContainer [2024-10-23 21:32:32,504 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 21:32:32,504 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 21:32:32,505 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 21:32:32,505 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 21:32:32,506 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:31:28" (3/4) ... [2024-10-23 21:32:32,507 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-23 21:32:33,124 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 21:32:33,124 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 21:32:33,125 INFO L158 Benchmark]: Toolchain (without parser) took 70211.82ms. Allocated memory was 165.7MB in the beginning and 10.2GB in the end (delta: 10.1GB). Free memory was 101.2MB in the beginning and 8.7GB in the end (delta: -8.6GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-10-23 21:32:33,125 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 165.7MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 21:32:33,125 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1221.55ms. Allocated memory is still 165.7MB. Free memory was 101.2MB in the beginning and 64.4MB in the end (delta: 36.8MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. [2024-10-23 21:32:33,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 333.41ms. Allocated memory was 165.7MB in the beginning and 272.6MB in the end (delta: 107.0MB). Free memory was 64.4MB in the beginning and 168.9MB in the end (delta: -104.5MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2024-10-23 21:32:33,125 INFO L158 Benchmark]: Boogie Preprocessor took 589.27ms. Allocated memory is still 272.6MB. Free memory was 168.9MB in the beginning and 181.4MB in the end (delta: -12.5MB). Peak memory consumption was 117.5MB. Max. memory is 16.1GB. [2024-10-23 21:32:33,126 INFO L158 Benchmark]: RCFGBuilder took 3281.07ms. Allocated memory was 272.6MB in the beginning and 545.3MB in the end (delta: 272.6MB). Free memory was 181.4MB in the beginning and 260.2MB in the end (delta: -78.8MB). Peak memory consumption was 195.9MB. Max. memory is 16.1GB. [2024-10-23 21:32:33,126 INFO L158 Benchmark]: TraceAbstraction took 64159.18ms. Allocated memory was 545.3MB in the beginning and 10.2GB in the end (delta: 9.7GB). Free memory was 260.2MB in the beginning and 8.4GB in the end (delta: -8.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-10-23 21:32:33,137 INFO L158 Benchmark]: Witness Printer took 619.74ms. Allocated memory is still 10.2GB. Free memory was 8.4GB in the beginning and 8.7GB in the end (delta: -285.2MB). Peak memory consumption was 194.0MB. Max. memory is 16.1GB. [2024-10-23 21:32:33,139 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.18ms. Allocated memory is still 165.7MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1221.55ms. Allocated memory is still 165.7MB. Free memory was 101.2MB in the beginning and 64.4MB in the end (delta: 36.8MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 333.41ms. Allocated memory was 165.7MB in the beginning and 272.6MB in the end (delta: 107.0MB). Free memory was 64.4MB in the beginning and 168.9MB in the end (delta: -104.5MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 589.27ms. Allocated memory is still 272.6MB. Free memory was 168.9MB in the beginning and 181.4MB in the end (delta: -12.5MB). Peak memory consumption was 117.5MB. Max. memory is 16.1GB. * RCFGBuilder took 3281.07ms. Allocated memory was 272.6MB in the beginning and 545.3MB in the end (delta: 272.6MB). Free memory was 181.4MB in the beginning and 260.2MB in the end (delta: -78.8MB). Peak memory consumption was 195.9MB. Max. memory is 16.1GB. * TraceAbstraction took 64159.18ms. Allocated memory was 545.3MB in the beginning and 10.2GB in the end (delta: 9.7GB). Free memory was 260.2MB in the beginning and 8.4GB in the end (delta: -8.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 619.74ms. Allocated memory is still 10.2GB. Free memory was 8.4GB in the beginning and 8.7GB in the end (delta: -285.2MB). Peak memory consumption was 194.0MB. 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: 90]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int inputA = 1; [L19] int inputB = 2; [L20] int inputC = 3; [L21] int inputE = 5; [L22] int inputD = 4; [L23] int inputF = 6; [L26] int a24 = 1; [L27] int a21 = 124; [L28] int a26 = 222; [L29] int a14 = -79; [L30] int a28 = 111; [L2587] int output = -1; VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 ))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND TRUE ( 217 < a26 && (( a21 <= 127 && ((a24==1) && ((input == 6) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && -84 < a14 )) [L334] a14 = ((((a14 % 299909)- 300090) + 0) + -1) [L335] a26 = ((((a26 * 9)/ 10) - 554854) * 1) [L336] a28 = ((((a28 * 9)/ 10) * 1) - 589002) [L337] a24 = 2 [L339] return 25; VAL [\result=25, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND TRUE ( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 )) [L330] a14 = (((((a14 * 9)/ 10) + -48560) % 14)+ -98) [L331] a28 = ((((a28 - 0) + 0) % 82)+ 217) [L332] return 25; VAL [\result=25, a14=-101, a21=124, a24=2, a26=-554655, a28=156, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 ))) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !(( 217 < a26 && (( a21 <= 127 && ((a24==1) && ((input == 6) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && -84 < a14 ))) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(( a21 <= 127 && ((a24==2) && ( ((124 < a26) && (217 >= a26)) && ( ((-114 < a14) && (-84 >= a14)) && ((input == 2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))))) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((( ((-68 < a26) && (124 >= a26)) && ((input == 6) && ((-182 < a14) && (-114 >= a14)) )) && 300 < a28 ) && (a24==3)) && a21 <= 127 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L352] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (((((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( ((37 < a28) && (134 >= a28)) && -84 < a14 )) && (input == 2)) && (a24==3)) && a21 <= 127 ))) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !(((a24==2) && (( ((-68 < a26) && (124 >= a26)) && (( -84 < a14 && (input == 3)) && a28 <= 37 )) && a21 <= 127 ))) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(( a21 <= 127 && (((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a14 <= -182 )) && ((124 < a26) && (217 >= a26)) ))) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((( a21 <= 127 && ((((a24==2) && (input == 5)) && ((134 < a28) && (300 >= a28)) ) && -84 < a14 )) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !(((((( 217 < a26 && (input == 2)) && a28 <= 37 ) && a21 <= 127 ) && (a24==3)) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && (((input == 3) && (( 300 < a28 && a14 <= -182 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && (a24==3))))) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L395] COND FALSE !(( ((134 < a28) && (300 >= a28)) && ((( a21 <= 127 && ((a24==2) && (input == 6))) && -84 < a14 ) && ((124 < a26) && (217 >= a26)) ))) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L402] COND FALSE !((( a21 <= 127 && ((a24==3) && ( ((124 < a26) && (217 >= a26)) && ((input == 6) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))) && -84 < a14 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L409] COND FALSE !((( a14 <= -182 && ((a24==2) && ( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 5))))) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L415] COND FALSE !(( a21 <= 127 && ((( ((124 < a26) && (217 >= a26)) && ((input == 6) && -84 < a14 )) && (a24==3)) && 300 < a28 ))) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L426] COND FALSE !(( a21 <= 127 && ((a24==3) && ( a26 <= -68 && (((input == 5) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && a14 <= -182 ))))) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L433] COND FALSE !(( 217 < a26 && ( a28 <= 37 && ( ((-182 < a14) && (-114 >= a14)) && (((input == 3) && (a24==3)) && a21 <= 127 ))))) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !(( a21 <= 127 && ((a24==2) && ( -84 < a14 && ( a26 <= -68 && ((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !((((a24==2) && ( a21 <= 127 && ((input == 5) && (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))))) && a26 <= -68 )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((a24==3) && (( ((-68 < a26) && (124 >= a26)) && (((input == 6) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && a21 <= 127 )) && ((-182 < a14) && (-114 >= a14)) ))) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L456] COND FALSE !(((( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 1)))) && (a24==2)) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L461] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && ((input == 3) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==2)))) VAL [a14=-101, a21=124, a24=2, a26=-554655, a28=156, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L468] COND TRUE ((a24==2) && (( ((-114 < a14) && (-84 >= a14)) && ( a26 <= -68 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 4)))) && a21 <= 127 )) [L469] a14 = (((a14 / 5) - 46740) - -32098) [L470] a26 = ((((a26 - 0) % 46)- -199) + -16) [L471] a28 = ((((a28 * 9)/ 10) + -35946) + -1966) [L472] return 25; VAL [\result=25, a14=-14662, a21=124, a24=2, a26=150, a28=-37772, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 ))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !(( 217 < a26 && (( a21 <= 127 && ((a24==1) && ((input == 6) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && -84 < a14 ))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(( a21 <= 127 && ((a24==2) && ( ((124 < a26) && (217 >= a26)) && ( ((-114 < a14) && (-84 >= a14)) && ((input == 2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((( ((-68 < a26) && (124 >= a26)) && ((input == 6) && ((-182 < a14) && (-114 >= a14)) )) && 300 < a28 ) && (a24==3)) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L352] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (((((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( ((37 < a28) && (134 >= a28)) && -84 < a14 )) && (input == 2)) && (a24==3)) && a21 <= 127 ))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !(((a24==2) && (( ((-68 < a26) && (124 >= a26)) && (( -84 < a14 && (input == 3)) && a28 <= 37 )) && a21 <= 127 ))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(( a21 <= 127 && (((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a14 <= -182 )) && ((124 < a26) && (217 >= a26)) ))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((( a21 <= 127 && ((((a24==2) && (input == 5)) && ((134 < a28) && (300 >= a28)) ) && -84 < a14 )) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !(((((( 217 < a26 && (input == 2)) && a28 <= 37 ) && a21 <= 127 ) && (a24==3)) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && (((input == 3) && (( 300 < a28 && a14 <= -182 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && (a24==3))))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L395] COND FALSE !(( ((134 < a28) && (300 >= a28)) && ((( a21 <= 127 && ((a24==2) && (input == 6))) && -84 < a14 ) && ((124 < a26) && (217 >= a26)) ))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L402] COND FALSE !((( a21 <= 127 && ((a24==3) && ( ((124 < a26) && (217 >= a26)) && ((input == 6) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))) && -84 < a14 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L409] COND FALSE !((( a14 <= -182 && ((a24==2) && ( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 5))))) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L415] COND FALSE !(( a21 <= 127 && ((( ((124 < a26) && (217 >= a26)) && ((input == 6) && -84 < a14 )) && (a24==3)) && 300 < a28 ))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L426] COND FALSE !(( a21 <= 127 && ((a24==3) && ( a26 <= -68 && (((input == 5) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && a14 <= -182 ))))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L433] COND FALSE !(( 217 < a26 && ( a28 <= 37 && ( ((-182 < a14) && (-114 >= a14)) && (((input == 3) && (a24==3)) && a21 <= 127 ))))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !(( a21 <= 127 && ((a24==2) && ( -84 < a14 && ( a26 <= -68 && ((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !((((a24==2) && ( a21 <= 127 && ((input == 5) && (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))))) && a26 <= -68 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((a24==3) && (( ((-68 < a26) && (124 >= a26)) && (((input == 6) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && a21 <= 127 )) && ((-182 < a14) && (-114 >= a14)) ))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L456] COND FALSE !(((( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 1)))) && (a24==2)) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L461] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && ((input == 3) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==2)))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L468] COND FALSE !(((a24==2) && (( ((-114 < a14) && (-84 >= a14)) && ( a26 <= -68 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 4)))) && a21 <= 127 ))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(( a14 <= -182 && (( a26 <= -68 && ((a24==3) && ((input == 2) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && a21 <= 127 ))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( a21 <= 127 && ((((( a14 <= -182 && a26 <= -68 ) && (a24==3)) && a28 <= 37 ) || ((((a24==2) && ( -84 < a14 && 217 < a26 )) && ((134 < a28) && (300 >= a28)) ) || (((a24==2) && ( -84 < a14 && 217 < a26 )) && 300 < a28 ))) && (input == 3)))) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L485] COND FALSE !(((((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && 217 < a26 ) && (a24==3)) && a14 <= -182 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND FALSE !((((a24==2) && ( -84 < a14 && ( ((37 < a28) && (134 >= a28)) && ( ((-68 < a26) && (124 >= a26)) && (input == 4))))) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=150, a28=-37772, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L496] COND TRUE (((( ((124 < a26) && (217 >= a26)) && ((input == 5) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && (a24==2)) && a21 <= 127 ) && a14 <= -182 ) [L497] a26 = (((a26 + -496055) - -804201) / 5) [L498] a28 = ((((a28 / 5) / 5) % 48)- -86) [L499] return 21; VAL [\result=21, a14=-14662, a21=124, a24=2, a26=61659, a28=64, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !(( 217 < a26 && (( a21 <= 127 && ((a24==1) && ((input == 6) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && -84 < a14 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(( a21 <= 127 && ((a24==2) && ( ((124 < a26) && (217 >= a26)) && ( ((-114 < a14) && (-84 >= a14)) && ((input == 2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((( ((-68 < a26) && (124 >= a26)) && ((input == 6) && ((-182 < a14) && (-114 >= a14)) )) && 300 < a28 ) && (a24==3)) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L352] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (((((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( ((37 < a28) && (134 >= a28)) && -84 < a14 )) && (input == 2)) && (a24==3)) && a21 <= 127 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !(((a24==2) && (( ((-68 < a26) && (124 >= a26)) && (( -84 < a14 && (input == 3)) && a28 <= 37 )) && a21 <= 127 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(( a21 <= 127 && (((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a14 <= -182 )) && ((124 < a26) && (217 >= a26)) ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((( a21 <= 127 && ((((a24==2) && (input == 5)) && ((134 < a28) && (300 >= a28)) ) && -84 < a14 )) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !(((((( 217 < a26 && (input == 2)) && a28 <= 37 ) && a21 <= 127 ) && (a24==3)) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && (((input == 3) && (( 300 < a28 && a14 <= -182 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && (a24==3))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L395] COND FALSE !(( ((134 < a28) && (300 >= a28)) && ((( a21 <= 127 && ((a24==2) && (input == 6))) && -84 < a14 ) && ((124 < a26) && (217 >= a26)) ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L402] COND FALSE !((( a21 <= 127 && ((a24==3) && ( ((124 < a26) && (217 >= a26)) && ((input == 6) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))) && -84 < a14 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L409] COND FALSE !((( a14 <= -182 && ((a24==2) && ( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 5))))) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L415] COND FALSE !(( a21 <= 127 && ((( ((124 < a26) && (217 >= a26)) && ((input == 6) && -84 < a14 )) && (a24==3)) && 300 < a28 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L426] COND FALSE !(( a21 <= 127 && ((a24==3) && ( a26 <= -68 && (((input == 5) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && a14 <= -182 ))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L433] COND FALSE !(( 217 < a26 && ( a28 <= 37 && ( ((-182 < a14) && (-114 >= a14)) && (((input == 3) && (a24==3)) && a21 <= 127 ))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !(( a21 <= 127 && ((a24==2) && ( -84 < a14 && ( a26 <= -68 && ((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !((((a24==2) && ( a21 <= 127 && ((input == 5) && (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))))) && a26 <= -68 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((a24==3) && (( ((-68 < a26) && (124 >= a26)) && (((input == 6) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && a21 <= 127 )) && ((-182 < a14) && (-114 >= a14)) ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L456] COND FALSE !(((( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 1)))) && (a24==2)) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L461] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && ((input == 3) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==2)))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L468] COND FALSE !(((a24==2) && (( ((-114 < a14) && (-84 >= a14)) && ( a26 <= -68 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 4)))) && a21 <= 127 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(( a14 <= -182 && (( a26 <= -68 && ((a24==3) && ((input == 2) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && a21 <= 127 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( a21 <= 127 && ((((( a14 <= -182 && a26 <= -68 ) && (a24==3)) && a28 <= 37 ) || ((((a24==2) && ( -84 < a14 && 217 < a26 )) && ((134 < a28) && (300 >= a28)) ) || (((a24==2) && ( -84 < a14 && 217 < a26 )) && 300 < a28 ))) && (input == 3)))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L485] COND FALSE !(((((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && 217 < a26 ) && (a24==3)) && a14 <= -182 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND FALSE !((((a24==2) && ( -84 < a14 && ( ((37 < a28) && (134 >= a28)) && ( ((-68 < a26) && (124 >= a26)) && (input == 4))))) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L496] COND FALSE !((((( ((124 < a26) && (217 >= a26)) && ((input == 5) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && (a24==2)) && a21 <= 127 ) && a14 <= -182 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !(( a21 <= 127 && ((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 6) && (( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ((((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))) && (input == 3)) && a21 <= 127 ) && (a24==3)))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L512] COND FALSE !(((a24==2) && ( 217 < a26 && (((input == 4) && (( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 )))) && a21 <= 127 )))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(( a21 <= 127 && ((( ((-114 < a14) && (-84 >= a14)) && ( ((124 < a26) && (217 >= a26)) && (input == 2))) && (a24==3)) && a28 <= 37 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 4)) && (a24==3)) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) ) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L531] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && ((a24==3) && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1)) && ((-114 < a14) && (-84 >= a14)) ))))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L542] COND FALSE !(((((a24==3) && ( a21 <= 127 && ((input == 1) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )))) && a14 <= -182 ) && 217 < a26 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L545] COND FALSE !(( a21 <= 127 && (((((input == 3) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (a24==2)) && ((-68 < a26) && (124 >= a26)) ) && ((-182 < a14) && (-114 >= a14)) ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L551] COND FALSE !((( a21 <= 127 && ((a24==3) && ((( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 5)))) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L557] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((((input == 6) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && a21 <= 127 ) && (a24==2))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L568] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && ((((a24==3) && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4))) && a26 <= -68 ) && a21 <= 127 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L575] COND FALSE !((((a24==2) && (((input == 2) && ((( ((134 < a28) && (300 >= a28)) && ((-182 < a14) && (-114 >= a14)) ) || ( ((-182 < a14) && (-114 >= a14)) && 300 < a28 )) || ( a28 <= 37 && ((-114 < a14) && (-84 >= a14)) ))) && a21 <= 127 )) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L580] COND FALSE !((((( -84 < a14 && ((input == 2) && a21 <= 127 )) && a26 <= -68 ) && (a24==2)) && ((37 < a28) && (134 >= a28)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L586] COND FALSE !((( a21 <= 127 && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 2)) && ((-182 < a14) && (-114 >= a14)) ))) && a26 <= -68 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L592] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && (((input == 3) && ((-68 < a26) && (124 >= a26)) ) && 300 < a28 ))) && (a24==2))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L597] COND FALSE !((( ((134 < a28) && (300 >= a28)) && ( a21 <= 127 && (((a24==2) && (input == 1)) && ((124 < a26) && (217 >= a26)) ))) && -84 < a14 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L604] COND FALSE !(((((a24==2) && ((input == 6) && (( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )))) && a26 <= -68 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L609] COND FALSE !((((((a24==2) && ( ((134 < a28) && (300 >= a28)) && (input == 2))) && 217 < a26 ) && a14 <= -182 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L616] COND FALSE !(( a28 <= 37 && (( 217 < a26 && ((a24==3) && ((input == 3) && a14 <= -182 ))) && a21 <= 127 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L628] COND FALSE !(( a21 <= 127 && (((a24==3) && (((input == 4) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && a14 <= -182 )) && a26 <= -68 ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L635] COND FALSE !((( a21 <= 127 && ( ((124 < a26) && (217 >= a26)) && ( a14 <= -182 && ((input == 1) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))) && (a24==2))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L644] COND FALSE !((((a24==2) && ( a21 <= 127 && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 6)) && a14 <= -182 ))) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L650] COND FALSE !(((((((a24==3) && (input == 5)) && 217 < a26 ) && a28 <= 37 ) && a14 <= -182 ) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L657] COND FALSE !(((( a21 <= 127 && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 2)) && (a24==3))) && ((-68 < a26) && (124 >= a26)) ) && a14 <= -182 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L663] COND FALSE !(( 217 < a26 && (((((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 4)) && a21 <= 127 ) && (a24==2)) && ((-114 < a14) && (-84 >= a14)) ))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L670] COND FALSE !((((a24==3) && ( ((-182 < a14) && (-114 >= a14)) && ( ((-68 < a26) && (124 >= a26)) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 2))))) && a21 <= 127 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L677] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 5))) && a26 <= -68 ) && a21 <= 127 ) && (a24==2))) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L683] COND FALSE !(((((a24==2) && ((( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 5))) && a21 <= 127 ) && a26 <= -68 )) VAL [a14=-14662, a21=124, a24=2, a26=61659, a28=64, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L689] COND TRUE ( ((37 < a28) && (134 >= a28)) && ( a21 <= 127 && ((( 217 < a26 && (input == 3)) && a14 <= -182 ) && (a24==2)))) [L690] a14 = (((a14 / -5) + 209000) + 129249) [L691] a26 = (((((a26 - 390752) - -126915) / 5) % 95)+ 29) [L692] a28 = (((a28 - -390078) * 1) + 42716) [L693] a24 = 1 [L695] return -1; VAL [\result=-1, a14=341181, a21=124, a24=1, a26=-31, a28=432858, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND TRUE (((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 ) VAL [a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] reach_error() VAL [a14=341181, a21=124, a24=1, a26=-31, a28=432858, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 528 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 63.9s, OverallIterations: 20, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 41.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 8659 SdHoareTripleChecker+Valid, 36.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8659 mSDsluCounter, 9595 SdHoareTripleChecker+Invalid, 30.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1132 mSDsCounter, 5691 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26805 IncrementalHoareTripleChecker+Invalid, 32497 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5691 mSolverCounterUnsat, 8463 mSDtfsCounter, 26805 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2191 GetRequests, 2156 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104916occurred in iteration=19, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 32539 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 7337 NumberOfCodeBlocks, 7337 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 7341 ConstructedInterpolants, 0 QuantifiedInterpolants, 21982 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2103 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 25 InterpolantComputations, 19 PerfectInterpolantSequences, 7360/7844 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-23 21:32:33,270 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