./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label00.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be --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 e0fca5dbc26170dee357d8c920e255472ddf26c4f4efecf06bc9180208e51483 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-e943c26 [2021-10-21 20:07:26,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 20:07:26,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 20:07:26,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 20:07:26,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 20:07:26,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 20:07:26,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 20:07:26,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 20:07:26,712 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 20:07:26,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 20:07:26,719 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 20:07:26,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 20:07:26,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 20:07:26,724 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 20:07:26,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 20:07:26,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 20:07:26,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 20:07:26,737 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 20:07:26,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 20:07:26,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 20:07:26,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 20:07:26,751 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 20:07:26,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 20:07:26,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 20:07:26,764 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 20:07:26,765 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 20:07:26,765 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 20:07:26,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 20:07:26,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 20:07:26,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 20:07:26,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 20:07:26,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 20:07:26,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 20:07:26,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 20:07:26,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 20:07:26,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 20:07:26,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 20:07:26,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 20:07:26,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 20:07:26,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 20:07:26,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 20:07:26,779 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-21 20:07:26,821 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 20:07:26,822 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 20:07:26,823 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 20:07:26,823 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 20:07:26,824 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 20:07:26,824 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 20:07:26,825 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 20:07:26,825 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 20:07:26,825 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 20:07:26,825 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 20:07:26,827 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 20:07:26,827 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 20:07:26,827 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-21 20:07:26,827 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 20:07:26,827 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-21 20:07:26,828 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 20:07:26,828 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 20:07:26,828 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 20:07:26,828 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-21 20:07:26,829 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 20:07:26,829 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 20:07:26,829 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 20:07:26,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 20:07:26,830 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 20:07:26,830 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 20:07:26,830 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-21 20:07:26,830 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 20:07:26,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-21 20:07:26,831 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-21 20:07:26,832 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-21 20:07:26,833 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-21 20:07:26,833 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 20:07:26,833 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be 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 -> e0fca5dbc26170dee357d8c920e255472ddf26c4f4efecf06bc9180208e51483 [2021-10-21 20:07:27,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 20:07:27,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 20:07:27,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 20:07:27,101 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 20:07:27,102 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 20:07:27,103 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/eca-rers2012/Problem15_label00.c [2021-10-21 20:07:27,209 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/data/b581e9bbb/1909ba86b32841b3b6bfd00ecdf4fbac/FLAG84a2026f4 [2021-10-21 20:07:27,903 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 20:07:27,903 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/sv-benchmarks/c/eca-rers2012/Problem15_label00.c [2021-10-21 20:07:27,931 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/data/b581e9bbb/1909ba86b32841b3b6bfd00ecdf4fbac/FLAG84a2026f4 [2021-10-21 20:07:28,060 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/data/b581e9bbb/1909ba86b32841b3b6bfd00ecdf4fbac [2021-10-21 20:07:28,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 20:07:28,064 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 20:07:28,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 20:07:28,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 20:07:28,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 20:07:28,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 08:07:28" (1/1) ... [2021-10-21 20:07:28,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bcb1b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:07:28, skipping insertion in model container [2021-10-21 20:07:28,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 08:07:28" (1/1) ... [2021-10-21 20:07:28,080 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 20:07:28,176 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 20:07:28,451 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/sv-benchmarks/c/eca-rers2012/Problem15_label00.c[1053,1066] [2021-10-21 20:07:29,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 20:07:29,044 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 20:07:29,057 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/sv-benchmarks/c/eca-rers2012/Problem15_label00.c[1053,1066] [2021-10-21 20:07:29,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 20:07:29,505 INFO L208 MainTranslator]: Completed translation [2021-10-21 20:07:29,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:07:29 WrapperNode [2021-10-21 20:07:29,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 20:07:29,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 20:07:29,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 20:07:29,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 20:07:29,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:07:29" (1/1) ... [2021-10-21 20:07:29,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:07:29" (1/1) ... [2021-10-21 20:07:29,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 20:07:29,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 20:07:29,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 20:07:29,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 20:07:29,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:07:29" (1/1) ... [2021-10-21 20:07:29,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:07:29" (1/1) ... [2021-10-21 20:07:29,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:07:29" (1/1) ... [2021-10-21 20:07:29,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:07:29" (1/1) ... [2021-10-21 20:07:29,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:07:29" (1/1) ... [2021-10-21 20:07:29,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:07:29" (1/1) ... [2021-10-21 20:07:29,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:07:29" (1/1) ... [2021-10-21 20:07:29,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 20:07:29,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 20:07:29,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 20:07:29,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 20:07:29,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:07:29" (1/1) ... [2021-10-21 20:07:29,950 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 20:07:29,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 20:07:29,981 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 20:07:30,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 20:07:30,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 20:07:30,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 20:07:30,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 20:07:30,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 20:07:33,247 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 20:07:33,247 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-10-21 20:07:33,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:07:33 BoogieIcfgContainer [2021-10-21 20:07:33,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 20:07:33,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 20:07:33,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 20:07:33,256 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 20:07:33,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 08:07:28" (1/3) ... [2021-10-21 20:07:33,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a86a307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 08:07:33, skipping insertion in model container [2021-10-21 20:07:33,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:07:29" (2/3) ... [2021-10-21 20:07:33,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a86a307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 08:07:33, skipping insertion in model container [2021-10-21 20:07:33,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:07:33" (3/3) ... [2021-10-21 20:07:33,261 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem15_label00.c [2021-10-21 20:07:33,269 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 20:07:33,270 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-21 20:07:33,325 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 20:07:33,332 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, mAutomataTypeConcurrency=PETRI_NET, 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-10-21 20:07:33,332 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-21 20:07:33,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:07:33,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-21 20:07:33,372 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:07:33,372 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-21 20:07:33,373 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:07:33,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:07:33,381 INFO L82 PathProgramCache]: Analyzing trace with hash 889694410, now seen corresponding path program 1 times [2021-10-21 20:07:33,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:07:33,415 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798282650] [2021-10-21 20:07:33,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:07:33,416 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:07:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:07:33,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:07:33,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:07:33,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798282650] [2021-10-21 20:07:33,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798282650] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:07:33,580 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:07:33,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 20:07:33,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079091207] [2021-10-21 20:07:33,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:07:33,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:07:33,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:07:33,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:07:33,613 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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-10-21 20:07:36,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:07:36,241 INFO L93 Difference]: Finished difference Result 1154 states and 2106 transitions. [2021-10-21 20:07:36,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:07:36,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-10-21 20:07:36,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:07:36,262 INFO L225 Difference]: With dead ends: 1154 [2021-10-21 20:07:36,262 INFO L226 Difference]: Without dead ends: 665 [2021-10-21 20:07:36,267 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:07:36,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2021-10-21 20:07:36,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2021-10-21 20:07:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.4818731117824773) internal successors, (981), 662 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:07:36,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 981 transitions. [2021-10-21 20:07:36,348 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 981 transitions. Word has length 6 [2021-10-21 20:07:36,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:07:36,348 INFO L470 AbstractCegarLoop]: Abstraction has 663 states and 981 transitions. [2021-10-21 20:07:36,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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-10-21 20:07:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 981 transitions. [2021-10-21 20:07:36,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-10-21 20:07:36,352 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:07:36,352 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:07:36,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-21 20:07:36,353 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:07:36,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:07:36,354 INFO L82 PathProgramCache]: Analyzing trace with hash 393562629, now seen corresponding path program 1 times [2021-10-21 20:07:36,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:07:36,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266178942] [2021-10-21 20:07:36,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:07:36,355 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:07:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:07:36,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:07:36,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:07:36,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266178942] [2021-10-21 20:07:36,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266178942] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:07:36,566 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:07:36,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 20:07:36,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617001030] [2021-10-21 20:07:36,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:07:36,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:07:36,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:07:36,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:07:36,571 INFO L87 Difference]: Start difference. First operand 663 states and 981 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 0 states have call successors, (0), 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-10-21 20:07:38,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:07:38,384 INFO L93 Difference]: Finished difference Result 1624 states and 2315 transitions. [2021-10-21 20:07:38,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:07:38,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2021-10-21 20:07:38,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:07:38,391 INFO L225 Difference]: With dead ends: 1624 [2021-10-21 20:07:38,391 INFO L226 Difference]: Without dead ends: 963 [2021-10-21 20:07:38,395 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:07:38,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2021-10-21 20:07:38,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2021-10-21 20:07:38,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.362785862785863) internal successors, (1311), 962 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:07:38,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1311 transitions. [2021-10-21 20:07:38,438 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1311 transitions. Word has length 71 [2021-10-21 20:07:38,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:07:38,439 INFO L470 AbstractCegarLoop]: Abstraction has 963 states and 1311 transitions. [2021-10-21 20:07:38,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 0 states have call successors, (0), 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-10-21 20:07:38,440 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1311 transitions. [2021-10-21 20:07:38,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-10-21 20:07:38,442 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:07:38,443 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:07:38,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-21 20:07:38,443 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:07:38,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:07:38,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1901777492, now seen corresponding path program 1 times [2021-10-21 20:07:38,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:07:38,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821136211] [2021-10-21 20:07:38,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:07:38,445 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:07:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:07:38,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:07:38,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:07:38,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821136211] [2021-10-21 20:07:38,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821136211] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:07:38,540 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:07:38,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 20:07:38,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776770769] [2021-10-21 20:07:38,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:07:38,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:07:38,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:07:38,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:07:38,543 INFO L87 Difference]: Start difference. First operand 963 states and 1311 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 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-10-21 20:07:40,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:07:40,402 INFO L93 Difference]: Finished difference Result 2229 states and 3186 transitions. [2021-10-21 20:07:40,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:07:40,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2021-10-21 20:07:40,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:07:40,412 INFO L225 Difference]: With dead ends: 2229 [2021-10-21 20:07:40,413 INFO L226 Difference]: Without dead ends: 1567 [2021-10-21 20:07:40,414 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-21 20:07:40,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2021-10-21 20:07:40,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1266. [2021-10-21 20:07:40,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.3051383399209486) internal successors, (1651), 1265 states have internal predecessors, (1651), 0 states have call successors, (0), 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-10-21 20:07:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1651 transitions. [2021-10-21 20:07:40,449 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1651 transitions. Word has length 76 [2021-10-21 20:07:40,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:07:40,450 INFO L470 AbstractCegarLoop]: Abstraction has 1266 states and 1651 transitions. [2021-10-21 20:07:40,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 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-10-21 20:07:40,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1651 transitions. [2021-10-21 20:07:40,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-10-21 20:07:40,454 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:07:40,454 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:07:40,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-21 20:07:40,455 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:07:40,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:07:40,456 INFO L82 PathProgramCache]: Analyzing trace with hash -2146356330, now seen corresponding path program 1 times [2021-10-21 20:07:40,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:07:40,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168709509] [2021-10-21 20:07:40,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:07:40,456 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:07:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:07:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:07:40,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:07:40,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168709509] [2021-10-21 20:07:40,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168709509] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:07:40,552 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:07:40,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:07:40,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226137632] [2021-10-21 20:07:40,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 20:07:40,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:07:40,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 20:07:40,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:07:40,554 INFO L87 Difference]: Start difference. First operand 1266 states and 1651 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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-10-21 20:07:45,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:07:45,654 INFO L93 Difference]: Finished difference Result 4670 states and 6174 transitions. [2021-10-21 20:07:45,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 20:07:45,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2021-10-21 20:07:45,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:07:45,673 INFO L225 Difference]: With dead ends: 4670 [2021-10-21 20:07:45,674 INFO L226 Difference]: Without dead ends: 3406 [2021-10-21 20:07:45,676 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:07:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2021-10-21 20:07:45,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 3381. [2021-10-21 20:07:45,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.2372781065088758) internal successors, (4182), 3380 states have internal predecessors, (4182), 0 states have call successors, (0), 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-10-21 20:07:45,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4182 transitions. [2021-10-21 20:07:45,759 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4182 transitions. Word has length 97 [2021-10-21 20:07:45,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:07:45,760 INFO L470 AbstractCegarLoop]: Abstraction has 3381 states and 4182 transitions. [2021-10-21 20:07:45,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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-10-21 20:07:45,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4182 transitions. [2021-10-21 20:07:45,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-10-21 20:07:45,764 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:07:45,765 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:07:45,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-21 20:07:45,766 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:07:45,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:07:45,766 INFO L82 PathProgramCache]: Analyzing trace with hash -678485718, now seen corresponding path program 1 times [2021-10-21 20:07:45,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:07:45,767 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843936015] [2021-10-21 20:07:45,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:07:45,768 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:07:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:07:45,987 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-10-21 20:07:45,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:07:45,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843936015] [2021-10-21 20:07:45,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843936015] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:07:45,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:07:45,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 20:07:45,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615617894] [2021-10-21 20:07:45,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:07:45,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:07:45,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:07:45,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:07:45,993 INFO L87 Difference]: Start difference. First operand 3381 states and 4182 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:07:47,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:07:47,560 INFO L93 Difference]: Finished difference Result 8563 states and 10760 transitions. [2021-10-21 20:07:47,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:07:47,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2021-10-21 20:07:47,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:07:47,592 INFO L225 Difference]: With dead ends: 8563 [2021-10-21 20:07:47,592 INFO L226 Difference]: Without dead ends: 5483 [2021-10-21 20:07:47,597 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-10-21 20:07:47,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2021-10-21 20:07:47,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478. [2021-10-21 20:07:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1694358225305825) internal successors, (6405), 5477 states have internal predecessors, (6405), 0 states have call successors, (0), 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-10-21 20:07:47,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6405 transitions. [2021-10-21 20:07:47,739 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6405 transitions. Word has length 163 [2021-10-21 20:07:47,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:07:47,740 INFO L470 AbstractCegarLoop]: Abstraction has 5478 states and 6405 transitions. [2021-10-21 20:07:47,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:07:47,742 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6405 transitions. [2021-10-21 20:07:47,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-10-21 20:07:47,748 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:07:47,748 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:07:47,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-21 20:07:47,749 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:07:47,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:07:47,750 INFO L82 PathProgramCache]: Analyzing trace with hash 717405888, now seen corresponding path program 1 times [2021-10-21 20:07:47,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:07:47,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811335197] [2021-10-21 20:07:47,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:07:47,751 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:07:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:07:47,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:07:47,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:07:47,972 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811335197] [2021-10-21 20:07:47,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811335197] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:07:47,972 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:07:47,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 20:07:47,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534192690] [2021-10-21 20:07:47,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:07:47,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:07:47,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:07:47,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:07:47,980 INFO L87 Difference]: Start difference. First operand 5478 states and 6405 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 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-10-21 20:07:49,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:07:49,651 INFO L93 Difference]: Finished difference Result 10655 states and 12497 transitions. [2021-10-21 20:07:49,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:07:49,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2021-10-21 20:07:49,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:07:49,690 INFO L225 Difference]: With dead ends: 10655 [2021-10-21 20:07:49,690 INFO L226 Difference]: Without dead ends: 5478 [2021-10-21 20:07:49,697 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:07:49,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2021-10-21 20:07:49,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478. [2021-10-21 20:07:49,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1683403322987036) internal successors, (6399), 5477 states have internal predecessors, (6399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:07:49,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6399 transitions. [2021-10-21 20:07:49,822 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6399 transitions. Word has length 164 [2021-10-21 20:07:49,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:07:49,823 INFO L470 AbstractCegarLoop]: Abstraction has 5478 states and 6399 transitions. [2021-10-21 20:07:49,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 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-10-21 20:07:49,824 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6399 transitions. [2021-10-21 20:07:49,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-10-21 20:07:49,826 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:07:49,826 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:07:49,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-21 20:07:49,827 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:07:49,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:07:49,827 INFO L82 PathProgramCache]: Analyzing trace with hash 456678259, now seen corresponding path program 1 times [2021-10-21 20:07:49,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:07:49,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822419410] [2021-10-21 20:07:49,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:07:49,828 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:07:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:07:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:07:49,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:07:49,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822419410] [2021-10-21 20:07:49,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822419410] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:07:49,938 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:07:49,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:07:49,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909861328] [2021-10-21 20:07:49,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 20:07:49,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:07:49,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 20:07:49,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:07:49,941 INFO L87 Difference]: Start difference. First operand 5478 states and 6399 transitions. Second operand has 4 states, 4 states have (on average 45.5) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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-10-21 20:07:53,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:07:53,598 INFO L93 Difference]: Finished difference Result 12184 states and 14319 transitions. [2021-10-21 20:07:53,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 20:07:53,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 182 [2021-10-21 20:07:53,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:07:53,628 INFO L225 Difference]: With dead ends: 12184 [2021-10-21 20:07:53,628 INFO L226 Difference]: Without dead ends: 7007 [2021-10-21 20:07:53,634 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:07:53,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7007 states. [2021-10-21 20:07:53,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7007 to 5786. [2021-10-21 20:07:53,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5786 states, 5785 states have (on average 1.1799481417458946) internal successors, (6826), 5785 states have internal predecessors, (6826), 0 states have call successors, (0), 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-10-21 20:07:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5786 states to 5786 states and 6826 transitions. [2021-10-21 20:07:53,803 INFO L78 Accepts]: Start accepts. Automaton has 5786 states and 6826 transitions. Word has length 182 [2021-10-21 20:07:53,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:07:53,804 INFO L470 AbstractCegarLoop]: Abstraction has 5786 states and 6826 transitions. [2021-10-21 20:07:53,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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-10-21 20:07:53,804 INFO L276 IsEmpty]: Start isEmpty. Operand 5786 states and 6826 transitions. [2021-10-21 20:07:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-21 20:07:53,808 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:07:53,809 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:07:53,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-21 20:07:53,809 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:07:53,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:07:53,810 INFO L82 PathProgramCache]: Analyzing trace with hash -444310974, now seen corresponding path program 1 times [2021-10-21 20:07:53,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:07:53,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149135241] [2021-10-21 20:07:53,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:07:53,813 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:07:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:07:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:07:53,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:07:53,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149135241] [2021-10-21 20:07:53,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149135241] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:07:53,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:07:53,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:07:53,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435554348] [2021-10-21 20:07:53,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 20:07:53,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:07:53,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 20:07:53,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:07:53,992 INFO L87 Difference]: Start difference. First operand 5786 states and 6826 transitions. Second operand has 4 states, 4 states have (on average 59.75) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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-10-21 20:07:57,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:07:57,824 INFO L93 Difference]: Finished difference Result 13094 states and 15499 transitions. [2021-10-21 20:07:57,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 20:07:57,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-21 20:07:57,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:07:57,861 INFO L225 Difference]: With dead ends: 13094 [2021-10-21 20:07:57,861 INFO L226 Difference]: Without dead ends: 7609 [2021-10-21 20:07:57,866 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:07:57,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7609 states. [2021-10-21 20:07:57,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7609 to 6086. [2021-10-21 20:07:57,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6086 states, 6085 states have (on average 1.1750205423171733) internal successors, (7150), 6085 states have internal predecessors, (7150), 0 states have call successors, (0), 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-10-21 20:07:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6086 states to 6086 states and 7150 transitions. [2021-10-21 20:07:57,980 INFO L78 Accepts]: Start accepts. Automaton has 6086 states and 7150 transitions. Word has length 239 [2021-10-21 20:07:57,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:07:57,981 INFO L470 AbstractCegarLoop]: Abstraction has 6086 states and 7150 transitions. [2021-10-21 20:07:57,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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-10-21 20:07:57,982 INFO L276 IsEmpty]: Start isEmpty. Operand 6086 states and 7150 transitions. [2021-10-21 20:07:57,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2021-10-21 20:07:57,986 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:07:57,987 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:07:57,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-21 20:07:57,987 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:07:57,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:07:57,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1593338374, now seen corresponding path program 1 times [2021-10-21 20:07:57,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:07:57,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431852161] [2021-10-21 20:07:57,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:07:57,989 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:07:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:07:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-10-21 20:07:58,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:07:58,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431852161] [2021-10-21 20:07:58,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431852161] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:07:58,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:07:58,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:07:58,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500510612] [2021-10-21 20:07:58,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:07:58,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:07:58,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:07:58,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:07:58,116 INFO L87 Difference]: Start difference. First operand 6086 states and 7150 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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-10-21 20:07:59,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:07:59,983 INFO L93 Difference]: Finished difference Result 14273 states and 17120 transitions. [2021-10-21 20:07:59,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:07:59,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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-10-21 20:07:59,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:00,001 INFO L225 Difference]: With dead ends: 14273 [2021-10-21 20:08:00,001 INFO L226 Difference]: Without dead ends: 8488 [2021-10-21 20:08:00,008 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-21 20:08:00,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8488 states. [2021-10-21 20:08:00,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8488 to 8484. [2021-10-21 20:08:00,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8484 states, 8483 states have (on average 1.1478250618884829) internal successors, (9737), 8483 states have internal predecessors, (9737), 0 states have call successors, (0), 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-10-21 20:08:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8484 states to 8484 states and 9737 transitions. [2021-10-21 20:08:00,143 INFO L78 Accepts]: Start accepts. Automaton has 8484 states and 9737 transitions. Word has length 293 [2021-10-21 20:08:00,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:00,144 INFO L470 AbstractCegarLoop]: Abstraction has 8484 states and 9737 transitions. [2021-10-21 20:08:00,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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-10-21 20:08:00,145 INFO L276 IsEmpty]: Start isEmpty. Operand 8484 states and 9737 transitions. [2021-10-21 20:08:00,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2021-10-21 20:08:00,151 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:00,152 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:00,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-21 20:08:00,153 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:00,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:00,153 INFO L82 PathProgramCache]: Analyzing trace with hash -803643897, now seen corresponding path program 1 times [2021-10-21 20:08:00,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:00,154 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045716349] [2021-10-21 20:08:00,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:00,154 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:00,307 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-10-21 20:08:00,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:00,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045716349] [2021-10-21 20:08:00,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045716349] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:00,308 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:00,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:00,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862881555] [2021-10-21 20:08:00,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:00,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:00,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:00,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:00,311 INFO L87 Difference]: Start difference. First operand 8484 states and 9737 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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-10-21 20:08:02,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:02,288 INFO L93 Difference]: Finished difference Result 19663 states and 22941 transitions. [2021-10-21 20:08:02,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:02,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 352 [2021-10-21 20:08:02,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:02,310 INFO L225 Difference]: With dead ends: 19663 [2021-10-21 20:08:02,310 INFO L226 Difference]: Without dead ends: 11480 [2021-10-21 20:08:02,319 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-10-21 20:08:02,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11480 states. [2021-10-21 20:08:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11480 to 10583. [2021-10-21 20:08:02,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10583 states, 10582 states have (on average 1.1332451332451332) internal successors, (11992), 10582 states have internal predecessors, (11992), 0 states have call successors, (0), 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-10-21 20:08:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10583 states to 10583 states and 11992 transitions. [2021-10-21 20:08:02,552 INFO L78 Accepts]: Start accepts. Automaton has 10583 states and 11992 transitions. Word has length 352 [2021-10-21 20:08:02,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:02,553 INFO L470 AbstractCegarLoop]: Abstraction has 10583 states and 11992 transitions. [2021-10-21 20:08:02,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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-10-21 20:08:02,553 INFO L276 IsEmpty]: Start isEmpty. Operand 10583 states and 11992 transitions. [2021-10-21 20:08:02,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2021-10-21 20:08:02,560 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:02,561 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:02,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-21 20:08:02,562 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:02,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:02,563 INFO L82 PathProgramCache]: Analyzing trace with hash -902711679, now seen corresponding path program 1 times [2021-10-21 20:08:02,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:02,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931959806] [2021-10-21 20:08:02,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:02,566 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:02,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:02,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931959806] [2021-10-21 20:08:02,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931959806] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 20:08:02,864 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418617242] [2021-10-21 20:08:02,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:02,865 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 20:08:02,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 20:08:02,868 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 20:08:02,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-21 20:08:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:03,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-21 20:08:03,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 20:08:04,998 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:04,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418617242] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 20:08:04,999 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 20:08:04,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-10-21 20:08:04,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508604380] [2021-10-21 20:08:05,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 20:08:05,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:05,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 20:08:05,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-21 20:08:05,002 INFO L87 Difference]: Start difference. First operand 10583 states and 11992 transitions. Second operand has 6 states, 6 states have (on average 69.83333333333333) internal successors, (419), 5 states have internal predecessors, (419), 0 states have call successors, (0), 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-10-21 20:08:10,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:10,697 INFO L93 Difference]: Finished difference Result 31105 states and 35489 transitions. [2021-10-21 20:08:10,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 20:08:10,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 69.83333333333333) internal successors, (419), 5 states have internal predecessors, (419), 0 states have call successors, (0), 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 353 [2021-10-21 20:08:10,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:10,745 INFO L225 Difference]: With dead ends: 31105 [2021-10-21 20:08:10,745 INFO L226 Difference]: Without dead ends: 20823 [2021-10-21 20:08:10,756 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 13.8ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-21 20:08:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20823 states. [2021-10-21 20:08:11,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20823 to 14177. [2021-10-21 20:08:11,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14177 states, 14176 states have (on average 1.1441873589164786) internal successors, (16220), 14176 states have internal predecessors, (16220), 0 states have call successors, (0), 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-10-21 20:08:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14177 states to 14177 states and 16220 transitions. [2021-10-21 20:08:11,061 INFO L78 Accepts]: Start accepts. Automaton has 14177 states and 16220 transitions. Word has length 353 [2021-10-21 20:08:11,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:11,062 INFO L470 AbstractCegarLoop]: Abstraction has 14177 states and 16220 transitions. [2021-10-21 20:08:11,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.83333333333333) internal successors, (419), 5 states have internal predecessors, (419), 0 states have call successors, (0), 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-10-21 20:08:11,063 INFO L276 IsEmpty]: Start isEmpty. Operand 14177 states and 16220 transitions. [2021-10-21 20:08:11,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2021-10-21 20:08:11,071 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:11,072 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:11,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-21 20:08:11,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 20:08:11,291 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:11,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:11,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1625402866, now seen corresponding path program 1 times [2021-10-21 20:08:11,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:11,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839271268] [2021-10-21 20:08:11,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:11,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:11,461 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:11,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:11,461 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839271268] [2021-10-21 20:08:11,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839271268] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:11,462 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:11,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:11,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815029301] [2021-10-21 20:08:11,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:11,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:11,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:11,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:11,464 INFO L87 Difference]: Start difference. First operand 14177 states and 16220 transitions. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 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-10-21 20:08:13,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:13,371 INFO L93 Difference]: Finished difference Result 30754 states and 35725 transitions. [2021-10-21 20:08:13,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:13,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 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 369 [2021-10-21 20:08:13,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:13,395 INFO L225 Difference]: With dead ends: 30754 [2021-10-21 20:08:13,396 INFO L226 Difference]: Without dead ends: 16878 [2021-10-21 20:08:13,409 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-10-21 20:08:13,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16878 states. [2021-10-21 20:08:13,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16878 to 15370. [2021-10-21 20:08:13,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15370 states, 15369 states have (on average 1.1316936690741102) internal successors, (17393), 15369 states have internal predecessors, (17393), 0 states have call successors, (0), 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-10-21 20:08:13,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15370 states to 15370 states and 17393 transitions. [2021-10-21 20:08:13,765 INFO L78 Accepts]: Start accepts. Automaton has 15370 states and 17393 transitions. Word has length 369 [2021-10-21 20:08:13,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:13,766 INFO L470 AbstractCegarLoop]: Abstraction has 15370 states and 17393 transitions. [2021-10-21 20:08:13,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 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-10-21 20:08:13,766 INFO L276 IsEmpty]: Start isEmpty. Operand 15370 states and 17393 transitions. [2021-10-21 20:08:13,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2021-10-21 20:08:13,771 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:13,772 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:13,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-21 20:08:13,772 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:13,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:13,773 INFO L82 PathProgramCache]: Analyzing trace with hash 323971146, now seen corresponding path program 1 times [2021-10-21 20:08:13,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:13,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220011702] [2021-10-21 20:08:13,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:13,774 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:14,048 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 187 proven. 39 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-21 20:08:14,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:14,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220011702] [2021-10-21 20:08:14,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220011702] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 20:08:14,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305549626] [2021-10-21 20:08:14,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:14,050 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 20:08:14,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 20:08:14,051 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 20:08:14,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-21 20:08:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:14,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-21 20:08:14,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 20:08:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 187 proven. 39 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-21 20:08:16,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305549626] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 20:08:16,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 20:08:16,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-10-21 20:08:16,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350128681] [2021-10-21 20:08:16,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 20:08:16,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:16,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 20:08:16,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-10-21 20:08:16,331 INFO L87 Difference]: Start difference. First operand 15370 states and 17393 transitions. Second operand has 7 states, 7 states have (on average 78.57142857142857) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 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-10-21 20:08:22,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:22,240 INFO L93 Difference]: Finished difference Result 40713 states and 46111 transitions. [2021-10-21 20:08:22,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 20:08:22,241 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 78.57142857142857) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 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 409 [2021-10-21 20:08:22,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:22,272 INFO L225 Difference]: With dead ends: 40713 [2021-10-21 20:08:22,272 INFO L226 Difference]: Without dead ends: 19859 [2021-10-21 20:08:22,283 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 66.0ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-10-21 20:08:22,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19859 states. [2021-10-21 20:08:22,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19859 to 17152. [2021-10-21 20:08:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17152 states, 17151 states have (on average 1.1010436709229783) internal successors, (18884), 17151 states have internal predecessors, (18884), 0 states have call successors, (0), 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-10-21 20:08:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17152 states to 17152 states and 18884 transitions. [2021-10-21 20:08:22,670 INFO L78 Accepts]: Start accepts. Automaton has 17152 states and 18884 transitions. Word has length 409 [2021-10-21 20:08:22,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:22,671 INFO L470 AbstractCegarLoop]: Abstraction has 17152 states and 18884 transitions. [2021-10-21 20:08:22,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.57142857142857) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 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-10-21 20:08:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 17152 states and 18884 transitions. [2021-10-21 20:08:22,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2021-10-21 20:08:22,674 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:22,675 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:22,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-21 20:08:22,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 20:08:22,896 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:22,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:22,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1371943525, now seen corresponding path program 1 times [2021-10-21 20:08:22,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:22,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056772702] [2021-10-21 20:08:22,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:22,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:23,169 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 4 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:23,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:23,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056772702] [2021-10-21 20:08:23,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056772702] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 20:08:23,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396127793] [2021-10-21 20:08:23,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:23,170 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 20:08:23,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 20:08:23,171 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 20:08:23,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-21 20:08:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:23,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-21 20:08:23,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 20:08:25,577 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 106 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-21 20:08:25,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396127793] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 20:08:25,577 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 20:08:25,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 6 [2021-10-21 20:08:25,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429758877] [2021-10-21 20:08:25,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 20:08:25,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:25,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 20:08:25,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-21 20:08:25,585 INFO L87 Difference]: Start difference. First operand 17152 states and 18884 transitions. Second operand has 7 states, 7 states have (on average 92.28571428571429) internal successors, (646), 6 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:31,963 INFO L93 Difference]: Finished difference Result 50537 states and 55503 transitions. [2021-10-21 20:08:31,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 20:08:31,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 92.28571428571429) internal successors, (646), 6 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 460 [2021-10-21 20:08:31,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:32,004 INFO L225 Difference]: With dead ends: 50537 [2021-10-21 20:08:32,005 INFO L226 Difference]: Without dead ends: 32789 [2021-10-21 20:08:32,015 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 25.5ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-10-21 20:08:32,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32789 states. [2021-10-21 20:08:32,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32789 to 24940. [2021-10-21 20:08:32,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24940 states, 24939 states have (on average 1.1042142828501544) internal successors, (27538), 24939 states have internal predecessors, (27538), 0 states have call successors, (0), 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-10-21 20:08:32,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24940 states to 24940 states and 27538 transitions. [2021-10-21 20:08:32,537 INFO L78 Accepts]: Start accepts. Automaton has 24940 states and 27538 transitions. Word has length 460 [2021-10-21 20:08:32,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:32,538 INFO L470 AbstractCegarLoop]: Abstraction has 24940 states and 27538 transitions. [2021-10-21 20:08:32,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.28571428571429) internal successors, (646), 6 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:32,541 INFO L276 IsEmpty]: Start isEmpty. Operand 24940 states and 27538 transitions. [2021-10-21 20:08:32,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2021-10-21 20:08:32,545 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:32,547 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:32,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-21 20:08:32,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-10-21 20:08:32,776 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:32,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:32,776 INFO L82 PathProgramCache]: Analyzing trace with hash -503495385, now seen corresponding path program 1 times [2021-10-21 20:08:32,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:32,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624514969] [2021-10-21 20:08:32,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:32,777 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 11 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:33,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:33,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624514969] [2021-10-21 20:08:33,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624514969] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 20:08:33,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102911460] [2021-10-21 20:08:33,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:33,060 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 20:08:33,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 20:08:33,061 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 20:08:33,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-21 20:08:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:33,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-21 20:08:33,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 20:08:35,310 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 11 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:35,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102911460] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 20:08:35,310 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 20:08:35,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-10-21 20:08:35,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740084490] [2021-10-21 20:08:35,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 20:08:35,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:35,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 20:08:35,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-10-21 20:08:35,317 INFO L87 Difference]: Start difference. First operand 24940 states and 27538 transitions. Second operand has 8 states, 8 states have (on average 82.125) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 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-10-21 20:08:39,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:39,848 INFO L93 Difference]: Finished difference Result 57436 states and 63240 transitions. [2021-10-21 20:08:39,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 20:08:39,849 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 82.125) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 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 472 [2021-10-21 20:08:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:39,892 INFO L225 Difference]: With dead ends: 57436 [2021-10-21 20:08:39,892 INFO L226 Difference]: Without dead ends: 32498 [2021-10-21 20:08:39,908 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 470 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 17.9ms TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-10-21 20:08:39,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32498 states. [2021-10-21 20:08:40,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32498 to 25540. [2021-10-21 20:08:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25540 states, 25539 states have (on average 1.1102235796233213) internal successors, (28354), 25539 states have internal predecessors, (28354), 0 states have call successors, (0), 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-10-21 20:08:40,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25540 states to 25540 states and 28354 transitions. [2021-10-21 20:08:40,363 INFO L78 Accepts]: Start accepts. Automaton has 25540 states and 28354 transitions. Word has length 472 [2021-10-21 20:08:40,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:40,364 INFO L470 AbstractCegarLoop]: Abstraction has 25540 states and 28354 transitions. [2021-10-21 20:08:40,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.125) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 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-10-21 20:08:40,364 INFO L276 IsEmpty]: Start isEmpty. Operand 25540 states and 28354 transitions. [2021-10-21 20:08:40,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2021-10-21 20:08:40,369 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:40,370 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:40,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-21 20:08:40,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-10-21 20:08:40,589 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:40,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:40,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1628263109, now seen corresponding path program 1 times [2021-10-21 20:08:40,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:40,590 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719755452] [2021-10-21 20:08:40,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:40,590 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:40,858 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2021-10-21 20:08:40,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:40,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719755452] [2021-10-21 20:08:40,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719755452] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:40,859 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:40,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:40,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197408299] [2021-10-21 20:08:40,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:40,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:40,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:40,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:40,862 INFO L87 Difference]: Start difference. First operand 25540 states and 28354 transitions. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 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-10-21 20:08:42,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:42,628 INFO L93 Difference]: Finished difference Result 57053 states and 63919 transitions. [2021-10-21 20:08:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:42,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 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 495 [2021-10-21 20:08:42,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:42,660 INFO L225 Difference]: With dead ends: 57053 [2021-10-21 20:08:42,660 INFO L226 Difference]: Without dead ends: 31515 [2021-10-21 20:08:42,674 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-10-21 20:08:42,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31515 states. [2021-10-21 20:08:43,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31515 to 27324. [2021-10-21 20:08:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27324 states, 27323 states have (on average 1.1183984189144676) internal successors, (30558), 27323 states have internal predecessors, (30558), 0 states have call successors, (0), 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-10-21 20:08:43,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27324 states to 27324 states and 30558 transitions. [2021-10-21 20:08:43,140 INFO L78 Accepts]: Start accepts. Automaton has 27324 states and 30558 transitions. Word has length 495 [2021-10-21 20:08:43,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:43,141 INFO L470 AbstractCegarLoop]: Abstraction has 27324 states and 30558 transitions. [2021-10-21 20:08:43,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 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-10-21 20:08:43,141 INFO L276 IsEmpty]: Start isEmpty. Operand 27324 states and 30558 transitions. [2021-10-21 20:08:43,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2021-10-21 20:08:43,148 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:43,149 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-21 20:08:43,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-21 20:08:43,150 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:43,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:43,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1749053749, now seen corresponding path program 1 times [2021-10-21 20:08:43,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:43,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533868495] [2021-10-21 20:08:43,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:43,151 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:43,415 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2021-10-21 20:08:43,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:43,416 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533868495] [2021-10-21 20:08:43,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533868495] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:43,416 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:43,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:43,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528625793] [2021-10-21 20:08:43,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:43,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:43,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:43,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:43,420 INFO L87 Difference]: Start difference. First operand 27324 states and 30558 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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-10-21 20:08:44,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:44,894 INFO L93 Difference]: Finished difference Result 54644 states and 61145 transitions. [2021-10-21 20:08:44,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:44,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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 519 [2021-10-21 20:08:44,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:44,926 INFO L225 Difference]: With dead ends: 54644 [2021-10-21 20:08:44,926 INFO L226 Difference]: Without dead ends: 27621 [2021-10-21 20:08:44,936 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-10-21 20:08:44,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27621 states. [2021-10-21 20:08:45,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27621 to 27322. [2021-10-21 20:08:45,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27322 states, 27321 states have (on average 1.1183338823615534) internal successors, (30554), 27321 states have internal predecessors, (30554), 0 states have call successors, (0), 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-10-21 20:08:45,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27322 states to 27322 states and 30554 transitions. [2021-10-21 20:08:45,239 INFO L78 Accepts]: Start accepts. Automaton has 27322 states and 30554 transitions. Word has length 519 [2021-10-21 20:08:45,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:45,239 INFO L470 AbstractCegarLoop]: Abstraction has 27322 states and 30554 transitions. [2021-10-21 20:08:45,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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-10-21 20:08:45,240 INFO L276 IsEmpty]: Start isEmpty. Operand 27322 states and 30554 transitions. [2021-10-21 20:08:45,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2021-10-21 20:08:45,245 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:45,246 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-10-21 20:08:45,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-21 20:08:45,246 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:45,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:45,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1021384384, now seen corresponding path program 1 times [2021-10-21 20:08:45,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:45,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596888661] [2021-10-21 20:08:45,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:45,247 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2021-10-21 20:08:45,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:45,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596888661] [2021-10-21 20:08:45,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596888661] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:45,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:45,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 20:08:45,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651788553] [2021-10-21 20:08:45,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 20:08:45,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:45,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 20:08:45,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:08:45,659 INFO L87 Difference]: Start difference. First operand 27322 states and 30554 transitions. Second operand has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 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-10-21 20:08:48,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:48,422 INFO L93 Difference]: Finished difference Result 63355 states and 70665 transitions. [2021-10-21 20:08:48,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 20:08:48,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 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 588 [2021-10-21 20:08:48,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:48,454 INFO L225 Difference]: With dead ends: 63355 [2021-10-21 20:08:48,454 INFO L226 Difference]: Without dead ends: 36035 [2021-10-21 20:08:48,466 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:08:48,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36035 states. [2021-10-21 20:08:48,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36035 to 29722. [2021-10-21 20:08:48,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29722 states, 29721 states have (on average 1.12647622892904) internal successors, (33480), 29721 states have internal predecessors, (33480), 0 states have call successors, (0), 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-10-21 20:08:49,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29722 states to 29722 states and 33480 transitions. [2021-10-21 20:08:49,015 INFO L78 Accepts]: Start accepts. Automaton has 29722 states and 33480 transitions. Word has length 588 [2021-10-21 20:08:49,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:49,016 INFO L470 AbstractCegarLoop]: Abstraction has 29722 states and 33480 transitions. [2021-10-21 20:08:49,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 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-10-21 20:08:49,016 INFO L276 IsEmpty]: Start isEmpty. Operand 29722 states and 33480 transitions. [2021-10-21 20:08:49,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2021-10-21 20:08:49,021 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:49,022 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-21 20:08:49,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-21 20:08:49,022 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:49,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:49,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1280158286, now seen corresponding path program 1 times [2021-10-21 20:08:49,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:49,023 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643364077] [2021-10-21 20:08:49,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:49,023 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:49,304 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2021-10-21 20:08:49,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:49,305 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643364077] [2021-10-21 20:08:49,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643364077] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:49,305 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:49,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:49,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802052376] [2021-10-21 20:08:49,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:49,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:49,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:49,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:49,308 INFO L87 Difference]: Start difference. First operand 29722 states and 33480 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:51,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:51,107 INFO L93 Difference]: Finished difference Result 63045 states and 71006 transitions. [2021-10-21 20:08:51,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:51,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 594 [2021-10-21 20:08:51,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:51,148 INFO L225 Difference]: With dead ends: 63045 [2021-10-21 20:08:51,148 INFO L226 Difference]: Without dead ends: 33325 [2021-10-21 20:08:51,158 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:51,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33325 states. [2021-10-21 20:08:51,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33325 to 33312. [2021-10-21 20:08:51,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33312 states, 33311 states have (on average 1.0925820299600733) internal successors, (36395), 33311 states have internal predecessors, (36395), 0 states have call successors, (0), 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-10-21 20:08:51,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33312 states to 33312 states and 36395 transitions. [2021-10-21 20:08:51,591 INFO L78 Accepts]: Start accepts. Automaton has 33312 states and 36395 transitions. Word has length 594 [2021-10-21 20:08:51,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:51,591 INFO L470 AbstractCegarLoop]: Abstraction has 33312 states and 36395 transitions. [2021-10-21 20:08:51,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:51,592 INFO L276 IsEmpty]: Start isEmpty. Operand 33312 states and 36395 transitions. [2021-10-21 20:08:51,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2021-10-21 20:08:51,599 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:51,600 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-10-21 20:08:51,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-21 20:08:51,600 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:51,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:51,601 INFO L82 PathProgramCache]: Analyzing trace with hash -755045467, now seen corresponding path program 1 times [2021-10-21 20:08:51,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:51,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133377156] [2021-10-21 20:08:51,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:51,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:51,856 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2021-10-21 20:08:51,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:51,857 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133377156] [2021-10-21 20:08:51,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133377156] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:51,857 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:51,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:51,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084238515] [2021-10-21 20:08:51,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:51,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:51,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:51,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:51,859 INFO L87 Difference]: Start difference. First operand 33312 states and 36395 transitions. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:53,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:53,578 INFO L93 Difference]: Finished difference Result 67535 states and 73702 transitions. [2021-10-21 20:08:53,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:53,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 596 [2021-10-21 20:08:53,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:53,614 INFO L225 Difference]: With dead ends: 67535 [2021-10-21 20:08:53,614 INFO L226 Difference]: Without dead ends: 33926 [2021-10-21 20:08:53,630 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-10-21 20:08:53,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33926 states. [2021-10-21 20:08:54,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33926 to 30319. [2021-10-21 20:08:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30319 states, 30318 states have (on average 1.0897816478659543) internal successors, (33040), 30318 states have internal predecessors, (33040), 0 states have call successors, (0), 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-10-21 20:08:54,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30319 states to 30319 states and 33040 transitions. [2021-10-21 20:08:54,170 INFO L78 Accepts]: Start accepts. Automaton has 30319 states and 33040 transitions. Word has length 596 [2021-10-21 20:08:54,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:54,171 INFO L470 AbstractCegarLoop]: Abstraction has 30319 states and 33040 transitions. [2021-10-21 20:08:54,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:54,171 INFO L276 IsEmpty]: Start isEmpty. Operand 30319 states and 33040 transitions. [2021-10-21 20:08:54,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2021-10-21 20:08:54,180 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:54,181 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-21 20:08:54,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-21 20:08:54,181 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:54,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:54,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1950390383, now seen corresponding path program 1 times [2021-10-21 20:08:54,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:54,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432430602] [2021-10-21 20:08:54,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:54,183 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:54,449 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2021-10-21 20:08:54,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:54,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432430602] [2021-10-21 20:08:54,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432430602] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:54,450 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:54,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:54,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20863335] [2021-10-21 20:08:54,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:54,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:54,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:54,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:54,453 INFO L87 Difference]: Start difference. First operand 30319 states and 33040 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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-10-21 20:08:55,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:55,815 INFO L93 Difference]: Finished difference Result 64522 states and 70226 transitions. [2021-10-21 20:08:55,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:55,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 646 [2021-10-21 20:08:55,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:55,858 INFO L225 Difference]: With dead ends: 64522 [2021-10-21 20:08:55,859 INFO L226 Difference]: Without dead ends: 34803 [2021-10-21 20:08:55,873 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-10-21 20:08:55,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34803 states. [2021-10-21 20:08:56,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34803 to 30916. [2021-10-21 20:08:56,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30916 states, 30915 states have (on average 1.0904091864790555) internal successors, (33710), 30915 states have internal predecessors, (33710), 0 states have call successors, (0), 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-10-21 20:08:56,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30916 states to 30916 states and 33710 transitions. [2021-10-21 20:08:56,359 INFO L78 Accepts]: Start accepts. Automaton has 30916 states and 33710 transitions. Word has length 646 [2021-10-21 20:08:56,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:56,360 INFO L470 AbstractCegarLoop]: Abstraction has 30916 states and 33710 transitions. [2021-10-21 20:08:56,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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-10-21 20:08:56,360 INFO L276 IsEmpty]: Start isEmpty. Operand 30916 states and 33710 transitions. [2021-10-21 20:08:56,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2021-10-21 20:08:56,370 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:56,371 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:56,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-21 20:08:56,371 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:56,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:56,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1089109601, now seen corresponding path program 1 times [2021-10-21 20:08:56,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:56,372 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476391825] [2021-10-21 20:08:56,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:56,373 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:08:56,498 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:08:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:08:56,823 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:08:56,824 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-21 20:08:56,825 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 20:08:56,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-21 20:08:56,833 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 20:08:57,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 08:08:57 BoogieIcfgContainer [2021-10-21 20:08:57,115 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 20:08:57,115 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 20:08:57,116 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 20:08:57,116 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 20:08:57,116 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:07:33" (3/4) ... [2021-10-21 20:08:57,118 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-21 20:08:57,672 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 20:08:57,673 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 20:08:57,676 INFO L168 Benchmark]: Toolchain (without parser) took 89609.61 ms. Allocated memory was 136.3 MB in the beginning and 5.4 GB in the end (delta: 5.2 GB). Free memory was 96.4 MB in the beginning and 4.7 GB in the end (delta: -4.6 GB). Peak memory consumption was 792.8 MB. Max. memory is 16.1 GB. [2021-10-21 20:08:57,677 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 92.3 MB. Free memory is still 49.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 20:08:57,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1441.87 ms. Allocated memory is still 136.3 MB. Free memory was 96.4 MB in the beginning and 47.4 MB in the end (delta: 49.0 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.1 GB. [2021-10-21 20:08:57,678 INFO L168 Benchmark]: Boogie Procedure Inliner took 236.46 ms. Allocated memory is still 136.3 MB. Free memory was 47.4 MB in the beginning and 71.6 MB in the end (delta: -24.2 MB). Peak memory consumption was 13.1 MB. Max. memory is 16.1 GB. [2021-10-21 20:08:57,679 INFO L168 Benchmark]: Boogie Preprocessor took 191.15 ms. Allocated memory is still 136.3 MB. Free memory was 71.6 MB in the beginning and 53.7 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-21 20:08:57,679 INFO L168 Benchmark]: RCFGBuilder took 3313.58 ms. Allocated memory was 136.3 MB in the beginning and 220.2 MB in the end (delta: 83.9 MB). Free memory was 53.7 MB in the beginning and 96.9 MB in the end (delta: -43.2 MB). Peak memory consumption was 51.0 MB. Max. memory is 16.1 GB. [2021-10-21 20:08:57,680 INFO L168 Benchmark]: TraceAbstraction took 83861.91 ms. Allocated memory was 220.2 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 95.8 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 640.7 MB. Max. memory is 16.1 GB. [2021-10-21 20:08:57,680 INFO L168 Benchmark]: Witness Printer took 557.34 ms. Allocated memory was 2.7 GB in the beginning and 5.4 GB in the end (delta: 2.7 GB). Free memory was 1.9 GB in the beginning and 4.7 GB in the end (delta: -2.8 GB). Peak memory consumption was 68.2 MB. Max. memory is 16.1 GB. [2021-10-21 20:08:57,682 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.23 ms. Allocated memory is still 92.3 MB. Free memory is still 49.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1441.87 ms. Allocated memory is still 136.3 MB. Free memory was 96.4 MB in the beginning and 47.4 MB in the end (delta: 49.0 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 236.46 ms. Allocated memory is still 136.3 MB. Free memory was 47.4 MB in the beginning and 71.6 MB in the end (delta: -24.2 MB). Peak memory consumption was 13.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 191.15 ms. Allocated memory is still 136.3 MB. Free memory was 71.6 MB in the beginning and 53.7 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3313.58 ms. Allocated memory was 136.3 MB in the beginning and 220.2 MB in the end (delta: 83.9 MB). Free memory was 53.7 MB in the beginning and 96.9 MB in the end (delta: -43.2 MB). Peak memory consumption was 51.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 83861.91 ms. Allocated memory was 220.2 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 95.8 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 640.7 MB. Max. memory is 16.1 GB. * Witness Printer took 557.34 ms. Allocated memory was 2.7 GB in the beginning and 5.4 GB in the end (delta: 2.7 GB). Free memory was 1.9 GB in the beginning and 4.7 GB in the end (delta: -2.8 GB). Peak memory consumption was 68.2 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: 35]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int inputD = 4; [L19] int inputB = 2; [L20] int inputE = 5; [L21] int inputA = 1; [L22] int inputF = 6; [L23] int inputC = 3; [L26] int a4 = -89; [L27] int a29 = -127; [L28] int a2 = 1; [L29] int a0 = -44; VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1773] int output = -1; VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1776] COND TRUE 1 [L1779] int input; [L1780] input = __VERIFIER_nondet_int() [L1781] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L34] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((((a2==1) && a4 <= -86 ) && -61 < a0 ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L218] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 1) && (((a2==3) && a29 <= -144 ) || (((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2)))))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L229] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==2) && ( a29 <= -144 && (input == 3))) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((( a0 <= -147 && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==4)))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !(((((a2==3) && ((input == 3) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && -61 < a0 ) && a4 <= -86 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !(((((input == 5) && (( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (( 43 < a29 && (a2==1)) || ((a2==2) && a29 <= -144 )))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L263] COND FALSE !(((((( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((( -61 < a0 && ((((a2==3) && a29 <= -144 ) || (( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ( 43 < a29 && (a2==2)))) && (input == 2))) && a4 <= -86 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !(((((a2==4) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((((input == 4) && 43 < a29 ) && (a2==1)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L288] COND FALSE !((( -61 < a0 && (((( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 1))) && a4 <= -86 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L295] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==3))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L302] COND FALSE !((((a2==2) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !((((((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !(((a2==4) && ( -61 < a0 && ( a4 <= -86 && ((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !((((((input == 3) && -61 < a0 ) && a4 <= -86 ) && ((-16 < a29) && (43 >= a29)) ) && (a2==5))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L337] COND FALSE !(((a2==1) && ( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L343] COND FALSE !((( -61 < a0 && ( 43 < a29 && ((input == 4) && (a2==5)))) && a4 <= -86 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L346] COND FALSE !(((((((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==3) && 43 < a29 ) || ( a29 <= -144 && (a2==4)))) && (input == 5)) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(( 43 < a29 && (( -61 < a0 && ( a4 <= -86 && (input == 1))) && (a2==5)))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !((( a4 <= -86 && ( 43 < a29 && ((input == 2) && -61 < a0 ))) && (a2==3))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L371] COND FALSE !(((((input == 6) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !((((( ((-98 < a0) && (-61 >= a0)) && (input == 3)) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !(((( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L390] COND FALSE !(((( a4 <= -86 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1))) && (a2==1)) && -61 < a0 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( -61 < a0 && ((( 43 < a29 && (input == 6)) && (a2==5)) && a4 <= -86 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 3) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (a2==5))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && ((-86 < a4) && (-42 >= a4)) )) && (a2==4))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && (a2==4))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !((((((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 ) && (input == 6)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((a2==3) && (((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) && (a2==5))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==3) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((((a2==3) && (( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2))) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L455] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && (a2==5)) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) )) && (a2==4))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(((((((a2==5) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 ))) && (input == 2)) && a4 <= -86 ) && -61 < a0 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L472] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (( ((-98 < a0) && (-61 >= a0)) && (input == 6)) && (a2==2))) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && ( a4 <= -86 && (((input == 6) && -61 < a0 ) && (a2==5))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L484] COND FALSE !((( ((-16 < a29) && (43 >= a29)) && (((input == 4) && -61 < a0 ) && a4 <= -86 )) && (a2==5))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 5) && ((( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ((a2==2) && 43 < a29 )) || ( a29 <= -144 && (a2==3))))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L496] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && (((input == 1) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==2))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L501] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 6) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && (a2==2))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((input == 3) && ((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L512] COND FALSE !(((( a0 <= -147 && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-98 < a0) && (-61 >= a0)) ) && (a2==1))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( a29 <= -144 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 3) && (a2==5)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L530] COND FALSE !(((a2==4) && ( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && a0 <= -147 )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L539] COND FALSE !((((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L552] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && ( a0 <= -147 && ( ((-16 < a29) && (43 >= a29)) && (input == 5)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L556] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( a0 <= -147 && ((( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2)))) && (input == 4))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L567] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==2) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)) && ((-98 < a0) && (-61 >= a0)) )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==5) && ( 43 < a29 && (input == 3)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L584] COND FALSE !(( -61 < a0 && ( a4 <= -86 && (((a2==3) && (input == 4)) && 43 < a29 )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L597] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 )) || ((a2==2) && a29 <= -144 )) && (input == 6))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L604] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L616] COND FALSE !((((a2==2) && (( ((-144 < a29) && (-16 >= a29)) && (input == 1)) && ((-86 < a4) && (-42 >= a4)) )) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L623] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 6) && (((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L630] COND FALSE !(((((a2==1) && ((input == 5) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L637] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )))) && (a2==2))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L644] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && (( a0 <= -147 && (input == 2)) && 43 < a29 )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L651] COND FALSE !(((a2==1) && ( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) && a0 <= -147 )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L662] COND FALSE !(((((a2==1) && ((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L667] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==1) && ((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L672] COND FALSE !(( a0 <= -147 && ((a2==2) && ( ((-86 < a4) && (-42 >= a4)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 2)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L678] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ((((( 43 < a29 && (a2==2)) || ((a2==3) && a29 <= -144 )) || ((a2==3) && ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L685] COND FALSE !(((((a2==5) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L691] COND FALSE !(((a2==2) && ( ((-98 < a0) && (-61 >= a0)) && (( a29 <= -144 && (input == 1)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L697] COND FALSE !(((( a4 <= -86 && ( -61 < a0 && (input == 5))) && (a2==5)) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L703] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 6)) && (a2==4)) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L717] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 4)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ((-98 < a0) && (-61 >= a0)) )) && a29 <= -144 ) && (a2==2))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L728] COND FALSE !(((a2==1) && ((((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L735] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((((a2==4) && 43 < a29 ) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 3))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L742] COND FALSE !((((a2==5) && (((input == 5) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L745] COND FALSE !(((( ((-16 < a29) && (43 >= a29)) && ((input == 1) && ((-147 < a0) && (-98 >= a0)) )) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L752] COND FALSE !((( a4 <= -86 && ((input == 6) && ((((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ((a2==2) && 43 < a29 )) || ((a2==3) && a29 <= -144 )))) && -61 < a0 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L758] COND FALSE !(((( -61 < a0 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 5))) && a4 <= -86 ) && (a2==3))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L764] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==2)) || ((a2==3) && a29 <= -144 ))) && (input == 5))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L771] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 6) && ((-86 < a4) && (-42 >= a4)) ) && (a2==1)) && 43 < a29 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L778] COND FALSE !(( a0 <= -147 && ((((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L784] COND FALSE !(((((a2==1) && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L789] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((a2==4) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L796] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 4) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L803] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 && (a2==2)) || (( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 ))) && (input == 4))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L814] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && (( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L821] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && (a2==2))) && a0 <= -147 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L827] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==3) && ( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L834] COND FALSE !(((a2==5) && ((( a0 <= -147 && (input == 5)) && 43 < a29 ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L839] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && (( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && (input == 3))) && a0 <= -147 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L850] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((a2==4) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L855] COND FALSE !((( a4 <= -86 && ((input == 3) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) )))) && -61 < a0 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L861] COND FALSE !(((a2==4) && ((((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L865] COND FALSE !(((a2==5) && ((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L872] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) && 43 < a29 ) || ( a29 <= -144 && (a2==3)))) && (input == 1))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L878] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && a0 <= -147 ) && (a2==5)))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L884] COND FALSE !(( a4 <= -86 && ( -61 < a0 && ((input == 5) && ((( 43 < a29 && (a2==4)) || ( a29 <= -144 && (a2==5))) || ((a2==5) && ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L890] COND FALSE !(((a2==3) && ( a4 <= -86 && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1)) && -61 < a0 )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L895] COND FALSE !(((a2==5) && ((((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L905] COND FALSE !((((( -61 < a0 && (input == 2)) && 43 < a29 ) && a4 <= -86 ) && (a2==5))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L911] COND FALSE !((((((input == 1) && (a2==1)) && 43 < a29 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L917] COND FALSE !(((((a2==2) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L922] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 6) && 43 < a29 ) && (a2==2))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L929] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && (a2==3)))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L935] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 1) && (a2==5)) && ((-86 < a4) && (-42 >= a4)) )) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L940] COND FALSE !((((a2==1) && ( a0 <= -147 && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 6)))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L945] COND FALSE !(((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==4))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L952] COND FALSE !((((a2==1) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L958] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && ((input == 5) && (a2==2)))) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L965] COND FALSE !((( -61 < a0 && ((a2==1) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)))) && a4 <= -86 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L969] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((((((a2==1) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )) && (input == 5)) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L976] COND FALSE !((((( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && ((-16 < a29) && (43 >= a29)) ) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L983] COND FALSE !(( a4 <= -86 && ((( 43 < a29 && (input == 5)) && -61 < a0 ) && (a2==3)))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L989] COND FALSE !((((a2==4) && ( a4 <= -86 && ((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )))) && -61 < a0 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L995] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 6)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==1)))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1002] COND FALSE !(((((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6)) && ((-86 < a4) && (-42 >= a4)) ) && (a2==2)) && a0 <= -147 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1008] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && (a2==4))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1014] COND FALSE !((((((input == 1) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) ) && (a2==5)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1021] COND FALSE !(((( ((-98 < a0) && (-61 >= a0)) && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1026] COND FALSE !((((a2==4) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1029] COND FALSE !((((a2==2) && (( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) )) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1036] COND FALSE !(((a2==5) && ( ((-86 < a4) && (-42 >= a4)) && (( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && a29 <= -144 )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1040] COND FALSE !(( a4 <= -86 && ((((((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2))) || ((a2==3) && a29 <= -144 )) && (input == 3)) && -61 < a0 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1045] COND FALSE !(((a2==2) && ( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 1)) && a0 <= -147 )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1048] COND FALSE !(( a0 <= -147 && ((((((a2==3) && 43 < a29 ) || ( a29 <= -144 && (a2==4))) || ((a2==4) && ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1054] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (( a0 <= -147 && ((a2==5) && (input == 1))) && 43 < a29 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1059] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) )) && (a2==5))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1072] COND FALSE !((((a2==2) && (((input == 4) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1084] COND FALSE !((((((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1091] COND FALSE !(( a4 <= -86 && (((input == 6) && ((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) ))) && -61 < a0 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1096] COND FALSE !(((a2==1) && (( 43 < a29 && ((input == 2) && ((-98 < a0) && (-61 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1101] COND FALSE !((((((input == 4) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && a4 <= -86 ) && (a2==3)) && -61 < a0 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1108] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==4))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1118] COND FALSE !(((a2==2) && (((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1125] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1132] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && (((input == 2) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && (a2==5))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1138] COND FALSE !(( 43 < a29 && ( a4 <= -86 && ( -61 < a0 && ((a2==3) && (input == 3)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1144] COND FALSE !((((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) ) && (a2==3))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1155] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( a0 <= -147 && ((( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (( 43 < a29 && (a2==1)) || ((a2==2) && a29 <= -144 ))) && (input == 1))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1160] COND FALSE !(((a2==4) && ((((input == 3) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1166] COND FALSE !(((a2==4) && ((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 1)) && a4 <= -86 ) && -61 < a0 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1172] COND FALSE !((((a2==4) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 4)) && ((-98 < a0) && (-61 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1178] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ( 43 < a29 && ((input == 3) && (a2==1)))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1182] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((a2==1) && ( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1188] COND FALSE !(( a0 <= -147 && (((((a2==2) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2)))) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1194] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 2) && (a2==2))) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1200] COND FALSE !((((( ((-98 < a0) && (-61 >= a0)) && (input == 2)) && a29 <= -144 ) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1207] COND FALSE !((((a2==5) && ( -61 < a0 && ((input == 5) && 43 < a29 ))) && a4 <= -86 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1213] COND FALSE !((((( a0 <= -147 && (input == 6)) && (a2==5)) && 43 < a29 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1218] COND FALSE !(( 43 < a29 && ((((input == 4) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1222] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && ((a2==1) && ((input == 3) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1228] COND FALSE !(( -61 < a0 && (((input == 1) && ((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2)))) && a4 <= -86 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1234] COND FALSE !(((( ((-98 < a0) && (-61 >= a0)) && ((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1241] COND FALSE !(((a2==3) && (( ((-98 < a0) && (-61 >= a0)) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1247] COND FALSE !(( -61 < a0 && ((((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2))) && (input == 2)) && a4 <= -86 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1253] COND FALSE !(((((input == 1) && (( a29 <= -144 && (a2==2)) || (( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 )))) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1259] COND FALSE !(((( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && (input == 3))) && (a2==5)) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1265] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 5)) && a0 <= -147 )) && (a2==3))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1271] COND FALSE !(((a2==2) && ((((input == 3) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1274] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && (input == 2))) && (a2==5)) && a29 <= -144 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1281] COND FALSE !((( -61 < a0 && ((input == 5) && ((((a2==1) && 43 < a29 ) || ((a2==2) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2))))) && a4 <= -86 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1287] COND FALSE !(((a2==1) && ((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1293] COND FALSE !(((( ((-147 < a0) && (-98 >= a0)) && ((a2==2) && (input == 6))) && ((-86 < a4) && (-42 >= a4)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1299] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ( 43 < a29 && (((a2==2) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1310] COND FALSE !(((((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ) && (a2==3))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1316] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && (( ((-86 < a4) && (-42 >= a4)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 4))) && (a2==3)))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1323] COND FALSE !(((a2==1) && (((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 6)) && a4 <= -86 ) && -61 < a0 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1327] COND FALSE !(( -61 < a0 && ( a4 <= -86 && (((input == 5) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && (a2==1))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1331] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((((input == 5) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-98 < a0) && (-61 >= a0)) ) && (a2==4)))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1343] COND FALSE !((( a0 <= -147 && (((input == 1) && ((-86 < a4) && (-42 >= a4)) ) && (a2==1))) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1348] COND FALSE !((( -61 < a0 && ((((a2==5) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 ))) && (input == 6))) && a4 <= -86 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1354] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ((a2==5) && (((input == 4) && ( 43 < a29 || ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1360] COND FALSE !((( a0 <= -147 && (((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==4))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1369] COND FALSE !(((((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 6)) && a4 <= -86 ) && (a2==3)) && -61 < a0 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1375] COND FALSE !((((((input == 6) && a29 <= -144 ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1381] COND FALSE !((((((input == 4) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) && a0 <= -147 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1388] COND FALSE !(( -61 < a0 && (((a2==3) && ( a4 <= -86 && (input == 1))) && 43 < a29 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1395] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 6) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && (a2==5))) && a0 <= -147 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1398] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((a2==4) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 4)))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1404] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 5)) && ((-98 < a0) && (-61 >= a0)) )) && (a2==3))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1418] COND FALSE !(( a4 <= -86 && ((((((a2==1) && 43 < a29 ) || ((a2==2) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==2))) && (input == 4)) && -61 < a0 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1423] COND FALSE !((((a2==3) && (((input == 5) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1429] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && (((a2==3) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1441] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((a2==2) && ( ((-144 < a29) && (-16 >= a29)) && (input == 5)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1448] COND FALSE !(((((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) && 43 < a29 ) || ((a2==3) && a29 <= -144 ))) && (input == 6)) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1459] COND FALSE !(((a2==3) && ( ((-147 < a0) && (-98 >= a0)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1466] COND FALSE !(((((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 1)) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1471] COND FALSE !(((a2==2) && (( ((-98 < a0) && (-61 >= a0)) && ((input == 5) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1476] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 5)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1483] COND FALSE !(((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 1)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==4))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1488] COND FALSE !((((((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1492] COND FALSE !((( a0 <= -147 && ((input == 3) && ((( 43 < a29 && (a2==1)) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1498] COND FALSE !(( -61 < a0 && (((input == 4) && (( ((-144 < a29) && (-16 >= a29)) && (a2==5)) || (((a2==4) && 43 < a29 ) || ((a2==5) && a29 <= -144 )))) && a4 <= -86 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1504] COND FALSE !(((a2==4) && ( ((-147 < a0) && (-98 >= a0)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 5)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1511] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 1)) && (a2==4))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1518] COND FALSE !((((( ((-86 < a4) && (-42 >= a4)) && (input == 5)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==2)) && 43 < a29 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1521] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==2) && (( 43 < a29 && (input == 1)) && ((-98 < a0) && (-61 >= a0)) )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1526] COND FALSE !(((a2==5) && ( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1532] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 1)))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1538] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && (((a2==1) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 1))) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1543] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((((((a2==2) && 43 < a29 ) || ((a2==3) && a29 <= -144 )) || ((a2==3) && ((-144 < a29) && (-16 >= a29)) )) && (input == 3)) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1550] COND FALSE !(( a0 <= -147 && ((((a2==1) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ) && ((-16 < a29) && (43 >= a29)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1557] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && ( ((-147 < a0) && (-98 >= a0)) && ((a2==2) && ((input == 2) && ((-86 < a4) && (-42 >= a4)) ))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1564] COND FALSE !((((a2==1) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)) && a4 <= -86 )) && -61 < a0 )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1569] COND FALSE !(((a2==4) && (( ((-86 < a4) && (-42 >= a4)) && ((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1576] COND FALSE !((( a0 <= -147 && (((input == 6) && ((-86 < a4) && (-42 >= a4)) ) && (a2==1))) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1580] COND FALSE !(( a4 <= -86 && (((((a2==3) && a29 <= -144 ) || (((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2)))) && (input == 4)) && -61 < a0 ))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1592] COND FALSE !(( ((-144 < a29) && (-16 >= a29)) && ((a2==2) && (( ((-86 < a4) && (-42 >= a4)) && (input == 6)) && ((-147 < a0) && (-98 >= a0)) )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1599] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) && (a2==4))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1605] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 1)) && a0 <= -147 )))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1612] COND FALSE !(((( ((-16 < a29) && (43 >= a29)) && ( ((-86 < a4) && (-42 >= a4)) && (input == 2))) && a0 <= -147 ) && (a2==1))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1616] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) && (input == 3)) && (a2==2))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1622] COND FALSE !(((a2==3) && ( ((-98 < a0) && (-61 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1633] COND FALSE !(( a4 <= -86 && (( -61 < a0 && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 6))) && (a2==4)))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1639] COND FALSE !(( a4 <= -86 && ( ((-16 < a29) && (43 >= a29)) && (( -61 < a0 && (input == 2)) && (a2==5))))) VAL [a0=-44, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1645] COND TRUE (((a2==1) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && a4 <= -86 )) && -61 < a0 ) [L1646] a29 = (((a29 / 5) / 5) + 4459) [L1647] a2 = 2 [L1649] return 22; VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1784] output = calculate_output(input) [L1776] COND TRUE 1 [L1779] int input; [L1780] input = __VERIFIER_nondet_int() [L1781] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L34] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((((a2==1) && a4 <= -86 ) && -61 < a0 ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L218] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 1) && (((a2==3) && a29 <= -144 ) || (((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2)))))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L229] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==2) && ( a29 <= -144 && (input == 3))) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((( a0 <= -147 && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==4)))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !(((((a2==3) && ((input == 3) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && -61 < a0 ) && a4 <= -86 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !(((((input == 5) && (( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (( 43 < a29 && (a2==1)) || ((a2==2) && a29 <= -144 )))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L263] COND FALSE !(((((( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((( -61 < a0 && ((((a2==3) && a29 <= -144 ) || (( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ( 43 < a29 && (a2==2)))) && (input == 2))) && a4 <= -86 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !(((((a2==4) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((((input == 4) && 43 < a29 ) && (a2==1)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L288] COND FALSE !((( -61 < a0 && (((( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 1))) && a4 <= -86 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L295] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==3))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L302] COND FALSE !((((a2==2) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !((((((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !(((a2==4) && ( -61 < a0 && ( a4 <= -86 && ((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !((((((input == 3) && -61 < a0 ) && a4 <= -86 ) && ((-16 < a29) && (43 >= a29)) ) && (a2==5))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L337] COND FALSE !(((a2==1) && ( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L343] COND FALSE !((( -61 < a0 && ( 43 < a29 && ((input == 4) && (a2==5)))) && a4 <= -86 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L346] COND FALSE !(((((((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==3) && 43 < a29 ) || ( a29 <= -144 && (a2==4)))) && (input == 5)) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(( 43 < a29 && (( -61 < a0 && ( a4 <= -86 && (input == 1))) && (a2==5)))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !((( a4 <= -86 && ( 43 < a29 && ((input == 2) && -61 < a0 ))) && (a2==3))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L371] COND FALSE !(((((input == 6) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !((((( ((-98 < a0) && (-61 >= a0)) && (input == 3)) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !(((( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L390] COND FALSE !(((( a4 <= -86 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1))) && (a2==1)) && -61 < a0 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( -61 < a0 && ((( 43 < a29 && (input == 6)) && (a2==5)) && a4 <= -86 ))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 3) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (a2==5))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && ((-86 < a4) && (-42 >= a4)) )) && (a2==4))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && (a2==4))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !((((((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 ) && (input == 6)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((a2==3) && (((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) && (a2==5))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==3) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((((a2==3) && (( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2))) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L455] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && (a2==5)) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) )) && (a2==4))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(((((((a2==5) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 ))) && (input == 2)) && a4 <= -86 ) && -61 < a0 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L472] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (( ((-98 < a0) && (-61 >= a0)) && (input == 6)) && (a2==2))) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && ( a4 <= -86 && (((input == 6) && -61 < a0 ) && (a2==5))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L484] COND FALSE !((( ((-16 < a29) && (43 >= a29)) && (((input == 4) && -61 < a0 ) && a4 <= -86 )) && (a2==5))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 5) && ((( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ((a2==2) && 43 < a29 )) || ( a29 <= -144 && (a2==3))))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L496] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && (((input == 1) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==2))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L501] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 6) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )) && (a2==2))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((input == 3) && ((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L512] COND FALSE !(((( a0 <= -147 && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-98 < a0) && (-61 >= a0)) ) && (a2==1))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( a29 <= -144 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 3) && (a2==5)))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L530] COND FALSE !(((a2==4) && ( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && a0 <= -147 )))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L539] COND FALSE !((((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L552] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && ( a0 <= -147 && ( ((-16 < a29) && (43 >= a29)) && (input == 5)))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L556] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( a0 <= -147 && ((( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2)))) && (input == 4))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L567] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==2) && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)) && ((-98 < a0) && (-61 >= a0)) )))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==5) && ( 43 < a29 && (input == 3)))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L584] COND FALSE !(( -61 < a0 && ( a4 <= -86 && (((a2==3) && (input == 4)) && 43 < a29 )))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L597] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 )) || ((a2==2) && a29 <= -144 )) && (input == 6))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L604] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L616] COND FALSE !((((a2==2) && (( ((-144 < a29) && (-16 >= a29)) && (input == 1)) && ((-86 < a4) && (-42 >= a4)) )) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L623] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 6) && (((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L630] COND FALSE !(((((a2==1) && ((input == 5) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L637] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) )))) && (a2==2))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L644] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && (( a0 <= -147 && (input == 2)) && 43 < a29 )))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L651] COND FALSE !(((a2==1) && ( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) && a0 <= -147 )))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L662] COND FALSE !(((((a2==1) && ((input == 6) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L667] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==1) && ((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L672] COND FALSE !(( a0 <= -147 && ((a2==2) && ( ((-86 < a4) && (-42 >= a4)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 2)))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L678] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ((((( 43 < a29 && (a2==2)) || ((a2==3) && a29 <= -144 )) || ((a2==3) && ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L685] COND FALSE !(((((a2==5) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L691] COND FALSE !(((a2==2) && ( ((-98 < a0) && (-61 >= a0)) && (( a29 <= -144 && (input == 1)) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L697] COND FALSE !(((( a4 <= -86 && ( -61 < a0 && (input == 5))) && (a2==5)) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L703] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 6)) && (a2==4)) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L717] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==5) && ( ((-98 < a0) && (-61 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 4)))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ((-98 < a0) && (-61 >= a0)) )) && a29 <= -144 ) && (a2==2))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L728] COND FALSE !(((a2==1) && ((((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L735] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((((a2==4) && 43 < a29 ) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 3))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L742] COND FALSE !((((a2==5) && (((input == 5) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) )) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L745] COND FALSE !(((( ((-16 < a29) && (43 >= a29)) && ((input == 1) && ((-147 < a0) && (-98 >= a0)) )) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L752] COND FALSE !((( a4 <= -86 && ((input == 6) && ((((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ((a2==2) && 43 < a29 )) || ((a2==3) && a29 <= -144 )))) && -61 < a0 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L758] COND FALSE !(((( -61 < a0 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 5))) && a4 <= -86 ) && (a2==3))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L764] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && ( ((-86 < a4) && (-42 >= a4)) && ((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29 && (a2==2)) || ((a2==3) && a29 <= -144 ))) && (input == 5))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L771] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((((input == 6) && ((-86 < a4) && (-42 >= a4)) ) && (a2==1)) && 43 < a29 ))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L778] COND FALSE !(( a0 <= -147 && ((((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L784] COND FALSE !(((((a2==1) && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L789] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((a2==4) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L796] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 4) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L803] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( a29 <= -144 && (a2==2)) || (( ((-16 < a29) && (43 >= a29)) && (a2==1)) || ((a2==1) && 43 < a29 ))) && (input == 4))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L814] COND FALSE !(( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && (( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L821] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && (a2==2))) && a0 <= -147 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L827] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((a2==3) && ( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L834] COND FALSE !(((a2==5) && ((( a0 <= -147 && (input == 5)) && 43 < a29 ) && ((-86 < a4) && (-42 >= a4)) ))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L839] COND FALSE !(( ((-16 < a29) && (43 >= a29)) && (( ((-86 < a4) && (-42 >= a4)) && ((a2==1) && (input == 3))) && a0 <= -147 ))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L850] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-147 < a0) && (-98 >= a0)) && ((a2==4) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L855] COND FALSE !((( a4 <= -86 && ((input == 3) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) )))) && -61 < a0 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L861] COND FALSE !(((a2==4) && ((((input == 6) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L865] COND FALSE !(((a2==5) && ((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 ))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L872] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ((((a2==3) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) && 43 < a29 ) || ( a29 <= -144 && (a2==3)))) && (input == 1))) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L878] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && a0 <= -147 ) && (a2==5)))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L884] COND FALSE !(( a4 <= -86 && ( -61 < a0 && ((input == 5) && ((( 43 < a29 && (a2==4)) || ( a29 <= -144 && (a2==5))) || ((a2==5) && ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L890] COND FALSE !(((a2==3) && ( a4 <= -86 && ((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1)) && -61 < a0 )))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L895] COND FALSE !(((a2==5) && ((((input == 1) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L905] COND FALSE !((((( -61 < a0 && (input == 2)) && 43 < a29 ) && a4 <= -86 ) && (a2==5))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L911] COND FALSE !((((((input == 1) && (a2==1)) && 43 < a29 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L917] COND FALSE !(((((a2==2) && ((input == 4) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L922] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 6) && 43 < a29 ) && (a2==2))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L929] COND FALSE !(( ((-147 < a0) && (-98 >= a0)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-86 < a4) && (-42 >= a4)) ) && (a2==3)))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L935] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 1) && (a2==5)) && ((-86 < a4) && (-42 >= a4)) )) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L940] COND FALSE !((((a2==1) && ( a0 <= -147 && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 6)))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L945] COND FALSE !(((((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==4))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L952] COND FALSE !((((a2==1) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L958] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && ((input == 5) && (a2==2)))) && a29 <= -144 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L965] COND FALSE !((( -61 < a0 && ((a2==1) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 3)))) && a4 <= -86 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L969] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ((((((a2==1) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==1))) || ((a2==2) && a29 <= -144 )) && (input == 5)) && ((-147 < a0) && (-98 >= a0)) ))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L976] COND FALSE !((((( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && ((-16 < a29) && (43 >= a29)) ) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L983] COND FALSE !(( a4 <= -86 && ((( 43 < a29 && (input == 5)) && -61 < a0 ) && (a2==3)))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L989] COND FALSE !((((a2==4) && ( a4 <= -86 && ((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )))) && -61 < a0 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L995] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 6)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==1)))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1002] COND FALSE !(((((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 6)) && ((-86 < a4) && (-42 >= a4)) ) && (a2==2)) && a0 <= -147 )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1008] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && (a2==4))))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1014] COND FALSE !((((((input == 1) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 )) && ((-147 < a0) && (-98 >= a0)) ) && (a2==5)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1021] COND FALSE !(((( ((-98 < a0) && (-61 >= a0)) && ((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && (a2==3)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1026] COND FALSE !((((a2==4) && ( ((-86 < a4) && (-42 >= a4)) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )))) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1029] COND FALSE !((((a2==2) && (( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && ((-86 < a4) && (-42 >= a4)) )) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1036] COND FALSE !(((a2==5) && ( ((-86 < a4) && (-42 >= a4)) && (( ((-147 < a0) && (-98 >= a0)) && (input == 4)) && a29 <= -144 )))) VAL [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1040] COND TRUE ( a4 <= -86 && ((((((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2))) || ((a2==3) && a29 <= -144 )) && (input == 3)) && -61 < a0 )) [L1041] a29 = ((((a29 + 0) + 0) % 29)+ 14) [L1042] a2 = 4 [L1044] return 22; VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1784] output = calculate_output(input) [L1776] COND TRUE 1 [L1779] int input; [L1780] input = __VERIFIER_nondet_int() [L1781] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L34] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((((a2==1) && a4 <= -86 ) && -61 < a0 ) && a29 <= -144 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L218] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 1) && (((a2==3) && a29 <= -144 ) || (((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2)))))))) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L229] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==2) && ( a29 <= -144 && (input == 3))) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((( a0 <= -147 && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==4)))) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !(((((a2==3) && ((input == 3) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && -61 < a0 ) && a4 <= -86 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !(((((input == 5) && (( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (( 43 < a29 && (a2==1)) || ((a2==2) && a29 <= -144 )))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L263] COND FALSE !(((((( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((( -61 < a0 && ((((a2==3) && a29 <= -144 ) || (( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ( 43 < a29 && (a2==2)))) && (input == 2))) && a4 <= -86 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !(((((a2==4) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((((input == 4) && 43 < a29 ) && (a2==1)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L288] COND FALSE !((( -61 < a0 && (((( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 1))) && a4 <= -86 )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L295] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==3))) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L302] COND FALSE !((((a2==2) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !((((((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND TRUE ((a2==4) && ( -61 < a0 && ( a4 <= -86 && ((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-44, a2=4, a29=31, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !(43 < a29) [L324] a4 = ((((a4 % 21)+ -46) * 1) + -5) [L325] a0 = ((((a0 + 0) % 299926)+ -300072) * 1) [L326] a29 = ((((a29 + 371124) % 29)- -13) + 2) [L327] a2 = 3 VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] return 22; VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1784] output = calculate_output(input) [L1776] COND TRUE 1 [L1779] int input; [L1780] input = __VERIFIER_nondet_int() [L1781] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L34] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && 43 < a29 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((((a2==3) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((((a2==3) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && 43 < a29 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((((a2==1) && a4 <= -86 ) && -61 < a0 ) && a29 <= -144 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && a29 <= -144 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && 43 < a29 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && a29 <= -144 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((((a2==4) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((((a2==1) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((((a2==5) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((((a2==5) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((((a2==2) && a4 <= -86 ) && a0 <= -147 ) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((((a2==4) && a4 <= -86 ) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !(((((a2==2) && a4 <= -86 ) && ((-98 < a0) && (-61 >= a0)) ) && ((-144 < a29) && (-16 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L218] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((input == 1) && (((a2==3) && a29 <= -144 ) || (((a2==2) && ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29 && (a2==2)))))))) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !(((( ((-86 < a4) && (-42 >= a4)) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) && ((-147 < a0) && (-98 >= a0)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L229] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((a2==2) && ( a29 <= -144 && (input == 3))) && ((-98 < a0) && (-61 >= a0)) ))) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((( a0 <= -147 && ((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && (((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 3)) && ((-98 < a0) && (-61 >= a0)) ) && (a2==4)))) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !(((((a2==3) && ((input == 3) && ( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ))) && -61 < a0 ) && a4 <= -86 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !(((((input == 5) && (( ((-144 < a29) && (-16 >= a29)) && (a2==2)) || (( 43 < a29 && (a2==1)) || ((a2==2) && a29 <= -144 )))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L263] COND FALSE !(((((( ((-144 < a29) && (-16 >= a29)) && (a2==4)) || (( 43 < a29 && (a2==3)) || ((a2==4) && a29 <= -144 ))) && (input == 2)) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((( -61 < a0 && ((((a2==3) && a29 <= -144 ) || (( ((-16 < a29) && (43 >= a29)) && (a2==2)) || ( 43 < a29 && (a2==2)))) && (input == 2))) && a4 <= -86 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !(((((a2==4) && ((input == 1) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((((input == 4) && 43 < a29 ) && (a2==1)) && ((-98 < a0) && (-61 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L288] COND FALSE !((( -61 < a0 && (((( 43 < a29 && (a2==4)) || ((a2==5) && a29 <= -144 )) || ( ((-144 < a29) && (-16 >= a29)) && (a2==5))) && (input == 1))) && a4 <= -86 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L295] COND FALSE !((( ((-147 < a0) && (-98 >= a0)) && (((input == 2) && ( ((-16 < a29) && (43 >= a29)) || 43 < a29 )) && ((-86 < a4) && (-42 >= a4)) )) && (a2==3))) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L302] COND FALSE !((((a2==2) && (((input == 5) && ((-86 < a4) && (-42 >= a4)) ) && ((-147 < a0) && (-98 >= a0)) )) && ((-16 < a29) && (43 >= a29)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !((((((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) && ((-86 < a4) && (-42 >= a4)) ) && ((-98 < a0) && (-61 >= a0)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !(((a2==4) && ( -61 < a0 && ( a4 <= -86 && ((input == 5) && ( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ))))))) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !((((((input == 3) && -61 < a0 ) && a4 <= -86 ) && ((-16 < a29) && (43 >= a29)) ) && (a2==5))) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L337] COND FALSE !(((a2==1) && ( a0 <= -147 && ( ((-86 < a4) && (-42 >= a4)) && ((input == 4) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )))))) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L343] COND FALSE !((( -61 < a0 && ( 43 < a29 && ((input == 4) && (a2==5)))) && a4 <= -86 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L346] COND FALSE !(((((((a2==4) && ((-144 < a29) && (-16 >= a29)) ) || (((a2==3) && 43 < a29 ) || ( a29 <= -144 && (a2==4)))) && (input == 5)) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 3) && (( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) )) && a0 <= -147 )) && (a2==3))) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(( 43 < a29 && (( -61 < a0 && ( a4 <= -86 && (input == 1))) && (a2==5)))) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !((( a4 <= -86 && ( 43 < a29 && ((input == 2) && -61 < a0 ))) && (a2==3))) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L371] COND FALSE !(((((input == 6) && ((((a2==1) && 43 < a29 ) || ( a29 <= -144 && (a2==2))) || ((a2==2) && ((-144 < a29) && (-16 >= a29)) ))) && ((-86 < a4) && (-42 >= a4)) ) && a0 <= -147 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !((((( ((-98 < a0) && (-61 >= a0)) && (input == 3)) && (a2==2)) && ((-86 < a4) && (-42 >= a4)) ) && 43 < a29 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !(((( ((-147 < a0) && (-98 >= a0)) && (( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5))) && (a2==4)) && ((-86 < a4) && (-42 >= a4)) )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L390] COND FALSE !(((( a4 <= -86 && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 1))) && (a2==1)) && -61 < a0 )) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( -61 < a0 && ((( 43 < a29 && (input == 6)) && (a2==5)) && a4 <= -86 ))) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(( ((-86 < a4) && (-42 >= a4)) && ( ((-98 < a0) && (-61 >= a0)) && (((input == 3) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (a2==5))))) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((( ((-98 < a0) && (-61 >= a0)) && ((( ((-16 < a29) && (43 >= a29)) || 43 < a29 ) && (input == 5)) && ((-86 < a4) && (-42 >= a4)) )) && (a2==4))) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(( a4 <= -86 && ( -61 < a0 && (((( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) ) || ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && (a2==4))))) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !((((((( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) || 43 < a29 ) && (input == 6)) && ((-147 < a0) && (-98 >= a0)) ) && ((-86 < a4) && (-42 >= a4)) ) && (a2==5))) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( ((-98 < a0) && (-61 >= a0)) && ((a2==3) && (((input == 2) && ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && ((-86 < a4) && (-42 >= a4)) )))) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !((( ((-86 < a4) && (-42 >= a4)) && (((input == 5) && ((-147 < a0) && (-98 >= a0)) ) && a29 <= -144 )) && (a2==5))) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !(( -61 < a0 && ( a4 <= -86 && ((a2==3) && (( ((-144 < a29) && (-16 >= a29)) || ((-16 < a29) && (43 >= a29)) ) && (input == 2)))))) VAL [a0=-300116, a2=3, a29=28, a4=-56, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND TRUE ((((a2==3) && (( ((-16 < a29) && (43 >= a29)) || ( a29 <= -144 || ((-144 < a29) && (-16 >= a29)) )) && (input == 2))) && a0 <= -147 ) && ((-86 < a4) && (-42 >= a4)) ) [L450] a4 = (((a4 + -287863) + -192250) * 1) [L451] a29 = ((((a29 / 5) % 63)+ -80) - 1) [L452] a2 = 1 [L454] return -1; VAL [a0=-300116, a2=1, a29=-76, a4=-480169, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1784] output = calculate_output(input) [L1776] COND TRUE 1 [L1779] int input; [L1780] input = __VERIFIER_nondet_int() [L1781] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L34] COND TRUE ((((a2==1) && a4 <= -86 ) && a0 <= -147 ) && ((-144 < a29) && (-16 >= a29)) ) VAL [a0=-300116, a2=1, a29=-76, a4=-480169, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L35] reach_error() VAL [a0=-300116, a2=1, a29=-76, a4=-480169, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 83507.2ms, OverallIterations: 22, TraceHistogramMax: 5, EmptinessCheckTime: 127.4ms, AutomataDifference: 62158.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 23.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 6448 SDtfs, 13045 SDslu, 1262 SDs, 0 SdLazy, 34374 SolverSat, 6116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 49845.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1760 GetRequests, 1714 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 177.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=33312occurred in iteration=19, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 5941.4ms AutomataMinimizationTime, 21 MinimizatonAttempts, 47956 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 682.6ms SsaConstructionTime, 1583.7ms SatisfiabilityAnalysisTime, 10318.4ms InterpolantComputationTime, 9497 NumberOfCodeBlocks, 9497 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 8813 ConstructedInterpolants, 0 QuantifiedInterpolants, 29780 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2202 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 25 InterpolantComputations, 17 PerfectInterpolantSequences, 3308/4404 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-10-21 20:08:57,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ac1fd20-de7a-4294-ba13-9afc109c2dc0/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...