./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label37.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ea34aa-eb3c-4caa-8756-a223d018d192/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ea34aa-eb3c-4caa-8756-a223d018d192/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ea34aa-eb3c-4caa-8756-a223d018d192/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ea34aa-eb3c-4caa-8756-a223d018d192/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label37.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ea34aa-eb3c-4caa-8756-a223d018d192/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ea34aa-eb3c-4caa-8756-a223d018d192/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 889703d30f71ddcf9dd164cd63c57e33725418944081edb29f7e0df12e48cb88 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 00:13:36,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:13:36,639 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ea34aa-eb3c-4caa-8756-a223d018d192/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-09 00:13:36,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:13:36,652 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 00:13:36,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:13:36,697 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:13:36,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-09 00:13:36,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:13:36,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:13:36,700 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:13:36,700 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:13:36,700 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:13:36,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:13:36,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:13:36,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:13:36,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:13:36,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:13:36,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:13:36,705 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:13:36,706 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:13:36,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:13:36,710 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:13:36,711 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 00:13:36,711 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 00:13:36,711 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 00:13:36,712 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:13:36,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:13:36,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:13:36,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:13:36,713 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:13:36,713 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 00:13:36,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:13:36,713 INFO L153 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_73ea34aa-eb3c-4caa-8756-a223d018d192/bin/ukojak-verify-ImItNfHLgk/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_73ea34aa-eb3c-4caa-8756-a223d018d192/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 889703d30f71ddcf9dd164cd63c57e33725418944081edb29f7e0df12e48cb88 [2024-11-09 00:13:36,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:13:37,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:13:37,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:13:37,033 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:13:37,034 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:13:37,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ea34aa-eb3c-4caa-8756-a223d018d192/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/eca-rers2012/Problem01_label37.c Unable to find full path for "g++" [2024-11-09 00:13:39,079 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:13:39,328 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:13:39,328 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ea34aa-eb3c-4caa-8756-a223d018d192/sv-benchmarks/c/eca-rers2012/Problem01_label37.c [2024-11-09 00:13:39,341 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ea34aa-eb3c-4caa-8756-a223d018d192/bin/ukojak-verify-ImItNfHLgk/data/1aa45a357/09168cc8cbea4070b19be59a989b9442/FLAGe256cd2cf [2024-11-09 00:13:39,635 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ea34aa-eb3c-4caa-8756-a223d018d192/bin/ukojak-verify-ImItNfHLgk/data/1aa45a357/09168cc8cbea4070b19be59a989b9442 [2024-11-09 00:13:39,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:13:39,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:13:39,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:13:39,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:13:39,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:13:39,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:13:39" (1/1) ... [2024-11-09 00:13:39,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@585f74e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:39, skipping insertion in model container [2024-11-09 00:13:39,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:13:39" (1/1) ... [2024-11-09 00:13:39,715 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:13:40,059 WARN L250 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_73ea34aa-eb3c-4caa-8756-a223d018d192/sv-benchmarks/c/eca-rers2012/Problem01_label37.c[14876,14889] [2024-11-09 00:13:40,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:13:40,144 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:13:40,251 WARN L250 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_73ea34aa-eb3c-4caa-8756-a223d018d192/sv-benchmarks/c/eca-rers2012/Problem01_label37.c[14876,14889] [2024-11-09 00:13:40,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:13:40,295 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:13:40,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:40 WrapperNode [2024-11-09 00:13:40,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:13:40,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:13:40,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:13:40,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:13:40,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:40" (1/1) ... [2024-11-09 00:13:40,327 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:40" (1/1) ... [2024-11-09 00:13:40,381 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-09 00:13:40,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:13:40,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:13:40,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:13:40,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:13:40,392 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:40" (1/1) ... [2024-11-09 00:13:40,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:40" (1/1) ... [2024-11-09 00:13:40,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:40" (1/1) ... [2024-11-09 00:13:40,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:40" (1/1) ... [2024-11-09 00:13:40,430 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:40" (1/1) ... [2024-11-09 00:13:40,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:40" (1/1) ... [2024-11-09 00:13:40,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:40" (1/1) ... [2024-11-09 00:13:40,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:40" (1/1) ... [2024-11-09 00:13:40,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:13:40,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:13:40,453 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:13:40,453 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:13:40,454 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:40" (1/1) ... [2024-11-09 00:13:40,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:13:40,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ea34aa-eb3c-4caa-8756-a223d018d192/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 00:13:40,494 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ea34aa-eb3c-4caa-8756-a223d018d192/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-09 00:13:40,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ea34aa-eb3c-4caa-8756-a223d018d192/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-09 00:13:40,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:13:40,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 00:13:40,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:13:40,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:13:40,628 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:13:40,630 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:13:41,883 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-09 00:13:41,884 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:13:42,163 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:13:42,164 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:13:42,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:13:42 BoogieIcfgContainer [2024-11-09 00:13:42,165 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:13:42,165 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 00:13:42,166 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 00:13:42,177 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 00:13:42,177 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:13:42" (1/1) ... [2024-11-09 00:13:42,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:13:42,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-09 00:13:42,260 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-09 00:13:42,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 00:13:42,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:42,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:42,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:43,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 145 states and 243 transitions. [2024-11-09 00:13:43,554 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 243 transitions. [2024-11-09 00:13:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 00:13:43,556 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:43,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:43,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:44,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 218 states and 323 transitions. [2024-11-09 00:13:44,823 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 323 transitions. [2024-11-09 00:13:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 00:13:44,826 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:44,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 219 states and 326 transitions. [2024-11-09 00:13:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 326 transitions. [2024-11-09 00:13:45,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-09 00:13:45,422 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:45,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:45,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 229 states and 341 transitions. [2024-11-09 00:13:45,937 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 341 transitions. [2024-11-09 00:13:45,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 00:13:45,941 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:45,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:46,188 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:46,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 240 states and 356 transitions. [2024-11-09 00:13:46,577 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 356 transitions. [2024-11-09 00:13:46,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 00:13:46,581 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:46,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:46,819 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 250 states and 368 transitions. [2024-11-09 00:13:47,154 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2024-11-09 00:13:47,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 00:13:47,155 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:47,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:47,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:47,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 253 states and 372 transitions. [2024-11-09 00:13:47,488 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 372 transitions. [2024-11-09 00:13:47,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 00:13:47,491 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:47,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:47,674 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:48,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:48,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 267 states and 388 transitions. [2024-11-09 00:13:48,186 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 388 transitions. [2024-11-09 00:13:48,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 00:13:48,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:48,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:48,305 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 00:13:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 268 states and 390 transitions. [2024-11-09 00:13:48,603 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 390 transitions. [2024-11-09 00:13:48,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 00:13:48,606 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:48,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:48,746 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 00:13:48,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:48,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 271 states and 394 transitions. [2024-11-09 00:13:48,938 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 394 transitions. [2024-11-09 00:13:48,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 00:13:48,939 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:48,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:49,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 286 states and 415 transitions. [2024-11-09 00:13:49,961 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 415 transitions. [2024-11-09 00:13:49,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 00:13:49,962 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:49,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 296 states and 426 transitions. [2024-11-09 00:13:50,489 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 426 transitions. [2024-11-09 00:13:50,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 00:13:50,491 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:50,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:50,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 299 states and 429 transitions. [2024-11-09 00:13:50,859 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 429 transitions. [2024-11-09 00:13:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 00:13:50,860 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:50,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:50,955 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:51,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:51,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 314 states and 450 transitions. [2024-11-09 00:13:51,218 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 450 transitions. [2024-11-09 00:13:51,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 00:13:51,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:51,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:51,328 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:52,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:52,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 330 states and 472 transitions. [2024-11-09 00:13:52,212 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 472 transitions. [2024-11-09 00:13:52,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 00:13:52,213 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:52,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:52,286 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:52,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 340 states and 482 transitions. [2024-11-09 00:13:52,687 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 482 transitions. [2024-11-09 00:13:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 00:13:52,689 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:52,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 00:13:52,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 341 states and 483 transitions. [2024-11-09 00:13:52,912 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 483 transitions. [2024-11-09 00:13:52,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 00:13:52,914 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:52,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:53,013 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:53,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:53,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 350 states and 495 transitions. [2024-11-09 00:13:53,412 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 495 transitions. [2024-11-09 00:13:53,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 00:13:53,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:53,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:53,526 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 00:13:53,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 354 states and 499 transitions. [2024-11-09 00:13:53,779 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 499 transitions. [2024-11-09 00:13:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 00:13:53,781 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:53,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:54,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:54,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 363 states and 513 transitions. [2024-11-09 00:13:54,399 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 513 transitions. [2024-11-09 00:13:54,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 00:13:54,403 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:54,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:54,523 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 367 states and 517 transitions. [2024-11-09 00:13:54,735 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 517 transitions. [2024-11-09 00:13:54,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 00:13:54,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:54,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:54,901 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:55,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:55,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 386 states and 542 transitions. [2024-11-09 00:13:55,624 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 542 transitions. [2024-11-09 00:13:55,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 00:13:55,628 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:55,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:55,703 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 00:13:55,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:55,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 390 states and 546 transitions. [2024-11-09 00:13:55,933 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 546 transitions. [2024-11-09 00:13:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 00:13:55,935 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:55,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,103 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 00:13:56,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:56,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 392 states and 548 transitions. [2024-11-09 00:13:56,287 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 548 transitions. [2024-11-09 00:13:56,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 00:13:56,289 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:56,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:13:56,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 409 states and 568 transitions. [2024-11-09 00:13:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 568 transitions. [2024-11-09 00:13:56,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 00:13:56,801 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:56,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:13:57,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 432 states and 597 transitions. [2024-11-09 00:13:57,898 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 597 transitions. [2024-11-09 00:13:57,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 00:13:57,899 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:57,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:58,050 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:13:58,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:58,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 436 states and 600 transitions. [2024-11-09 00:13:58,291 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 600 transitions. [2024-11-09 00:13:58,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 00:13:58,293 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:58,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 00:13:59,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:13:59,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 451 states and 617 transitions. [2024-11-09 00:13:59,046 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 617 transitions. [2024-11-09 00:13:59,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 00:13:59,048 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:13:59,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:59,467 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:00,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:00,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 463 states and 629 transitions. [2024-11-09 00:14:00,069 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 629 transitions. [2024-11-09 00:14:00,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 00:14:00,070 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:00,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:00,190 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 00:14:00,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:00,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 469 states and 636 transitions. [2024-11-09 00:14:00,600 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 636 transitions. [2024-11-09 00:14:00,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 00:14:00,601 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:00,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 00:14:01,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:01,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 473 states and 640 transitions. [2024-11-09 00:14:01,190 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 640 transitions. [2024-11-09 00:14:01,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 00:14:01,191 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:01,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:01,321 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:02,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 561 states and 740 transitions. [2024-11-09 00:14:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 740 transitions. [2024-11-09 00:14:02,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 00:14:02,123 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:02,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:02,257 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 00:14:02,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:02,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 565 states and 743 transitions. [2024-11-09 00:14:02,531 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 743 transitions. [2024-11-09 00:14:02,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 00:14:02,532 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:02,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:02,989 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 47 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:03,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:03,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 580 states and 763 transitions. [2024-11-09 00:14:03,774 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 763 transitions. [2024-11-09 00:14:03,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 00:14:03,775 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:03,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 47 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:04,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:04,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 583 states and 767 transitions. [2024-11-09 00:14:04,322 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 767 transitions. [2024-11-09 00:14:04,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 00:14:04,323 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:04,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:04,487 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 00:14:05,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:05,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 621 states and 812 transitions. [2024-11-09 00:14:05,583 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 812 transitions. [2024-11-09 00:14:05,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 00:14:05,585 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:05,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 00:14:06,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:06,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 632 states and 827 transitions. [2024-11-09 00:14:06,674 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 827 transitions. [2024-11-09 00:14:06,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 00:14:06,676 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:06,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:06,753 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 00:14:07,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 637 states and 838 transitions. [2024-11-09 00:14:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 838 transitions. [2024-11-09 00:14:07,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 00:14:07,254 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:07,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:07,359 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 00:14:07,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 640 states and 842 transitions. [2024-11-09 00:14:07,617 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 842 transitions. [2024-11-09 00:14:07,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 00:14:07,619 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:07,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:07,734 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 56 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 00:14:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 647 states and 854 transitions. [2024-11-09 00:14:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 854 transitions. [2024-11-09 00:14:08,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 00:14:08,258 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:08,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:08,346 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 00:14:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:08,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 654 states and 864 transitions. [2024-11-09 00:14:08,809 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 864 transitions. [2024-11-09 00:14:08,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 00:14:08,809 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:08,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:08,897 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 00:14:09,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:09,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 661 states and 871 transitions. [2024-11-09 00:14:09,404 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 871 transitions. [2024-11-09 00:14:09,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 00:14:09,406 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:09,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 00:14:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:10,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 684 states and 900 transitions. [2024-11-09 00:14:10,274 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 900 transitions. [2024-11-09 00:14:10,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 00:14:10,275 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:10,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 00:14:11,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:11,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 720 states and 938 transitions. [2024-11-09 00:14:11,207 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 938 transitions. [2024-11-09 00:14:11,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 00:14:11,208 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:11,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:11,267 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 00:14:11,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 729 states and 948 transitions. [2024-11-09 00:14:11,708 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 948 transitions. [2024-11-09 00:14:11,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 00:14:11,709 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:11,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 00:14:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:12,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 736 states and 956 transitions. [2024-11-09 00:14:12,089 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 956 transitions. [2024-11-09 00:14:12,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 00:14:12,091 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:12,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:12,167 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 00:14:12,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:12,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 745 states and 965 transitions. [2024-11-09 00:14:12,907 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 965 transitions. [2024-11-09 00:14:12,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 00:14:12,909 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:12,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:13,110 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 00:14:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 748 states and 968 transitions. [2024-11-09 00:14:13,299 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 968 transitions. [2024-11-09 00:14:13,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 00:14:13,300 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:13,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 00:14:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 762 states and 987 transitions. [2024-11-09 00:14:14,045 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 987 transitions. [2024-11-09 00:14:14,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 00:14:14,046 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:14,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 763 states and 988 transitions. [2024-11-09 00:14:14,681 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 988 transitions. [2024-11-09 00:14:14,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 00:14:14,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:14,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:14,895 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:15,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:15,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 773 states and 999 transitions. [2024-11-09 00:14:15,688 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 999 transitions. [2024-11-09 00:14:15,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 00:14:15,690 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:15,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:16,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:16,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 776 states and 1002 transitions. [2024-11-09 00:14:16,225 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1002 transitions. [2024-11-09 00:14:16,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 00:14:16,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:16,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:16,302 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 00:14:16,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:16,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 789 states and 1016 transitions. [2024-11-09 00:14:16,597 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1016 transitions. [2024-11-09 00:14:16,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 00:14:16,598 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:16,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 00:14:17,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 798 states and 1026 transitions. [2024-11-09 00:14:17,104 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1026 transitions. [2024-11-09 00:14:17,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 00:14:17,106 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:17,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:17,162 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 00:14:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 802 states and 1031 transitions. [2024-11-09 00:14:17,438 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1031 transitions. [2024-11-09 00:14:17,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 00:14:17,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:17,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:17,599 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 00:14:18,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:18,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 818 states and 1051 transitions. [2024-11-09 00:14:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1051 transitions. [2024-11-09 00:14:18,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 00:14:18,647 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:18,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:18,781 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 00:14:19,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 825 states and 1058 transitions. [2024-11-09 00:14:19,436 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1058 transitions. [2024-11-09 00:14:19,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 00:14:19,438 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:19,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:19,637 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 00:14:20,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:20,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 832 states and 1065 transitions. [2024-11-09 00:14:20,225 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1065 transitions. [2024-11-09 00:14:20,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 00:14:20,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:20,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:20,367 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 00:14:20,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:20,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 837 states and 1069 transitions. [2024-11-09 00:14:20,585 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1069 transitions. [2024-11-09 00:14:20,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 00:14:20,586 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:20,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:20,661 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:21,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 868 states and 1118 transitions. [2024-11-09 00:14:21,129 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1118 transitions. [2024-11-09 00:14:21,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 00:14:21,130 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:21,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:21,295 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 69 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:21,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:21,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 882 states and 1135 transitions. [2024-11-09 00:14:21,912 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1135 transitions. [2024-11-09 00:14:21,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-09 00:14:21,914 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:21,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:22,019 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:14:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 884 states and 1139 transitions. [2024-11-09 00:14:22,357 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1139 transitions. [2024-11-09 00:14:22,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 00:14:22,358 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:22,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:23,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:23,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 928 states and 1187 transitions. [2024-11-09 00:14:23,560 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1187 transitions. [2024-11-09 00:14:23,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 00:14:23,561 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:23,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:23,620 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 935 states and 1194 transitions. [2024-11-09 00:14:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1194 transitions. [2024-11-09 00:14:24,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 00:14:24,232 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:24,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:25,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:25,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 964 states and 1229 transitions. [2024-11-09 00:14:25,150 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1229 transitions. [2024-11-09 00:14:25,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 00:14:25,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:25,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:25,226 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 966 states and 1230 transitions. [2024-11-09 00:14:25,578 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1230 transitions. [2024-11-09 00:14:25,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-09 00:14:25,579 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:25,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:25,648 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:29,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:29,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1006 states and 1286 transitions. [2024-11-09 00:14:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1286 transitions. [2024-11-09 00:14:29,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-09 00:14:29,773 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:29,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:29,878 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:30,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:30,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1013 states and 1293 transitions. [2024-11-09 00:14:30,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1293 transitions. [2024-11-09 00:14:30,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-09 00:14:30,753 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:30,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:32,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1034 states and 1323 transitions. [2024-11-09 00:14:32,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1323 transitions. [2024-11-09 00:14:32,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-09 00:14:32,577 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:32,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:33,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1044 states and 1335 transitions. [2024-11-09 00:14:33,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1335 transitions. [2024-11-09 00:14:33,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-09 00:14:33,653 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:33,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:33,789 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:34,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:34,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1053 states and 1345 transitions. [2024-11-09 00:14:34,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1345 transitions. [2024-11-09 00:14:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-09 00:14:34,315 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:34,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:34,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:34,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1058 states and 1349 transitions. [2024-11-09 00:14:34,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1349 transitions. [2024-11-09 00:14:34,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-09 00:14:34,811 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:34,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:35,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1060 states and 1350 transitions. [2024-11-09 00:14:35,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1350 transitions. [2024-11-09 00:14:35,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-09 00:14:35,277 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:35,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:35,384 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:36,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1069 states and 1361 transitions. [2024-11-09 00:14:36,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1361 transitions. [2024-11-09 00:14:36,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-09 00:14:36,197 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:36,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:36,336 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:36,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:36,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1071 states and 1362 transitions. [2024-11-09 00:14:36,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1362 transitions. [2024-11-09 00:14:36,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-09 00:14:36,711 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:36,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:37,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1078 states and 1369 transitions. [2024-11-09 00:14:37,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1369 transitions. [2024-11-09 00:14:37,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-09 00:14:37,687 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:37,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:37,794 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:38,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1083 states and 1374 transitions. [2024-11-09 00:14:38,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1374 transitions. [2024-11-09 00:14:38,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-09 00:14:38,178 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:38,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:38,292 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:38,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:38,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1085 states and 1375 transitions. [2024-11-09 00:14:38,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1375 transitions. [2024-11-09 00:14:38,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-09 00:14:38,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:38,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:38,826 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:39,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:39,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1087 states and 1377 transitions. [2024-11-09 00:14:39,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1377 transitions. [2024-11-09 00:14:39,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-09 00:14:39,065 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:39,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:39,131 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:39,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1098 states and 1387 transitions. [2024-11-09 00:14:39,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1387 transitions. [2024-11-09 00:14:39,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-09 00:14:39,226 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:39,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:14:39,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:39,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1101 states and 1390 transitions. [2024-11-09 00:14:39,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1390 transitions. [2024-11-09 00:14:39,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-09 00:14:39,514 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:39,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:14:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1104 states and 1393 transitions. [2024-11-09 00:14:40,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1393 transitions. [2024-11-09 00:14:40,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-09 00:14:40,081 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:40,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:40,280 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 00:14:40,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:40,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1105 states and 1394 transitions. [2024-11-09 00:14:40,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1394 transitions. [2024-11-09 00:14:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-09 00:14:40,589 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:40,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:40,659 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:14:41,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:41,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1119 states and 1411 transitions. [2024-11-09 00:14:41,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1411 transitions. [2024-11-09 00:14:41,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-09 00:14:41,872 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:41,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:41,950 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:14:42,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:42,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1137 states and 1431 transitions. [2024-11-09 00:14:42,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1431 transitions. [2024-11-09 00:14:42,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-09 00:14:42,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:42,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:42,869 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:14:43,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:43,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1138 states and 1433 transitions. [2024-11-09 00:14:43,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1433 transitions. [2024-11-09 00:14:43,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-09 00:14:43,356 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:43,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,441 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:43,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1139 states and 1435 transitions. [2024-11-09 00:14:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1435 transitions. [2024-11-09 00:14:43,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-09 00:14:43,829 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:43,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:44,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:44,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1149 states and 1446 transitions. [2024-11-09 00:14:44,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1446 transitions. [2024-11-09 00:14:44,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-09 00:14:44,546 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:44,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-09 00:14:44,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:44,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1162 states and 1460 transitions. [2024-11-09 00:14:44,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1460 transitions. [2024-11-09 00:14:44,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-09 00:14:44,868 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:44,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-09 00:14:44,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1163 states and 1461 transitions. [2024-11-09 00:14:44,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1461 transitions. [2024-11-09 00:14:44,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-09 00:14:44,987 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:44,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:14:45,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:45,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1183 states and 1485 transitions. [2024-11-09 00:14:45,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1485 transitions. [2024-11-09 00:14:45,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-09 00:14:45,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:45,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:45,647 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 00:14:46,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:46,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1194 states and 1497 transitions. [2024-11-09 00:14:46,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1497 transitions. [2024-11-09 00:14:46,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-09 00:14:46,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:46,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:46,191 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 00:14:46,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1195 states and 1498 transitions. [2024-11-09 00:14:46,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1498 transitions. [2024-11-09 00:14:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-09 00:14:46,233 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:46,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:46,561 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 137 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:49,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:49,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1276 states and 1584 transitions. [2024-11-09 00:14:49,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1584 transitions. [2024-11-09 00:14:49,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-09 00:14:49,434 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:49,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:49,642 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 137 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:50,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:50,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1288 states and 1600 transitions. [2024-11-09 00:14:50,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1600 transitions. [2024-11-09 00:14:50,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-09 00:14:50,380 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:50,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:50,731 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 137 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:51,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1311 states and 1622 transitions. [2024-11-09 00:14:51,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1622 transitions. [2024-11-09 00:14:51,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-09 00:14:51,536 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:51,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 137 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:51,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:51,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1313 states and 1623 transitions. [2024-11-09 00:14:51,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1623 transitions. [2024-11-09 00:14:51,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-09 00:14:51,925 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:51,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:52,137 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 137 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:14:52,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:52,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1316 states and 1627 transitions. [2024-11-09 00:14:52,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1627 transitions. [2024-11-09 00:14:52,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-09 00:14:52,308 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:52,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:52,407 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-09 00:14:52,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:52,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1327 states and 1639 transitions. [2024-11-09 00:14:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1639 transitions. [2024-11-09 00:14:52,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-09 00:14:52,756 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:52,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:53,539 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 143 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:14:59,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:14:59,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1396 states and 1739 transitions. [2024-11-09 00:14:59,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1739 transitions. [2024-11-09 00:14:59,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-09 00:14:59,014 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:14:59,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:14:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:59,376 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 143 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:15:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:02,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1432 states and 1780 transitions. [2024-11-09 00:15:02,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1780 transitions. [2024-11-09 00:15:02,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-09 00:15:02,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:02,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:15:03,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:03,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1435 states and 1787 transitions. [2024-11-09 00:15:03,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1787 transitions. [2024-11-09 00:15:03,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-09 00:15:03,905 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:03,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:04,095 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:15:05,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1437 states and 1789 transitions. [2024-11-09 00:15:05,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1789 transitions. [2024-11-09 00:15:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-09 00:15:05,124 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:05,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:05,220 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:15:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:05,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1438 states and 1789 transitions. [2024-11-09 00:15:05,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1789 transitions. [2024-11-09 00:15:05,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-09 00:15:05,538 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:05,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:05,925 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:15:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:08,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1456 states and 1810 transitions. [2024-11-09 00:15:08,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1810 transitions. [2024-11-09 00:15:08,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-09 00:15:08,188 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:08,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:08,440 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:15:10,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:10,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1490 states and 1843 transitions. [2024-11-09 00:15:10,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1843 transitions. [2024-11-09 00:15:10,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-09 00:15:10,666 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:10,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:11,372 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:15:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1560 states and 1914 transitions. [2024-11-09 00:15:13,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1914 transitions. [2024-11-09 00:15:13,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-09 00:15:13,861 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:13,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:14,290 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:15:14,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:14,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1561 states and 1914 transitions. [2024-11-09 00:15:14,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1914 transitions. [2024-11-09 00:15:14,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-09 00:15:14,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:14,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-09 00:15:15,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:15,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1574 states and 1927 transitions. [2024-11-09 00:15:15,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 1927 transitions. [2024-11-09 00:15:15,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-09 00:15:15,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:15,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:16,384 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 168 proven. 36 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:15:18,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:18,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1622 states and 1989 transitions. [2024-11-09 00:15:18,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1989 transitions. [2024-11-09 00:15:18,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-09 00:15:18,689 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:18,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:18,783 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 00:15:20,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:20,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 1643 states and 2015 transitions. [2024-11-09 00:15:20,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2015 transitions. [2024-11-09 00:15:20,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-09 00:15:20,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:20,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:20,336 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 00:15:22,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:22,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 1663 states and 2035 transitions. [2024-11-09 00:15:22,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2035 transitions. [2024-11-09 00:15:22,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 00:15:22,232 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:22,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 00:15:32,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:32,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2143 states to 1729 states and 2143 transitions. [2024-11-09 00:15:32,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2143 transitions. [2024-11-09 00:15:32,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 00:15:32,777 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:32,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:33,403 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 00:15:41,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 1770 states and 2188 transitions. [2024-11-09 00:15:41,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2188 transitions. [2024-11-09 00:15:41,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 00:15:41,084 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:41,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:41,462 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 00:15:43,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:43,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 1779 states and 2200 transitions. [2024-11-09 00:15:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2200 transitions. [2024-11-09 00:15:43,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 00:15:43,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:43,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:43,916 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 00:15:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2204 states to 1781 states and 2204 transitions. [2024-11-09 00:15:44,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2204 transitions. [2024-11-09 00:15:44,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 00:15:44,821 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:44,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:45,175 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 00:15:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 1788 states and 2211 transitions. [2024-11-09 00:15:46,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2211 transitions. [2024-11-09 00:15:46,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 00:15:46,389 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:46,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:46,809 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 00:15:47,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:47,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 1795 states and 2217 transitions. [2024-11-09 00:15:47,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2217 transitions. [2024-11-09 00:15:47,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 00:15:47,995 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:47,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:48,449 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 00:15:49,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:49,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 1800 states and 2222 transitions. [2024-11-09 00:15:49,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2222 transitions. [2024-11-09 00:15:49,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 00:15:49,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:49,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 00:15:52,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 1820 states and 2246 transitions. [2024-11-09 00:15:52,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2246 transitions. [2024-11-09 00:15:52,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 00:15:52,832 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:52,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:53,158 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 00:15:54,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:54,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 1827 states and 2252 transitions. [2024-11-09 00:15:54,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2252 transitions. [2024-11-09 00:15:54,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 00:15:54,343 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:54,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:54,699 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 00:15:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 1834 states and 2259 transitions. [2024-11-09 00:15:55,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2259 transitions. [2024-11-09 00:15:55,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 00:15:55,731 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:55,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 00:15:56,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:56,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 1843 states and 2267 transitions. [2024-11-09 00:15:56,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2267 transitions. [2024-11-09 00:15:56,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 00:15:56,712 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:56,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:57,020 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 00:15:57,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 1848 states and 2271 transitions. [2024-11-09 00:15:57,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2271 transitions. [2024-11-09 00:15:57,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 00:15:57,909 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:57,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:58,489 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 00:15:59,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:59,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 1850 states and 2272 transitions. [2024-11-09 00:15:59,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2272 transitions. [2024-11-09 00:15:59,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 00:15:59,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:59,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:15:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 00:15:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:15:59,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 1854 states and 2276 transitions. [2024-11-09 00:15:59,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2276 transitions. [2024-11-09 00:15:59,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 00:15:59,729 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:15:59,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:15:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 00:16:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 1858 states and 2279 transitions. [2024-11-09 00:16:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2279 transitions. [2024-11-09 00:16:00,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 00:16:00,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:00,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:01,233 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 00:16:01,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:01,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 1862 states and 2282 transitions. [2024-11-09 00:16:01,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2282 transitions. [2024-11-09 00:16:01,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 00:16:01,812 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:01,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 198 proven. 51 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-09 00:16:03,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:03,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2300 states to 1877 states and 2300 transitions. [2024-11-09 00:16:03,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2300 transitions. [2024-11-09 00:16:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-09 00:16:03,320 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:03,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-11-09 00:16:03,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:03,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 1882 states and 2306 transitions. [2024-11-09 00:16:03,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2306 transitions. [2024-11-09 00:16:03,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-09 00:16:03,810 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:03,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:03,891 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-11-09 00:16:04,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 1887 states and 2311 transitions. [2024-11-09 00:16:04,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2311 transitions. [2024-11-09 00:16:04,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-09 00:16:04,235 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:04,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:16:05,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:05,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 1926 states and 2354 transitions. [2024-11-09 00:16:05,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2354 transitions. [2024-11-09 00:16:05,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 00:16:05,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:05,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 94 proven. 162 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 00:16:06,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:06,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 1927 states and 2354 transitions. [2024-11-09 00:16:06,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2354 transitions. [2024-11-09 00:16:06,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-09 00:16:06,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:06,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-11-09 00:16:06,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:06,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 1931 states and 2358 transitions. [2024-11-09 00:16:06,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2358 transitions. [2024-11-09 00:16:06,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-09 00:16:06,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:06,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:06,475 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-11-09 00:16:06,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:06,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 1935 states and 2362 transitions. [2024-11-09 00:16:06,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2362 transitions. [2024-11-09 00:16:06,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-09 00:16:06,558 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:06,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 192 proven. 21 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-09 00:16:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 1939 states and 2367 transitions. [2024-11-09 00:16:09,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2367 transitions. [2024-11-09 00:16:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-09 00:16:09,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:09,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:09,582 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 192 proven. 21 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-09 00:16:10,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 1942 states and 2369 transitions. [2024-11-09 00:16:10,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2369 transitions. [2024-11-09 00:16:10,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-09 00:16:10,353 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:10,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 232 proven. 68 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-09 00:16:11,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:11,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 1960 states and 2394 transitions. [2024-11-09 00:16:11,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2394 transitions. [2024-11-09 00:16:11,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:16:11,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:11,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:12,736 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:16:27,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:27,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2051 states and 2526 transitions. [2024-11-09 00:16:27,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 2526 transitions. [2024-11-09 00:16:27,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:16:27,171 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:27,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:16:36,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:36,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2095 states and 2582 transitions. [2024-11-09 00:16:36,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 2582 transitions. [2024-11-09 00:16:36,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:16:36,573 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:36,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:37,127 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:16:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:39,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2104 states and 2594 transitions. [2024-11-09 00:16:39,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2104 states and 2594 transitions. [2024-11-09 00:16:39,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:16:39,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:39,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:39,748 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:16:41,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2115 states and 2605 transitions. [2024-11-09 00:16:41,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2605 transitions. [2024-11-09 00:16:41,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:16:41,926 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:41,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:42,357 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:16:44,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2617 states to 2124 states and 2617 transitions. [2024-11-09 00:16:44,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 2617 transitions. [2024-11-09 00:16:44,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:16:44,649 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:44,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:45,324 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:16:46,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:46,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2131 states and 2624 transitions. [2024-11-09 00:16:46,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2624 transitions. [2024-11-09 00:16:46,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:16:46,756 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:46,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:47,084 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:16:47,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2134 states and 2627 transitions. [2024-11-09 00:16:47,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 2627 transitions. [2024-11-09 00:16:47,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:16:47,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:47,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:48,244 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:16:48,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:48,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2139 states and 2631 transitions. [2024-11-09 00:16:48,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2631 transitions. [2024-11-09 00:16:49,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:16:49,111 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:49,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:49,484 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:16:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:51,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2153 states and 2647 transitions. [2024-11-09 00:16:51,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2153 states and 2647 transitions. [2024-11-09 00:16:51,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:16:51,869 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:51,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:16:53,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2158 states and 2652 transitions. [2024-11-09 00:16:53,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 2652 transitions. [2024-11-09 00:16:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:16:53,500 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:53,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:54,028 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:16:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:54,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2160 states and 2654 transitions. [2024-11-09 00:16:54,918 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 2654 transitions. [2024-11-09 00:16:54,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:16:54,921 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:54,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:55,292 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:16:56,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:56,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2162 states and 2657 transitions. [2024-11-09 00:16:56,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2162 states and 2657 transitions. [2024-11-09 00:16:56,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:16:56,409 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:56,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:56,901 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:16:57,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:57,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2164 states and 2658 transitions. [2024-11-09 00:16:57,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 2658 transitions. [2024-11-09 00:16:57,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:16:57,909 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:57,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:16:59,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:16:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2169 states and 2663 transitions. [2024-11-09 00:16:59,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2663 transitions. [2024-11-09 00:16:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:16:59,286 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:16:59,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:59,818 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:17:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2174 states and 2668 transitions. [2024-11-09 00:17:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 2668 transitions. [2024-11-09 00:17:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:17:00,895 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:00,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:17:02,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:02,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2179 states and 2673 transitions. [2024-11-09 00:17:02,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 2673 transitions. [2024-11-09 00:17:02,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:17:02,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:02,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:02,945 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:17:03,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:03,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2182 states and 2676 transitions. [2024-11-09 00:17:03,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2676 transitions. [2024-11-09 00:17:03,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:17:03,902 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:03,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:17:05,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2184 states and 2677 transitions. [2024-11-09 00:17:05,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 2677 transitions. [2024-11-09 00:17:05,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:17:05,602 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:05,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:17:07,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:07,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2679 states to 2186 states and 2679 transitions. [2024-11-09 00:17:07,085 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 2679 transitions. [2024-11-09 00:17:07,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:17:07,087 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:07,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:17:08,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2188 states and 2681 transitions. [2024-11-09 00:17:08,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 2681 transitions. [2024-11-09 00:17:08,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:17:08,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:08,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:09,162 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:17:10,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:10,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2190 states and 2682 transitions. [2024-11-09 00:17:10,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 2682 transitions. [2024-11-09 00:17:10,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:17:10,027 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:10,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:17:11,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:11,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2194 states and 2690 transitions. [2024-11-09 00:17:11,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2194 states and 2690 transitions. [2024-11-09 00:17:11,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:17:11,918 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:11,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:12,478 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:17:12,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2205 states and 2702 transitions. [2024-11-09 00:17:12,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 2702 transitions. [2024-11-09 00:17:12,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:17:12,693 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:12,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:13,202 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 00:17:14,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2210 states and 2708 transitions. [2024-11-09 00:17:14,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 2708 transitions. [2024-11-09 00:17:14,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 00:17:14,252 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:14,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 232 proven. 46 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-09 00:17:15,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2211 states and 2708 transitions. [2024-11-09 00:17:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 2708 transitions. [2024-11-09 00:17:15,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-09 00:17:15,086 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:15,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:15,188 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-09 00:17:15,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:15,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2241 states and 2738 transitions. [2024-11-09 00:17:15,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 2738 transitions. [2024-11-09 00:17:15,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-09 00:17:15,733 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:15,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:16,204 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-09 00:17:18,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:18,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2754 states to 2255 states and 2754 transitions. [2024-11-09 00:17:18,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 2754 transitions. [2024-11-09 00:17:18,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-09 00:17:18,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:18,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:19,052 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-09 00:17:21,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:21,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2268 states and 2768 transitions. [2024-11-09 00:17:21,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 2768 transitions. [2024-11-09 00:17:21,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-09 00:17:21,533 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:21,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:22,035 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 242 proven. 62 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-09 00:17:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:24,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2270 states and 2773 transitions. [2024-11-09 00:17:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 2773 transitions. [2024-11-09 00:17:24,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-09 00:17:24,160 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:24,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:24,664 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 242 proven. 62 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-09 00:17:26,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:26,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2283 states and 2788 transitions. [2024-11-09 00:17:26,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 2788 transitions. [2024-11-09 00:17:26,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-09 00:17:26,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:26,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:26,446 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 240 proven. 8 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-09 00:17:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:17:29,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2308 states and 2815 transitions. [2024-11-09 00:17:29,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 2815 transitions. [2024-11-09 00:17:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-09 00:17:29,620 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:17:29,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:17:29,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:17:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:17:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:17:30,151 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:17:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:17:30,334 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 170 iterations. [2024-11-09 00:17:30,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.11 12:17:30 ImpRootNode [2024-11-09 00:17:30,510 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-09 00:17:30,511 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:17:30,511 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:17:30,511 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:17:30,512 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:13:42" (3/4) ... [2024-11-09 00:17:30,513 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 00:17:30,707 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ea34aa-eb3c-4caa-8756-a223d018d192/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-09 00:17:30,707 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:17:30,708 INFO L158 Benchmark]: Toolchain (without parser) took 231069.43ms. Allocated memory was 155.2MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 114.9MB in the beginning and 6.5GB in the end (delta: -6.3GB). Peak memory consumption was 366.1MB. Max. memory is 16.1GB. [2024-11-09 00:17:30,708 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 155.2MB. Free memory is still 100.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:17:30,709 INFO L158 Benchmark]: CACSL2BoogieTranslator took 655.82ms. Allocated memory is still 155.2MB. Free memory was 114.9MB in the beginning and 83.9MB in the end (delta: 30.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-09 00:17:30,710 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.93ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 78.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:17:30,710 INFO L158 Benchmark]: Boogie Preprocessor took 69.58ms. Allocated memory is still 155.2MB. Free memory was 78.2MB in the beginning and 73.4MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:17:30,711 INFO L158 Benchmark]: RCFGBuilder took 1711.93ms. Allocated memory was 155.2MB in the beginning and 199.2MB in the end (delta: 44.0MB). Free memory was 73.4MB in the beginning and 124.2MB in the end (delta: -50.8MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2024-11-09 00:17:30,711 INFO L158 Benchmark]: CodeCheck took 228344.92ms. Allocated memory was 199.2MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 124.2MB in the beginning and 6.5GB in the end (delta: -6.4GB). Peak memory consumption was 299.4MB. Max. memory is 16.1GB. [2024-11-09 00:17:30,711 INFO L158 Benchmark]: Witness Printer took 196.69ms. Allocated memory is still 6.9GB. Free memory was 6.5GB in the beginning and 6.5GB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-09 00:17:30,713 INFO L338 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: 228.1s, OverallIterations: 170, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 443183 SdHoareTripleChecker+Valid, 1258.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 441509 mSDsluCounter, 81081 SdHoareTripleChecker+Invalid, 1075.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70082 mSDsCounter, 118732 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 956099 IncrementalHoareTripleChecker+Invalid, 1074831 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118732 mSolverCounterUnsat, 10999 mSDtfsCounter, 956099 mSolverCounterSat, 12.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 207888 GetRequests, 201676 SyntacticMatches, 4870 SemanticMatches, 1342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1162063 ImplicationChecksByTransitivity, 159.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 39.4s InterpolantComputationTime, 31185 NumberOfCodeBlocks, 31185 NumberOfCodeBlocksAsserted, 170 NumberOfCheckSat, 30751 ConstructedInterpolants, 0 QuantifiedInterpolants, 120397 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 169 InterpolantComputations, 96 PerfectInterpolantSequences, 28920/31762 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: 411]: 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, 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)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, 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 [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [\result=21, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [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)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [\result=21, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [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)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, 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 [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [\result=26, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [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)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((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)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [\result=26, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [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)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND TRUE ((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5)) [L388] a21 = 1 [L389] a16 = 6 [L390] a7 = 0 [L391] return -1; VAL [\result=-1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [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)) [L601] CALL calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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 [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, 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))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L410] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1)) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L411] reach_error() VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, 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.33ms. Allocated memory is still 155.2MB. Free memory is still 100.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 655.82ms. Allocated memory is still 155.2MB. Free memory was 114.9MB in the beginning and 83.9MB in the end (delta: 30.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.93ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 78.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.58ms. Allocated memory is still 155.2MB. Free memory was 78.2MB in the beginning and 73.4MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1711.93ms. Allocated memory was 155.2MB in the beginning and 199.2MB in the end (delta: 44.0MB). Free memory was 73.4MB in the beginning and 124.2MB in the end (delta: -50.8MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. * CodeCheck took 228344.92ms. Allocated memory was 199.2MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 124.2MB in the beginning and 6.5GB in the end (delta: -6.4GB). Peak memory consumption was 299.4MB. Max. memory is 16.1GB. * Witness Printer took 196.69ms. Allocated memory is still 6.9GB. Free memory was 6.5GB in the beginning and 6.5GB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-09 00:17:30,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ea34aa-eb3c-4caa-8756-a223d018d192/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE