./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label44.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b58361-738b-4eba-8f05-d519cc126c1e/bin/ukojak-Rh5K9KB4LI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b58361-738b-4eba-8f05-d519cc126c1e/bin/ukojak-Rh5K9KB4LI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b58361-738b-4eba-8f05-d519cc126c1e/bin/ukojak-Rh5K9KB4LI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b58361-738b-4eba-8f05-d519cc126c1e/bin/ukojak-Rh5K9KB4LI/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label44.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b58361-738b-4eba-8f05-d519cc126c1e/bin/ukojak-Rh5K9KB4LI/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b58361-738b-4eba-8f05-d519cc126c1e/bin/ukojak-Rh5K9KB4LI --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 19f6a4e9c4337065cd35355f350ba61e20d7c158a393782dbdfa17548177e415 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-b2eff8b [2021-10-29 03:54:51,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 03:54:51,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 03:54:51,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 03:54:51,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 03:54:51,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 03:54:51,629 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 03:54:51,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 03:54:51,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 03:54:51,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 03:54:51,643 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 03:54:51,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 03:54:51,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 03:54:51,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 03:54:51,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 03:54:51,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 03:54:51,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 03:54:51,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 03:54:51,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 03:54:51,669 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 03:54:51,671 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 03:54:51,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 03:54:51,676 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 03:54:51,677 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 03:54:51,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 03:54:51,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 03:54:51,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 03:54:51,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 03:54:51,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 03:54:51,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 03:54:51,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 03:54:51,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 03:54:51,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 03:54:51,691 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 03:54:51,693 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 03:54:51,693 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 03:54:51,694 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 03:54:51,694 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 03:54:51,694 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 03:54:51,695 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 03:54:51,696 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 03:54:51,697 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b58361-738b-4eba-8f05-d519cc126c1e/bin/ukojak-Rh5K9KB4LI/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-10-29 03:54:51,742 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 03:54:51,742 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 03:54:51,744 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 03:54:51,744 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-10-29 03:54:51,745 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-29 03:54:51,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-29 03:54:51,746 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 03:54:51,746 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 03:54:51,752 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 03:54:51,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 03:54:51,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 03:54:51,754 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 03:54:51,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 03:54:51,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 03:54:51,755 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 03:54:51,755 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 03:54:51,755 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 03:54:51,755 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 03:54:51,756 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-10-29 03:54:51,756 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-10-29 03:54:51,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 03:54:51,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-10-29 03:54:51,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 03:54:51,757 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 03:54:51,757 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 03:54:51,757 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-10-29 03:54:51,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 03:54:51,758 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 03:54:51,758 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_c7b58361-738b-4eba-8f05-d519cc126c1e/bin/ukojak-Rh5K9KB4LI/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_c7b58361-738b-4eba-8f05-d519cc126c1e/bin/ukojak-Rh5K9KB4LI 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 -> Kojak 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 -> 19f6a4e9c4337065cd35355f350ba61e20d7c158a393782dbdfa17548177e415 [2021-10-29 03:54:52,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 03:54:52,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 03:54:52,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 03:54:52,079 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 03:54:52,082 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 03:54:52,083 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b58361-738b-4eba-8f05-d519cc126c1e/bin/ukojak-Rh5K9KB4LI/../../sv-benchmarks/c/eca-rers2012/Problem01_label44.c [2021-10-29 03:54:52,153 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b58361-738b-4eba-8f05-d519cc126c1e/bin/ukojak-Rh5K9KB4LI/data/3d4b1792a/7d93694f8fcc4174b36076d35af7d3e7/FLAGd4afd0e1e [2021-10-29 03:54:52,822 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 03:54:52,823 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b58361-738b-4eba-8f05-d519cc126c1e/sv-benchmarks/c/eca-rers2012/Problem01_label44.c [2021-10-29 03:54:52,843 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b58361-738b-4eba-8f05-d519cc126c1e/bin/ukojak-Rh5K9KB4LI/data/3d4b1792a/7d93694f8fcc4174b36076d35af7d3e7/FLAGd4afd0e1e [2021-10-29 03:54:53,169 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b58361-738b-4eba-8f05-d519cc126c1e/bin/ukojak-Rh5K9KB4LI/data/3d4b1792a/7d93694f8fcc4174b36076d35af7d3e7 [2021-10-29 03:54:53,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 03:54:53,176 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 03:54:53,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 03:54:53,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 03:54:53,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 03:54:53,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:54:53" (1/1) ... [2021-10-29 03:54:53,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581fe86c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:53, skipping insertion in model container [2021-10-29 03:54:53,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:54:53" (1/1) ... [2021-10-29 03:54:53,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 03:54:53,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 03:54:53,631 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_c7b58361-738b-4eba-8f05-d519cc126c1e/sv-benchmarks/c/eca-rers2012/Problem01_label44.c[16002,16015] [2021-10-29 03:54:53,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 03:54:53,714 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 03:54:53,854 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_c7b58361-738b-4eba-8f05-d519cc126c1e/sv-benchmarks/c/eca-rers2012/Problem01_label44.c[16002,16015] [2021-10-29 03:54:53,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 03:54:53,899 INFO L208 MainTranslator]: Completed translation [2021-10-29 03:54:53,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:53 WrapperNode [2021-10-29 03:54:53,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 03:54:53,901 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 03:54:53,901 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 03:54:53,903 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 03:54:53,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:53" (1/1) ... [2021-10-29 03:54:53,941 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:53" (1/1) ... [2021-10-29 03:54:53,996 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 03:54:53,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 03:54:53,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 03:54:53,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 03:54:54,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:53" (1/1) ... [2021-10-29 03:54:54,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:53" (1/1) ... [2021-10-29 03:54:54,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:53" (1/1) ... [2021-10-29 03:54:54,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:53" (1/1) ... [2021-10-29 03:54:54,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:53" (1/1) ... [2021-10-29 03:54:54,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:53" (1/1) ... [2021-10-29 03:54:54,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:53" (1/1) ... [2021-10-29 03:54:54,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 03:54:54,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 03:54:54,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 03:54:54,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 03:54:54,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:53" (1/1) ... [2021-10-29 03:54:54,073 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-10-29 03:54:54,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b58361-738b-4eba-8f05-d519cc126c1e/bin/ukojak-Rh5K9KB4LI/z3 [2021-10-29 03:54:54,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b58361-738b-4eba-8f05-d519cc126c1e/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-10-29 03:54:54,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b58361-738b-4eba-8f05-d519cc126c1e/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-10-29 03:54:54,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 03:54:54,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 03:54:54,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 03:54:54,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 03:54:56,101 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 03:54:56,101 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-29 03:54:56,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:54:56 BoogieIcfgContainer [2021-10-29 03:54:56,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 03:54:56,105 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-10-29 03:54:56,106 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-10-29 03:54:56,117 INFO L275 PluginConnector]: CodeCheck initialized [2021-10-29 03:54:56,117 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:54:56" (1/1) ... [2021-10-29 03:54:56,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 03:54:56,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2021-10-29 03:54:56,176 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2021-10-29 03:54:56,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-10-29 03:54:56,182 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:56,184 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:56,545 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-29 03:54:57,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:57,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2021-10-29 03:54:57,002 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2021-10-29 03:54:57,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-10-29 03:54:57,006 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:57,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:57,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:54:57,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2021-10-29 03:54:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2021-10-29 03:54:57,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-10-29 03:54:57,338 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:57,339 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:57,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:54:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 150 states and 244 transitions. [2021-10-29 03:54:57,499 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 244 transitions. [2021-10-29 03:54:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-10-29 03:54:57,503 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:57,503 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:54:57,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:57,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2021-10-29 03:54:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2021-10-29 03:54:57,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-10-29 03:54:57,731 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:57,731 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:57,783 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:54:57,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 159 states and 258 transitions. [2021-10-29 03:54:57,938 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 258 transitions. [2021-10-29 03:54:57,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-10-29 03:54:57,939 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:57,939 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:54:58,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:58,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 160 states and 259 transitions. [2021-10-29 03:54:58,109 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 259 transitions. [2021-10-29 03:54:58,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-10-29 03:54:58,112 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:58,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:58,150 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:54:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 168 states and 268 transitions. [2021-10-29 03:54:58,260 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 268 transitions. [2021-10-29 03:54:58,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-10-29 03:54:58,261 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:58,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:58,309 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:54:58,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:58,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 182 states and 286 transitions. [2021-10-29 03:54:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 286 transitions. [2021-10-29 03:54:58,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-10-29 03:54:58,579 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:58,580 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:58,640 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:54:59,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:59,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 197 states and 306 transitions. [2021-10-29 03:54:59,063 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 306 transitions. [2021-10-29 03:54:59,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-10-29 03:54:59,064 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:59,065 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:59,144 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:54:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:59,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 212 states and 327 transitions. [2021-10-29 03:54:59,668 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 327 transitions. [2021-10-29 03:54:59,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-10-29 03:54:59,696 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:59,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:00,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 230 states and 356 transitions. [2021-10-29 03:55:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2021-10-29 03:55:00,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-10-29 03:55:00,472 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:00,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:00,531 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 232 states and 369 transitions. [2021-10-29 03:55:00,847 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 369 transitions. [2021-10-29 03:55:00,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-10-29 03:55:00,849 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:00,849 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:01,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:01,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 246 states and 387 transitions. [2021-10-29 03:55:01,349 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 387 transitions. [2021-10-29 03:55:01,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-10-29 03:55:01,350 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:01,351 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:01,382 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:01,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 251 states and 393 transitions. [2021-10-29 03:55:01,491 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 393 transitions. [2021-10-29 03:55:01,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-29 03:55:01,493 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:01,494 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:55:01,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:01,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 252 states and 394 transitions. [2021-10-29 03:55:01,697 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 394 transitions. [2021-10-29 03:55:01,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-29 03:55:01,698 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:01,700 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:01,802 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:02,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:02,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 271 states and 424 transitions. [2021-10-29 03:55:02,602 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 424 transitions. [2021-10-29 03:55:02,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-29 03:55:02,604 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:02,605 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:02,652 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:02,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:02,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 272 states and 425 transitions. [2021-10-29 03:55:02,809 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 425 transitions. [2021-10-29 03:55:02,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-29 03:55:02,810 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:02,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:03,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:03,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 287 states and 444 transitions. [2021-10-29 03:55:03,472 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 444 transitions. [2021-10-29 03:55:03,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-10-29 03:55:03,474 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:03,474 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:03,506 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:55:04,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 305 states and 464 transitions. [2021-10-29 03:55:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 464 transitions. [2021-10-29 03:55:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-10-29 03:55:04,167 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:04,167 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:04,208 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:04,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 309 states and 468 transitions. [2021-10-29 03:55:04,273 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 468 transitions. [2021-10-29 03:55:04,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-10-29 03:55:04,274 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:04,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:55:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 313 states and 475 transitions. [2021-10-29 03:55:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 475 transitions. [2021-10-29 03:55:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-10-29 03:55:04,674 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:04,675 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:04,712 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:55:04,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 314 states and 477 transitions. [2021-10-29 03:55:04,851 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 477 transitions. [2021-10-29 03:55:04,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-29 03:55:04,852 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:04,853 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:55:05,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 322 states and 492 transitions. [2021-10-29 03:55:05,474 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 492 transitions. [2021-10-29 03:55:05,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-29 03:55:05,476 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:05,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:05,533 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:55:05,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:05,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 328 states and 501 transitions. [2021-10-29 03:55:05,845 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 501 transitions. [2021-10-29 03:55:05,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-29 03:55:05,846 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:05,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:05,876 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:55:06,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:06,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 331 states and 506 transitions. [2021-10-29 03:55:06,066 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 506 transitions. [2021-10-29 03:55:06,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-29 03:55:06,068 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:06,068 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:06,099 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:06,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:06,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 346 states and 527 transitions. [2021-10-29 03:55:06,575 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 527 transitions. [2021-10-29 03:55:06,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-29 03:55:06,577 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:06,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:06,611 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:06,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:06,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 360 states and 544 transitions. [2021-10-29 03:55:06,905 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 544 transitions. [2021-10-29 03:55:06,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-10-29 03:55:06,907 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:06,907 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:06,997 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:07,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:07,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 362 states and 546 transitions. [2021-10-29 03:55:07,274 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 546 transitions. [2021-10-29 03:55:07,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-10-29 03:55:07,276 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:07,276 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:07,310 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:55:07,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:07,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 368 states and 553 transitions. [2021-10-29 03:55:07,620 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 553 transitions. [2021-10-29 03:55:07,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-10-29 03:55:07,621 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:07,622 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:07,657 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:55:07,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:07,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 372 states and 556 transitions. [2021-10-29 03:55:07,692 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 556 transitions. [2021-10-29 03:55:07,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-10-29 03:55:07,693 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:07,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:07,732 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:07,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:07,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 374 states and 559 transitions. [2021-10-29 03:55:07,772 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 559 transitions. [2021-10-29 03:55:07,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-10-29 03:55:07,774 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:07,774 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:08,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 388 states and 577 transitions. [2021-10-29 03:55:08,400 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 577 transitions. [2021-10-29 03:55:08,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-10-29 03:55:08,402 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:08,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:08,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:08,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 392 states and 582 transitions. [2021-10-29 03:55:08,749 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 582 transitions. [2021-10-29 03:55:08,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-10-29 03:55:08,750 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:08,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:08,802 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:55:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:09,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 394 states and 585 transitions. [2021-10-29 03:55:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 585 transitions. [2021-10-29 03:55:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-10-29 03:55:09,002 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:09,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:09,055 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:09,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:09,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 397 states and 589 transitions. [2021-10-29 03:55:09,129 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 589 transitions. [2021-10-29 03:55:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-10-29 03:55:09,130 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:09,131 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:55:09,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:09,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 406 states and 599 transitions. [2021-10-29 03:55:09,649 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 599 transitions. [2021-10-29 03:55:09,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-10-29 03:55:09,651 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:09,651 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:09,702 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:55:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 410 states and 602 transitions. [2021-10-29 03:55:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 602 transitions. [2021-10-29 03:55:10,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-10-29 03:55:10,018 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:10,019 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:10,085 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:55:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 413 states and 605 transitions. [2021-10-29 03:55:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 605 transitions. [2021-10-29 03:55:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-10-29 03:55:10,339 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:10,340 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:10,466 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-10-29 03:55:11,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 488 states and 682 transitions. [2021-10-29 03:55:11,162 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 682 transitions. [2021-10-29 03:55:11,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-10-29 03:55:11,164 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:11,165 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:11,206 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 502 states and 698 transitions. [2021-10-29 03:55:11,301 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 698 transitions. [2021-10-29 03:55:11,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-10-29 03:55:11,303 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:11,303 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:11,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 513 states and 711 transitions. [2021-10-29 03:55:11,496 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 711 transitions. [2021-10-29 03:55:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-10-29 03:55:11,498 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:11,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-29 03:55:11,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:11,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 518 states and 718 transitions. [2021-10-29 03:55:11,723 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 718 transitions. [2021-10-29 03:55:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-10-29 03:55:11,725 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:11,725 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:11,779 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:12,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 542 states and 753 transitions. [2021-10-29 03:55:12,517 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 753 transitions. [2021-10-29 03:55:12,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-10-29 03:55:12,519 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:12,520 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 546 states and 757 transitions. [2021-10-29 03:55:12,876 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 757 transitions. [2021-10-29 03:55:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-10-29 03:55:12,878 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:12,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:12,925 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:55:13,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 553 states and 765 transitions. [2021-10-29 03:55:13,393 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 765 transitions. [2021-10-29 03:55:13,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-10-29 03:55:13,396 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:13,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:55:13,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 555 states and 766 transitions. [2021-10-29 03:55:13,720 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 766 transitions. [2021-10-29 03:55:13,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-10-29 03:55:13,722 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:13,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:13,768 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:14,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 593 states and 811 transitions. [2021-10-29 03:55:14,818 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 811 transitions. [2021-10-29 03:55:14,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-10-29 03:55:14,820 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:14,821 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:14,864 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:15,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 596 states and 813 transitions. [2021-10-29 03:55:15,146 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 813 transitions. [2021-10-29 03:55:15,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-10-29 03:55:15,149 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:15,149 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:15,193 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:15,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:15,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 599 states and 815 transitions. [2021-10-29 03:55:15,480 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 815 transitions. [2021-10-29 03:55:15,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-10-29 03:55:15,483 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:15,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:15,563 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 608 states and 827 transitions. [2021-10-29 03:55:15,656 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 827 transitions. [2021-10-29 03:55:15,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-10-29 03:55:15,659 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:15,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:55:16,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:16,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 617 states and 836 transitions. [2021-10-29 03:55:16,007 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 836 transitions. [2021-10-29 03:55:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-10-29 03:55:16,010 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:16,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:16,079 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-10-29 03:55:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 706 states and 928 transitions. [2021-10-29 03:55:17,048 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 928 transitions. [2021-10-29 03:55:17,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-10-29 03:55:17,051 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:17,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:17,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:17,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 733 states and 956 transitions. [2021-10-29 03:55:17,303 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 956 transitions. [2021-10-29 03:55:17,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-10-29 03:55:17,305 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:17,305 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:17,352 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:17,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 761 states and 985 transitions. [2021-10-29 03:55:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 985 transitions. [2021-10-29 03:55:17,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-10-29 03:55:17,698 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:17,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:17,756 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-10-29 03:55:17,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:17,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 762 states and 985 transitions. [2021-10-29 03:55:17,797 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 985 transitions. [2021-10-29 03:55:17,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-10-29 03:55:17,800 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:17,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:17,853 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:55:19,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 790 states and 1014 transitions. [2021-10-29 03:55:19,051 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1014 transitions. [2021-10-29 03:55:19,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-10-29 03:55:19,053 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:19,054 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 817 states and 1046 transitions. [2021-10-29 03:55:19,851 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1046 transitions. [2021-10-29 03:55:19,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-10-29 03:55:19,852 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:19,853 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:19,900 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:19,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:19,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 824 states and 1053 transitions. [2021-10-29 03:55:19,975 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1053 transitions. [2021-10-29 03:55:19,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-10-29 03:55:19,977 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:19,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:21,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 887 states and 1123 transitions. [2021-10-29 03:55:21,627 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1123 transitions. [2021-10-29 03:55:21,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-10-29 03:55:21,629 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:21,629 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:21,685 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:22,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 908 states and 1143 transitions. [2021-10-29 03:55:22,424 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1143 transitions. [2021-10-29 03:55:22,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-10-29 03:55:22,427 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:22,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-10-29 03:55:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:22,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 911 states and 1146 transitions. [2021-10-29 03:55:22,651 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1146 transitions. [2021-10-29 03:55:22,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-10-29 03:55:22,653 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:22,653 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:22,712 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-10-29 03:55:22,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:22,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 947 states and 1182 transitions. [2021-10-29 03:55:22,946 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1182 transitions. [2021-10-29 03:55:22,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-10-29 03:55:22,949 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:22,949 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:55:23,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 961 states and 1198 transitions. [2021-10-29 03:55:23,561 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1198 transitions. [2021-10-29 03:55:23,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-10-29 03:55:23,564 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:23,565 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:55:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:23,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 965 states and 1201 transitions. [2021-10-29 03:55:23,878 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1201 transitions. [2021-10-29 03:55:23,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-10-29 03:55:23,879 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:23,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:23,931 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:55:24,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:24,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 971 states and 1208 transitions. [2021-10-29 03:55:24,178 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1208 transitions. [2021-10-29 03:55:24,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-10-29 03:55:24,179 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:24,180 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:24,230 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:55:24,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:24,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 974 states and 1210 transitions. [2021-10-29 03:55:24,446 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1210 transitions. [2021-10-29 03:55:24,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-10-29 03:55:24,448 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:24,448 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:24,498 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:55:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 977 states and 1212 transitions. [2021-10-29 03:55:24,763 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1212 transitions. [2021-10-29 03:55:24,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-10-29 03:55:24,765 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:24,765 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:55:24,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:24,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 981 states and 1215 transitions. [2021-10-29 03:55:24,955 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1215 transitions. [2021-10-29 03:55:24,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-10-29 03:55:24,957 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:24,957 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:25,191 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 119 proven. 11 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-10-29 03:55:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:26,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1029 states and 1269 transitions. [2021-10-29 03:55:26,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1269 transitions. [2021-10-29 03:55:26,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-10-29 03:55:26,783 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:26,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:26,836 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-10-29 03:55:27,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:27,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1038 states and 1282 transitions. [2021-10-29 03:55:27,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1282 transitions. [2021-10-29 03:55:27,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-10-29 03:55:27,538 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:27,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:27,642 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-10-29 03:55:28,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1043 states and 1288 transitions. [2021-10-29 03:55:28,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1288 transitions. [2021-10-29 03:55:28,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-10-29 03:55:28,020 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:28,020 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:28,074 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-10-29 03:55:28,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1047 states and 1290 transitions. [2021-10-29 03:55:28,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1290 transitions. [2021-10-29 03:55:28,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-10-29 03:55:28,420 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:28,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-10-29 03:55:28,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:28,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1048 states and 1290 transitions. [2021-10-29 03:55:28,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1290 transitions. [2021-10-29 03:55:28,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-10-29 03:55:28,517 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:28,518 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:55:28,570 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 03:55:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:55:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:55:28,826 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 03:55:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:55:29,009 WARN L480 CodeCheckObserver]: This program is UNSAFE, Check terminated with 74 iterations. [2021-10-29 03:55:29,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 29.10 03:55:29 ImpRootNode [2021-10-29 03:55:29,311 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-10-29 03:55:29,311 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 03:55:29,311 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 03:55:29,312 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 03:55:29,312 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:54:56" (3/4) ... [2021-10-29 03:55:29,314 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-29 03:55:29,580 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b58361-738b-4eba-8f05-d519cc126c1e/bin/ukojak-Rh5K9KB4LI/witness.graphml [2021-10-29 03:55:29,580 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 03:55:29,582 INFO L168 Benchmark]: Toolchain (without parser) took 36404.94 ms. Allocated memory was 88.1 MB in the beginning and 448.8 MB in the end (delta: 360.7 MB). Free memory was 65.7 MB in the beginning and 365.8 MB in the end (delta: -300.1 MB). Peak memory consumption was 245.4 MB. Max. memory is 16.1 GB. [2021-10-29 03:55:29,582 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 88.1 MB. Free memory is still 64.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 03:55:29,582 INFO L168 Benchmark]: CACSL2BoogieTranslator took 723.38 ms. Allocated memory is still 88.1 MB. Free memory was 65.5 MB in the beginning and 47.0 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-29 03:55:29,583 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.60 ms. Allocated memory is still 88.1 MB. Free memory was 47.0 MB in the beginning and 41.3 MB in the end (delta: 5.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-29 03:55:29,583 INFO L168 Benchmark]: Boogie Preprocessor took 66.81 ms. Allocated memory is still 88.1 MB. Free memory was 41.3 MB in the beginning and 37.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 03:55:29,584 INFO L168 Benchmark]: RCFGBuilder took 2040.64 ms. Allocated memory was 88.1 MB in the beginning and 107.0 MB in the end (delta: 18.9 MB). Free memory was 36.9 MB in the beginning and 52.8 MB in the end (delta: -15.9 MB). Peak memory consumption was 21.4 MB. Max. memory is 16.1 GB. [2021-10-29 03:55:29,584 INFO L168 Benchmark]: CodeCheck took 33205.53 ms. Allocated memory was 107.0 MB in the beginning and 373.3 MB in the end (delta: 266.3 MB). Free memory was 52.1 MB in the beginning and 118.5 MB in the end (delta: -66.4 MB). Peak memory consumption was 200.0 MB. Max. memory is 16.1 GB. [2021-10-29 03:55:29,585 INFO L168 Benchmark]: Witness Printer took 268.86 ms. Allocated memory was 373.3 MB in the beginning and 448.8 MB in the end (delta: 75.5 MB). Free memory was 118.5 MB in the beginning and 365.8 MB in the end (delta: -247.3 MB). Peak memory consumption was 13.5 MB. Max. memory is 16.1 GB. [2021-10-29 03:55:29,587 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.8s, OverallIterations: 74, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 276922432 SDtfs, -229863848 SDslu, 1393172864 SDs, 0 SdLazy, -605098360 SolverSat, -373197088 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 168.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61998 GetRequests, 60653 SyntacticMatches, 905 SemanticMatches, 440 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122177 ImplicationChecksByTransitivity, 20.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 8683 NumberOfCodeBlocks, 8683 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 8435 ConstructedInterpolants, 0 QuantifiedInterpolants, 18142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 73 InterpolantComputations, 72 PerfectInterpolantSequences, 4021/4032 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 438]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND TRUE (((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)) [L42] a16 = 5 [L43] a20 = 0 [L44] return 24; VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND TRUE ((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15))) [L276] a17 = 0 [L277] return 24; VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND TRUE ((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5)) [L323] a8 = 13 [L324] a16 = 4 [L325] return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L422] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L425] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L428] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L431] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L434] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L437] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L438] reach_error() VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 88.1 MB. Free memory is still 64.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 723.38 ms. Allocated memory is still 88.1 MB. Free memory was 65.5 MB in the beginning and 47.0 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 94.60 ms. Allocated memory is still 88.1 MB. Free memory was 47.0 MB in the beginning and 41.3 MB in the end (delta: 5.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 66.81 ms. Allocated memory is still 88.1 MB. Free memory was 41.3 MB in the beginning and 37.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2040.64 ms. Allocated memory was 88.1 MB in the beginning and 107.0 MB in the end (delta: 18.9 MB). Free memory was 36.9 MB in the beginning and 52.8 MB in the end (delta: -15.9 MB). Peak memory consumption was 21.4 MB. Max. memory is 16.1 GB. * CodeCheck took 33205.53 ms. Allocated memory was 107.0 MB in the beginning and 373.3 MB in the end (delta: 266.3 MB). Free memory was 52.1 MB in the beginning and 118.5 MB in the end (delta: -66.4 MB). Peak memory consumption was 200.0 MB. Max. memory is 16.1 GB. * Witness Printer took 268.86 ms. Allocated memory was 373.3 MB in the beginning and 448.8 MB in the end (delta: 75.5 MB). Free memory was 118.5 MB in the beginning and 365.8 MB in the end (delta: -247.3 MB). Peak memory consumption was 13.5 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! [2021-10-29 03:55:29,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b58361-738b-4eba-8f05-d519cc126c1e/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...