./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label25.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/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 ../sv-benchmarks/c/eca-rers2012/Problem15_label25.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 383c2dec5cb0add37b54a945b9d93707b021cbcb .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-29 04:57:53,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-29 04:57:53,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-29 04:57:53,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-29 04:57:53,401 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-29 04:57:53,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-29 04:57:53,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-29 04:57:53,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-29 04:57:53,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-29 04:57:53,418 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-29 04:57:53,419 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-29 04:57:53,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-29 04:57:53,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-29 04:57:53,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-29 04:57:53,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-29 04:57:53,430 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-29 04:57:53,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-29 04:57:53,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-29 04:57:53,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-29 04:57:53,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-29 04:57:53,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-29 04:57:53,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-29 04:57:53,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-29 04:57:53,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-29 04:57:53,456 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-29 04:57:53,456 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-29 04:57:53,456 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-29 04:57:53,457 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-29 04:57:53,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-29 04:57:53,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-29 04:57:53,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-29 04:57:53,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-29 04:57:53,462 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-29 04:57:53,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-29 04:57:53,464 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-29 04:57:53,465 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-29 04:57:53,465 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-29 04:57:53,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-29 04:57:53,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-29 04:57:53,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-29 04:57:53,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-29 04:57:53,472 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-29 04:57:53,506 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-29 04:57:53,507 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-29 04:57:53,508 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-29 04:57:53,508 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-29 04:57:53,510 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-29 04:57:53,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-29 04:57:53,510 INFO L138 SettingsManager]: * Use SBE=true [2021-08-29 04:57:53,511 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-29 04:57:53,511 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-29 04:57:53,511 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-29 04:57:53,512 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-29 04:57:53,512 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-29 04:57:53,512 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-29 04:57:53,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-29 04:57:53,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-29 04:57:53,513 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-29 04:57:53,513 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-29 04:57:53,513 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-29 04:57:53,514 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-29 04:57:53,514 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-29 04:57:53,514 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-29 04:57:53,514 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-29 04:57:53,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 04:57:53,515 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-29 04:57:53,515 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-29 04:57:53,515 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-29 04:57:53,515 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-29 04:57:53,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-29 04:57:53,516 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-29 04:57:53,516 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-29 04:57:53,516 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> 383c2dec5cb0add37b54a945b9d93707b021cbcb [2021-08-29 04:57:53,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-29 04:57:53,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-29 04:57:53,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-29 04:57:53,838 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-29 04:57:53,839 INFO L275 PluginConnector]: CDTParser initialized [2021-08-29 04:57:53,840 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label25.c [2021-08-29 04:57:53,899 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/615841b5c/cbbda6af67ab4b74bfa2a587aedf758c/FLAGbdcae5e01 [2021-08-29 04:57:54,487 INFO L306 CDTParser]: Found 1 translation units. [2021-08-29 04:57:54,490 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label25.c [2021-08-29 04:57:54,510 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/615841b5c/cbbda6af67ab4b74bfa2a587aedf758c/FLAGbdcae5e01 [2021-08-29 04:57:54,716 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/615841b5c/cbbda6af67ab4b74bfa2a587aedf758c [2021-08-29 04:57:54,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-29 04:57:54,721 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-29 04:57:54,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-29 04:57:54,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-29 04:57:54,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-29 04:57:54,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 04:57:54" (1/1) ... [2021-08-29 04:57:54,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bb0d0c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:57:54, skipping insertion in model container [2021-08-29 04:57:54,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 04:57:54" (1/1) ... [2021-08-29 04:57:54,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-29 04:57:54,802 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-29 04:57:54,937 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label25.c[3069,3082] [2021-08-29 04:57:55,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 04:57:55,377 INFO L203 MainTranslator]: Completed pre-run [2021-08-29 04:57:55,401 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label25.c[3069,3082] [2021-08-29 04:57:55,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 04:57:55,598 INFO L208 MainTranslator]: Completed translation [2021-08-29 04:57:55,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:57:55 WrapperNode [2021-08-29 04:57:55,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-29 04:57:55,601 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-29 04:57:55,601 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-29 04:57:55,601 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-29 04:57:55,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:57:55" (1/1) ... [2021-08-29 04:57:55,647 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:57:55" (1/1) ... [2021-08-29 04:57:55,873 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-29 04:57:55,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-29 04:57:55,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-29 04:57:55,874 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-29 04:57:55,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:57:55" (1/1) ... [2021-08-29 04:57:55,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:57:55" (1/1) ... [2021-08-29 04:57:55,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:57:55" (1/1) ... [2021-08-29 04:57:55,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:57:55" (1/1) ... [2021-08-29 04:57:56,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:57:55" (1/1) ... [2021-08-29 04:57:56,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:57:55" (1/1) ... [2021-08-29 04:57:56,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:57:55" (1/1) ... [2021-08-29 04:57:56,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-29 04:57:56,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-29 04:57:56,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-29 04:57:56,138 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-29 04:57:56,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:57:55" (1/1) ... [2021-08-29 04:57:56,145 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 04:57:56,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 04:57:56,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-29 04:57:56,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-29 04:57:56,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-29 04:57:56,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-29 04:57:56,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-29 04:57:56,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-29 04:57:57,317 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-29 04:57:57,318 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-08-29 04:57:57,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 04:57:57 BoogieIcfgContainer [2021-08-29 04:57:57,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-29 04:57:57,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-29 04:57:57,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-29 04:57:57,325 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-29 04:57:57,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 04:57:54" (1/3) ... [2021-08-29 04:57:57,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0f667a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 04:57:57, skipping insertion in model container [2021-08-29 04:57:57,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:57:55" (2/3) ... [2021-08-29 04:57:57,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0f667a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 04:57:57, skipping insertion in model container [2021-08-29 04:57:57,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 04:57:57" (3/3) ... [2021-08-29 04:57:57,328 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem15_label25.c [2021-08-29 04:57:57,332 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-29 04:57:57,332 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-29 04:57:57,383 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-29 04:57:57,390 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-08-29 04:57:57,391 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-29 04:57:57,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:57:57,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-29 04:57:57,428 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:57:57,429 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:57:57,429 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:57:57,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:57:57,439 INFO L82 PathProgramCache]: Analyzing trace with hash -593706766, now seen corresponding path program 1 times [2021-08-29 04:57:57,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:57:57,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91593927] [2021-08-29 04:57:57,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:57:57,448 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:57:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:57:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 04:57:57,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:57:57,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91593927] [2021-08-29 04:57:57,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91593927] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:57:57,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 04:57:57,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 04:57:57,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049018912] [2021-08-29 04:57:57,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 04:57:57,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:57:57,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 04:57:57,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:57:57,743 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:57:59,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:57:59,994 INFO L93 Difference]: Finished difference Result 1154 states and 2106 transitions. [2021-08-29 04:57:59,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 04:57:59,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-08-29 04:57:59,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:00,011 INFO L225 Difference]: With dead ends: 1154 [2021-08-29 04:58:00,012 INFO L226 Difference]: Without dead ends: 665 [2021-08-29 04:58:00,016 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.65ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:00,019 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 297 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1779.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.00ms SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2147.83ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:00,020 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 0 Invalid, 1613 Unknown, 0 Unchecked, 10.00ms Time], IncrementalHoareTripleChecker [254 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 2147.83ms Time] [2021-08-29 04:58:00,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2021-08-29 04:58:00,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2021-08-29 04:58:00,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.4818731117824773) internal successors, (981), 662 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 981 transitions. [2021-08-29 04:58:00,086 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 981 transitions. Word has length 24 [2021-08-29 04:58:00,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:00,087 INFO L470 AbstractCegarLoop]: Abstraction has 663 states and 981 transitions. [2021-08-29 04:58:00,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:00,087 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 981 transitions. [2021-08-29 04:58:00,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-29 04:58:00,089 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:00,090 INFO L513 BasicCegarLoop]: 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] [2021-08-29 04:58:00,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-29 04:58:00,090 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:00,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:00,091 INFO L82 PathProgramCache]: Analyzing trace with hash 850501261, now seen corresponding path program 1 times [2021-08-29 04:58:00,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:00,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147976586] [2021-08-29 04:58:00,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:00,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:00,254 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 04:58:00,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:00,255 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147976586] [2021-08-29 04:58:00,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147976586] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:58:00,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 04:58:00,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 04:58:00,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70542425] [2021-08-29 04:58:00,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 04:58:00,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:00,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 04:58:00,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:00,259 INFO L87 Difference]: Start difference. First operand 663 states and 981 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:02,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:58:02,108 INFO L93 Difference]: Finished difference Result 1624 states and 2315 transitions. [2021-08-29 04:58:02,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 04:58:02,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2021-08-29 04:58:02,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:02,113 INFO L225 Difference]: With dead ends: 1624 [2021-08-29 04:58:02,114 INFO L226 Difference]: Without dead ends: 963 [2021-08-29 04:58:02,115 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.49ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:02,116 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1548.48ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.57ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1805.22ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:02,117 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 0 Invalid, 1271 Unknown, 0 Unchecked, 3.57ms Time], IncrementalHoareTripleChecker [24 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 1805.22ms Time] [2021-08-29 04:58:02,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2021-08-29 04:58:02,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2021-08-29 04:58:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.362785862785863) internal successors, (1311), 962 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:02,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1311 transitions. [2021-08-29 04:58:02,163 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1311 transitions. Word has length 89 [2021-08-29 04:58:02,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:02,164 INFO L470 AbstractCegarLoop]: Abstraction has 963 states and 1311 transitions. [2021-08-29 04:58:02,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:02,164 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1311 transitions. [2021-08-29 04:58:02,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-29 04:58:02,166 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:02,167 INFO L513 BasicCegarLoop]: 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] [2021-08-29 04:58:02,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-29 04:58:02,167 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:02,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:02,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1384932644, now seen corresponding path program 1 times [2021-08-29 04:58:02,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:02,168 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892790656] [2021-08-29 04:58:02,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:02,168 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:02,287 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 04:58:02,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:02,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892790656] [2021-08-29 04:58:02,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892790656] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:58:02,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 04:58:02,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 04:58:02,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787144985] [2021-08-29 04:58:02,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 04:58:02,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:02,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 04:58:02,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:02,301 INFO L87 Difference]: Start difference. First operand 963 states and 1311 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:04,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:58:04,017 INFO L93 Difference]: Finished difference Result 2229 states and 3186 transitions. [2021-08-29 04:58:04,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 04:58:04,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2021-08-29 04:58:04,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:04,031 INFO L225 Difference]: With dead ends: 2229 [2021-08-29 04:58:04,031 INFO L226 Difference]: Without dead ends: 1567 [2021-08-29 04:58:04,032 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.54ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:04,033 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 256 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1370.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.35ms SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1673.40ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:04,034 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 0 Invalid, 1442 Unknown, 0 Unchecked, 3.35ms Time], IncrementalHoareTripleChecker [285 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 1673.40ms Time] [2021-08-29 04:58:04,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2021-08-29 04:58:04,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1266. [2021-08-29 04:58:04,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.3043478260869565) internal successors, (1650), 1265 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:04,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1650 transitions. [2021-08-29 04:58:04,059 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1650 transitions. Word has length 94 [2021-08-29 04:58:04,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:04,059 INFO L470 AbstractCegarLoop]: Abstraction has 1266 states and 1650 transitions. [2021-08-29 04:58:04,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1650 transitions. [2021-08-29 04:58:04,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2021-08-29 04:58:04,062 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:04,063 INFO L513 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:58:04,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-29 04:58:04,063 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:04,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:04,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1161972447, now seen corresponding path program 1 times [2021-08-29 04:58:04,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:04,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236492273] [2021-08-29 04:58:04,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:04,064 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:04,197 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 04:58:04,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:04,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236492273] [2021-08-29 04:58:04,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236492273] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:58:04,198 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 04:58:04,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 04:58:04,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510453239] [2021-08-29 04:58:04,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 04:58:04,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:04,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 04:58:04,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-29 04:58:04,200 INFO L87 Difference]: Start difference. First operand 1266 states and 1650 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:07,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:58:07,651 INFO L93 Difference]: Finished difference Result 4668 states and 6169 transitions. [2021-08-29 04:58:07,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 04:58:07,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 [2021-08-29 04:58:07,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:07,664 INFO L225 Difference]: With dead ends: 4668 [2021-08-29 04:58:07,664 INFO L226 Difference]: Without dead ends: 3404 [2021-08-29 04:58:07,666 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.47ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-29 04:58:07,676 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 485 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2654 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2879.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.51ms SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 2654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3372.91ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:07,678 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [485 Valid, 0 Invalid, 2924 Unknown, 0 Unchecked, 6.51ms Time], IncrementalHoareTripleChecker [270 Valid, 2654 Invalid, 0 Unknown, 0 Unchecked, 3372.91ms Time] [2021-08-29 04:58:07,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2021-08-29 04:58:07,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3381. [2021-08-29 04:58:07,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.2363905325443787) internal successors, (4179), 3380 states have internal predecessors, (4179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4179 transitions. [2021-08-29 04:58:07,759 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4179 transitions. Word has length 190 [2021-08-29 04:58:07,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:07,760 INFO L470 AbstractCegarLoop]: Abstraction has 3381 states and 4179 transitions. [2021-08-29 04:58:07,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:07,760 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4179 transitions. [2021-08-29 04:58:07,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-08-29 04:58:07,762 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:07,763 INFO L513 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:58:07,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-29 04:58:07,763 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:07,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:07,764 INFO L82 PathProgramCache]: Analyzing trace with hash 884632535, now seen corresponding path program 1 times [2021-08-29 04:58:07,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:07,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662646806] [2021-08-29 04:58:07,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:07,764 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-08-29 04:58:07,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:07,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662646806] [2021-08-29 04:58:07,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662646806] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:58:07,925 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 04:58:07,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 04:58:07,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031719656] [2021-08-29 04:58:07,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 04:58:07,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:07,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 04:58:07,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:07,927 INFO L87 Difference]: Start difference. First operand 3381 states and 4179 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:09,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:58:09,519 INFO L93 Difference]: Finished difference Result 8563 states and 10751 transitions. [2021-08-29 04:58:09,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 04:58:09,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 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 194 [2021-08-29 04:58:09,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:09,538 INFO L225 Difference]: With dead ends: 8563 [2021-08-29 04:58:09,538 INFO L226 Difference]: Without dead ends: 5483 [2021-08-29 04:58:09,543 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.46ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:09,544 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1316.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.67ms SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1538.79ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:09,544 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 0 Invalid, 1428 Unknown, 0 Unchecked, 1.67ms Time], IncrementalHoareTripleChecker [298 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 1538.79ms Time] [2021-08-29 04:58:09,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2021-08-29 04:58:09,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478. [2021-08-29 04:58:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1683403322987036) internal successors, (6399), 5477 states have internal predecessors, (6399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:09,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6399 transitions. [2021-08-29 04:58:09,635 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6399 transitions. Word has length 194 [2021-08-29 04:58:09,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:09,635 INFO L470 AbstractCegarLoop]: Abstraction has 5478 states and 6399 transitions. [2021-08-29 04:58:09,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:09,636 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6399 transitions. [2021-08-29 04:58:09,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2021-08-29 04:58:09,641 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:09,641 INFO L513 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:58:09,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-29 04:58:09,642 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:09,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:09,643 INFO L82 PathProgramCache]: Analyzing trace with hash 814797661, now seen corresponding path program 1 times [2021-08-29 04:58:09,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:09,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326967248] [2021-08-29 04:58:09,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:09,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:09,769 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-08-29 04:58:09,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:09,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326967248] [2021-08-29 04:58:09,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326967248] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:58:09,770 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 04:58:09,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 04:58:09,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380273261] [2021-08-29 04:58:09,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 04:58:09,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:09,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 04:58:09,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:09,773 INFO L87 Difference]: Start difference. First operand 5478 states and 6399 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:11,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:58:11,300 INFO L93 Difference]: Finished difference Result 10655 states and 12485 transitions. [2021-08-29 04:58:11,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 04:58:11,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 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 296 [2021-08-29 04:58:11,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:11,319 INFO L225 Difference]: With dead ends: 10655 [2021-08-29 04:58:11,319 INFO L226 Difference]: Without dead ends: 5478 [2021-08-29 04:58:11,326 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.13ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:11,326 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1237.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.56ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1471.07ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:11,327 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 0 Invalid, 1252 Unknown, 0 Unchecked, 1.56ms Time], IncrementalHoareTripleChecker [5 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 1471.07ms Time] [2021-08-29 04:58:11,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2021-08-29 04:58:11,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478. [2021-08-29 04:58:11,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1672448420668249) internal successors, (6393), 5477 states have internal predecessors, (6393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6393 transitions. [2021-08-29 04:58:11,406 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6393 transitions. Word has length 296 [2021-08-29 04:58:11,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:11,407 INFO L470 AbstractCegarLoop]: Abstraction has 5478 states and 6393 transitions. [2021-08-29 04:58:11,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:11,408 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6393 transitions. [2021-08-29 04:58:11,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2021-08-29 04:58:11,411 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:11,411 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:58:11,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-29 04:58:11,412 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:11,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:11,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1872879406, now seen corresponding path program 1 times [2021-08-29 04:58:11,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:11,413 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27458762] [2021-08-29 04:58:11,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:11,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-08-29 04:58:11,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:11,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27458762] [2021-08-29 04:58:11,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27458762] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:58:11,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 04:58:11,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 04:58:11,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479149111] [2021-08-29 04:58:11,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 04:58:11,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:11,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 04:58:11,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:11,528 INFO L87 Difference]: Start difference. First operand 5478 states and 6393 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:13,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:58:13,277 INFO L93 Difference]: Finished difference Result 11851 states and 14145 transitions. [2021-08-29 04:58:13,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 04:58:13,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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 311 [2021-08-29 04:58:13,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:13,296 INFO L225 Difference]: With dead ends: 11851 [2021-08-29 04:58:13,296 INFO L226 Difference]: Without dead ends: 6674 [2021-08-29 04:58:13,302 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.61ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:13,303 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 291 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1438.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.17ms SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1689.98ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:13,303 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 0 Invalid, 1436 Unknown, 0 Unchecked, 2.17ms Time], IncrementalHoareTripleChecker [206 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 1689.98ms Time] [2021-08-29 04:58:13,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6674 states. [2021-08-29 04:58:13,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6674 to 4577. [2021-08-29 04:58:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4577 states, 4576 states have (on average 1.1840034965034965) internal successors, (5418), 4576 states have internal predecessors, (5418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:13,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4577 states to 4577 states and 5418 transitions. [2021-08-29 04:58:13,393 INFO L78 Accepts]: Start accepts. Automaton has 4577 states and 5418 transitions. Word has length 311 [2021-08-29 04:58:13,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:13,394 INFO L470 AbstractCegarLoop]: Abstraction has 4577 states and 5418 transitions. [2021-08-29 04:58:13,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:13,395 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 5418 transitions. [2021-08-29 04:58:13,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2021-08-29 04:58:13,400 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:13,400 INFO L513 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:58:13,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-29 04:58:13,400 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:13,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:13,402 INFO L82 PathProgramCache]: Analyzing trace with hash 359147183, now seen corresponding path program 1 times [2021-08-29 04:58:13,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:13,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700004159] [2021-08-29 04:58:13,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:13,405 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-29 04:58:13,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:13,564 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700004159] [2021-08-29 04:58:13,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700004159] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:58:13,564 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 04:58:13,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 04:58:13,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944317448] [2021-08-29 04:58:13,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 04:58:13,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:13,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 04:58:13,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:13,566 INFO L87 Difference]: Start difference. First operand 4577 states and 5418 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:15,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:58:15,288 INFO L93 Difference]: Finished difference Result 10955 states and 13233 transitions. [2021-08-29 04:58:15,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 04:58:15,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 370 [2021-08-29 04:58:15,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:15,313 INFO L225 Difference]: With dead ends: 10955 [2021-08-29 04:58:15,313 INFO L226 Difference]: Without dead ends: 6679 [2021-08-29 04:58:15,319 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.57ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:15,320 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 304 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1420.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.72ms SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1667.90ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:15,320 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 0 Invalid, 1760 Unknown, 0 Unchecked, 1.72ms Time], IncrementalHoareTripleChecker [227 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 1667.90ms Time] [2021-08-29 04:58:15,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6679 states. [2021-08-29 04:58:15,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6679 to 6081. [2021-08-29 04:58:15,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6081 states, 6080 states have (on average 1.1572368421052632) internal successors, (7036), 6080 states have internal predecessors, (7036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:15,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6081 states to 6081 states and 7036 transitions. [2021-08-29 04:58:15,435 INFO L78 Accepts]: Start accepts. Automaton has 6081 states and 7036 transitions. Word has length 370 [2021-08-29 04:58:15,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:15,436 INFO L470 AbstractCegarLoop]: Abstraction has 6081 states and 7036 transitions. [2021-08-29 04:58:15,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:15,436 INFO L276 IsEmpty]: Start isEmpty. Operand 6081 states and 7036 transitions. [2021-08-29 04:58:15,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2021-08-29 04:58:15,441 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:15,442 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:58:15,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-29 04:58:15,443 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:15,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:15,443 INFO L82 PathProgramCache]: Analyzing trace with hash 872957315, now seen corresponding path program 1 times [2021-08-29 04:58:15,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:15,443 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477347919] [2021-08-29 04:58:15,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:15,444 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 04:58:15,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:15,564 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477347919] [2021-08-29 04:58:15,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477347919] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:58:15,565 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 04:58:15,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 04:58:15,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771819947] [2021-08-29 04:58:15,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 04:58:15,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:15,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 04:58:15,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:15,567 INFO L87 Difference]: Start difference. First operand 6081 states and 7036 transitions. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:17,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:58:17,231 INFO L93 Difference]: Finished difference Result 13965 states and 16476 transitions. [2021-08-29 04:58:17,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 04:58:17,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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 376 [2021-08-29 04:58:17,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:17,245 INFO L225 Difference]: With dead ends: 13965 [2021-08-29 04:58:17,245 INFO L226 Difference]: Without dead ends: 8185 [2021-08-29 04:58:17,252 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.45ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:17,253 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 250 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1335.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.64ms SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1598.31ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:17,253 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 0 Invalid, 1728 Unknown, 0 Unchecked, 1.64ms Time], IncrementalHoareTripleChecker [223 Valid, 1505 Invalid, 0 Unknown, 0 Unchecked, 1598.31ms Time] [2021-08-29 04:58:17,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8185 states. [2021-08-29 04:58:17,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8185 to 7883. [2021-08-29 04:58:17,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7883 states, 7882 states have (on average 1.1386703882263385) internal successors, (8975), 7882 states have internal predecessors, (8975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7883 states to 7883 states and 8975 transitions. [2021-08-29 04:58:17,366 INFO L78 Accepts]: Start accepts. Automaton has 7883 states and 8975 transitions. Word has length 376 [2021-08-29 04:58:17,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:17,367 INFO L470 AbstractCegarLoop]: Abstraction has 7883 states and 8975 transitions. [2021-08-29 04:58:17,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:17,368 INFO L276 IsEmpty]: Start isEmpty. Operand 7883 states and 8975 transitions. [2021-08-29 04:58:17,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2021-08-29 04:58:17,374 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:17,374 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:58:17,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-29 04:58:17,375 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:17,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:17,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1884992770, now seen corresponding path program 1 times [2021-08-29 04:58:17,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:17,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078298140] [2021-08-29 04:58:17,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:17,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:17,558 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-08-29 04:58:17,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:17,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078298140] [2021-08-29 04:58:17,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078298140] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:58:17,559 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 04:58:17,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 04:58:17,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979253432] [2021-08-29 04:58:17,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 04:58:17,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:17,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 04:58:17,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:17,561 INFO L87 Difference]: Start difference. First operand 7883 states and 8975 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:19,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:58:19,505 INFO L93 Difference]: Finished difference Result 17259 states and 20018 transitions. [2021-08-29 04:58:19,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 04:58:19,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 392 [2021-08-29 04:58:19,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:19,525 INFO L225 Difference]: With dead ends: 17259 [2021-08-29 04:58:19,525 INFO L226 Difference]: Without dead ends: 9677 [2021-08-29 04:58:19,533 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.47ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:19,534 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 245 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1571.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.88ms SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1858.18ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:19,535 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 0 Invalid, 1741 Unknown, 0 Unchecked, 1.88ms Time], IncrementalHoareTripleChecker [242 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 1858.18ms Time] [2021-08-29 04:58:19,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9677 states. [2021-08-29 04:58:19,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9677 to 9374. [2021-08-29 04:58:19,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9374 states, 9373 states have (on average 1.1290942067641097) internal successors, (10583), 9373 states have internal predecessors, (10583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9374 states to 9374 states and 10583 transitions. [2021-08-29 04:58:19,645 INFO L78 Accepts]: Start accepts. Automaton has 9374 states and 10583 transitions. Word has length 392 [2021-08-29 04:58:19,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:19,646 INFO L470 AbstractCegarLoop]: Abstraction has 9374 states and 10583 transitions. [2021-08-29 04:58:19,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:19,646 INFO L276 IsEmpty]: Start isEmpty. Operand 9374 states and 10583 transitions. [2021-08-29 04:58:19,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2021-08-29 04:58:19,655 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:19,656 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:58:19,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-29 04:58:19,657 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:19,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:19,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1562034219, now seen corresponding path program 1 times [2021-08-29 04:58:19,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:19,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084852924] [2021-08-29 04:58:19,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:19,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2021-08-29 04:58:19,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:19,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084852924] [2021-08-29 04:58:19,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084852924] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:58:19,813 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 04:58:19,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 04:58:19,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978657216] [2021-08-29 04:58:19,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 04:58:19,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:19,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 04:58:19,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:19,816 INFO L87 Difference]: Start difference. First operand 9374 states and 10583 transitions. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:21,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:58:21,404 INFO L93 Difference]: Finished difference Result 20838 states and 23816 transitions. [2021-08-29 04:58:21,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 04:58:21,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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 488 [2021-08-29 04:58:21,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:21,424 INFO L225 Difference]: With dead ends: 20838 [2021-08-29 04:58:21,424 INFO L226 Difference]: Without dead ends: 11765 [2021-08-29 04:58:21,434 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.61ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:21,435 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 391 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1297.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.97ms SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1509.90ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:21,435 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 0 Invalid, 1543 Unknown, 0 Unchecked, 1.97ms Time], IncrementalHoareTripleChecker [127 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 1509.90ms Time] [2021-08-29 04:58:21,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11765 states. [2021-08-29 04:58:21,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11765 to 11765. [2021-08-29 04:58:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11765 states, 11764 states have (on average 1.134308058483509) internal successors, (13344), 11764 states have internal predecessors, (13344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:21,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11765 states to 11765 states and 13344 transitions. [2021-08-29 04:58:21,574 INFO L78 Accepts]: Start accepts. Automaton has 11765 states and 13344 transitions. Word has length 488 [2021-08-29 04:58:21,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:21,575 INFO L470 AbstractCegarLoop]: Abstraction has 11765 states and 13344 transitions. [2021-08-29 04:58:21,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 11765 states and 13344 transitions. [2021-08-29 04:58:21,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2021-08-29 04:58:21,581 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:21,582 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:58:21,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-29 04:58:21,582 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:21,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:21,583 INFO L82 PathProgramCache]: Analyzing trace with hash 616687281, now seen corresponding path program 1 times [2021-08-29 04:58:21,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:21,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771035753] [2021-08-29 04:58:21,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:21,584 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:21,734 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-08-29 04:58:21,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:21,735 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771035753] [2021-08-29 04:58:21,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771035753] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:58:21,735 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 04:58:21,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 04:58:21,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019090964] [2021-08-29 04:58:21,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 04:58:21,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:21,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 04:58:21,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:21,737 INFO L87 Difference]: Start difference. First operand 11765 states and 13344 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:23,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:58:23,753 INFO L93 Difference]: Finished difference Result 28027 states and 32076 transitions. [2021-08-29 04:58:23,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 04:58:23,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 512 [2021-08-29 04:58:23,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:23,774 INFO L225 Difference]: With dead ends: 28027 [2021-08-29 04:58:23,774 INFO L226 Difference]: Without dead ends: 16563 [2021-08-29 04:58:23,786 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.85ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:23,787 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1628.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.17ms SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1907.78ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:23,787 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 0 Invalid, 1831 Unknown, 0 Unchecked, 2.17ms Time], IncrementalHoareTripleChecker [170 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 1907.78ms Time] [2021-08-29 04:58:23,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16563 states. [2021-08-29 04:58:23,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16563 to 15655. [2021-08-29 04:58:23,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15655 states, 15654 states have (on average 1.1269324134406542) internal successors, (17641), 15654 states have internal predecessors, (17641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:23,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15655 states to 15655 states and 17641 transitions. [2021-08-29 04:58:23,967 INFO L78 Accepts]: Start accepts. Automaton has 15655 states and 17641 transitions. Word has length 512 [2021-08-29 04:58:23,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:23,968 INFO L470 AbstractCegarLoop]: Abstraction has 15655 states and 17641 transitions. [2021-08-29 04:58:23,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:23,969 INFO L276 IsEmpty]: Start isEmpty. Operand 15655 states and 17641 transitions. [2021-08-29 04:58:23,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2021-08-29 04:58:23,978 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:23,979 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:58:23,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-29 04:58:23,980 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:23,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:23,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1811466623, now seen corresponding path program 1 times [2021-08-29 04:58:23,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:23,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40464200] [2021-08-29 04:58:23,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:23,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:24,240 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 540 proven. 39 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2021-08-29 04:58:24,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:24,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40464200] [2021-08-29 04:58:24,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40464200] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 04:58:24,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407048971] [2021-08-29 04:58:24,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:24,242 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 04:58:24,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 04:58:24,243 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) [2021-08-29 04:58:24,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-29 04:58:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:24,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-29 04:58:24,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 04:58:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 540 proven. 39 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2021-08-29 04:58:26,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 04:58:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 540 proven. 39 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2021-08-29 04:58:27,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407048971] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 04:58:27,981 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 04:58:27,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2021-08-29 04:58:27,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277568122] [2021-08-29 04:58:27,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-29 04:58:27,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:27,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-29 04:58:27,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-08-29 04:58:27,985 INFO L87 Difference]: Start difference. First operand 15655 states and 17641 transitions. Second operand has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:32,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:58:32,976 INFO L93 Difference]: Finished difference Result 39640 states and 44385 transitions. [2021-08-29 04:58:32,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-29 04:58:32,977 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 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 579 [2021-08-29 04:58:32,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:32,997 INFO L225 Difference]: With dead ends: 39640 [2021-08-29 04:58:32,997 INFO L226 Difference]: Without dead ends: 17149 [2021-08-29 04:58:33,012 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 1167 GetRequests, 1153 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 104.20ms TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2021-08-29 04:58:33,013 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 3067 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 5255 mSolverCounterSat, 724 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3962.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3067 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.42ms SdHoareTripleChecker+Time, 724 IncrementalHoareTripleChecker+Valid, 5255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4701.43ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:33,013 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [3067 Valid, 0 Invalid, 5979 Unknown, 0 Unchecked, 11.42ms Time], IncrementalHoareTripleChecker [724 Valid, 5255 Invalid, 0 Unknown, 0 Unchecked, 4701.43ms Time] [2021-08-29 04:58:33,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17149 states. [2021-08-29 04:58:33,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17149 to 12661. [2021-08-29 04:58:33,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12661 states, 12660 states have (on average 1.0669826224328594) internal successors, (13508), 12660 states have internal predecessors, (13508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:33,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12661 states to 12661 states and 13508 transitions. [2021-08-29 04:58:33,167 INFO L78 Accepts]: Start accepts. Automaton has 12661 states and 13508 transitions. Word has length 579 [2021-08-29 04:58:33,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:33,167 INFO L470 AbstractCegarLoop]: Abstraction has 12661 states and 13508 transitions. [2021-08-29 04:58:33,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:33,168 INFO L276 IsEmpty]: Start isEmpty. Operand 12661 states and 13508 transitions. [2021-08-29 04:58:33,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2021-08-29 04:58:33,174 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:33,175 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:58:33,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-29 04:58:33,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-08-29 04:58:33,393 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:33,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:33,394 INFO L82 PathProgramCache]: Analyzing trace with hash -351913856, now seen corresponding path program 1 times [2021-08-29 04:58:33,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:33,394 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995581703] [2021-08-29 04:58:33,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:33,394 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2021-08-29 04:58:33,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:33,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995581703] [2021-08-29 04:58:33,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995581703] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:58:33,558 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 04:58:33,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 04:58:33,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445551244] [2021-08-29 04:58:33,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 04:58:33,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:33,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 04:58:33,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:33,561 INFO L87 Difference]: Start difference. First operand 12661 states and 13508 transitions. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:34,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:58:34,522 INFO L93 Difference]: Finished difference Result 25318 states and 27024 transitions. [2021-08-29 04:58:34,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 04:58:34,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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 604 [2021-08-29 04:58:34,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:34,553 INFO L225 Difference]: With dead ends: 25318 [2021-08-29 04:58:34,553 INFO L226 Difference]: Without dead ends: 12958 [2021-08-29 04:58:34,559 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.50ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:34,560 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 437 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 709.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.15ms SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 846.36ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:34,560 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 0 Invalid, 888 Unknown, 0 Unchecked, 1.15ms Time], IncrementalHoareTripleChecker [81 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 846.36ms Time] [2021-08-29 04:58:34,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12958 states. [2021-08-29 04:58:34,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12958 to 12659. [2021-08-29 04:58:34,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12659 states, 12658 states have (on average 1.0668352030336545) internal successors, (13504), 12658 states have internal predecessors, (13504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:34,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12659 states to 12659 states and 13504 transitions. [2021-08-29 04:58:34,689 INFO L78 Accepts]: Start accepts. Automaton has 12659 states and 13504 transitions. Word has length 604 [2021-08-29 04:58:34,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:34,690 INFO L470 AbstractCegarLoop]: Abstraction has 12659 states and 13504 transitions. [2021-08-29 04:58:34,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:34,690 INFO L276 IsEmpty]: Start isEmpty. Operand 12659 states and 13504 transitions. [2021-08-29 04:58:34,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2021-08-29 04:58:34,697 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:34,699 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:58:34,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-29 04:58:34,700 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:34,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:34,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1658158704, now seen corresponding path program 1 times [2021-08-29 04:58:34,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:34,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440139841] [2021-08-29 04:58:34,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:34,701 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:34,866 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2021-08-29 04:58:34,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:34,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440139841] [2021-08-29 04:58:34,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440139841] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:58:34,866 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 04:58:34,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 04:58:34,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684584000] [2021-08-29 04:58:34,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 04:58:34,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:34,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 04:58:34,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:34,870 INFO L87 Difference]: Start difference. First operand 12659 states and 13504 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:36,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:58:36,033 INFO L93 Difference]: Finished difference Result 29201 states and 31213 transitions. [2021-08-29 04:58:36,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 04:58:36,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 625 [2021-08-29 04:58:36,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:36,054 INFO L225 Difference]: With dead ends: 29201 [2021-08-29 04:58:36,054 INFO L226 Difference]: Without dead ends: 16544 [2021-08-29 04:58:36,062 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.45ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:36,063 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 290 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 903.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.16ms SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1078.98ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:36,063 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 0 Invalid, 1413 Unknown, 0 Unchecked, 1.16ms Time], IncrementalHoareTripleChecker [120 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 1078.98ms Time] [2021-08-29 04:58:36,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16544 states. [2021-08-29 04:58:36,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16544 to 15647. [2021-08-29 04:58:36,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15647 states, 15646 states have (on average 1.056755720311901) internal successors, (16534), 15646 states have internal predecessors, (16534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:36,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15647 states to 15647 states and 16534 transitions. [2021-08-29 04:58:36,253 INFO L78 Accepts]: Start accepts. Automaton has 15647 states and 16534 transitions. Word has length 625 [2021-08-29 04:58:36,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:36,254 INFO L470 AbstractCegarLoop]: Abstraction has 15647 states and 16534 transitions. [2021-08-29 04:58:36,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 15647 states and 16534 transitions. [2021-08-29 04:58:36,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2021-08-29 04:58:36,263 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:36,264 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:58:36,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-29 04:58:36,264 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:36,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:36,265 INFO L82 PathProgramCache]: Analyzing trace with hash -277862202, now seen corresponding path program 1 times [2021-08-29 04:58:36,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:36,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859918355] [2021-08-29 04:58:36,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:36,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2021-08-29 04:58:36,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:36,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859918355] [2021-08-29 04:58:36,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859918355] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:58:36,444 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 04:58:36,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 04:58:36,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255607872] [2021-08-29 04:58:36,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 04:58:36,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:36,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 04:58:36,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:36,446 INFO L87 Difference]: Start difference. First operand 15647 states and 16534 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:37,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:58:37,441 INFO L93 Difference]: Finished difference Result 33980 states and 35967 transitions. [2021-08-29 04:58:37,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 04:58:37,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 649 [2021-08-29 04:58:37,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:37,457 INFO L225 Difference]: With dead ends: 33980 [2021-08-29 04:58:37,458 INFO L226 Difference]: Without dead ends: 18335 [2021-08-29 04:58:37,468 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.37ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:37,469 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 317 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 747.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.14ms SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 898.22ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:37,469 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 0 Invalid, 1070 Unknown, 0 Unchecked, 1.14ms Time], IncrementalHoareTripleChecker [115 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 898.22ms Time] [2021-08-29 04:58:37,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18335 states. [2021-08-29 04:58:37,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18335 to 17736. [2021-08-29 04:58:37,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17736 states, 17735 states have (on average 1.0518748237947562) internal successors, (18655), 17735 states have internal predecessors, (18655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17736 states to 17736 states and 18655 transitions. [2021-08-29 04:58:37,710 INFO L78 Accepts]: Start accepts. Automaton has 17736 states and 18655 transitions. Word has length 649 [2021-08-29 04:58:37,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:37,710 INFO L470 AbstractCegarLoop]: Abstraction has 17736 states and 18655 transitions. [2021-08-29 04:58:37,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:37,711 INFO L276 IsEmpty]: Start isEmpty. Operand 17736 states and 18655 transitions. [2021-08-29 04:58:37,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2021-08-29 04:58:37,720 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:37,721 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:58:37,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-29 04:58:37,721 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:37,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:37,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1628041968, now seen corresponding path program 1 times [2021-08-29 04:58:37,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:37,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218280032] [2021-08-29 04:58:37,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:37,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:37,919 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2021-08-29 04:58:37,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:37,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218280032] [2021-08-29 04:58:37,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218280032] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:58:37,920 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 04:58:37,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 04:58:37,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676331865] [2021-08-29 04:58:37,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 04:58:37,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:37,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 04:58:37,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:37,922 INFO L87 Difference]: Start difference. First operand 17736 states and 18655 transitions. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:38,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:58:38,940 INFO L93 Difference]: Finished difference Result 35163 states and 36991 transitions. [2021-08-29 04:58:38,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 04:58:38,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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 649 [2021-08-29 04:58:38,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:38,963 INFO L225 Difference]: With dead ends: 35163 [2021-08-29 04:58:38,963 INFO L226 Difference]: Without dead ends: 17429 [2021-08-29 04:58:38,975 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.45ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:38,976 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 303 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 754.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.02ms SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 917.07ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:38,977 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 0 Invalid, 1346 Unknown, 0 Unchecked, 1.02ms Time], IncrementalHoareTripleChecker [101 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 917.07ms Time] [2021-08-29 04:58:38,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17429 states. [2021-08-29 04:58:39,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17429 to 16830. [2021-08-29 04:58:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16830 states, 16829 states have (on average 1.0295917761007785) internal successors, (17327), 16829 states have internal predecessors, (17327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:39,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16830 states to 16830 states and 17327 transitions. [2021-08-29 04:58:39,240 INFO L78 Accepts]: Start accepts. Automaton has 16830 states and 17327 transitions. Word has length 649 [2021-08-29 04:58:39,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:39,240 INFO L470 AbstractCegarLoop]: Abstraction has 16830 states and 17327 transitions. [2021-08-29 04:58:39,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:39,242 INFO L276 IsEmpty]: Start isEmpty. Operand 16830 states and 17327 transitions. [2021-08-29 04:58:39,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2021-08-29 04:58:39,250 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:39,250 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:58:39,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-29 04:58:39,251 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:39,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:39,251 INFO L82 PathProgramCache]: Analyzing trace with hash 132430898, now seen corresponding path program 1 times [2021-08-29 04:58:39,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:39,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90521529] [2021-08-29 04:58:39,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:39,252 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:39,549 INFO L134 CoverageAnalysis]: Checked inductivity of 721 backedges. 509 proven. 190 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-08-29 04:58:39,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:39,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90521529] [2021-08-29 04:58:39,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90521529] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 04:58:39,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364246404] [2021-08-29 04:58:39,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:39,551 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 04:58:39,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 04:58:39,553 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) [2021-08-29 04:58:39,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-29 04:58:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:39,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-29 04:58:39,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 04:58:41,023 INFO L134 CoverageAnalysis]: Checked inductivity of 721 backedges. 446 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2021-08-29 04:58:41,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-29 04:58:41,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364246404] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:58:41,024 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-29 04:58:41,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2021-08-29 04:58:41,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653870636] [2021-08-29 04:58:41,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 04:58:41,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:41,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 04:58:41,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-29 04:58:41,026 INFO L87 Difference]: Start difference. First operand 16830 states and 17327 transitions. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:42,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:58:42,628 INFO L93 Difference]: Finished difference Result 36954 states and 38095 transitions. [2021-08-29 04:58:42,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 04:58:42,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 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 656 [2021-08-29 04:58:42,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:42,646 INFO L225 Difference]: With dead ends: 36954 [2021-08-29 04:58:42,646 INFO L226 Difference]: Without dead ends: 20425 [2021-08-29 04:58:42,655 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 654 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 24.79ms TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-29 04:58:42,656 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 191 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1231.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.64ms SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1484.83ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:42,656 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 0 Invalid, 1479 Unknown, 0 Unchecked, 1.64ms Time], IncrementalHoareTripleChecker [92 Valid, 1387 Invalid, 0 Unknown, 0 Unchecked, 1484.83ms Time] [2021-08-29 04:58:42,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20425 states. [2021-08-29 04:58:42,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20425 to 19224. [2021-08-29 04:58:42,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19224 states, 19223 states have (on average 1.0300161265151122) internal successors, (19800), 19223 states have internal predecessors, (19800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:42,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19224 states to 19224 states and 19800 transitions. [2021-08-29 04:58:42,818 INFO L78 Accepts]: Start accepts. Automaton has 19224 states and 19800 transitions. Word has length 656 [2021-08-29 04:58:42,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:42,818 INFO L470 AbstractCegarLoop]: Abstraction has 19224 states and 19800 transitions. [2021-08-29 04:58:42,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:42,819 INFO L276 IsEmpty]: Start isEmpty. Operand 19224 states and 19800 transitions. [2021-08-29 04:58:42,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2021-08-29 04:58:42,825 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:42,825 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:58:42,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-08-29 04:58:43,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-08-29 04:58:43,028 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:43,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:43,029 INFO L82 PathProgramCache]: Analyzing trace with hash -477030220, now seen corresponding path program 1 times [2021-08-29 04:58:43,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:43,029 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905595224] [2021-08-29 04:58:43,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:43,030 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2021-08-29 04:58:43,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:43,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905595224] [2021-08-29 04:58:43,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905595224] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:58:43,261 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 04:58:43,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 04:58:43,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683826086] [2021-08-29 04:58:43,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 04:58:43,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:43,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 04:58:43,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-29 04:58:43,264 INFO L87 Difference]: Start difference. First operand 19224 states and 19800 transitions. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:44,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:58:44,748 INFO L93 Difference]: Finished difference Result 42940 states and 44266 transitions. [2021-08-29 04:58:44,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 04:58:44,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 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 693 [2021-08-29 04:58:44,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:44,769 INFO L225 Difference]: With dead ends: 42940 [2021-08-29 04:58:44,769 INFO L226 Difference]: Without dead ends: 24017 [2021-08-29 04:58:44,779 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.66ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-29 04:58:44,780 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 480 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1141.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.65ms SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1370.20ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:44,780 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [480 Valid, 0 Invalid, 1497 Unknown, 0 Unchecked, 1.65ms Time], IncrementalHoareTripleChecker [97 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 1370.20ms Time] [2021-08-29 04:58:44,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24017 states. [2021-08-29 04:58:45,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24017 to 19224. [2021-08-29 04:58:45,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19224 states, 19223 states have (on average 1.0300161265151122) internal successors, (19800), 19223 states have internal predecessors, (19800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:45,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19224 states to 19224 states and 19800 transitions. [2021-08-29 04:58:45,046 INFO L78 Accepts]: Start accepts. Automaton has 19224 states and 19800 transitions. Word has length 693 [2021-08-29 04:58:45,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:45,046 INFO L470 AbstractCegarLoop]: Abstraction has 19224 states and 19800 transitions. [2021-08-29 04:58:45,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:45,047 INFO L276 IsEmpty]: Start isEmpty. Operand 19224 states and 19800 transitions. [2021-08-29 04:58:45,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2021-08-29 04:58:45,057 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:45,057 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:58:45,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-29 04:58:45,058 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:45,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:45,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1705420050, now seen corresponding path program 1 times [2021-08-29 04:58:45,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:45,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756739942] [2021-08-29 04:58:45,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:45,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2021-08-29 04:58:45,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:45,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756739942] [2021-08-29 04:58:45,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756739942] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:58:45,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 04:58:45,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 04:58:45,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011635392] [2021-08-29 04:58:45,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 04:58:45,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:45,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 04:58:45,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:45,283 INFO L87 Difference]: Start difference. First operand 19224 states and 19800 transitions. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:46,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:58:46,227 INFO L93 Difference]: Finished difference Result 40849 states and 42068 transitions. [2021-08-29 04:58:46,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 04:58:46,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 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 733 [2021-08-29 04:58:46,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:46,247 INFO L225 Difference]: With dead ends: 40849 [2021-08-29 04:58:46,247 INFO L226 Difference]: Without dead ends: 21926 [2021-08-29 04:58:46,259 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.48ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:46,259 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 349 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 688.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.04ms SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 836.43ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:46,260 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [349 Valid, 0 Invalid, 1030 Unknown, 0 Unchecked, 1.04ms Time], IncrementalHoareTripleChecker [124 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 836.43ms Time] [2021-08-29 04:58:46,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21926 states. [2021-08-29 04:58:46,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21926 to 19221. [2021-08-29 04:58:46,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19221 states, 19220 states have (on average 1.0285119667013527) internal successors, (19768), 19220 states have internal predecessors, (19768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19221 states to 19221 states and 19768 transitions. [2021-08-29 04:58:46,461 INFO L78 Accepts]: Start accepts. Automaton has 19221 states and 19768 transitions. Word has length 733 [2021-08-29 04:58:46,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:46,462 INFO L470 AbstractCegarLoop]: Abstraction has 19221 states and 19768 transitions. [2021-08-29 04:58:46,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:46,462 INFO L276 IsEmpty]: Start isEmpty. Operand 19221 states and 19768 transitions. [2021-08-29 04:58:46,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2021-08-29 04:58:46,470 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:46,470 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:58:46,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-29 04:58:46,470 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:46,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:46,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1164873992, now seen corresponding path program 1 times [2021-08-29 04:58:46,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:46,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980731241] [2021-08-29 04:58:46,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:46,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 567 proven. 188 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2021-08-29 04:58:46,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:46,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980731241] [2021-08-29 04:58:46,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980731241] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 04:58:46,735 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592713847] [2021-08-29 04:58:46,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:46,735 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 04:58:46,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 04:58:46,741 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) [2021-08-29 04:58:46,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-29 04:58:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:46,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-29 04:58:46,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 04:58:48,199 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-08-29 04:58:48,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-29 04:58:48,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592713847] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:58:48,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-29 04:58:48,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2021-08-29 04:58:48,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895252335] [2021-08-29 04:58:48,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 04:58:48,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:48,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 04:58:48,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-29 04:58:48,202 INFO L87 Difference]: Start difference. First operand 19221 states and 19768 transitions. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:49,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:58:49,858 INFO L93 Difference]: Finished difference Result 46231 states and 47510 transitions. [2021-08-29 04:58:49,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 04:58:49,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 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 746 [2021-08-29 04:58:49,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:49,885 INFO L225 Difference]: With dead ends: 46231 [2021-08-29 04:58:49,885 INFO L226 Difference]: Without dead ends: 27311 [2021-08-29 04:58:49,898 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 749 GetRequests, 744 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 23.60ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-29 04:58:49,899 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 508 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1288.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.55ms SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1533.56ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:49,899 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [508 Valid, 0 Invalid, 1844 Unknown, 0 Unchecked, 1.55ms Time], IncrementalHoareTripleChecker [172 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 1533.56ms Time] [2021-08-29 04:58:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27311 states. [2021-08-29 04:58:50,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27311 to 23413. [2021-08-29 04:58:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23413 states, 23412 states have (on average 1.0279343926191697) internal successors, (24066), 23412 states have internal predecessors, (24066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:50,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23413 states to 23413 states and 24066 transitions. [2021-08-29 04:58:50,255 INFO L78 Accepts]: Start accepts. Automaton has 23413 states and 24066 transitions. Word has length 746 [2021-08-29 04:58:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:50,256 INFO L470 AbstractCegarLoop]: Abstraction has 23413 states and 24066 transitions. [2021-08-29 04:58:50,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 23413 states and 24066 transitions. [2021-08-29 04:58:50,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2021-08-29 04:58:50,274 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:50,275 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-08-29 04:58:50,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-29 04:58:50,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 04:58:50,486 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:50,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:50,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1400261556, now seen corresponding path program 1 times [2021-08-29 04:58:50,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:50,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047127427] [2021-08-29 04:58:50,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:50,487 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1011 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2021-08-29 04:58:50,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:50,757 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047127427] [2021-08-29 04:58:50,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047127427] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:58:50,757 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 04:58:50,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 04:58:50,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911212908] [2021-08-29 04:58:50,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 04:58:50,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:50,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 04:58:50,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-29 04:58:50,759 INFO L87 Difference]: Start difference. First operand 23413 states and 24066 transitions. Second operand has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:52,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:58:52,690 INFO L93 Difference]: Finished difference Result 59102 states and 60644 transitions. [2021-08-29 04:58:52,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 04:58:52,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 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 850 [2021-08-29 04:58:52,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:52,724 INFO L225 Difference]: With dead ends: 59102 [2021-08-29 04:58:52,724 INFO L226 Difference]: Without dead ends: 35990 [2021-08-29 04:58:52,734 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 5.51ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-29 04:58:52,735 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 806 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 2038 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1381.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.30ms SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 2038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1671.40ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:52,735 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [806 Valid, 0 Invalid, 2227 Unknown, 0 Unchecked, 2.30ms Time], IncrementalHoareTripleChecker [189 Valid, 2038 Invalid, 0 Unknown, 0 Unchecked, 1671.40ms Time] [2021-08-29 04:58:52,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35990 states. [2021-08-29 04:58:52,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35990 to 19520. [2021-08-29 04:58:52,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19520 states, 19519 states have (on average 1.027767815974179) internal successors, (20061), 19519 states have internal predecessors, (20061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:53,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19520 states to 19520 states and 20061 transitions. [2021-08-29 04:58:53,002 INFO L78 Accepts]: Start accepts. Automaton has 19520 states and 20061 transitions. Word has length 850 [2021-08-29 04:58:53,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:53,003 INFO L470 AbstractCegarLoop]: Abstraction has 19520 states and 20061 transitions. [2021-08-29 04:58:53,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:53,003 INFO L276 IsEmpty]: Start isEmpty. Operand 19520 states and 20061 transitions. [2021-08-29 04:58:53,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 859 [2021-08-29 04:58:53,019 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:53,020 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:58:53,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-29 04:58:53,020 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:53,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:53,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1301092927, now seen corresponding path program 1 times [2021-08-29 04:58:53,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:53,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419338243] [2021-08-29 04:58:53,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:53,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 652 proven. 188 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-08-29 04:58:53,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:53,343 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419338243] [2021-08-29 04:58:53,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419338243] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 04:58:53,343 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996320358] [2021-08-29 04:58:53,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:53,343 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 04:58:53,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 04:58:53,344 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) [2021-08-29 04:58:53,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-29 04:58:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:53,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-29 04:58:53,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 04:58:55,001 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 750 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-08-29 04:58:55,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-29 04:58:55,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996320358] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:58:55,001 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-29 04:58:55,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-08-29 04:58:55,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896515071] [2021-08-29 04:58:55,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 04:58:55,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:55,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 04:58:55,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-29 04:58:55,003 INFO L87 Difference]: Start difference. First operand 19520 states and 20061 transitions. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:55,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:58:55,951 INFO L93 Difference]: Finished difference Result 41748 states and 42894 transitions. [2021-08-29 04:58:55,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 04:58:55,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 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 858 [2021-08-29 04:58:55,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:55,972 INFO L225 Difference]: With dead ends: 41748 [2021-08-29 04:58:55,973 INFO L226 Difference]: Without dead ends: 22529 [2021-08-29 04:58:55,983 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 861 GetRequests, 857 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.99ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-29 04:58:55,984 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 260 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 713.24ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.96ms SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 854.71ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:55,984 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 0 Invalid, 1020 Unknown, 0 Unchecked, 0.96ms Time], IncrementalHoareTripleChecker [78 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 854.71ms Time] [2021-08-29 04:58:55,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22529 states. [2021-08-29 04:58:56,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22529 to 19520. [2021-08-29 04:58:56,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19520 states, 19519 states have (on average 1.0276653517085916) internal successors, (20059), 19519 states have internal predecessors, (20059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:56,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19520 states to 19520 states and 20059 transitions. [2021-08-29 04:58:56,137 INFO L78 Accepts]: Start accepts. Automaton has 19520 states and 20059 transitions. Word has length 858 [2021-08-29 04:58:56,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:56,137 INFO L470 AbstractCegarLoop]: Abstraction has 19520 states and 20059 transitions. [2021-08-29 04:58:56,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:56,138 INFO L276 IsEmpty]: Start isEmpty. Operand 19520 states and 20059 transitions. [2021-08-29 04:58:56,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 871 [2021-08-29 04:58:56,148 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:56,149 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:58:56,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-29 04:58:56,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 04:58:56,350 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:56,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:56,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1903145191, now seen corresponding path program 1 times [2021-08-29 04:58:56,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:56,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106583219] [2021-08-29 04:58:56,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:56,351 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2021-08-29 04:58:56,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:56,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106583219] [2021-08-29 04:58:56,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106583219] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:58:56,653 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 04:58:56,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 04:58:56,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67577772] [2021-08-29 04:58:56,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 04:58:56,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:56,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 04:58:56,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 04:58:56,656 INFO L87 Difference]: Start difference. First operand 19520 states and 20059 transitions. Second operand has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:58,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:58:58,733 INFO L93 Difference]: Finished difference Result 54989 states and 56462 transitions. [2021-08-29 04:58:58,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 04:58:58,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 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 870 [2021-08-29 04:58:58,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:58:58,762 INFO L225 Difference]: With dead ends: 54989 [2021-08-29 04:58:58,762 INFO L226 Difference]: Without dead ends: 35770 [2021-08-29 04:58:58,776 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.86ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 04:58:58,776 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 374 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1563.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.30ms SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1902.02ms IncrementalHoareTripleChecker+Time [2021-08-29 04:58:58,777 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 0 Invalid, 2493 Unknown, 0 Unchecked, 6.30ms Time], IncrementalHoareTripleChecker [110 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 1902.02ms Time] [2021-08-29 04:58:58,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35770 states. [2021-08-29 04:58:58,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35770 to 19820. [2021-08-29 04:58:58,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19820 states, 19819 states have (on average 1.027347494828195) internal successors, (20361), 19819 states have internal predecessors, (20361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:58,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19820 states to 19820 states and 20361 transitions. [2021-08-29 04:58:58,986 INFO L78 Accepts]: Start accepts. Automaton has 19820 states and 20361 transitions. Word has length 870 [2021-08-29 04:58:58,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:58:58,987 INFO L470 AbstractCegarLoop]: Abstraction has 19820 states and 20361 transitions. [2021-08-29 04:58:58,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:58:58,987 INFO L276 IsEmpty]: Start isEmpty. Operand 19820 states and 20361 transitions. [2021-08-29 04:58:58,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 892 [2021-08-29 04:58:58,999 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:58:58,999 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:58:58,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-29 04:58:59,000 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:58:59,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:58:59,000 INFO L82 PathProgramCache]: Analyzing trace with hash 372208260, now seen corresponding path program 1 times [2021-08-29 04:58:59,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:58:59,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239978765] [2021-08-29 04:58:59,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:58:59,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:58:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:58:59,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 645 proven. 0 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2021-08-29 04:58:59,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:58:59,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239978765] [2021-08-29 04:58:59,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239978765] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 04:58:59,207 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 04:58:59,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 04:58:59,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962023350] [2021-08-29 04:58:59,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 04:58:59,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:58:59,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 04:58:59,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:58:59,210 INFO L87 Difference]: Start difference. First operand 19820 states and 20361 transitions. Second operand has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:59:00,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:59:00,094 INFO L93 Difference]: Finished difference Result 31817 states and 32680 transitions. [2021-08-29 04:59:00,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 04:59:00,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 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 891 [2021-08-29 04:59:00,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:59:00,105 INFO L225 Difference]: With dead ends: 31817 [2021-08-29 04:59:00,105 INFO L226 Difference]: Without dead ends: 12298 [2021-08-29 04:59:00,115 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.40ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 04:59:00,116 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 337 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 658.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.14ms SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 798.33ms IncrementalHoareTripleChecker+Time [2021-08-29 04:59:00,116 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 0 Invalid, 1115 Unknown, 0 Unchecked, 1.14ms Time], IncrementalHoareTripleChecker [81 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 798.33ms Time] [2021-08-29 04:59:00,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12298 states. [2021-08-29 04:59:00,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12298 to 11102. [2021-08-29 04:59:00,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11102 states, 11101 states have (on average 1.019187460589136) internal successors, (11314), 11101 states have internal predecessors, (11314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:59:00,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11102 states to 11102 states and 11314 transitions. [2021-08-29 04:59:00,205 INFO L78 Accepts]: Start accepts. Automaton has 11102 states and 11314 transitions. Word has length 891 [2021-08-29 04:59:00,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:59:00,206 INFO L470 AbstractCegarLoop]: Abstraction has 11102 states and 11314 transitions. [2021-08-29 04:59:00,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:59:00,206 INFO L276 IsEmpty]: Start isEmpty. Operand 11102 states and 11314 transitions. [2021-08-29 04:59:00,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2021-08-29 04:59:00,217 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:59:00,217 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:59:00,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-29 04:59:00,218 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:59:00,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:59:00,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1838174761, now seen corresponding path program 1 times [2021-08-29 04:59:00,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:59:00,219 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885776055] [2021-08-29 04:59:00,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:59:00,219 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:59:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:59:00,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 686 proven. 193 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2021-08-29 04:59:00,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 04:59:00,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885776055] [2021-08-29 04:59:00,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885776055] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 04:59:00,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857748547] [2021-08-29 04:59:00,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:59:00,542 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 04:59:00,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 04:59:00,548 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 04:59:00,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-29 04:59:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 04:59:00,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-29 04:59:00,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 04:59:02,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 729 proven. 106 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2021-08-29 04:59:02,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 04:59:06,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 729 proven. 106 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2021-08-29 04:59:06,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857748547] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 04:59:06,693 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 04:59:06,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2021-08-29 04:59:06,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567925705] [2021-08-29 04:59:06,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-29 04:59:06,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 04:59:06,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-29 04:59:06,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-08-29 04:59:06,696 INFO L87 Difference]: Start difference. First operand 11102 states and 11314 transitions. Second operand has 9 states, 9 states have (on average 132.44444444444446) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:59:11,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 04:59:11,299 INFO L93 Difference]: Finished difference Result 27021 states and 27520 transitions. [2021-08-29 04:59:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-29 04:59:11,299 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 132.44444444444446) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 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 906 [2021-08-29 04:59:11,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 04:59:11,312 INFO L225 Difference]: With dead ends: 27021 [2021-08-29 04:59:11,312 INFO L226 Difference]: Without dead ends: 16220 [2021-08-29 04:59:11,316 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 1827 GetRequests, 1809 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 265.05ms TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2021-08-29 04:59:11,317 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 5297 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 5950 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3462.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5297 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.15ms SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 5950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4137.23ms IncrementalHoareTripleChecker+Time [2021-08-29 04:59:11,317 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [5297 Valid, 0 Invalid, 6383 Unknown, 0 Unchecked, 13.15ms Time], IncrementalHoareTripleChecker [433 Valid, 5950 Invalid, 0 Unknown, 0 Unchecked, 4137.23ms Time] [2021-08-29 04:59:11,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16220 states. [2021-08-29 04:59:11,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16220 to 12000. [2021-08-29 04:59:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12000 states, 11999 states have (on average 1.017751479289941) internal successors, (12212), 11999 states have internal predecessors, (12212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:59:11,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12000 states to 12000 states and 12212 transitions. [2021-08-29 04:59:11,423 INFO L78 Accepts]: Start accepts. Automaton has 12000 states and 12212 transitions. Word has length 906 [2021-08-29 04:59:11,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 04:59:11,424 INFO L470 AbstractCegarLoop]: Abstraction has 12000 states and 12212 transitions. [2021-08-29 04:59:11,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 132.44444444444446) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 04:59:11,424 INFO L276 IsEmpty]: Start isEmpty. Operand 12000 states and 12212 transitions. [2021-08-29 04:59:11,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 919 [2021-08-29 04:59:11,436 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 04:59:11,437 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 04:59:11,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-29 04:59:11,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-08-29 04:59:11,646 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 04:59:11,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 04:59:11,646 INFO L82 PathProgramCache]: Analyzing trace with hash 2089011481, now seen corresponding path program 1 times [2021-08-29 04:59:11,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 04:59:11,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389775448] [2021-08-29 04:59:11,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 04:59:11,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 04:59:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 04:59:11,829 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-29 04:59:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 04:59:12,351 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-29 04:59:12,351 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-29 04:59:12,352 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-08-29 04:59:12,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-29 04:59:12,359 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-29 04:59:12,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 04:59:12 BoogieIcfgContainer [2021-08-29 04:59:12,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-29 04:59:12,665 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-29 04:59:12,665 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-29 04:59:12,665 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-29 04:59:12,665 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 04:57:57" (3/4) ... [2021-08-29 04:59:12,667 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-29 04:59:12,997 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-29 04:59:12,998 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-29 04:59:12,999 INFO L158 Benchmark]: Toolchain (without parser) took 78277.35ms. Allocated memory was 62.9MB in the beginning and 1.5GB in the end (delta: 1.5GB). Free memory was 38.0MB in the beginning and 599.1MB in the end (delta: -561.0MB). Peak memory consumption was 917.0MB. Max. memory is 16.1GB. [2021-08-29 04:59:12,999 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 62.9MB. Free memory was 43.9MB in the beginning and 43.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 04:59:12,999 INFO L158 Benchmark]: CACSL2BoogieTranslator took 877.75ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 37.9MB in the beginning and 43.3MB in the end (delta: -5.4MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2021-08-29 04:59:12,999 INFO L158 Benchmark]: Boogie Procedure Inliner took 272.64ms. Allocated memory was 75.5MB in the beginning and 115.3MB in the end (delta: 39.8MB). Free memory was 43.3MB in the beginning and 61.9MB in the end (delta: -18.6MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2021-08-29 04:59:13,000 INFO L158 Benchmark]: Boogie Preprocessor took 262.17ms. Allocated memory is still 115.3MB. Free memory was 61.9MB in the beginning and 54.4MB in the end (delta: 7.6MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2021-08-29 04:59:13,000 INFO L158 Benchmark]: RCFGBuilder took 1182.90ms. Allocated memory was 115.3MB in the beginning and 230.7MB in the end (delta: 115.3MB). Free memory was 54.4MB in the beginning and 110.4MB in the end (delta: -56.1MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. [2021-08-29 04:59:13,000 INFO L158 Benchmark]: TraceAbstraction took 75342.11ms. Allocated memory was 230.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 109.4MB in the beginning and 718.6MB in the end (delta: -609.2MB). Peak memory consumption was 702.6MB. Max. memory is 16.1GB. [2021-08-29 04:59:13,003 INFO L158 Benchmark]: Witness Printer took 333.15ms. Allocated memory is still 1.5GB. Free memory was 718.6MB in the beginning and 599.1MB in the end (delta: 119.5MB). Peak memory consumption was 117.4MB. Max. memory is 16.1GB. [2021-08-29 04:59:13,011 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 62.9MB. Free memory was 43.9MB in the beginning and 43.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 877.75ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 37.9MB in the beginning and 43.3MB in the end (delta: -5.4MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 272.64ms. Allocated memory was 75.5MB in the beginning and 115.3MB in the end (delta: 39.8MB). Free memory was 43.3MB in the beginning and 61.9MB in the end (delta: -18.6MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 262.17ms. Allocated memory is still 115.3MB. Free memory was 61.9MB in the beginning and 54.4MB in the end (delta: 7.6MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1182.90ms. Allocated memory was 115.3MB in the beginning and 230.7MB in the end (delta: 115.3MB). Free memory was 54.4MB in the beginning and 110.4MB in the end (delta: -56.1MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. * TraceAbstraction took 75342.11ms. Allocated memory was 230.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 109.4MB in the beginning and 718.6MB in the end (delta: -609.2MB). Peak memory consumption was 702.6MB. Max. memory is 16.1GB. * Witness Printer took 333.15ms. Allocated memory is still 1.5GB. Free memory was 718.6MB in the beginning and 599.1MB in the end (delta: 119.5MB). Peak memory consumption was 117.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 89]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int inputD = 4; [L19] int inputB = 2; [L20] int inputE = 5; [L21] int inputA = 1; [L22] int inputF = 6; [L23] int inputC = 3; [L26] int a4 = -89; [L27] int a29 = -127; [L28] int a2 = 1; [L29] int a0 = -44; VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1773] int output = -1; VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1776] COND TRUE 1 [L1779] int input; [L1780] input = __VERIFIER_nondet_int() [L1781] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L34] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((((a2==1) && a4 <= -86 ) && -61 < a0 ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L218] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 1) && (((a2==3) && a29 <= -144 ) || (((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2)))))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L229] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==2) && ( a29 <= -144 && (input == 3))) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((( a0 <= -147 && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==4)))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !(((((a2==3) && ((input == 3) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && -61 < a0 ) && a4 <= -86 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !(((((input == 5) && (( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (( 43 < a29 && (a2==1)) || ((a2==2) && a29 <= -144 )))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L263] COND FALSE !(((((( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((( -61 < a0 && ((((a2==3) && a29 <= -144 ) || (( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ( 43 < a29 && (a2==2)))) && (input == 2))) && a4 <= -86 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !(((((a2==4) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((((input == 4) && 43 < a29 ) && (a2==1)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L288] COND FALSE !((( -61 < a0 && (((( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 1))) && a4 <= -86 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L295] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==3))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L302] COND FALSE !((((a2==2) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !((((((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !(((a2==4) && ( -61 < a0 && ( a4 <= -86 && ((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !((((((input == 3) && -61 < a0 ) && a4 <= -86 ) && ((-16 < a29) && (43 >= a29)) ) && (a2==5))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L337] COND FALSE !(((a2==1) && ( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L343] COND FALSE !((( -61 < a0 && ( 43 < a29 && ((input == 4) && (a2==5)))) && a4 <= -86 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L346] COND FALSE !(((((((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==3) && 43 < a29 ) || ( a29 <= -144 && (a2==4)))) && (input == 5)) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(( 43 < a29 && (( -61 < a0 && ( a4 <= -86 && (input == 1))) && (a2==5)))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !((( a4 <= -86 && ( 43 < a29 && ((input == 2) && -61 < a0 ))) && (a2==3))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L371] COND FALSE !(((((input == 6) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !((((( ((-98 < a0) && (-61 >= a0)) && (input == 3)) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !(((( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L390] COND FALSE !(((( a4 <= -86 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1))) && (a2==1)) && -61 < a0 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( -61 < a0 && ((( 43 < a29 && (input == 6)) && (a2==5)) && a4 <= -86 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 3) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (a2==5))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && ((-86 < a4) && (-42 >= a4)) )) && (a2==4))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && (a2==4))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !((((((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 ) && (input == 6)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((a2==3) && (((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) && (a2==5))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==3) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((((a2==3) && (( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2))) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L455] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && (a2==5)) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) )) && (a2==4))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(((((((a2==5) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 ))) && (input == 2)) && a4 <= -86 ) && -61 < a0 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L472] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (( ((-98 < a0) && (-61 >= a0)) && (input == 6)) && (a2==2))) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && ( a4 <= -86 && (((input == 6) && -61 < a0 ) && (a2==5))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L484] COND FALSE !((( ((-16 < a29) && (43 >= a29)) && (((input == 4) && -61 < a0 ) && a4 <= -86 )) && (a2==5))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 5) && ((( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ((a2==2) && 43 < a29 )) || ( a29 <= -144 && (a2==3))))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L496] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && (((input == 1) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==2))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L501] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 6) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && (a2==2))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((input == 3) && ((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L512] COND FALSE !(((( a0 <= -147 && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-98 < a0) && (-61 >= a0)) ) && (a2==1))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( a29 <= -144 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 3) && (a2==5)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L530] COND FALSE !(((a2==4) && ( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && a0 <= -147 )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L539] COND FALSE !((((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L552] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && ( a0 <= -147 && ( ((-16 < a29) && (43 >= a29)) && (input == 5)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L556] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( a0 <= -147 && ((( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2)))) && (input == 4))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L567] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==2) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)) && ((-98 < a0) && (-61 >= a0)) )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==5) && ( 43 < a29 && (input == 3)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L584] COND FALSE !(( -61 < a0 && ( a4 <= -86 && (((a2==3) && (input == 4)) && 43 < a29 )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L597] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 )) || ((a2==2) && a29 <= -144 )) && (input == 6))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L604] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L616] COND FALSE !((((a2==2) && (( ((-144 < a29) && (-16 >= a29)) && (input == 1)) && ((-86 < a4) && (-42 >= a4)) )) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L623] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 6) && (((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L630] COND FALSE !(((((a2==1) && ((input == 5) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L637] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )))) && (a2==2))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L644] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && (( a0 <= -147 && (input == 2)) && 43 < a29 )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L651] COND FALSE !(((a2==1) && ( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) && a0 <= -147 )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L662] COND FALSE !(((((a2==1) && ((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L667] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==1) && ((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L672] COND FALSE !(( a0 <= -147 && ((a2==2) && ( ((-86 < a4) && (-42 >= a4)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 2)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L678] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ((((( 43 < a29 && (a2==2)) || ((a2==3) && a29 <= -144 )) || ((a2==3) && ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L685] COND FALSE !(((((a2==5) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L691] COND FALSE !(((a2==2) && ( ((-98 < a0) && (-61 >= a0)) && (( a29 <= -144 && (input == 1)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L697] COND FALSE !(((( a4 <= -86 && ( -61 < a0 && (input == 5))) && (a2==5)) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L703] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 6)) && (a2==4)) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L717] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 4)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ((-98 < a0) && (-61 >= a0)) )) && a29 <= -144 ) && (a2==2))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L728] COND FALSE !(((a2==1) && ((((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L735] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((((a2==4) && 43 < a29 ) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 3))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L742] COND FALSE !((((a2==5) && (((input == 5) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L745] COND FALSE !(((( ((-16 < a29) && (43 >= a29)) && ((input == 1) && ((-147 < a0) && (-98 >= a0)) )) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L752] COND FALSE !((( a4 <= -86 && ((input == 6) && ((((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ((a2==2) && 43 < a29 )) || ((a2==3) && a29 <= -144 )))) && -61 < a0 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L758] COND FALSE !(((( -61 < a0 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 5))) && a4 <= -86 ) && (a2==3))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L764] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==2)) || ((a2==3) && a29 <= -144 ))) && (input == 5))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L771] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 6) && ((-86 < a4) && (-42 >= a4)) ) && (a2==1)) && 43 < a29 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L778] COND FALSE !(( a0 <= -147 && ((((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L784] COND FALSE !(((((a2==1) && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L789] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((a2==4) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L796] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 4) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L803] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 && (a2==2)) || (( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 ))) && (input == 4))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L814] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && (( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L821] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && (a2==2))) && a0 <= -147 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L827] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==3) && ( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L834] COND FALSE !(((a2==5) && ((( a0 <= -147 && (input == 5)) && 43 < a29 ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L839] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && (( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && (input == 3))) && a0 <= -147 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L850] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((a2==4) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L855] COND FALSE !((( a4 <= -86 && ((input == 3) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) )))) && -61 < a0 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L861] COND FALSE !(((a2==4) && ((((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L865] COND FALSE !(((a2==5) && ((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L872] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) && 43 < a29 ) || ( a29 <= -144 && (a2==3)))) && (input == 1))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L878] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && a0 <= -147 ) && (a2==5)))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L884] COND FALSE !(( a4 <= -86 && ( -61 < a0 && ((input == 5) && ((( 43 < a29 && (a2==4)) || ( a29 <= -144 && (a2==5))) || ((a2==5) && ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L890] COND FALSE !(((a2==3) && ( a4 <= -86 && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1)) && -61 < a0 )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L895] COND FALSE !(((a2==5) && ((((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L905] COND FALSE !((((( -61 < a0 && (input == 2)) && 43 < a29 ) && a4 <= -86 ) && (a2==5))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L911] COND FALSE !((((((input == 1) && (a2==1)) && 43 < a29 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L917] COND FALSE !(((((a2==2) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L922] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 6) && 43 < a29 ) && (a2==2))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L929] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && (a2==3)))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L935] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 1) && (a2==5)) && ((-86 < a4) && (-42 >= a4)) )) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L940] COND FALSE !((((a2==1) && ( a0 <= -147 && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 6)))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L945] COND FALSE !(((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==4))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L952] COND FALSE !((((a2==1) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L958] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && ((input == 5) && (a2==2)))) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L965] COND FALSE !((( -61 < a0 && ((a2==1) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)))) && a4 <= -86 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L969] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((((((a2==1) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )) && (input == 5)) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L976] COND FALSE !((((( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && ((-16 < a29) && (43 >= a29)) ) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L983] COND FALSE !(( a4 <= -86 && ((( 43 < a29 && (input == 5)) && -61 < a0 ) && (a2==3)))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L989] COND FALSE !((((a2==4) && ( a4 <= -86 && ((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )))) && -61 < a0 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L995] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 6)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==1)))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1002] COND FALSE !(((((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6)) && ((-86 < a4) && (-42 >= a4)) ) && (a2==2)) && a0 <= -147 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1008] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && (a2==4))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1014] COND FALSE !((((((input == 1) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) ) && (a2==5)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1021] COND FALSE !(((( ((-98 < a0) && (-61 >= a0)) && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1026] COND FALSE !((((a2==4) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1029] COND FALSE !((((a2==2) && (( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) )) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1036] COND FALSE !(((a2==5) && ( ((-86 < a4) && (-42 >= a4)) && (( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && a29 <= -144 )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1040] COND FALSE !(( a4 <= -86 && ((((((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2))) || ((a2==3) && a29 <= -144 )) && (input == 3)) && -61 < a0 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1045] COND FALSE !(((a2==2) && ( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 1)) && a0 <= -147 )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1048] COND FALSE !(( a0 <= -147 && ((((((a2==3) && 43 < a29 ) || ( a29 <= -144 && (a2==4))) || ((a2==4) && ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1054] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (( a0 <= -147 && ((a2==5) && (input == 1))) && 43 < a29 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1059] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) )) && (a2==5))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1072] COND FALSE !((((a2==2) && (((input == 4) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1084] COND FALSE !((((((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1091] COND FALSE !(( a4 <= -86 && (((input == 6) && ((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) ))) && -61 < a0 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1096] COND FALSE !(((a2==1) && (( 43 < a29 && ((input == 2) && ((-98 < a0) && (-61 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1101] COND FALSE !((((((input == 4) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && a4 <= -86 ) && (a2==3)) && -61 < a0 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1108] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==4))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1118] COND FALSE !(((a2==2) && (((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1125] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1132] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && (((input == 2) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && (a2==5))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1138] COND FALSE !(( 43 < a29 && ( a4 <= -86 && ( -61 < a0 && ((a2==3) && (input == 3)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1144] COND FALSE !((((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) ) && (a2==3))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1155] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( a0 <= -147 && ((( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (( 43 < a29 && (a2==1)) || ((a2==2) && a29 <= -144 ))) && (input == 1))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1160] COND FALSE !(((a2==4) && ((((input == 3) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1166] COND FALSE !(((a2==4) && ((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 1)) && a4 <= -86 ) && -61 < a0 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1172] COND FALSE !((((a2==4) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 4)) && ((-98 < a0) && (-61 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1178] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ( 43 < a29 && ((input == 3) && (a2==1)))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1182] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((a2==1) && ( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1188] COND FALSE !(( a0 <= -147 && (((((a2==2) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2)))) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1194] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 2) && (a2==2))) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1200] COND FALSE !((((( ((-98 < a0) && (-61 >= a0)) && (input == 2)) && a29 <= -144 ) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1207] COND FALSE !((((a2==5) && ( -61 < a0 && ((input == 5) && 43 < a29 ))) && a4 <= -86 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1213] COND FALSE !((((( a0 <= -147 && (input == 6)) && (a2==5)) && 43 < a29 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1218] COND FALSE !(( 43 < a29 && ((((input == 4) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1222] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && ((a2==1) && ((input == 3) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1228] COND FALSE !(( -61 < a0 && (((input == 1) && ((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2)))) && a4 <= -86 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1234] COND FALSE !(((( ((-98 < a0) && (-61 >= a0)) && ((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1241] COND FALSE !(((a2==3) && (( ((-98 < a0) && (-61 >= a0)) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1247] COND FALSE !(( -61 < a0 && ((((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2))) && (input == 2)) && a4 <= -86 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1253] COND FALSE !(((((input == 1) && (( a29 <= -144 && (a2==2)) || (( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 )))) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1259] COND FALSE !(((( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && (input == 3))) && (a2==5)) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1265] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 5)) && a0 <= -147 )) && (a2==3))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1271] COND FALSE !(((a2==2) && ((((input == 3) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1274] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && (input == 2))) && (a2==5)) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1281] COND FALSE !((( -61 < a0 && ((input == 5) && ((((a2==1) && 43 < a29 ) || ((a2==2) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2))))) && a4 <= -86 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1287] COND FALSE !(((a2==1) && ((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1293] COND FALSE !(((( ((-147 < a0) && (-98 >= a0)) && ((a2==2) && (input == 6))) && ((-86 < a4) && (-42 >= a4)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1299] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ( 43 < a29 && (((a2==2) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1310] COND FALSE !(((((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ) && (a2==3))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1316] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && (( ((-86 < a4) && (-42 >= a4)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 4))) && (a2==3)))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1323] COND FALSE !(((a2==1) && (((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 6)) && a4 <= -86 ) && -61 < a0 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1327] COND FALSE !(( -61 < a0 && ( a4 <= -86 && (((input == 5) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && (a2==1))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1331] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((((input == 5) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-98 < a0) && (-61 >= a0)) ) && (a2==4)))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1343] COND FALSE !((( a0 <= -147 && (((input == 1) && ((-86 < a4) && (-42 >= a4)) ) && (a2==1))) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1348] COND FALSE !((( -61 < a0 && ((((a2==5) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 ))) && (input == 6))) && a4 <= -86 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1354] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ((a2==5) && (((input == 4) && ( 43 < a29 || ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1360] COND FALSE !((( a0 <= -147 && (((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==4))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1369] COND FALSE !(((((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 6)) && a4 <= -86 ) && (a2==3)) && -61 < a0 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1375] COND FALSE !((((((input == 6) && a29 <= -144 ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1381] COND FALSE !((((((input == 4) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) && a0 <= -147 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1388] COND FALSE !(( -61 < a0 && (((a2==3) && ( a4 <= -86 && (input == 1))) && 43 < a29 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1395] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 6) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && (a2==5))) && a0 <= -147 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1398] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((a2==4) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 4)))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1404] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 5)) && ((-98 < a0) && (-61 >= a0)) )) && (a2==3))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1418] COND FALSE !(( a4 <= -86 && ((((((a2==1) && 43 < a29 ) || ((a2==2) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2))) && (input == 4)) && -61 < a0 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1423] COND FALSE !((((a2==3) && (((input == 5) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1429] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && (((a2==3) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1441] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((a2==2) && ( ((-144 < a29) && (-16 >= a29)) && (input == 5)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1448] COND FALSE !(((((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) && 43 < a29 ) || ((a2==3) && a29 <= -144 ))) && (input == 6)) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1459] COND FALSE !(((a2==3) && ( ((-147 < a0) && (-98 >= a0)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1466] COND FALSE !(((((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 1)) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1471] COND FALSE !(((a2==2) && (( ((-98 < a0) && (-61 >= a0)) && ((input == 5) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1476] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 5)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1483] COND FALSE !(((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 1)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==4))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1488] COND FALSE !((((((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1492] COND FALSE !((( a0 <= -147 && ((input == 3) && ((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1498] COND FALSE !(( -61 < a0 && (((input == 4) && (( ((-144 < a29) && (-16 >= a29)) && (a2==5)) || (((a2==4) && 43 < a29 ) || ((a2==5) && a29 <= -144 )))) && a4 <= -86 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1504] COND FALSE !(((a2==4) && ( ((-147 < a0) && (-98 >= a0)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 5)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1511] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 1)) && (a2==4))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1518] COND FALSE !((((( ((-86 < a4) && (-42 >= a4)) && (input == 5)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==2)) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1521] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==2) && (( 43 < a29 && (input == 1)) && ((-98 < a0) && (-61 >= a0)) )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1526] COND FALSE !(((a2==5) && ( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1532] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 1)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1538] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && (((a2==1) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 1))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1543] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((((((a2==2) && 43 < a29 ) || ((a2==3) && a29 <= -144 )) || ((a2==3) && ((-144 < a29) && (-16 >= a29)) )) && (input == 3)) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1550] COND FALSE !(( a0 <= -147 && ((((a2==1) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ) && ((-16 < a29) && (43 >= a29)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1557] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && ( ((-147 < a0) && (-98 >= a0)) && ((a2==2) && ((input == 2) && ((-86 < a4) && (-42 >= a4)) ))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1564] COND FALSE !((((a2==1) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)) && a4 <= -86 )) && -61 < a0 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1569] COND FALSE !(((a2==4) && (( ((-86 < a4) && (-42 >= a4)) && ((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1576] COND FALSE !((( a0 <= -147 && (((input == 6) && ((-86 < a4) && (-42 >= a4)) ) && (a2==1))) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1580] COND FALSE !(( a4 <= -86 && (((((a2==3) && a29 <= -144 ) || (((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2)))) && (input == 4)) && -61 < a0 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1592] COND FALSE !(( ((-144 < a29) && (-16 >= a29)) && ((a2==2) && (( ((-86 < a4) && (-42 >= a4)) && (input == 6)) && ((-147 < a0) && (-98 >= a0)) )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1599] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) && (a2==4))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1605] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 1)) && a0 <= -147 )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1612] COND FALSE !(((( ((-16 < a29) && (43 >= a29)) && ( ((-86 < a4) && (-42 >= a4)) && (input == 2))) && a0 <= -147 ) && (a2==1))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1616] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) && (input == 3)) && (a2==2))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1622] COND FALSE !(((a2==3) && ( ((-98 < a0) && (-61 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1633] COND FALSE !(( a4 <= -86 && (( -61 < a0 && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 6))) && (a2==4)))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1639] COND FALSE !(( a4 <= -86 && ( ((-16 < a29) && (43 >= a29)) && (( -61 < a0 && (input == 2)) && (a2==5))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1645] COND TRUE (((a2==1) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && a4 <= -86 )) && -61 < a0 ) [L1646] a29 = (((a29 / 5) / 5) + 4459) [L1647] a2 = 2 [L1649] return 22; VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1784] output = calculate_output(input) [L1776] COND TRUE 1 [L1779] int input; [L1780] input = __VERIFIER_nondet_int() [L1781] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L34] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((((a2==1) && a4 <= -86 ) && -61 < a0 ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L218] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 1) && (((a2==3) && a29 <= -144 ) || (((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2)))))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L229] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==2) && ( a29 <= -144 && (input == 3))) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((( a0 <= -147 && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==4)))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !(((((a2==3) && ((input == 3) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && -61 < a0 ) && a4 <= -86 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !(((((input == 5) && (( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (( 43 < a29 && (a2==1)) || ((a2==2) && a29 <= -144 )))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L263] COND FALSE !(((((( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((( -61 < a0 && ((((a2==3) && a29 <= -144 ) || (( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ( 43 < a29 && (a2==2)))) && (input == 2))) && a4 <= -86 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !(((((a2==4) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((((input == 4) && 43 < a29 ) && (a2==1)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L288] COND FALSE !((( -61 < a0 && (((( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 1))) && a4 <= -86 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L295] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==3))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L302] COND FALSE !((((a2==2) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !((((((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !(((a2==4) && ( -61 < a0 && ( a4 <= -86 && ((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !((((((input == 3) && -61 < a0 ) && a4 <= -86 ) && ((-16 < a29) && (43 >= a29)) ) && (a2==5))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L337] COND FALSE !(((a2==1) && ( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L343] COND FALSE !((( -61 < a0 && ( 43 < a29 && ((input == 4) && (a2==5)))) && a4 <= -86 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L346] COND FALSE !(((((((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==3) && 43 < a29 ) || ( a29 <= -144 && (a2==4)))) && (input == 5)) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(( 43 < a29 && (( -61 < a0 && ( a4 <= -86 && (input == 1))) && (a2==5)))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !((( a4 <= -86 && ( 43 < a29 && ((input == 2) && -61 < a0 ))) && (a2==3))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L371] COND FALSE !(((((input == 6) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !((((( ((-98 < a0) && (-61 >= a0)) && (input == 3)) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !(((( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L390] COND FALSE !(((( a4 <= -86 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1))) && (a2==1)) && -61 < a0 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( -61 < a0 && ((( 43 < a29 && (input == 6)) && (a2==5)) && a4 <= -86 ))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 3) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (a2==5))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && ((-86 < a4) && (-42 >= a4)) )) && (a2==4))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && (a2==4))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !((((((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 ) && (input == 6)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((a2==3) && (((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) && (a2==5))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==3) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((((a2==3) && (( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2))) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L455] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && (a2==5)) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) )) && (a2==4))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(((((((a2==5) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 ))) && (input == 2)) && a4 <= -86 ) && -61 < a0 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L472] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (( ((-98 < a0) && (-61 >= a0)) && (input == 6)) && (a2==2))) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && ( a4 <= -86 && (((input == 6) && -61 < a0 ) && (a2==5))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L484] COND FALSE !((( ((-16 < a29) && (43 >= a29)) && (((input == 4) && -61 < a0 ) && a4 <= -86 )) && (a2==5))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND TRUE ( -61 < a0 && ( a4 <= -86 && ((input == 5) && ((( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ((a2==2) && 43 < a29 )) || ( a29 <= -144 && (a2==3)))))) [L490] a4 = (((((a4 % 21)+ -47) + 367614) + 116418) + -484038) [L491] a0 = ((((a0 / 5) / 5) % 24)+ -122) [L492] a29 = (((a29 / 5) + 298882) - 164223) [L493] a2 = 3 [L495] return 21; VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1784] output = calculate_output(input) [L1776] COND TRUE 1 [L1779] int input; [L1780] input = __VERIFIER_nondet_int() [L1781] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L34] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((((a2==1) && a4 <= -86 ) && -61 < a0 ) && a29 <= -144 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L218] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 1) && (((a2==3) && a29 <= -144 ) || (((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2)))))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L229] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==2) && ( a29 <= -144 && (input == 3))) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((( a0 <= -147 && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==4)))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !(((((a2==3) && ((input == 3) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && -61 < a0 ) && a4 <= -86 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !(((((input == 5) && (( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (( 43 < a29 && (a2==1)) || ((a2==2) && a29 <= -144 )))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L263] COND FALSE !(((((( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((( -61 < a0 && ((((a2==3) && a29 <= -144 ) || (( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ( 43 < a29 && (a2==2)))) && (input == 2))) && a4 <= -86 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !(((((a2==4) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((((input == 4) && 43 < a29 ) && (a2==1)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L288] COND FALSE !((( -61 < a0 && (((( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 1))) && a4 <= -86 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L295] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==3))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L302] COND FALSE !((((a2==2) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !((((((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !(((a2==4) && ( -61 < a0 && ( a4 <= -86 && ((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !((((((input == 3) && -61 < a0 ) && a4 <= -86 ) && ((-16 < a29) && (43 >= a29)) ) && (a2==5))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L337] COND FALSE !(((a2==1) && ( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L343] COND FALSE !((( -61 < a0 && ( 43 < a29 && ((input == 4) && (a2==5)))) && a4 <= -86 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L346] COND FALSE !(((((((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==3) && 43 < a29 ) || ( a29 <= -144 && (a2==4)))) && (input == 5)) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(( 43 < a29 && (( -61 < a0 && ( a4 <= -86 && (input == 1))) && (a2==5)))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !((( a4 <= -86 && ( 43 < a29 && ((input == 2) && -61 < a0 ))) && (a2==3))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L371] COND FALSE !(((((input == 6) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !((((( ((-98 < a0) && (-61 >= a0)) && (input == 3)) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !(((( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L390] COND FALSE !(((( a4 <= -86 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1))) && (a2==1)) && -61 < a0 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( -61 < a0 && ((( 43 < a29 && (input == 6)) && (a2==5)) && a4 <= -86 ))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 3) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (a2==5))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && ((-86 < a4) && (-42 >= a4)) )) && (a2==4))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && (a2==4))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !((((((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 ) && (input == 6)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((a2==3) && (((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) && (a2==5))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==3) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((((a2==3) && (( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2))) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L455] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && (a2==5)) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) )) && (a2==4))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(((((((a2==5) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 ))) && (input == 2)) && a4 <= -86 ) && -61 < a0 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L472] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (( ((-98 < a0) && (-61 >= a0)) && (input == 6)) && (a2==2))) && a29 <= -144 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && ( a4 <= -86 && (((input == 6) && -61 < a0 ) && (a2==5))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L484] COND FALSE !((( ((-16 < a29) && (43 >= a29)) && (((input == 4) && -61 < a0 ) && a4 <= -86 )) && (a2==5))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 5) && ((( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ((a2==2) && 43 < a29 )) || ( a29 <= -144 && (a2==3))))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L496] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && (((input == 1) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==2))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L501] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 6) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && (a2==2))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((input == 3) && ((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L512] COND FALSE !(((( a0 <= -147 && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-98 < a0) && (-61 >= a0)) ) && (a2==1))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( a29 <= -144 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 3) && (a2==5)))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L530] COND FALSE !(((a2==4) && ( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && a0 <= -147 )))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L539] COND FALSE !((((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L552] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && ( a0 <= -147 && ( ((-16 < a29) && (43 >= a29)) && (input == 5)))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L556] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( a0 <= -147 && ((( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2)))) && (input == 4))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L567] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==2) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)) && ((-98 < a0) && (-61 >= a0)) )))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==5) && ( 43 < a29 && (input == 3)))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L584] COND FALSE !(( -61 < a0 && ( a4 <= -86 && (((a2==3) && (input == 4)) && 43 < a29 )))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L597] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 )) || ((a2==2) && a29 <= -144 )) && (input == 6))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L604] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L616] COND FALSE !((((a2==2) && (( ((-144 < a29) && (-16 >= a29)) && (input == 1)) && ((-86 < a4) && (-42 >= a4)) )) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L623] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 6) && (((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L630] COND FALSE !(((((a2==1) && ((input == 5) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L637] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )))) && (a2==2))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L644] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && (( a0 <= -147 && (input == 2)) && 43 < a29 )))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L651] COND FALSE !(((a2==1) && ( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) && a0 <= -147 )))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L662] COND FALSE !(((((a2==1) && ((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L667] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==1) && ((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L672] COND FALSE !(( a0 <= -147 && ((a2==2) && ( ((-86 < a4) && (-42 >= a4)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 2)))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L678] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ((((( 43 < a29 && (a2==2)) || ((a2==3) && a29 <= -144 )) || ((a2==3) && ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L685] COND FALSE !(((((a2==5) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L691] COND FALSE !(((a2==2) && ( ((-98 < a0) && (-61 >= a0)) && (( a29 <= -144 && (input == 1)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L697] COND FALSE !(((( a4 <= -86 && ( -61 < a0 && (input == 5))) && (a2==5)) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L703] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 6)) && (a2==4)) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L717] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 4)))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ((-98 < a0) && (-61 >= a0)) )) && a29 <= -144 ) && (a2==2))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L728] COND FALSE !(((a2==1) && ((((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L735] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((((a2==4) && 43 < a29 ) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 3))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L742] COND FALSE !((((a2==5) && (((input == 5) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L745] COND FALSE !(((( ((-16 < a29) && (43 >= a29)) && ((input == 1) && ((-147 < a0) && (-98 >= a0)) )) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L752] COND FALSE !((( a4 <= -86 && ((input == 6) && ((((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ((a2==2) && 43 < a29 )) || ((a2==3) && a29 <= -144 )))) && -61 < a0 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L758] COND FALSE !(((( -61 < a0 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 5))) && a4 <= -86 ) && (a2==3))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L764] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==2)) || ((a2==3) && a29 <= -144 ))) && (input == 5))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L771] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 6) && ((-86 < a4) && (-42 >= a4)) ) && (a2==1)) && 43 < a29 ))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L778] COND FALSE !(( a0 <= -147 && ((((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L784] COND FALSE !(((((a2==1) && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L789] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((a2==4) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L796] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 4) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L803] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 && (a2==2)) || (( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 ))) && (input == 4))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L814] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && (( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L821] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && (a2==2))) && a0 <= -147 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L827] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==3) && ( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L834] COND FALSE !(((a2==5) && ((( a0 <= -147 && (input == 5)) && 43 < a29 ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L839] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && (( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && (input == 3))) && a0 <= -147 ))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L850] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((a2==4) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L855] COND FALSE !((( a4 <= -86 && ((input == 3) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) )))) && -61 < a0 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L861] COND FALSE !(((a2==4) && ((((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L865] COND FALSE !(((a2==5) && ((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 ))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L872] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) && 43 < a29 ) || ( a29 <= -144 && (a2==3)))) && (input == 1))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L878] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && a0 <= -147 ) && (a2==5)))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L884] COND FALSE !(( a4 <= -86 && ( -61 < a0 && ((input == 5) && ((( 43 < a29 && (a2==4)) || ( a29 <= -144 && (a2==5))) || ((a2==5) && ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L890] COND FALSE !(((a2==3) && ( a4 <= -86 && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1)) && -61 < a0 )))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L895] COND FALSE !(((a2==5) && ((((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L905] COND FALSE !((((( -61 < a0 && (input == 2)) && 43 < a29 ) && a4 <= -86 ) && (a2==5))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L911] COND FALSE !((((((input == 1) && (a2==1)) && 43 < a29 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L917] COND FALSE !(((((a2==2) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L922] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 6) && 43 < a29 ) && (a2==2))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L929] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && (a2==3)))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L935] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 1) && (a2==5)) && ((-86 < a4) && (-42 >= a4)) )) && a29 <= -144 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L940] COND FALSE !((((a2==1) && ( a0 <= -147 && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 6)))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L945] COND FALSE !(((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==4))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L952] COND FALSE !((((a2==1) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L958] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && ((input == 5) && (a2==2)))) && a29 <= -144 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L965] COND FALSE !((( -61 < a0 && ((a2==1) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)))) && a4 <= -86 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L969] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((((((a2==1) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )) && (input == 5)) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L976] COND FALSE !((((( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && ((-16 < a29) && (43 >= a29)) ) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L983] COND FALSE !(( a4 <= -86 && ((( 43 < a29 && (input == 5)) && -61 < a0 ) && (a2==3)))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L989] COND FALSE !((((a2==4) && ( a4 <= -86 && ((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )))) && -61 < a0 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L995] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 6)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==1)))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1002] COND FALSE !(((((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6)) && ((-86 < a4) && (-42 >= a4)) ) && (a2==2)) && a0 <= -147 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1008] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && (a2==4))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1014] COND FALSE !((((((input == 1) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) ) && (a2==5)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1021] COND FALSE !(((( ((-98 < a0) && (-61 >= a0)) && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1026] COND FALSE !((((a2==4) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1029] COND FALSE !((((a2==2) && (( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) )) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1036] COND FALSE !(((a2==5) && ( ((-86 < a4) && (-42 >= a4)) && (( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && a29 <= -144 )))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1040] COND FALSE !(( a4 <= -86 && ((((((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2))) || ((a2==3) && a29 <= -144 )) && (input == 3)) && -61 < a0 ))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1045] COND FALSE !(((a2==2) && ( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 1)) && a0 <= -147 )))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1048] COND FALSE !(( a0 <= -147 && ((((((a2==3) && 43 < a29 ) || ( a29 <= -144 && (a2==4))) || ((a2==4) && ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1054] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (( a0 <= -147 && ((a2==5) && (input == 1))) && 43 < a29 ))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1059] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) )) && (a2==5))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1072] COND FALSE !((((a2==2) && (((input == 4) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1084] COND FALSE !((((((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1091] COND FALSE !(( a4 <= -86 && (((input == 6) && ((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) ))) && -61 < a0 ))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1096] COND FALSE !(((a2==1) && (( 43 < a29 && ((input == 2) && ((-98 < a0) && (-61 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1101] COND FALSE !((((((input == 4) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && a4 <= -86 ) && (a2==3)) && -61 < a0 )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1108] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==4))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1118] COND FALSE !(((a2==2) && (((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1125] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1132] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && (((input == 2) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && (a2==5))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1138] COND FALSE !(( 43 < a29 && ( a4 <= -86 && ( -61 < a0 && ((a2==3) && (input == 3)))))) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1144] COND TRUE (((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) ) && (a2==3)) VAL [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1145] COND FALSE !(((-98 < a0) && (-61 >= a0))) [L1150] a0 = (((a0 - 401265) / 5) + -135803) [L1151] a29 = ((((a29 % 299978)+ 300021) - 0) * 1) [L1152] a2 = 4 VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1154] return 22; VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1784] output = calculate_output(input) [L1776] COND TRUE 1 [L1779] int input; [L1780] input = __VERIFIER_nondet_int() [L1781] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L34] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((((a2==1) && a4 <= -86 ) && -61 < a0 ) && a29 <= -144 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L218] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 1) && (((a2==3) && a29 <= -144 ) || (((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2)))))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L229] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==2) && ( a29 <= -144 && (input == 3))) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((( a0 <= -147 && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==4)))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !(((((a2==3) && ((input == 3) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && -61 < a0 ) && a4 <= -86 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !(((((input == 5) && (( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (( 43 < a29 && (a2==1)) || ((a2==2) && a29 <= -144 )))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L263] COND FALSE !(((((( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((( -61 < a0 && ((((a2==3) && a29 <= -144 ) || (( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ( 43 < a29 && (a2==2)))) && (input == 2))) && a4 <= -86 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !(((((a2==4) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((((input == 4) && 43 < a29 ) && (a2==1)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L288] COND FALSE !((( -61 < a0 && (((( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 1))) && a4 <= -86 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L295] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==3))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L302] COND FALSE !((((a2==2) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !((((((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !(((a2==4) && ( -61 < a0 && ( a4 <= -86 && ((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !((((((input == 3) && -61 < a0 ) && a4 <= -86 ) && ((-16 < a29) && (43 >= a29)) ) && (a2==5))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L337] COND FALSE !(((a2==1) && ( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L343] COND FALSE !((( -61 < a0 && ( 43 < a29 && ((input == 4) && (a2==5)))) && a4 <= -86 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L346] COND FALSE !(((((((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==3) && 43 < a29 ) || ( a29 <= -144 && (a2==4)))) && (input == 5)) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(( 43 < a29 && (( -61 < a0 && ( a4 <= -86 && (input == 1))) && (a2==5)))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !((( a4 <= -86 && ( 43 < a29 && ((input == 2) && -61 < a0 ))) && (a2==3))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L371] COND FALSE !(((((input == 6) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !((((( ((-98 < a0) && (-61 >= a0)) && (input == 3)) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !(((( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L390] COND FALSE !(((( a4 <= -86 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1))) && (a2==1)) && -61 < a0 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( -61 < a0 && ((( 43 < a29 && (input == 6)) && (a2==5)) && a4 <= -86 ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 3) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (a2==5))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && ((-86 < a4) && (-42 >= a4)) )) && (a2==4))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && (a2==4))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !((((((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 ) && (input == 6)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((a2==3) && (((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) && (a2==5))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==3) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((((a2==3) && (( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2))) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L455] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && (a2==5)) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) )) && (a2==4))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(((((((a2==5) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 ))) && (input == 2)) && a4 <= -86 ) && -61 < a0 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L472] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (( ((-98 < a0) && (-61 >= a0)) && (input == 6)) && (a2==2))) && a29 <= -144 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && ( a4 <= -86 && (((input == 6) && -61 < a0 ) && (a2==5))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L484] COND FALSE !((( ((-16 < a29) && (43 >= a29)) && (((input == 4) && -61 < a0 ) && a4 <= -86 )) && (a2==5))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 5) && ((( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ((a2==2) && 43 < a29 )) || ( a29 <= -144 && (a2==3))))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L496] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && (((input == 1) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==2))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L501] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 6) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && (a2==2))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((input == 3) && ((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L512] COND FALSE !(((( a0 <= -147 && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-98 < a0) && (-61 >= a0)) ) && (a2==1))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( a29 <= -144 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 3) && (a2==5)))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L530] COND FALSE !(((a2==4) && ( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && a0 <= -147 )))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L539] COND FALSE !((((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L552] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && ( a0 <= -147 && ( ((-16 < a29) && (43 >= a29)) && (input == 5)))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L556] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( a0 <= -147 && ((( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2)))) && (input == 4))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L567] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==2) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)) && ((-98 < a0) && (-61 >= a0)) )))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==5) && ( 43 < a29 && (input == 3)))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L584] COND FALSE !(( -61 < a0 && ( a4 <= -86 && (((a2==3) && (input == 4)) && 43 < a29 )))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L597] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 )) || ((a2==2) && a29 <= -144 )) && (input == 6))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L604] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L616] COND FALSE !((((a2==2) && (( ((-144 < a29) && (-16 >= a29)) && (input == 1)) && ((-86 < a4) && (-42 >= a4)) )) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L623] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 6) && (((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L630] COND FALSE !(((((a2==1) && ((input == 5) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L637] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )))) && (a2==2))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L644] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && (( a0 <= -147 && (input == 2)) && 43 < a29 )))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L651] COND FALSE !(((a2==1) && ( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) && a0 <= -147 )))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L662] COND FALSE !(((((a2==1) && ((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L667] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==1) && ((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L672] COND FALSE !(( a0 <= -147 && ((a2==2) && ( ((-86 < a4) && (-42 >= a4)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 2)))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L678] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ((((( 43 < a29 && (a2==2)) || ((a2==3) && a29 <= -144 )) || ((a2==3) && ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L685] COND FALSE !(((((a2==5) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L691] COND FALSE !(((a2==2) && ( ((-98 < a0) && (-61 >= a0)) && (( a29 <= -144 && (input == 1)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L697] COND FALSE !(((( a4 <= -86 && ( -61 < a0 && (input == 5))) && (a2==5)) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L703] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 6)) && (a2==4)) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L717] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 4)))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ((-98 < a0) && (-61 >= a0)) )) && a29 <= -144 ) && (a2==2))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L728] COND FALSE !(((a2==1) && ((((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L735] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((((a2==4) && 43 < a29 ) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 3))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L742] COND FALSE !((((a2==5) && (((input == 5) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L745] COND FALSE !(((( ((-16 < a29) && (43 >= a29)) && ((input == 1) && ((-147 < a0) && (-98 >= a0)) )) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L752] COND FALSE !((( a4 <= -86 && ((input == 6) && ((((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ((a2==2) && 43 < a29 )) || ((a2==3) && a29 <= -144 )))) && -61 < a0 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L758] COND FALSE !(((( -61 < a0 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 5))) && a4 <= -86 ) && (a2==3))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L764] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==2)) || ((a2==3) && a29 <= -144 ))) && (input == 5))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L771] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 6) && ((-86 < a4) && (-42 >= a4)) ) && (a2==1)) && 43 < a29 ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L778] COND FALSE !(( a0 <= -147 && ((((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L784] COND FALSE !(((((a2==1) && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L789] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((a2==4) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L796] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 4) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L803] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 && (a2==2)) || (( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 ))) && (input == 4))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L814] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && (( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L821] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && (a2==2))) && a0 <= -147 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L827] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==3) && ( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L834] COND FALSE !(((a2==5) && ((( a0 <= -147 && (input == 5)) && 43 < a29 ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L839] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && (( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && (input == 3))) && a0 <= -147 ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L850] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((a2==4) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L855] COND FALSE !((( a4 <= -86 && ((input == 3) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) )))) && -61 < a0 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L861] COND FALSE !(((a2==4) && ((((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L865] COND FALSE !(((a2==5) && ((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L872] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) && 43 < a29 ) || ( a29 <= -144 && (a2==3)))) && (input == 1))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L878] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && a0 <= -147 ) && (a2==5)))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L884] COND FALSE !(( a4 <= -86 && ( -61 < a0 && ((input == 5) && ((( 43 < a29 && (a2==4)) || ( a29 <= -144 && (a2==5))) || ((a2==5) && ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L890] COND FALSE !(((a2==3) && ( a4 <= -86 && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1)) && -61 < a0 )))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L895] COND FALSE !(((a2==5) && ((((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L905] COND FALSE !((((( -61 < a0 && (input == 2)) && 43 < a29 ) && a4 <= -86 ) && (a2==5))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L911] COND FALSE !((((((input == 1) && (a2==1)) && 43 < a29 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L917] COND FALSE !(((((a2==2) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L922] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 6) && 43 < a29 ) && (a2==2))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L929] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && (a2==3)))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L935] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 1) && (a2==5)) && ((-86 < a4) && (-42 >= a4)) )) && a29 <= -144 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L940] COND FALSE !((((a2==1) && ( a0 <= -147 && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 6)))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L945] COND FALSE !(((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==4))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L952] COND FALSE !((((a2==1) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L958] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && ((input == 5) && (a2==2)))) && a29 <= -144 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L965] COND FALSE !((( -61 < a0 && ((a2==1) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)))) && a4 <= -86 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L969] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((((((a2==1) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )) && (input == 5)) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L976] COND FALSE !((((( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && ((-16 < a29) && (43 >= a29)) ) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L983] COND FALSE !(( a4 <= -86 && ((( 43 < a29 && (input == 5)) && -61 < a0 ) && (a2==3)))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L989] COND FALSE !((((a2==4) && ( a4 <= -86 && ((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )))) && -61 < a0 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L995] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 6)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==1)))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1002] COND FALSE !(((((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6)) && ((-86 < a4) && (-42 >= a4)) ) && (a2==2)) && a0 <= -147 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1008] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && (a2==4))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1014] COND FALSE !((((((input == 1) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) ) && (a2==5)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1021] COND FALSE !(((( ((-98 < a0) && (-61 >= a0)) && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1026] COND FALSE !((((a2==4) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1029] COND FALSE !((((a2==2) && (( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) )) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1036] COND FALSE !(((a2==5) && ( ((-86 < a4) && (-42 >= a4)) && (( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && a29 <= -144 )))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1040] COND FALSE !(( a4 <= -86 && ((((((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2))) || ((a2==3) && a29 <= -144 )) && (input == 3)) && -61 < a0 ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1045] COND FALSE !(((a2==2) && ( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 1)) && a0 <= -147 )))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1048] COND FALSE !(( a0 <= -147 && ((((((a2==3) && 43 < a29 ) || ( a29 <= -144 && (a2==4))) || ((a2==4) && ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1054] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (( a0 <= -147 && ((a2==5) && (input == 1))) && 43 < a29 ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1059] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) )) && (a2==5))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1072] COND FALSE !((((a2==2) && (((input == 4) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1084] COND FALSE !((((((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1091] COND FALSE !(( a4 <= -86 && (((input == 6) && ((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) ))) && -61 < a0 ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1096] COND FALSE !(((a2==1) && (( 43 < a29 && ((input == 2) && ((-98 < a0) && (-61 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1101] COND FALSE !((((((input == 4) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && a4 <= -86 ) && (a2==3)) && -61 < a0 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1108] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==4))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1118] COND FALSE !(((a2==2) && (((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1125] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1132] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && (((input == 2) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && (a2==5))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1138] COND FALSE !(( 43 < a29 && ( a4 <= -86 && ( -61 < a0 && ((a2==3) && (input == 3)))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1144] COND FALSE !((((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) ) && (a2==3))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1155] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( a0 <= -147 && ((( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (( 43 < a29 && (a2==1)) || ((a2==2) && a29 <= -144 ))) && (input == 1))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1160] COND FALSE !(((a2==4) && ((((input == 3) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1166] COND FALSE !(((a2==4) && ((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 1)) && a4 <= -86 ) && -61 < a0 ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1172] COND FALSE !((((a2==4) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 4)) && ((-98 < a0) && (-61 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1178] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ( 43 < a29 && ((input == 3) && (a2==1)))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1182] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((a2==1) && ( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1188] COND FALSE !(( a0 <= -147 && (((((a2==2) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2)))) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1194] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 2) && (a2==2))) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1200] COND FALSE !((((( ((-98 < a0) && (-61 >= a0)) && (input == 2)) && a29 <= -144 ) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1207] COND FALSE !((((a2==5) && ( -61 < a0 && ((input == 5) && 43 < a29 ))) && a4 <= -86 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1213] COND FALSE !((((( a0 <= -147 && (input == 6)) && (a2==5)) && 43 < a29 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1218] COND FALSE !(( 43 < a29 && ((((input == 4) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1222] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && ((a2==1) && ((input == 3) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1228] COND FALSE !(( -61 < a0 && (((input == 1) && ((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2)))) && a4 <= -86 ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1234] COND FALSE !(((( ((-98 < a0) && (-61 >= a0)) && ((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1241] COND FALSE !(((a2==3) && (( ((-98 < a0) && (-61 >= a0)) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1247] COND FALSE !(( -61 < a0 && ((((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2))) && (input == 2)) && a4 <= -86 ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1253] COND FALSE !(((((input == 1) && (( a29 <= -144 && (a2==2)) || (( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 )))) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1259] COND FALSE !(((( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && (input == 3))) && (a2==5)) && 43 < a29 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1265] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 5)) && a0 <= -147 )) && (a2==3))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1271] COND FALSE !(((a2==2) && ((((input == 3) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1274] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && (input == 2))) && (a2==5)) && a29 <= -144 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1281] COND FALSE !((( -61 < a0 && ((input == 5) && ((((a2==1) && 43 < a29 ) || ((a2==2) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2))))) && a4 <= -86 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1287] COND FALSE !(((a2==1) && ((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1293] COND FALSE !(((( ((-147 < a0) && (-98 >= a0)) && ((a2==2) && (input == 6))) && ((-86 < a4) && (-42 >= a4)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1299] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ( 43 < a29 && (((a2==2) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1310] COND FALSE !(((((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ) && (a2==3))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1316] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && (( ((-86 < a4) && (-42 >= a4)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 4))) && (a2==3)))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1323] COND FALSE !(((a2==1) && (((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 6)) && a4 <= -86 ) && -61 < a0 ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1327] COND FALSE !(( -61 < a0 && ( a4 <= -86 && (((input == 5) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && (a2==1))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1331] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((((input == 5) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-98 < a0) && (-61 >= a0)) ) && (a2==4)))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1343] COND FALSE !((( a0 <= -147 && (((input == 1) && ((-86 < a4) && (-42 >= a4)) ) && (a2==1))) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1348] COND FALSE !((( -61 < a0 && ((((a2==5) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 ))) && (input == 6))) && a4 <= -86 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1354] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ((a2==5) && (((input == 4) && ( 43 < a29 || ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1360] COND FALSE !((( a0 <= -147 && (((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==4))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1369] COND FALSE !(((((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 6)) && a4 <= -86 ) && (a2==3)) && -61 < a0 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1375] COND FALSE !((((((input == 6) && a29 <= -144 ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1381] COND FALSE !((((((input == 4) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) && a0 <= -147 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1388] COND FALSE !(( -61 < a0 && (((a2==3) && ( a4 <= -86 && (input == 1))) && 43 < a29 ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1395] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 6) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && (a2==5))) && a0 <= -147 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1398] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((a2==4) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 4)))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1404] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 5)) && ((-98 < a0) && (-61 >= a0)) )) && (a2==3))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1418] COND FALSE !(( a4 <= -86 && ((((((a2==1) && 43 < a29 ) || ((a2==2) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2))) && (input == 4)) && -61 < a0 ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1423] COND FALSE !((((a2==3) && (((input == 5) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1429] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && (((a2==3) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1441] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((a2==2) && ( ((-144 < a29) && (-16 >= a29)) && (input == 5)))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1448] COND FALSE !(((((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) && 43 < a29 ) || ((a2==3) && a29 <= -144 ))) && (input == 6)) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1459] COND FALSE !(((a2==3) && ( ((-147 < a0) && (-98 >= a0)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1466] COND FALSE !(((((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 1)) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1471] COND FALSE !(((a2==2) && (( ((-98 < a0) && (-61 >= a0)) && ((input == 5) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1476] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 5)))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1483] COND FALSE !(((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 1)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==4))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1488] COND FALSE !((((((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1492] COND FALSE !((( a0 <= -147 && ((input == 3) && ((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1498] COND FALSE !(( -61 < a0 && (((input == 4) && (( ((-144 < a29) && (-16 >= a29)) && (a2==5)) || (((a2==4) && 43 < a29 ) || ((a2==5) && a29 <= -144 )))) && a4 <= -86 ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1504] COND FALSE !(((a2==4) && ( ((-147 < a0) && (-98 >= a0)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 5)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1511] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 1)) && (a2==4))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1518] COND FALSE !((((( ((-86 < a4) && (-42 >= a4)) && (input == 5)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==2)) && 43 < a29 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1521] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==2) && (( 43 < a29 && (input == 1)) && ((-98 < a0) && (-61 >= a0)) )))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1526] COND FALSE !(((a2==5) && ( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6)))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1532] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 1)))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1538] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && (((a2==1) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 1))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1543] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((((((a2==2) && 43 < a29 ) || ((a2==3) && a29 <= -144 )) || ((a2==3) && ((-144 < a29) && (-16 >= a29)) )) && (input == 3)) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1550] COND FALSE !(( a0 <= -147 && ((((a2==1) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ) && ((-16 < a29) && (43 >= a29)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1557] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && ( ((-147 < a0) && (-98 >= a0)) && ((a2==2) && ((input == 2) && ((-86 < a4) && (-42 >= a4)) ))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1564] COND FALSE !((((a2==1) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)) && a4 <= -86 )) && -61 < a0 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1569] COND FALSE !(((a2==4) && (( ((-86 < a4) && (-42 >= a4)) && ((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1576] COND FALSE !((( a0 <= -147 && (((input == 6) && ((-86 < a4) && (-42 >= a4)) ) && (a2==1))) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1580] COND FALSE !(( a4 <= -86 && (((((a2==3) && a29 <= -144 ) || (((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2)))) && (input == 4)) && -61 < a0 ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1592] COND FALSE !(( ((-144 < a29) && (-16 >= a29)) && ((a2==2) && (( ((-86 < a4) && (-42 >= a4)) && (input == 6)) && ((-147 < a0) && (-98 >= a0)) )))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1599] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) && (a2==4))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1605] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 1)) && a0 <= -147 )))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1612] COND FALSE !(((( ((-16 < a29) && (43 >= a29)) && ( ((-86 < a4) && (-42 >= a4)) && (input == 2))) && a0 <= -147 ) && (a2==1))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1616] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) && (input == 3)) && (a2==2))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1622] COND FALSE !(((a2==3) && ( ((-98 < a0) && (-61 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1633] COND FALSE !(( a4 <= -86 && (( -61 < a0 && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 6))) && (a2==4)))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1639] COND FALSE !(( a4 <= -86 && ( ((-16 < a29) && (43 >= a29)) && (( -61 < a0 && (input == 2)) && (a2==5))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1645] COND FALSE !((((a2==1) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && a4 <= -86 )) && -61 < a0 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1650] COND FALSE !((( ((-16 < a29) && (43 >= a29)) && ( a4 <= -86 && ( -61 < a0 && (input == 1)))) && (a2==5))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1657] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==5))))) [L1671] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 3) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==4)) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1678] COND FALSE !((((a2==3) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 6) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )))) && a0 <= -147 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1682] COND FALSE !(( -61 < a0 && ( a4 <= -86 && (( 43 < a29 && (input == 6)) && (a2==3))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1688] COND FALSE !(( a0 <= -147 && ((((((a2==3) && 43 < a29 ) || ((a2==4) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==4))) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1695] COND FALSE !(((a2==2) && ( ((-144 < a29) && (-16 >= a29)) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 3) && ((-147 < a0) && (-98 >= a0)) ))))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1704] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((a2==4) && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1711] COND FALSE !((((((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && (a2==3)) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1716] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) )) && (a2==3))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1719] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && (((a2==5) && ((input == 5) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1732] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && ((input == 2) && (((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) && 43 < a29 ) || ( a29 <= -144 && (a2==3)))))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1739] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 ) && (input == 3)))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1745] COND FALSE !(((((a2==4) && ((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1752] COND FALSE !((((a2==5) && ( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 5)))) && a0 <= -147 )) VAL [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1759] COND TRUE ((a2==4) && ( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3))))) [L1760] a4 = (((a4 / 5) + -251576) * 2) [L1761] a0 = (((((a0 + 0) % 24)+ -113) / 5) - 105) [L1762] a29 = (((((a29 / 5) - -479587) - -287) % 29)+ 3) [L1763] a2 = 2 [L1765] return -1; VAL [a0=-129, a2=2, a29=12, a4=-503174, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1665] return calculate_output2(input); [L1784] output = calculate_output(input) [L1776] COND TRUE 1 [L1779] int input; [L1780] input = __VERIFIER_nondet_int() [L1781] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L34] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-129, a2=2, a29=12, a4=-503174, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-129, a2=2, a29=12, a4=-503174, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-129, a2=2, a29=12, a4=-503174, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-129, a2=2, a29=12, a4=-503174, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-129, a2=2, a29=12, a4=-503174, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-129, a2=2, a29=12, a4=-503174, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-129, a2=2, a29=12, a4=-503174, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-129, a2=2, a29=12, a4=-503174, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-129, a2=2, a29=12, a4=-503174, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-129, a2=2, a29=12, a4=-503174, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-129, a2=2, a29=12, a4=-503174, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-129, a2=2, a29=12, a4=-503174, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-129, a2=2, a29=12, a4=-503174, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-129, a2=2, a29=12, a4=-503174, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-129, a2=2, a29=12, a4=-503174, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-129, a2=2, a29=12, a4=-503174, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-129, a2=2, a29=12, a4=-503174, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-129, a2=2, a29=12, a4=-503174, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND TRUE ((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) ) VAL [a0=-129, a2=2, a29=12, a4=-503174, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] reach_error() VAL [a0=-129, a2=2, a29=12, a4=-503174, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 74974.47ms, OverallIterations: 27, TraceHistogramMax: 5, EmptinessCheckTime: 219.33ms, AutomataDifference: 49169.33ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 19.47ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16380 SdHoareTripleChecker+Valid, 45272.04ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16380 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 38031.48ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1225 mSDsCounter, 4848 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44905 IncrementalHoareTripleChecker+Invalid, 49753 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4848 mSolverCounterUnsat, 0 mSDtfsCounter, 44905 mSolverCounterSat, 83.83ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5327 GetRequests, 5254 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 518.61ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=23413occurred in iteration=21, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 3894.38ms AutomataMinimizationTime, 26 MinimizatonAttempts, 64863 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 673.02ms SsaConstructionTime, 2099.66ms SatisfiabilityAnalysisTime, 16816.42ms InterpolantComputationTime, 18308 NumberOfCodeBlocks, 18308 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 18842 ConstructedInterpolants, 0 QuantifiedInterpolants, 72708 SizeOfPredicates, 7 NumberOfNonLiveVariables, 4552 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 33 InterpolantComputations, 24 PerfectInterpolantSequences, 18571/19659 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! [2021-08-29 04:59:13,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...