./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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/Problem11_label20.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 cb2aadf2d17f1b7cfc4d760b6f8877e3375a5d88 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-dev-20ed64e [2021-08-25 21:44:51,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 21:44:51,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 21:44:51,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 21:44:51,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 21:44:51,619 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 21:44:51,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 21:44:51,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 21:44:51,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 21:44:51,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 21:44:51,629 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 21:44:51,630 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 21:44:51,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 21:44:51,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 21:44:51,633 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 21:44:51,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 21:44:51,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 21:44:51,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 21:44:51,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 21:44:51,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 21:44:51,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 21:44:51,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 21:44:51,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 21:44:51,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 21:44:51,654 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 21:44:51,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 21:44:51,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 21:44:51,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 21:44:51,656 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 21:44:51,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 21:44:51,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 21:44:51,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 21:44:51,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 21:44:51,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 21:44:51,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 21:44:51,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 21:44:51,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 21:44:51,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 21:44:51,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 21:44:51,662 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 21:44:51,662 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 21:44:51,665 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 21:44:51,684 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 21:44:51,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 21:44:51,687 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 21:44:51,687 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 21:44:51,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 21:44:51,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 21:44:51,689 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 21:44:51,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 21:44:51,689 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 21:44:51,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 21:44:51,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 21:44:51,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 21:44:51,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 21:44:51,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 21:44:51,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 21:44:51,691 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 21:44:51,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 21:44:51,691 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 21:44:51,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 21:44:51,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 21:44:51,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 21:44:51,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 21:44:51,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 21:44:51,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 21:44:51,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 21:44:51,692 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 21:44:51,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 21:44:51,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 21:44:51,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 21:44:51,693 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 21:44:51,693 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 -> cb2aadf2d17f1b7cfc4d760b6f8877e3375a5d88 [2021-08-25 21:44:51,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 21:44:51,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 21:44:51,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 21:44:51,958 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 21:44:51,959 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 21:44:51,960 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label20.c [2021-08-25 21:44:52,011 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25501ca4/edc58c8d4a624cf7b1028e26d137a817/FLAG9e6850441 [2021-08-25 21:44:52,469 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 21:44:52,470 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label20.c [2021-08-25 21:44:52,479 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25501ca4/edc58c8d4a624cf7b1028e26d137a817/FLAG9e6850441 [2021-08-25 21:44:52,490 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25501ca4/edc58c8d4a624cf7b1028e26d137a817 [2021-08-25 21:44:52,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 21:44:52,494 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 21:44:52,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 21:44:52,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 21:44:52,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 21:44:52,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 09:44:52" (1/1) ... [2021-08-25 21:44:52,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d10fc02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:44:52, skipping insertion in model container [2021-08-25 21:44:52,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 09:44:52" (1/1) ... [2021-08-25 21:44:52,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 21:44:52,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 21:44:52,663 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/Problem11_label20.c[1455,1468] [2021-08-25 21:44:52,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 21:44:52,923 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 21:44:52,944 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/Problem11_label20.c[1455,1468] [2021-08-25 21:44:53,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 21:44:53,044 INFO L208 MainTranslator]: Completed translation [2021-08-25 21:44:53,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:44:53 WrapperNode [2021-08-25 21:44:53,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 21:44:53,045 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 21:44:53,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 21:44:53,045 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 21:44:53,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:44:53" (1/1) ... [2021-08-25 21:44:53,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:44:53" (1/1) ... [2021-08-25 21:44:53,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 21:44:53,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 21:44:53,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 21:44:53,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 21:44:53,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:44:53" (1/1) ... [2021-08-25 21:44:53,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:44:53" (1/1) ... [2021-08-25 21:44:53,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:44:53" (1/1) ... [2021-08-25 21:44:53,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:44:53" (1/1) ... [2021-08-25 21:44:53,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:44:53" (1/1) ... [2021-08-25 21:44:53,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:44:53" (1/1) ... [2021-08-25 21:44:53,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:44:53" (1/1) ... [2021-08-25 21:44:53,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 21:44:53,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 21:44:53,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 21:44:53,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 21:44:53,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:44:53" (1/1) ... [2021-08-25 21:44:53,250 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 21:44:53,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 21:44:53,263 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-25 21:44:53,282 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-25 21:44:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 21:44:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 21:44:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 21:44:53,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 21:44:54,782 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 21:44:54,783 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 21:44:54,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 09:44:54 BoogieIcfgContainer [2021-08-25 21:44:54,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 21:44:54,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 21:44:54,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 21:44:54,788 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 21:44:54,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 09:44:52" (1/3) ... [2021-08-25 21:44:54,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb8cbc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 09:44:54, skipping insertion in model container [2021-08-25 21:44:54,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:44:53" (2/3) ... [2021-08-25 21:44:54,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb8cbc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 09:44:54, skipping insertion in model container [2021-08-25 21:44:54,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 09:44:54" (3/3) ... [2021-08-25 21:44:54,790 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem11_label20.c [2021-08-25 21:44:54,795 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 21:44:54,795 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 21:44:54,831 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 21:44:54,837 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-25 21:44:54,837 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 21:44:54,854 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 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-25 21:44:54,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-25 21:44:54,857 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 21:44:54,857 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 21:44:54,857 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 21:44:54,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 21:44:54,861 INFO L82 PathProgramCache]: Analyzing trace with hash 647015545, now seen corresponding path program 1 times [2021-08-25 21:44:54,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 21:44:54,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450301273] [2021-08-25 21:44:54,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 21:44:54,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 21:44:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 21:44:55,000 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-25 21:44:55,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 21:44:55,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450301273] [2021-08-25 21:44:55,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450301273] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 21:44:55,002 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 21:44:55,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-25 21:44:55,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356193107] [2021-08-25 21:44:55,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 21:44:55,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 21:44:55,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 21:44:55,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:44:55,017 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 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 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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-25 21:44:56,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 21:44:56,074 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2021-08-25 21:44:56,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 21:44:56,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2021-08-25 21:44:56,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 21:44:56,088 INFO L225 Difference]: With dead ends: 761 [2021-08-25 21:44:56,089 INFO L226 Difference]: Without dead ends: 413 [2021-08-25 21:44:56,094 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:44:56,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-08-25 21:44:56,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2021-08-25 21:44:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 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-25 21:44:56,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2021-08-25 21:44:56,146 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 9 [2021-08-25 21:44:56,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 21:44:56,146 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2021-08-25 21:44:56,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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-25 21:44:56,146 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2021-08-25 21:44:56,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-25 21:44:56,148 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 21:44:56,153 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-25 21:44:56,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 21:44:56,154 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 21:44:56,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 21:44:56,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1481538176, now seen corresponding path program 1 times [2021-08-25 21:44:56,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 21:44:56,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058281757] [2021-08-25 21:44:56,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 21:44:56,155 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 21:44:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 21:44:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 21:44:56,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 21:44:56,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058281757] [2021-08-25 21:44:56,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058281757] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 21:44:56,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 21:44:56,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-25 21:44:56,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512500680] [2021-08-25 21:44:56,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 21:44:56,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 21:44:56,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 21:44:56,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:44:56,253 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 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-25 21:44:56,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 21:44:56,936 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2021-08-25 21:44:56,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 21:44:56,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2021-08-25 21:44:56,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 21:44:56,940 INFO L225 Difference]: With dead ends: 1211 [2021-08-25 21:44:56,940 INFO L226 Difference]: Without dead ends: 800 [2021-08-25 21:44:56,941 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:44:56,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2021-08-25 21:44:56,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2021-08-25 21:44:56,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3756345177664975) internal successors, (1084), 788 states have internal predecessors, (1084), 0 states have call successors, (0), 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-25 21:44:56,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1084 transitions. [2021-08-25 21:44:56,958 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1084 transitions. Word has length 77 [2021-08-25 21:44:56,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 21:44:56,959 INFO L470 AbstractCegarLoop]: Abstraction has 789 states and 1084 transitions. [2021-08-25 21:44:56,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 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-25 21:44:56,959 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1084 transitions. [2021-08-25 21:44:56,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-25 21:44:56,960 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 21:44:56,960 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-25 21:44:56,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 21:44:56,961 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 21:44:56,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 21:44:56,961 INFO L82 PathProgramCache]: Analyzing trace with hash 469804704, now seen corresponding path program 1 times [2021-08-25 21:44:56,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 21:44:56,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581853589] [2021-08-25 21:44:56,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 21:44:56,962 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 21:44:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 21:44:57,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 21:44:57,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 21:44:57,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581853589] [2021-08-25 21:44:57,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581853589] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 21:44:57,031 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 21:44:57,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-25 21:44:57,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822213942] [2021-08-25 21:44:57,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 21:44:57,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 21:44:57,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 21:44:57,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:44:57,032 INFO L87 Difference]: Start difference. First operand 789 states and 1084 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 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-25 21:44:57,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 21:44:57,654 INFO L93 Difference]: Finished difference Result 1945 states and 2614 transitions. [2021-08-25 21:44:57,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 21:44:57,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2021-08-25 21:44:57,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 21:44:57,658 INFO L225 Difference]: With dead ends: 1945 [2021-08-25 21:44:57,658 INFO L226 Difference]: Without dead ends: 1158 [2021-08-25 21:44:57,658 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:44:57,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2021-08-25 21:44:57,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1157. [2021-08-25 21:44:57,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.2716262975778547) internal successors, (1470), 1156 states have internal predecessors, (1470), 0 states have call successors, (0), 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-25 21:44:57,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1470 transitions. [2021-08-25 21:44:57,672 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1470 transitions. Word has length 78 [2021-08-25 21:44:57,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 21:44:57,673 INFO L470 AbstractCegarLoop]: Abstraction has 1157 states and 1470 transitions. [2021-08-25 21:44:57,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 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-25 21:44:57,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1470 transitions. [2021-08-25 21:44:57,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-08-25 21:44:57,676 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 21:44:57,676 INFO L512 BasicCegarLoop]: trace histogram [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-25 21:44:57,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 21:44:57,677 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 21:44:57,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 21:44:57,677 INFO L82 PathProgramCache]: Analyzing trace with hash 569597349, now seen corresponding path program 1 times [2021-08-25 21:44:57,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 21:44:57,677 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772899183] [2021-08-25 21:44:57,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 21:44:57,678 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 21:44:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 21:44:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 21:44:57,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 21:44:57,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772899183] [2021-08-25 21:44:57,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772899183] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 21:44:57,746 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 21:44:57,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 21:44:57,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572569878] [2021-08-25 21:44:57,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 21:44:57,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 21:44:57,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 21:44:57,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:44:57,748 INFO L87 Difference]: Start difference. First operand 1157 states and 1470 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-25 21:44:58,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 21:44:58,386 INFO L93 Difference]: Finished difference Result 2519 states and 3352 transitions. [2021-08-25 21:44:58,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 21:44:58,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2021-08-25 21:44:58,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 21:44:58,391 INFO L225 Difference]: With dead ends: 2519 [2021-08-25 21:44:58,391 INFO L226 Difference]: Without dead ends: 1548 [2021-08-25 21:44:58,392 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:44:58,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2021-08-25 21:44:58,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1545. [2021-08-25 21:44:58,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.294041450777202) internal successors, (1998), 1544 states have internal predecessors, (1998), 0 states have call successors, (0), 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-25 21:44:58,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1998 transitions. [2021-08-25 21:44:58,411 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1998 transitions. Word has length 136 [2021-08-25 21:44:58,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 21:44:58,411 INFO L470 AbstractCegarLoop]: Abstraction has 1545 states and 1998 transitions. [2021-08-25 21:44:58,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-25 21:44:58,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1998 transitions. [2021-08-25 21:44:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-08-25 21:44:58,414 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 21:44:58,415 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 21:44:58,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 21:44:58,415 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 21:44:58,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 21:44:58,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1727211453, now seen corresponding path program 1 times [2021-08-25 21:44:58,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 21:44:58,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941624208] [2021-08-25 21:44:58,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 21:44:58,416 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 21:44:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 21:44:58,483 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 21:44:58,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 21:44:58,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941624208] [2021-08-25 21:44:58,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941624208] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 21:44:58,484 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 21:44:58,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 21:44:58,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714876468] [2021-08-25 21:44:58,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 21:44:58,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 21:44:58,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 21:44:58,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:44:58,486 INFO L87 Difference]: Start difference. First operand 1545 states and 1998 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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-25 21:44:59,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 21:44:59,192 INFO L93 Difference]: Finished difference Result 3656 states and 4826 transitions. [2021-08-25 21:44:59,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 21:44:59,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2021-08-25 21:44:59,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 21:44:59,198 INFO L225 Difference]: With dead ends: 3656 [2021-08-25 21:44:59,199 INFO L226 Difference]: Without dead ends: 2297 [2021-08-25 21:44:59,200 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:44:59,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2021-08-25 21:44:59,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 2100. [2021-08-25 21:44:59,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.2706050500238208) internal successors, (2667), 2099 states have internal predecessors, (2667), 0 states have call successors, (0), 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-25 21:44:59,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2667 transitions. [2021-08-25 21:44:59,225 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2667 transitions. Word has length 189 [2021-08-25 21:44:59,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 21:44:59,226 INFO L470 AbstractCegarLoop]: Abstraction has 2100 states and 2667 transitions. [2021-08-25 21:44:59,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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-25 21:44:59,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2667 transitions. [2021-08-25 21:44:59,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2021-08-25 21:44:59,228 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 21:44:59,228 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 21:44:59,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 21:44:59,228 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 21:44:59,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 21:44:59,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1443867709, now seen corresponding path program 1 times [2021-08-25 21:44:59,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 21:44:59,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021119263] [2021-08-25 21:44:59,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 21:44:59,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 21:44:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 21:44:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-08-25 21:44:59,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 21:44:59,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021119263] [2021-08-25 21:44:59,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021119263] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 21:44:59,327 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 21:44:59,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 21:44:59,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638665276] [2021-08-25 21:44:59,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 21:44:59,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 21:44:59,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 21:44:59,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:44:59,329 INFO L87 Difference]: Start difference. First operand 2100 states and 2667 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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-25 21:45:00,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 21:45:00,075 INFO L93 Difference]: Finished difference Result 4765 states and 6075 transitions. [2021-08-25 21:45:00,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 21:45:00,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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-25 21:45:00,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 21:45:00,083 INFO L225 Difference]: With dead ends: 4765 [2021-08-25 21:45:00,083 INFO L226 Difference]: Without dead ends: 2667 [2021-08-25 21:45:00,089 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:45:00,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2021-08-25 21:45:00,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2652. [2021-08-25 21:45:00,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2652 states, 2651 states have (on average 1.2572614107883817) internal successors, (3333), 2651 states have internal predecessors, (3333), 0 states have call successors, (0), 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-25 21:45:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 3333 transitions. [2021-08-25 21:45:00,122 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 3333 transitions. Word has length 190 [2021-08-25 21:45:00,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 21:45:00,122 INFO L470 AbstractCegarLoop]: Abstraction has 2652 states and 3333 transitions. [2021-08-25 21:45:00,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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-25 21:45:00,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 3333 transitions. [2021-08-25 21:45:00,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-08-25 21:45:00,124 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 21:45:00,124 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 21:45:00,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 21:45:00,125 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 21:45:00,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 21:45:00,126 INFO L82 PathProgramCache]: Analyzing trace with hash 515736200, now seen corresponding path program 1 times [2021-08-25 21:45:00,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 21:45:00,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606548635] [2021-08-25 21:45:00,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 21:45:00,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 21:45:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 21:45:00,217 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-08-25 21:45:00,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 21:45:00,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606548635] [2021-08-25 21:45:00,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606548635] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 21:45:00,218 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 21:45:00,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 21:45:00,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752569120] [2021-08-25 21:45:00,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 21:45:00,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 21:45:00,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 21:45:00,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:45:00,220 INFO L87 Difference]: Start difference. First operand 2652 states and 3333 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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-25 21:45:00,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 21:45:00,926 INFO L93 Difference]: Finished difference Result 6047 states and 7676 transitions. [2021-08-25 21:45:00,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 21:45:00,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 191 [2021-08-25 21:45:00,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 21:45:00,935 INFO L225 Difference]: With dead ends: 6047 [2021-08-25 21:45:00,935 INFO L226 Difference]: Without dead ends: 3397 [2021-08-25 21:45:00,938 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:45:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3397 states. [2021-08-25 21:45:00,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3397 to 3204. [2021-08-25 21:45:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3204 states, 3203 states have (on average 1.2466437714642522) internal successors, (3993), 3203 states have internal predecessors, (3993), 0 states have call successors, (0), 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-25 21:45:00,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 3204 states and 3993 transitions. [2021-08-25 21:45:00,981 INFO L78 Accepts]: Start accepts. Automaton has 3204 states and 3993 transitions. Word has length 191 [2021-08-25 21:45:00,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 21:45:00,981 INFO L470 AbstractCegarLoop]: Abstraction has 3204 states and 3993 transitions. [2021-08-25 21:45:00,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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-25 21:45:00,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3204 states and 3993 transitions. [2021-08-25 21:45:00,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-08-25 21:45:00,983 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 21:45:00,983 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 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-25 21:45:00,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 21:45:00,983 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 21:45:00,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 21:45:00,984 INFO L82 PathProgramCache]: Analyzing trace with hash 490521914, now seen corresponding path program 1 times [2021-08-25 21:45:00,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 21:45:00,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279878034] [2021-08-25 21:45:00,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 21:45:00,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 21:45:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 21:45:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-08-25 21:45:01,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 21:45:01,069 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279878034] [2021-08-25 21:45:01,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279878034] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 21:45:01,069 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910506452] [2021-08-25 21:45:01,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 21:45:01,069 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 21:45:01,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 21:45:01,093 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-25 21:45:01,094 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-25 21:45:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 21:45:01,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 21:45:01,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 21:45:02,793 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-08-25 21:45:02,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910506452] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 21:45:02,794 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 21:45:02,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2021-08-25 21:45:02,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895390450] [2021-08-25 21:45:02,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 21:45:02,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 21:45:02,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 21:45:02,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 21:45:02,795 INFO L87 Difference]: Start difference. First operand 3204 states and 3993 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 21:45:03,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 21:45:03,840 INFO L93 Difference]: Finished difference Result 9567 states and 11924 transitions. [2021-08-25 21:45:03,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 21:45:03,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 211 [2021-08-25 21:45:03,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 21:45:03,857 INFO L225 Difference]: With dead ends: 9567 [2021-08-25 21:45:03,857 INFO L226 Difference]: Without dead ends: 6365 [2021-08-25 21:45:03,861 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 21:45:03,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6365 states. [2021-08-25 21:45:03,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6365 to 6362. [2021-08-25 21:45:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6362 states, 6361 states have (on average 1.2070429177802233) internal successors, (7678), 6361 states have internal predecessors, (7678), 0 states have call successors, (0), 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-25 21:45:03,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6362 states to 6362 states and 7678 transitions. [2021-08-25 21:45:03,936 INFO L78 Accepts]: Start accepts. Automaton has 6362 states and 7678 transitions. Word has length 211 [2021-08-25 21:45:03,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 21:45:03,936 INFO L470 AbstractCegarLoop]: Abstraction has 6362 states and 7678 transitions. [2021-08-25 21:45:03,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 21:45:03,937 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states and 7678 transitions. [2021-08-25 21:45:03,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2021-08-25 21:45:03,938 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 21:45:03,939 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-25 21:45:03,960 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-25 21:45:04,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 21:45:04,155 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 21:45:04,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 21:45:04,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1445810690, now seen corresponding path program 1 times [2021-08-25 21:45:04,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 21:45:04,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788716124] [2021-08-25 21:45:04,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 21:45:04,156 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 21:45:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 21:45:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-25 21:45:04,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 21:45:04,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788716124] [2021-08-25 21:45:04,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788716124] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 21:45:04,210 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 21:45:04,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-25 21:45:04,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743941351] [2021-08-25 21:45:04,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 21:45:04,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 21:45:04,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 21:45:04,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:45:04,211 INFO L87 Difference]: Start difference. First operand 6362 states and 7678 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 21:45:04,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 21:45:04,793 INFO L93 Difference]: Finished difference Result 11950 states and 14495 transitions. [2021-08-25 21:45:04,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 21:45:04,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212 [2021-08-25 21:45:04,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 21:45:04,808 INFO L225 Difference]: With dead ends: 11950 [2021-08-25 21:45:04,808 INFO L226 Difference]: Without dead ends: 5958 [2021-08-25 21:45:04,813 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:45:04,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2021-08-25 21:45:04,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 5589. [2021-08-25 21:45:04,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5589 states, 5588 states have (on average 1.1648174659985684) internal successors, (6509), 5588 states have internal predecessors, (6509), 0 states have call successors, (0), 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-25 21:45:04,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5589 states to 5589 states and 6509 transitions. [2021-08-25 21:45:04,872 INFO L78 Accepts]: Start accepts. Automaton has 5589 states and 6509 transitions. Word has length 212 [2021-08-25 21:45:04,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 21:45:04,872 INFO L470 AbstractCegarLoop]: Abstraction has 5589 states and 6509 transitions. [2021-08-25 21:45:04,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 21:45:04,872 INFO L276 IsEmpty]: Start isEmpty. Operand 5589 states and 6509 transitions. [2021-08-25 21:45:04,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-08-25 21:45:04,874 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 21:45:04,874 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 21:45:04,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 21:45:04,874 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 21:45:04,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 21:45:04,875 INFO L82 PathProgramCache]: Analyzing trace with hash -609976669, now seen corresponding path program 1 times [2021-08-25 21:45:04,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 21:45:04,875 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417658275] [2021-08-25 21:45:04,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 21:45:04,875 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 21:45:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 21:45:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-08-25 21:45:04,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 21:45:04,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417658275] [2021-08-25 21:45:04,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417658275] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 21:45:04,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 21:45:04,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 21:45:04,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601406120] [2021-08-25 21:45:04,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 21:45:04,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 21:45:04,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 21:45:04,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:45:04,929 INFO L87 Difference]: Start difference. First operand 5589 states and 6509 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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-25 21:45:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 21:45:05,614 INFO L93 Difference]: Finished difference Result 11182 states and 13028 transitions. [2021-08-25 21:45:05,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 21:45:05,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 218 [2021-08-25 21:45:05,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 21:45:05,636 INFO L225 Difference]: With dead ends: 11182 [2021-08-25 21:45:05,636 INFO L226 Difference]: Without dead ends: 5779 [2021-08-25 21:45:05,641 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:45:05,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5779 states. [2021-08-25 21:45:05,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5779 to 5588. [2021-08-25 21:45:05,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5588 states, 5587 states have (on average 1.1365670306067657) internal successors, (6350), 5587 states have internal predecessors, (6350), 0 states have call successors, (0), 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-25 21:45:05,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5588 states to 5588 states and 6350 transitions. [2021-08-25 21:45:05,705 INFO L78 Accepts]: Start accepts. Automaton has 5588 states and 6350 transitions. Word has length 218 [2021-08-25 21:45:05,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 21:45:05,705 INFO L470 AbstractCegarLoop]: Abstraction has 5588 states and 6350 transitions. [2021-08-25 21:45:05,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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-25 21:45:05,706 INFO L276 IsEmpty]: Start isEmpty. Operand 5588 states and 6350 transitions. [2021-08-25 21:45:05,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2021-08-25 21:45:05,709 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 21:45:05,709 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 21:45:05,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 21:45:05,710 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 21:45:05,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 21:45:05,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1268745497, now seen corresponding path program 1 times [2021-08-25 21:45:05,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 21:45:05,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569033581] [2021-08-25 21:45:05,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 21:45:05,711 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 21:45:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 21:45:05,787 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2021-08-25 21:45:05,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 21:45:05,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569033581] [2021-08-25 21:45:05,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569033581] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 21:45:05,788 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 21:45:05,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 21:45:05,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882007932] [2021-08-25 21:45:05,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 21:45:05,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 21:45:05,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 21:45:05,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:45:05,789 INFO L87 Difference]: Start difference. First operand 5588 states and 6350 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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-25 21:45:06,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 21:45:06,427 INFO L93 Difference]: Finished difference Result 12646 states and 14399 transitions. [2021-08-25 21:45:06,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 21:45:06,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 276 [2021-08-25 21:45:06,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 21:45:06,439 INFO L225 Difference]: With dead ends: 12646 [2021-08-25 21:45:06,439 INFO L226 Difference]: Without dead ends: 7428 [2021-08-25 21:45:06,444 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:45:06,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7428 states. [2021-08-25 21:45:06,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7428 to 6692. [2021-08-25 21:45:06,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6692 states, 6691 states have (on average 1.122104319234793) internal successors, (7508), 6691 states have internal predecessors, (7508), 0 states have call successors, (0), 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-25 21:45:06,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6692 states to 6692 states and 7508 transitions. [2021-08-25 21:45:06,523 INFO L78 Accepts]: Start accepts. Automaton has 6692 states and 7508 transitions. Word has length 276 [2021-08-25 21:45:06,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 21:45:06,523 INFO L470 AbstractCegarLoop]: Abstraction has 6692 states and 7508 transitions. [2021-08-25 21:45:06,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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-25 21:45:06,524 INFO L276 IsEmpty]: Start isEmpty. Operand 6692 states and 7508 transitions. [2021-08-25 21:45:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2021-08-25 21:45:06,528 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 21:45:06,528 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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-25 21:45:06,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 21:45:06,528 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 21:45:06,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 21:45:06,529 INFO L82 PathProgramCache]: Analyzing trace with hash -536204933, now seen corresponding path program 1 times [2021-08-25 21:45:06,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 21:45:06,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934426355] [2021-08-25 21:45:06,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 21:45:06,529 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 21:45:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 21:45:06,618 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-08-25 21:45:06,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 21:45:06,618 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934426355] [2021-08-25 21:45:06,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934426355] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 21:45:06,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 21:45:06,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 21:45:06,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630675626] [2021-08-25 21:45:06,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 21:45:06,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 21:45:06,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 21:45:06,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 21:45:06,620 INFO L87 Difference]: Start difference. First operand 6692 states and 7508 transitions. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 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-25 21:45:07,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 21:45:07,941 INFO L93 Difference]: Finished difference Result 16725 states and 19001 transitions. [2021-08-25 21:45:07,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 21:45:07,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 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 280 [2021-08-25 21:45:07,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 21:45:07,954 INFO L225 Difference]: With dead ends: 16725 [2021-08-25 21:45:07,955 INFO L226 Difference]: Without dead ends: 11327 [2021-08-25 21:45:07,972 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 21:45:07,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11327 states. [2021-08-25 21:45:08,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11327 to 9104. [2021-08-25 21:45:08,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9104 states, 9103 states have (on average 1.1296275952982533) internal successors, (10283), 9103 states have internal predecessors, (10283), 0 states have call successors, (0), 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-25 21:45:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9104 states to 9104 states and 10283 transitions. [2021-08-25 21:45:08,124 INFO L78 Accepts]: Start accepts. Automaton has 9104 states and 10283 transitions. Word has length 280 [2021-08-25 21:45:08,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 21:45:08,124 INFO L470 AbstractCegarLoop]: Abstraction has 9104 states and 10283 transitions. [2021-08-25 21:45:08,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 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-25 21:45:08,125 INFO L276 IsEmpty]: Start isEmpty. Operand 9104 states and 10283 transitions. [2021-08-25 21:45:08,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2021-08-25 21:45:08,129 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 21:45:08,129 INFO L512 BasicCegarLoop]: trace histogram [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, 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] [2021-08-25 21:45:08,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 21:45:08,130 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 21:45:08,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 21:45:08,130 INFO L82 PathProgramCache]: Analyzing trace with hash 192751904, now seen corresponding path program 1 times [2021-08-25 21:45:08,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 21:45:08,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029285460] [2021-08-25 21:45:08,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 21:45:08,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 21:45:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 21:45:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2021-08-25 21:45:08,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 21:45:08,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029285460] [2021-08-25 21:45:08,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029285460] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 21:45:08,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026952415] [2021-08-25 21:45:08,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 21:45:08,237 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 21:45:08,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 21:45:08,238 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-25 21:45:08,239 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-25 21:45:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 21:45:08,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 21:45:08,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 21:45:09,080 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2021-08-25 21:45:09,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026952415] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 21:45:09,081 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 21:45:09,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-08-25 21:45:09,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132390121] [2021-08-25 21:45:09,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 21:45:09,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 21:45:09,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 21:45:09,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 21:45:09,082 INFO L87 Difference]: Start difference. First operand 9104 states and 10283 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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-25 21:45:09,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 21:45:09,784 INFO L93 Difference]: Finished difference Result 16532 states and 18739 transitions. [2021-08-25 21:45:09,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 21:45:09,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 290 [2021-08-25 21:45:09,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 21:45:09,799 INFO L225 Difference]: With dead ends: 16532 [2021-08-25 21:45:09,799 INFO L226 Difference]: Without dead ends: 10575 [2021-08-25 21:45:09,806 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 16.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 21:45:09,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10575 states. [2021-08-25 21:45:09,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10575 to 9093. [2021-08-25 21:45:09,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9093 states, 9092 states have (on average 1.1292344918609767) internal successors, (10267), 9092 states have internal predecessors, (10267), 0 states have call successors, (0), 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-25 21:45:09,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9093 states to 9093 states and 10267 transitions. [2021-08-25 21:45:09,899 INFO L78 Accepts]: Start accepts. Automaton has 9093 states and 10267 transitions. Word has length 290 [2021-08-25 21:45:09,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 21:45:09,899 INFO L470 AbstractCegarLoop]: Abstraction has 9093 states and 10267 transitions. [2021-08-25 21:45:09,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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-25 21:45:09,899 INFO L276 IsEmpty]: Start isEmpty. Operand 9093 states and 10267 transitions. [2021-08-25 21:45:09,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2021-08-25 21:45:09,903 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 21:45:09,903 INFO L512 BasicCegarLoop]: trace histogram [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, 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-25 21:45:09,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-25 21:45:10,105 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,SelfDestructingSolverStorable12 [2021-08-25 21:45:10,105 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 21:45:10,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 21:45:10,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1695070172, now seen corresponding path program 1 times [2021-08-25 21:45:10,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 21:45:10,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235489647] [2021-08-25 21:45:10,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 21:45:10,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 21:45:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 21:45:10,237 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-25 21:45:10,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 21:45:10,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235489647] [2021-08-25 21:45:10,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235489647] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 21:45:10,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 21:45:10,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 21:45:10,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399988339] [2021-08-25 21:45:10,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 21:45:10,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 21:45:10,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 21:45:10,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:45:10,241 INFO L87 Difference]: Start difference. First operand 9093 states and 10267 transitions. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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-25 21:45:10,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 21:45:10,941 INFO L93 Difference]: Finished difference Result 21878 states and 24731 transitions. [2021-08-25 21:45:10,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 21:45:10,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 293 [2021-08-25 21:45:10,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 21:45:10,959 INFO L225 Difference]: With dead ends: 21878 [2021-08-25 21:45:10,959 INFO L226 Difference]: Without dead ends: 13155 [2021-08-25 21:45:10,967 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:45:10,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13155 states. [2021-08-25 21:45:11,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13155 to 12602. [2021-08-25 21:45:11,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12602 states, 12601 states have (on average 1.1157051027696214) internal successors, (14059), 12601 states have internal predecessors, (14059), 0 states have call successors, (0), 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-25 21:45:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12602 states to 12602 states and 14059 transitions. [2021-08-25 21:45:11,083 INFO L78 Accepts]: Start accepts. Automaton has 12602 states and 14059 transitions. Word has length 293 [2021-08-25 21:45:11,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 21:45:11,083 INFO L470 AbstractCegarLoop]: Abstraction has 12602 states and 14059 transitions. [2021-08-25 21:45:11,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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-25 21:45:11,083 INFO L276 IsEmpty]: Start isEmpty. Operand 12602 states and 14059 transitions. [2021-08-25 21:45:11,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2021-08-25 21:45:11,089 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 21:45:11,089 INFO L512 BasicCegarLoop]: trace histogram [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, 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] [2021-08-25 21:45:11,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 21:45:11,089 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 21:45:11,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 21:45:11,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1816967519, now seen corresponding path program 1 times [2021-08-25 21:45:11,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 21:45:11,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146611804] [2021-08-25 21:45:11,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 21:45:11,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 21:45:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 21:45:11,172 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-25 21:45:11,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 21:45:11,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146611804] [2021-08-25 21:45:11,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146611804] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 21:45:11,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 21:45:11,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 21:45:11,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357459420] [2021-08-25 21:45:11,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 21:45:11,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 21:45:11,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 21:45:11,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 21:45:11,174 INFO L87 Difference]: Start difference. First operand 12602 states and 14059 transitions. Second operand has 4 states, 4 states have (on average 73.75) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 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-25 21:45:12,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 21:45:12,485 INFO L93 Difference]: Finished difference Result 32768 states and 36715 transitions. [2021-08-25 21:45:12,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 21:45:12,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.75) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 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 301 [2021-08-25 21:45:12,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 21:45:12,508 INFO L225 Difference]: With dead ends: 32768 [2021-08-25 21:45:12,508 INFO L226 Difference]: Without dead ends: 20536 [2021-08-25 21:45:12,520 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 21:45:12,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20536 states. [2021-08-25 21:45:12,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20536 to 19789. [2021-08-25 21:45:12,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19789 states, 19788 states have (on average 1.1112290276935517) internal successors, (21989), 19788 states have internal predecessors, (21989), 0 states have call successors, (0), 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-25 21:45:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19789 states to 19789 states and 21989 transitions. [2021-08-25 21:45:12,815 INFO L78 Accepts]: Start accepts. Automaton has 19789 states and 21989 transitions. Word has length 301 [2021-08-25 21:45:12,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 21:45:12,816 INFO L470 AbstractCegarLoop]: Abstraction has 19789 states and 21989 transitions. [2021-08-25 21:45:12,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.75) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 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-25 21:45:12,816 INFO L276 IsEmpty]: Start isEmpty. Operand 19789 states and 21989 transitions. [2021-08-25 21:45:12,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2021-08-25 21:45:12,821 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 21:45:12,822 INFO L512 BasicCegarLoop]: trace histogram [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, 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-25 21:45:12,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 21:45:12,822 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 21:45:12,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 21:45:12,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1580742211, now seen corresponding path program 1 times [2021-08-25 21:45:12,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 21:45:12,823 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146240074] [2021-08-25 21:45:12,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 21:45:12,823 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 21:45:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 21:45:12,919 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-08-25 21:45:12,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 21:45:12,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146240074] [2021-08-25 21:45:12,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146240074] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 21:45:12,921 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 21:45:12,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 21:45:12,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775735962] [2021-08-25 21:45:12,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 21:45:12,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 21:45:12,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 21:45:12,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-25 21:45:12,922 INFO L87 Difference]: Start difference. First operand 19789 states and 21989 transitions. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 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-25 21:45:14,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 21:45:14,504 INFO L93 Difference]: Finished difference Result 47529 states and 52934 transitions. [2021-08-25 21:45:14,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 21:45:14,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 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 303 [2021-08-25 21:45:14,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 21:45:14,584 INFO L225 Difference]: With dead ends: 47529 [2021-08-25 21:45:14,585 INFO L226 Difference]: Without dead ends: 30507 [2021-08-25 21:45:14,599 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-25 21:45:14,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30507 states. [2021-08-25 21:45:14,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30507 to 25517. [2021-08-25 21:45:14,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25517 states, 25516 states have (on average 1.1127919736635836) internal successors, (28394), 25516 states have internal predecessors, (28394), 0 states have call successors, (0), 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-25 21:45:14,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25517 states to 25517 states and 28394 transitions. [2021-08-25 21:45:14,878 INFO L78 Accepts]: Start accepts. Automaton has 25517 states and 28394 transitions. Word has length 303 [2021-08-25 21:45:14,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 21:45:14,878 INFO L470 AbstractCegarLoop]: Abstraction has 25517 states and 28394 transitions. [2021-08-25 21:45:14,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 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-25 21:45:14,878 INFO L276 IsEmpty]: Start isEmpty. Operand 25517 states and 28394 transitions. [2021-08-25 21:45:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2021-08-25 21:45:14,883 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 21:45:14,883 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 21:45:14,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 21:45:14,883 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 21:45:14,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 21:45:14,884 INFO L82 PathProgramCache]: Analyzing trace with hash -738080408, now seen corresponding path program 1 times [2021-08-25 21:45:14,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 21:45:14,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230045518] [2021-08-25 21:45:14,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 21:45:14,884 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 21:45:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 21:45:15,016 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-08-25 21:45:15,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 21:45:15,016 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230045518] [2021-08-25 21:45:15,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230045518] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 21:45:15,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 21:45:15,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 21:45:15,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552946987] [2021-08-25 21:45:15,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 21:45:15,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 21:45:15,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 21:45:15,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:45:15,018 INFO L87 Difference]: Start difference. First operand 25517 states and 28394 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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-25 21:45:15,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 21:45:15,843 INFO L93 Difference]: Finished difference Result 49182 states and 54716 transitions. [2021-08-25 21:45:15,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 21:45:15,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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 307 [2021-08-25 21:45:15,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 21:45:15,886 INFO L225 Difference]: With dead ends: 49182 [2021-08-25 21:45:15,886 INFO L226 Difference]: Without dead ends: 24035 [2021-08-25 21:45:15,902 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:45:15,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24035 states. [2021-08-25 21:45:16,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24035 to 22194. [2021-08-25 21:45:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22194 states, 22193 states have (on average 1.1009777857883116) internal successors, (24434), 22193 states have internal predecessors, (24434), 0 states have call successors, (0), 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-25 21:45:16,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22194 states to 22194 states and 24434 transitions. [2021-08-25 21:45:16,161 INFO L78 Accepts]: Start accepts. Automaton has 22194 states and 24434 transitions. Word has length 307 [2021-08-25 21:45:16,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 21:45:16,161 INFO L470 AbstractCegarLoop]: Abstraction has 22194 states and 24434 transitions. [2021-08-25 21:45:16,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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-25 21:45:16,162 INFO L276 IsEmpty]: Start isEmpty. Operand 22194 states and 24434 transitions. [2021-08-25 21:45:16,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2021-08-25 21:45:16,237 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 21:45:16,237 INFO L512 BasicCegarLoop]: trace histogram [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, 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] [2021-08-25 21:45:16,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 21:45:16,237 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 21:45:16,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 21:45:16,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1829432203, now seen corresponding path program 1 times [2021-08-25 21:45:16,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 21:45:16,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706590893] [2021-08-25 21:45:16,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 21:45:16,239 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 21:45:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 21:45:16,333 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-25 21:45:16,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 21:45:16,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706590893] [2021-08-25 21:45:16,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706590893] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 21:45:16,334 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 21:45:16,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 21:45:16,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637134800] [2021-08-25 21:45:16,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 21:45:16,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 21:45:16,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 21:45:16,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 21:45:16,336 INFO L87 Difference]: Start difference. First operand 22194 states and 24434 transitions. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 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-25 21:45:17,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 21:45:17,643 INFO L93 Difference]: Finished difference Result 50300 states and 55420 transitions. [2021-08-25 21:45:17,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 21:45:17,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 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 316 [2021-08-25 21:45:17,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 21:45:17,676 INFO L225 Difference]: With dead ends: 50300 [2021-08-25 21:45:17,677 INFO L226 Difference]: Without dead ends: 30507 [2021-08-25 21:45:17,692 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 21:45:17,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30507 states. [2021-08-25 21:45:17,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30507 to 29401. [2021-08-25 21:45:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29401 states, 29400 states have (on average 1.0989455782312925) internal successors, (32309), 29400 states have internal predecessors, (32309), 0 states have call successors, (0), 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-25 21:45:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29401 states to 29401 states and 32309 transitions. [2021-08-25 21:45:18,038 INFO L78 Accepts]: Start accepts. Automaton has 29401 states and 32309 transitions. Word has length 316 [2021-08-25 21:45:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 21:45:18,039 INFO L470 AbstractCegarLoop]: Abstraction has 29401 states and 32309 transitions. [2021-08-25 21:45:18,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 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-25 21:45:18,039 INFO L276 IsEmpty]: Start isEmpty. Operand 29401 states and 32309 transitions. [2021-08-25 21:45:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2021-08-25 21:45:18,056 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 21:45:18,056 INFO L512 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-25 21:45:18,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 21:45:18,057 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 21:45:18,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 21:45:18,057 INFO L82 PathProgramCache]: Analyzing trace with hash 734098576, now seen corresponding path program 1 times [2021-08-25 21:45:18,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 21:45:18,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349423746] [2021-08-25 21:45:18,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 21:45:18,058 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 21:45:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 21:45:18,140 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2021-08-25 21:45:18,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 21:45:18,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349423746] [2021-08-25 21:45:18,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349423746] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 21:45:18,140 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 21:45:18,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-25 21:45:18,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954613439] [2021-08-25 21:45:18,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 21:45:18,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 21:45:18,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 21:45:18,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:45:18,142 INFO L87 Difference]: Start difference. First operand 29401 states and 32309 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 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-25 21:45:18,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 21:45:18,594 INFO L93 Difference]: Finished difference Result 53606 states and 58874 transitions. [2021-08-25 21:45:18,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 21:45:18,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 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 381 [2021-08-25 21:45:18,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 21:45:18,622 INFO L225 Difference]: With dead ends: 53606 [2021-08-25 21:45:18,622 INFO L226 Difference]: Without dead ends: 26789 [2021-08-25 21:45:18,637 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 21:45:18,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26789 states. [2021-08-25 21:45:18,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26789 to 24190. [2021-08-25 21:45:18,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24190 states, 24189 states have (on average 1.0936789449749886) internal successors, (26455), 24189 states have internal predecessors, (26455), 0 states have call successors, (0), 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-25 21:45:18,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24190 states to 24190 states and 26455 transitions. [2021-08-25 21:45:18,922 INFO L78 Accepts]: Start accepts. Automaton has 24190 states and 26455 transitions. Word has length 381 [2021-08-25 21:45:18,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 21:45:18,922 INFO L470 AbstractCegarLoop]: Abstraction has 24190 states and 26455 transitions. [2021-08-25 21:45:18,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 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-25 21:45:18,922 INFO L276 IsEmpty]: Start isEmpty. Operand 24190 states and 26455 transitions. [2021-08-25 21:45:18,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2021-08-25 21:45:18,937 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 21:45:18,938 INFO L512 BasicCegarLoop]: trace histogram [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, 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] [2021-08-25 21:45:18,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 21:45:18,938 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 21:45:18,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 21:45:18,938 INFO L82 PathProgramCache]: Analyzing trace with hash -425402839, now seen corresponding path program 1 times [2021-08-25 21:45:18,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 21:45:18,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745480621] [2021-08-25 21:45:18,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 21:45:18,939 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 21:45:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 21:45:18,995 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 21:45:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 21:45:19,120 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-25 21:45:19,120 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 21:45:19,121 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 21:45:19,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 21:45:19,126 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 21:45:19,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 09:45:19 BoogieIcfgContainer [2021-08-25 21:45:19,252 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 21:45:19,252 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 21:45:19,252 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 21:45:19,253 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 21:45:19,253 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 09:44:54" (3/4) ... [2021-08-25 21:45:19,254 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-25 21:45:19,370 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 21:45:19,370 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 21:45:19,371 INFO L168 Benchmark]: Toolchain (without parser) took 26877.15 ms. Allocated memory was 65.0 MB in the beginning and 1.1 GB in the end (delta: 998.2 MB). Free memory was 42.8 MB in the beginning and 551.3 MB in the end (delta: -508.5 MB). Peak memory consumption was 492.3 MB. Max. memory is 16.1 GB. [2021-08-25 21:45:19,372 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 65.0 MB. Free memory was 47.8 MB in the beginning and 47.7 MB in the end (delta: 84.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 21:45:19,372 INFO L168 Benchmark]: CACSL2BoogieTranslator took 548.99 ms. Allocated memory was 65.0 MB in the beginning and 96.5 MB in the end (delta: 31.5 MB). Free memory was 42.6 MB in the beginning and 64.6 MB in the end (delta: -21.9 MB). Peak memory consumption was 20.2 MB. Max. memory is 16.1 GB. [2021-08-25 21:45:19,372 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.12 ms. Allocated memory is still 96.5 MB. Free memory was 64.6 MB in the beginning and 65.1 MB in the end (delta: -538.7 kB). Peak memory consumption was 26.3 MB. Max. memory is 16.1 GB. [2021-08-25 21:45:19,372 INFO L168 Benchmark]: Boogie Preprocessor took 96.36 ms. Allocated memory is still 96.5 MB. Free memory was 65.1 MB in the beginning and 55.9 MB in the end (delta: 9.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-25 21:45:19,373 INFO L168 Benchmark]: RCFGBuilder took 1539.93 ms. Allocated memory was 96.5 MB in the beginning and 180.4 MB in the end (delta: 83.9 MB). Free memory was 55.9 MB in the beginning and 91.7 MB in the end (delta: -35.8 MB). Peak memory consumption was 51.4 MB. Max. memory is 16.1 GB. [2021-08-25 21:45:19,373 INFO L168 Benchmark]: TraceAbstraction took 24465.86 ms. Allocated memory was 180.4 MB in the beginning and 1.1 GB in the end (delta: 882.9 MB). Free memory was 90.6 MB in the beginning and 607.4 MB in the end (delta: -516.8 MB). Peak memory consumption was 365.0 MB. Max. memory is 16.1 GB. [2021-08-25 21:45:19,373 INFO L168 Benchmark]: Witness Printer took 118.07 ms. Allocated memory is still 1.1 GB. Free memory was 607.4 MB in the beginning and 551.3 MB in the end (delta: 56.1 MB). Peak memory consumption was 56.6 MB. Max. memory is 16.1 GB. [2021-08-25 21:45:19,374 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.15 ms. Allocated memory is still 65.0 MB. Free memory was 47.8 MB in the beginning and 47.7 MB in the end (delta: 84.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 548.99 ms. Allocated memory was 65.0 MB in the beginning and 96.5 MB in the end (delta: 31.5 MB). Free memory was 42.6 MB in the beginning and 64.6 MB in the end (delta: -21.9 MB). Peak memory consumption was 20.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 102.12 ms. Allocated memory is still 96.5 MB. Free memory was 64.6 MB in the beginning and 65.1 MB in the end (delta: -538.7 kB). Peak memory consumption was 26.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 96.36 ms. Allocated memory is still 96.5 MB. Free memory was 65.1 MB in the beginning and 55.9 MB in the end (delta: 9.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1539.93 ms. Allocated memory was 96.5 MB in the beginning and 180.4 MB in the end (delta: 83.9 MB). Free memory was 55.9 MB in the beginning and 91.7 MB in the end (delta: -35.8 MB). Peak memory consumption was 51.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 24465.86 ms. Allocated memory was 180.4 MB in the beginning and 1.1 GB in the end (delta: 882.9 MB). Free memory was 90.6 MB in the beginning and 607.4 MB in the end (delta: -516.8 MB). Peak memory consumption was 365.0 MB. Max. memory is 16.1 GB. * Witness Printer took 118.07 ms. Allocated memory is still 1.1 GB. Free memory was 607.4 MB in the beginning and 551.3 MB in the end (delta: 56.1 MB). Peak memory consumption was 56.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 43]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputA = 1; [L18] int inputD = 4; [L19] int inputB = 2; [L20] int inputE = 5; [L21] int inputF = 6; [L22] int inputC = 3; [L25] int a29 = 130; [L26] int a4 = 1; [L27] int a23 = 312; [L28] int a8 = 15; [L29] int a25 = 10; [L30] int a3 = 1; VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1041] int output = -1; VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1044] COND TRUE 1 [L1047] int input; [L1048] input = __VERIFIER_nondet_int() [L1049] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L204] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L213] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L217] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L237] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L243] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L250] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L278] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L332] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L344] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L356] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L368] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L387] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L401] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L421] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L427] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L439] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L453] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L480] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L536] COND TRUE ((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15))) [L537] a29 = (((((a29 % 52)- -193) * 5) % 52)- -169) [L538] a25 = 12 [L540] return 26; VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1052] output = calculate_output(input) [L1044] COND TRUE 1 [L1047] int input; [L1048] input = __VERIFIER_nondet_int() [L1049] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L204] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L213] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L217] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L237] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L243] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L250] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L278] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L332] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L344] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L356] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L368] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L387] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L401] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L421] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L427] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L439] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L453] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L480] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L536] COND FALSE !(((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15)))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L541] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 5)) && (a3==1))) && (a25==9)) && a29 <= 140 ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L547] COND FALSE !(( 306 < a23 && (((a8==15) && ((((input == 1) && ((a25==11) || (a25==12))) && (a4==1)) && (a3==1))) && ((140 < a29) && (245 >= a29)) ))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L552] COND FALSE !(((((a8==15) && ( a23 <= -43 && (((input == 1) && ((a25==10) || (a25==11))) && a29 <= 140 ))) && !(a4==1)) && (a3==1))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L559] COND FALSE !(((( a23 <= -43 && (!(a4==1) && ((a3==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 5))))) && (a8==15)) && ((140 < a29) && (245 >= a29)) )) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((a3==1) && ( ((-43 < a23) && (138 >= a23)) && ((a8==15) && ((((((a25==10) || (a25==11)) || (a25==12)) && (input == 5)) && a29 <= 140 ) && !(a4==1)))))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L571] COND FALSE !(( 306 < a23 && (((a3==1) && ( 277 < a29 && (((input == 4) && (((a25==9) || (a25==10)) || (a25==11))) && (a8==15)))) && (a4==1)))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L576] COND FALSE !((!(a4==1) && ( a23 <= -43 && ((a8==15) && (((((a25==12) || ((a25==10) || (a25==11))) && (input == 1)) && (a3==1)) && 277 < a29 ))))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L582] COND FALSE !(( 277 < a29 && (((a25==13) && ( a23 <= -43 && (!(a4==1) && ((input == 1) && (a3==1))))) && (a8==15)))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L585] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (((a25==9) && ((input == 4) && !(a4==1))) && a29 <= 140 )) && (a3==1)) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L591] COND FALSE !(((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 ))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L596] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && ((a3==1) && (!(a4==1) && ((input == 4) && (((a25==10) && ((140 < a29) && (245 >= a29)) ) || (((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9)))))))) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L608] COND FALSE !(((((a8==15) && ((!(a4==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 6))) && (a3==1))) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) )) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND FALSE !(( a29 <= 140 && (((a4==1) && ((a8==15) && (((input == 6) && (((a25==10) || (a25==11)) || (a25==12))) && 306 < a23 ))) && (a3==1)))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND FALSE !(((((((a3==1) && ((input == 5) && ((a25==11) || (a25==12)))) && (a4==1)) && 306 < a23 ) && ((140 < a29) && (245 >= a29)) ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L631] COND TRUE ((((a4==1) && ( 306 < a23 && ((a8==15) && (((a25==11) || (a25==12)) && (input == 2))))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)) [L632] a29 = ((((a29 / -5) - 119439) + 125177) * -5) [L633] a23 = (((a23 + 0) - 600293) - 11) [L634] a4 = 0 [L635] a25 = 10 [L637] return 21; VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1052] output = calculate_output(input) [L1044] COND TRUE 1 [L1047] int input; [L1048] input = __VERIFIER_nondet_int() [L1049] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L204] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L213] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L217] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L237] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L243] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L250] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L278] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L332] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L344] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L356] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L368] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L387] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L401] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L421] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L427] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L439] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L453] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L480] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L536] COND FALSE !(((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15)))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L541] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 5)) && (a3==1))) && (a25==9)) && a29 <= 140 ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L547] COND FALSE !(( 306 < a23 && (((a8==15) && ((((input == 1) && ((a25==11) || (a25==12))) && (a4==1)) && (a3==1))) && ((140 < a29) && (245 >= a29)) ))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L552] COND FALSE !(((((a8==15) && ( a23 <= -43 && (((input == 1) && ((a25==10) || (a25==11))) && a29 <= 140 ))) && !(a4==1)) && (a3==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L559] COND FALSE !(((( a23 <= -43 && (!(a4==1) && ((a3==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 5))))) && (a8==15)) && ((140 < a29) && (245 >= a29)) )) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((a3==1) && ( ((-43 < a23) && (138 >= a23)) && ((a8==15) && ((((((a25==10) || (a25==11)) || (a25==12)) && (input == 5)) && a29 <= 140 ) && !(a4==1)))))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L571] COND FALSE !(( 306 < a23 && (((a3==1) && ( 277 < a29 && (((input == 4) && (((a25==9) || (a25==10)) || (a25==11))) && (a8==15)))) && (a4==1)))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L576] COND FALSE !((!(a4==1) && ( a23 <= -43 && ((a8==15) && (((((a25==12) || ((a25==10) || (a25==11))) && (input == 1)) && (a3==1)) && 277 < a29 ))))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L582] COND FALSE !(( 277 < a29 && (((a25==13) && ( a23 <= -43 && (!(a4==1) && ((input == 1) && (a3==1))))) && (a8==15)))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L585] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (((a25==9) && ((input == 4) && !(a4==1))) && a29 <= 140 )) && (a3==1)) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L591] COND FALSE !(((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 ))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L596] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && ((a3==1) && (!(a4==1) && ((input == 4) && (((a25==10) && ((140 < a29) && (245 >= a29)) ) || (((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9)))))))) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L608] COND FALSE !(((((a8==15) && ((!(a4==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 6))) && (a3==1))) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) )) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND FALSE !(( a29 <= 140 && (((a4==1) && ((a8==15) && (((input == 6) && (((a25==10) || (a25==11)) || (a25==12))) && 306 < a23 ))) && (a3==1)))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND FALSE !(((((((a3==1) && ((input == 5) && ((a25==11) || (a25==12)))) && (a4==1)) && 306 < a23 ) && ((140 < a29) && (245 >= a29)) ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L631] COND FALSE !(((((a4==1) && ( 306 < a23 && ((a8==15) && (((a25==11) || (a25==12)) && (input == 2))))) && ((140 < a29) && (245 >= a29)) ) && (a3==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L638] COND FALSE !(((((a8==15) && ( a23 <= -43 && (!(a4==1) && ((a25==11) && (input == 5))))) && (a3==1)) && ((245 < a29) && (277 >= a29)) )) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L645] COND FALSE !((((((((input == 2) && ((a25==9) || (a25==10))) && (a8==15)) && ((140 < a29) && (245 >= a29)) ) && 306 < a23 ) && (a3==1)) && (a4==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L652] COND FALSE !(((a8==15) && (((( 277 < a29 && ((input == 2) && ((a25==11) || ((a25==9) || (a25==10))))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L657] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 3) && ((a25==12) || ((a25==10) || (a25==11))))) && !(a4==1)) && (a8==15)) && a29 <= 140 ) && (a3==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L668] COND FALSE !((((!(a4==1) && ((((input == 6) && ((a25==12) || ((a25==10) || (a25==11)))) && (a8==15)) && ((-43 < a23) && (138 >= a23)) )) && (a3==1)) && a29 <= 140 )) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L673] COND FALSE !(((a25==9) && (( a29 <= 140 && ((a3==1) && (!(a4==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 2))))) && (a8==15)))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L680] COND FALSE !((!(a4==1) && ( a23 <= -43 && (((a8==15) && (((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ( ((245 < a29) && (277 >= a29)) && (a25==13))) || ((a25==9) && 277 < a29 )) && (input == 3))) && (a3==1))))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L685] COND FALSE !((((!(a4==1) && ((a3==1) && ((input == 5) && ((( ((245 < a29) && (277 >= a29)) && (a25==12)) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ((a25==9) && 277 < a29 ))))) && a23 <= -43 ) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L691] COND FALSE !(( a23 <= -43 && (!(a4==1) && ( ((245 < a29) && (277 >= a29)) && ((a8==15) && ((a25==11) && ((a3==1) && (input == 3)))))))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L698] COND FALSE !(((((a8==15) && ( 306 < a23 && ( ((140 < a29) && (245 >= a29)) && ((input == 1) && ((a25==9) || (a25==10)))))) && (a4==1)) && (a3==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L704] COND FALSE !((!(a4==1) && (((((a3==1) && ((input == 2) && (((a25==9) || (a25==10)) || (a25==11)))) && ((140 < a29) && (245 >= a29)) ) && a23 <= -43 ) && (a8==15)))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L716] COND FALSE !(((((((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))) && (input == 6)) && (a3==1)) && 306 < a23 ) && (a4==1)) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !(( 306 < a23 && ((a8==15) && ( 277 < a29 && ((a4==1) && ((a3==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 5)))))))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L727] COND FALSE !(((( 277 < a29 && ((a8==15) && (((input == 6) && a23 <= -43 ) && (a25==13)))) && !(a4==1)) && (a3==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L741] COND FALSE !(((a3==1) && (((!(a4==1) && ((( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))) && (input == 3))) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L748] COND FALSE !(((a3==1) && (( 306 < a23 && (((a4==1) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 1))) && a29 <= 140 )) && (a8==15)))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L753] COND FALSE !((((( a23 <= -43 && ((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))))) && (a3==1)) && !(a4==1)) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L760] COND FALSE !(((!(a4==1) && (((a8==15) && ( a29 <= 140 && (((a25==10) || (a25==11)) && (input == 5)))) && a23 <= -43 )) && (a3==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L767] COND FALSE !((((((a8==15) && ((a3==1) && ( a23 <= -43 && (input == 5)))) && !(a4==1)) && (a25==13)) && 277 < a29 )) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L779] COND FALSE !(((a8==15) && ((a3==1) && ( 306 < a23 && ((((((a25==11) || (a25==12)) || (a25==13)) && (input == 1)) && (a4==1)) && ((245 < a29) && (277 >= a29)) ))))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L784] COND FALSE !((!(a4==1) && (((((((a25==12) || (a25==13)) && (input == 6)) && (a8==15)) && a23 <= -43 ) && (a3==1)) && a29 <= 140 ))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L790] COND FALSE !(((a3==1) && (( a23 <= -43 && (((input == 6) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && !(a4==1))) && (a8==15)))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L797] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 6)) && (a25==9))) && a29 <= 140 ) && (a3==1)) && (a8==15))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L802] COND FALSE !((( a29 <= 140 && ((a3==1) && ((a8==15) && ((a25==13) && ( 306 < a23 && (input == 1)))))) && (a4==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L809] COND FALSE !(((a3==1) && (((a8==15) && (((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9)))) && (input == 5)) && 306 < a23 )) && (a4==1)))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L814] COND FALSE !((((((a8==15) && ((input == 4) && (( 277 < a29 && (a25==9)) || (( ((245 < a29) && (277 >= a29)) && (a25==12)) || ( ((245 < a29) && (277 >= a29)) && (a25==13)))))) && !(a4==1)) && a23 <= -43 ) && (a3==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L826] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (!(a4==1) && ((input == 5) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) )))))) && (a8==15)) && (a3==1))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L832] COND FALSE !(( a29 <= 140 && ((((( 306 < a23 && (input == 2)) && (a25==13)) && (a4==1)) && (a3==1)) && (a8==15)))) VAL [a23=-599992, a25=10, a29=-28520, a3=1, a4=0, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L835] COND TRUE ((a8==15) && ((((a3==1) && ((((a25==10) || (a25==11)) && (input == 6)) && a29 <= 140 )) && a23 <= -43 ) && !(a4==1))) [L836] a23 = (((((a23 / 5) + -54477) / 5) % 90)- -119) [L837] a4 = 1 [L838] a25 = 10 [L840] return -1; VAL [a23=54, a25=10, a29=-28520, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1052] output = calculate_output(input) [L1044] COND TRUE 1 [L1047] int input; [L1048] input = __VERIFIER_nondet_int() [L1049] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=54, a25=10, a29=-28520, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=54, a25=10, a29=-28520, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=54, a25=10, a29=-28520, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND TRUE ((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)) VAL [a23=54, a25=10, a29=-28520, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] reach_error() VAL [a23=54, a25=10, a29=-28520, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24294.4ms, OverallIterations: 20, TraceHistogramMax: 4, EmptinessCheckTime: 160.0ms, AutomataDifference: 16842.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3967 SDtfs, 4523 SDslu, 557 SDs, 0 SdLazy, 13675 SolverSat, 1946 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11702.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 555 GetRequests, 525 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 74.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=29401occurred in iteration=18, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2287.1ms AutomataMinimizationTime, 19 MinimizatonAttempts, 17260 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 150.0ms SsaConstructionTime, 620.6ms SatisfiabilityAnalysisTime, 3217.1ms InterpolantComputationTime, 5163 NumberOfCodeBlocks, 5163 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 4738 ConstructedInterpolants, 0 QuantifiedInterpolants, 12388 SizeOfPredicates, 0 NumberOfNonLiveVariables, 780 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 21 InterpolantComputations, 18 PerfectInterpolantSequences, 3219/3254 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-25 21:45:19,396 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...