./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label33.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6d68d4f-263a-4f2e-89ff-3e03313497a2/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6d68d4f-263a-4f2e-89ff-3e03313497a2/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6d68d4f-263a-4f2e-89ff-3e03313497a2/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6d68d4f-263a-4f2e-89ff-3e03313497a2/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label33.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6d68d4f-263a-4f2e-89ff-3e03313497a2/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6d68d4f-263a-4f2e-89ff-3e03313497a2/bin/ukojak-verify-EEHR8qb7sm --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 a90366a5085659577cb1c98c7b11041979a96aff31e8f044fed2c2fa31b4a389 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:51:14,126 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:51:14,236 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6d68d4f-263a-4f2e-89ff-3e03313497a2/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 16:51:14,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:51:14,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 16:51:14,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:51:14,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:51:14,278 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 16:51:14,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:51:14,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:51:14,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:51:14,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:51:14,280 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:51:14,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:51:14,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:51:14,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:51:14,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:51:14,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:51:14,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:51:14,281 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:51:14,281 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:51:14,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:51:14,281 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:51:14,282 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 16:51:14,282 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 16:51:14,282 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 16:51:14,282 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:51:14,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 16:51:14,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:51:14,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:51:14,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:51:14,283 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 16:51:14,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:51:14,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_e6d68d4f-263a-4f2e-89ff-3e03313497a2/bin/ukojak-verify-EEHR8qb7sm 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 -> a90366a5085659577cb1c98c7b11041979a96aff31e8f044fed2c2fa31b4a389 [2024-11-13 16:51:14,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:51:14,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:51:14,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:51:14,634 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:51:14,635 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:51:14,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6d68d4f-263a-4f2e-89ff-3e03313497a2/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem01_label33.c Unable to find full path for "g++" [2024-11-13 16:51:16,876 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:51:17,278 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:51:17,279 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6d68d4f-263a-4f2e-89ff-3e03313497a2/sv-benchmarks/c/eca-rers2012/Problem01_label33.c [2024-11-13 16:51:17,300 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6d68d4f-263a-4f2e-89ff-3e03313497a2/bin/ukojak-verify-EEHR8qb7sm/data/e77a61008/6dfa53ffd0d3442c836e0d3de0b07c94/FLAG40eb6246d [2024-11-13 16:51:17,329 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6d68d4f-263a-4f2e-89ff-3e03313497a2/bin/ukojak-verify-EEHR8qb7sm/data/e77a61008/6dfa53ffd0d3442c836e0d3de0b07c94 [2024-11-13 16:51:17,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:51:17,336 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:51:17,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:51:17,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:51:17,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:51:17,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:51:17" (1/1) ... [2024-11-13 16:51:17,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fb15e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:17, skipping insertion in model container [2024-11-13 16:51:17,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:51:17" (1/1) ... [2024-11-13 16:51:17,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:51:17,864 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_e6d68d4f-263a-4f2e-89ff-3e03313497a2/sv-benchmarks/c/eca-rers2012/Problem01_label33.c[15127,15140] [2024-11-13 16:51:17,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:51:17,942 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:51:18,078 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_e6d68d4f-263a-4f2e-89ff-3e03313497a2/sv-benchmarks/c/eca-rers2012/Problem01_label33.c[15127,15140] [2024-11-13 16:51:18,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:51:18,160 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:51:18,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:18 WrapperNode [2024-11-13 16:51:18,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:51:18,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:51:18,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:51:18,163 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:51:18,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:18" (1/1) ... [2024-11-13 16:51:18,201 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:18" (1/1) ... [2024-11-13 16:51:18,282 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-13 16:51:18,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:51:18,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:51:18,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:51:18,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:51:18,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:18" (1/1) ... [2024-11-13 16:51:18,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:18" (1/1) ... [2024-11-13 16:51:18,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:18" (1/1) ... [2024-11-13 16:51:18,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:18" (1/1) ... [2024-11-13 16:51:18,321 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:18" (1/1) ... [2024-11-13 16:51:18,331 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:18" (1/1) ... [2024-11-13 16:51:18,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:18" (1/1) ... [2024-11-13 16:51:18,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:18" (1/1) ... [2024-11-13 16:51:18,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:51:18,346 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:51:18,346 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:51:18,347 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:51:18,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:51:18" (1/1) ... [2024-11-13 16:51:18,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 16:51:18,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6d68d4f-263a-4f2e-89ff-3e03313497a2/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 16:51:18,406 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6d68d4f-263a-4f2e-89ff-3e03313497a2/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 16:51:18,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6d68d4f-263a-4f2e-89ff-3e03313497a2/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 16:51:18,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:51:18,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 16:51:18,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:51:18,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:51:18,558 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:51:18,562 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:51:20,264 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-13 16:51:20,266 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:51:20,627 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:51:20,628 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:51:20,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:51:20 BoogieIcfgContainer [2024-11-13 16:51:20,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:51:20,630 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 16:51:20,630 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 16:51:20,640 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 16:51:20,640 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:51:20" (1/1) ... [2024-11-13 16:51:20,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:51:20,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:20,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-13 16:51:20,710 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-13 16:51:20,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 16:51:20,714 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:20,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:21,276 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-13 16:51:22,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:22,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2024-11-13 16:51:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2024-11-13 16:51:22,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 16:51:22,114 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:22,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:22,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 16:51:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:22,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2024-11-13 16:51:22,683 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2024-11-13 16:51:22,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-13 16:51:22,687 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:22,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:22,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:22,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:22,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 150 states and 244 transitions. [2024-11-13 16:51:22,986 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 244 transitions. [2024-11-13 16:51:22,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 16:51:22,987 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:22,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:23,146 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 16:51:23,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:23,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2024-11-13 16:51:23,352 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2024-11-13 16:51:23,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 16:51:23,354 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:23,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:23,559 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:23,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:23,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 159 states and 258 transitions. [2024-11-13 16:51:23,808 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 258 transitions. [2024-11-13 16:51:23,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-13 16:51:23,810 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:23,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:24,020 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 160 states and 259 transitions. [2024-11-13 16:51:24,217 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 259 transitions. [2024-11-13 16:51:24,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-13 16:51:24,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:24,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:24,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:24,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 168 states and 268 transitions. [2024-11-13 16:51:24,668 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 268 transitions. [2024-11-13 16:51:24,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 16:51:24,669 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:24,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:25,038 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-13 16:51:25,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:25,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 182 states and 286 transitions. [2024-11-13 16:51:25,473 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 286 transitions. [2024-11-13 16:51:25,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-13 16:51:25,474 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:25,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:25,647 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:26,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 197 states and 306 transitions. [2024-11-13 16:51:26,307 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 306 transitions. [2024-11-13 16:51:26,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 16:51:26,308 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:26,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:26,607 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-13 16:51:27,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 212 states and 327 transitions. [2024-11-13 16:51:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 327 transitions. [2024-11-13 16:51:27,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 16:51:27,463 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:27,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:27,660 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-13 16:51:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:28,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 230 states and 356 transitions. [2024-11-13 16:51:28,574 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2024-11-13 16:51:28,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 16:51:28,575 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:28,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:28,733 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:29,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 232 states and 359 transitions. [2024-11-13 16:51:29,023 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2024-11-13 16:51:29,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 16:51:29,025 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:29,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:29,162 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:29,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:29,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 237 states and 365 transitions. [2024-11-13 16:51:29,324 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 365 transitions. [2024-11-13 16:51:29,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 16:51:29,325 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:29,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 16:51:29,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 238 states and 366 transitions. [2024-11-13 16:51:29,710 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 366 transitions. [2024-11-13 16:51:29,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 16:51:29,711 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:29,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:29,816 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-13 16:51:30,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:30,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 257 states and 395 transitions. [2024-11-13 16:51:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 395 transitions. [2024-11-13 16:51:30,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 16:51:30,857 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:30,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:30,946 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-13 16:51:31,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:31,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 258 states and 396 transitions. [2024-11-13 16:51:31,162 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 396 transitions. [2024-11-13 16:51:31,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 16:51:31,165 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:31,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:31,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:31,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 273 states and 415 transitions. [2024-11-13 16:51:31,991 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 415 transitions. [2024-11-13 16:51:31,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 16:51:31,993 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:31,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:32,102 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 16:51:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 291 states and 435 transitions. [2024-11-13 16:51:32,928 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 435 transitions. [2024-11-13 16:51:32,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 16:51:32,929 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:32,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:33,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:33,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 295 states and 439 transitions. [2024-11-13 16:51:33,112 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 439 transitions. [2024-11-13 16:51:33,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 16:51:33,114 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:33,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:33,276 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-13 16:51:33,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:33,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 299 states and 444 transitions. [2024-11-13 16:51:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 444 transitions. [2024-11-13 16:51:33,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 16:51:33,718 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:33,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:33,815 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 16:51:34,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:34,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 307 states and 459 transitions. [2024-11-13 16:51:34,387 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 459 transitions. [2024-11-13 16:51:34,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 16:51:34,390 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:34,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:34,467 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 16:51:35,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:35,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 313 states and 467 transitions. [2024-11-13 16:51:35,019 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 467 transitions. [2024-11-13 16:51:35,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 16:51:35,021 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:35,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:35,126 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 16:51:35,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:35,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 316 states and 471 transitions. [2024-11-13 16:51:35,399 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 471 transitions. [2024-11-13 16:51:35,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 16:51:35,401 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:35,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:36,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 331 states and 491 transitions. [2024-11-13 16:51:36,077 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 491 transitions. [2024-11-13 16:51:36,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 16:51:36,078 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:36,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:36,257 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:36,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:36,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 345 states and 508 transitions. [2024-11-13 16:51:36,642 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 508 transitions. [2024-11-13 16:51:36,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 16:51:36,644 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:36,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:36,837 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-13 16:51:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:37,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 347 states and 510 transitions. [2024-11-13 16:51:37,213 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 510 transitions. [2024-11-13 16:51:37,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 16:51:37,215 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:37,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:37,308 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 16:51:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 353 states and 516 transitions. [2024-11-13 16:51:37,778 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 516 transitions. [2024-11-13 16:51:37,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 16:51:37,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:37,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:37,866 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 16:51:37,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:37,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 357 states and 519 transitions. [2024-11-13 16:51:37,927 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 519 transitions. [2024-11-13 16:51:37,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 16:51:37,929 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:37,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:38,077 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-13 16:51:38,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:38,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 359 states and 522 transitions. [2024-11-13 16:51:38,157 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 522 transitions. [2024-11-13 16:51:38,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 16:51:38,158 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:38,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:39,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:39,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 373 states and 540 transitions. [2024-11-13 16:51:39,035 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 540 transitions. [2024-11-13 16:51:39,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 16:51:39,037 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:39,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:39,210 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:39,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:39,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 377 states and 545 transitions. [2024-11-13 16:51:39,528 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 545 transitions. [2024-11-13 16:51:39,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 16:51:39,529 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:39,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:39,639 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-13 16:51:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 379 states and 548 transitions. [2024-11-13 16:51:39,877 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 548 transitions. [2024-11-13 16:51:39,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 16:51:39,880 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:39,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:40,207 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-13 16:51:40,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 386 states and 555 transitions. [2024-11-13 16:51:40,647 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 555 transitions. [2024-11-13 16:51:40,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 16:51:40,649 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:40,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 16:51:41,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 395 states and 564 transitions. [2024-11-13 16:51:41,350 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 564 transitions. [2024-11-13 16:51:41,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 16:51:41,352 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:41,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:41,522 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 16:51:41,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:41,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 399 states and 567 transitions. [2024-11-13 16:51:41,821 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 567 transitions. [2024-11-13 16:51:41,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 16:51:41,822 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:41,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 16:51:42,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:42,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 402 states and 569 transitions. [2024-11-13 16:51:42,237 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 569 transitions. [2024-11-13 16:51:42,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 16:51:42,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:42,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:42,348 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:43,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 472 states and 647 transitions. [2024-11-13 16:51:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 647 transitions. [2024-11-13 16:51:43,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 16:51:43,126 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:43,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:43,213 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 486 states and 664 transitions. [2024-11-13 16:51:43,349 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 664 transitions. [2024-11-13 16:51:43,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 16:51:43,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:43,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:43,447 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:43,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:43,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 497 states and 678 transitions. [2024-11-13 16:51:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 678 transitions. [2024-11-13 16:51:43,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-13 16:51:43,647 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:43,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:43,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:43,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 504 states and 686 transitions. [2024-11-13 16:51:43,844 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 686 transitions. [2024-11-13 16:51:43,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 16:51:43,846 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:43,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 16:51:43,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 506 states and 688 transitions. [2024-11-13 16:51:43,968 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 688 transitions. [2024-11-13 16:51:43,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 16:51:43,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:43,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:44,077 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 16:51:44,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:44,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 513 states and 695 transitions. [2024-11-13 16:51:44,240 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 695 transitions. [2024-11-13 16:51:44,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 16:51:44,241 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:44,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:44,326 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:45,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 551 states and 739 transitions. [2024-11-13 16:51:45,392 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 739 transitions. [2024-11-13 16:51:45,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 16:51:45,394 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:45,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:45,521 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:45,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 554 states and 741 transitions. [2024-11-13 16:51:45,921 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 741 transitions. [2024-11-13 16:51:45,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 16:51:45,923 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:45,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:46,071 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:46,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 557 states and 743 transitions. [2024-11-13 16:51:46,391 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 743 transitions. [2024-11-13 16:51:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 16:51:46,392 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:46,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:46,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:46,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 571 states and 758 transitions. [2024-11-13 16:51:46,629 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 758 transitions. [2024-11-13 16:51:46,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 16:51:46,631 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:46,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 16:51:46,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:46,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 580 states and 766 transitions. [2024-11-13 16:51:46,839 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 766 transitions. [2024-11-13 16:51:46,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 16:51:46,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:46,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:47,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:47,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 588 states and 775 transitions. [2024-11-13 16:51:47,235 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 775 transitions. [2024-11-13 16:51:47,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 16:51:47,236 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:47,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:47,317 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 16:51:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 685 states and 880 transitions. [2024-11-13 16:51:48,900 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 880 transitions. [2024-11-13 16:51:48,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 16:51:48,902 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:48,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:49,008 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-13 16:51:49,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:49,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 707 states and 903 transitions. [2024-11-13 16:51:49,652 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 903 transitions. [2024-11-13 16:51:49,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 16:51:49,653 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:49,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:49,747 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-13 16:51:49,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 710 states and 905 transitions. [2024-11-13 16:51:49,863 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 905 transitions. [2024-11-13 16:51:49,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-13 16:51:49,864 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:49,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:50,250 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 16:51:51,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:51,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 739 states and 938 transitions. [2024-11-13 16:51:51,070 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 938 transitions. [2024-11-13 16:51:51,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 16:51:51,071 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:51,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 16:51:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:51,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 753 states and 955 transitions. [2024-11-13 16:51:51,667 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 955 transitions. [2024-11-13 16:51:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 16:51:51,668 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:51,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:52,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 772 states and 975 transitions. [2024-11-13 16:51:52,282 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 975 transitions. [2024-11-13 16:51:52,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-13 16:51:52,283 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:52,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:52,944 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 70 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 16:51:55,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 823 states and 1046 transitions. [2024-11-13 16:51:55,427 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1046 transitions. [2024-11-13 16:51:55,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-13 16:51:55,429 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:55,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:55,727 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 70 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 16:51:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 827 states and 1050 transitions. [2024-11-13 16:51:56,249 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1050 transitions. [2024-11-13 16:51:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 16:51:56,251 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:56,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:56,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:56,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 850 states and 1073 transitions. [2024-11-13 16:51:56,612 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1073 transitions. [2024-11-13 16:51:56,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 16:51:56,614 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:56,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:56,734 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-13 16:51:56,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:56,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 851 states and 1073 transitions. [2024-11-13 16:51:56,823 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1073 transitions. [2024-11-13 16:51:56,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 16:51:56,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:56,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:57,220 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 901 states and 1127 transitions. [2024-11-13 16:51:58,973 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1127 transitions. [2024-11-13 16:51:58,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 16:51:58,974 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:58,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:59,208 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:51:59,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:59,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 874 states and 1099 transitions. [2024-11-13 16:51:59,657 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1099 transitions. [2024-11-13 16:51:59,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 16:51:59,658 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:59,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:51:59,727 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 16:51:59,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:51:59,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 901 states and 1127 transitions. [2024-11-13 16:51:59,921 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1127 transitions. [2024-11-13 16:51:59,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 16:51:59,922 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:51:59,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:51:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:00,050 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 16:52:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:00,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 912 states and 1138 transitions. [2024-11-13 16:52:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1138 transitions. [2024-11-13 16:52:00,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 16:52:00,884 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:00,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:00,963 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 16:52:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 945 states and 1176 transitions. [2024-11-13 16:52:01,372 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1176 transitions. [2024-11-13 16:52:01,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 16:52:01,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:01,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:01,472 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 16:52:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 954 states and 1188 transitions. [2024-11-13 16:52:02,310 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1188 transitions. [2024-11-13 16:52:02,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 16:52:02,312 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:02,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:02,400 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 16:52:02,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 958 states and 1193 transitions. [2024-11-13 16:52:02,520 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1193 transitions. [2024-11-13 16:52:02,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 16:52:02,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:02,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:02,631 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 16:52:02,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:02,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 963 states and 1199 transitions. [2024-11-13 16:52:02,784 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1199 transitions. [2024-11-13 16:52:02,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 16:52:02,785 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:02,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 16:52:03,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:03,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 967 states and 1202 transitions. [2024-11-13 16:52:03,292 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1202 transitions. [2024-11-13 16:52:03,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-13 16:52:03,293 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:03,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 16:52:04,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:04,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 989 states and 1225 transitions. [2024-11-13 16:52:04,279 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1225 transitions. [2024-11-13 16:52:04,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 16:52:04,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:04,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 16:52:05,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:05,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1000 states and 1241 transitions. [2024-11-13 16:52:05,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1241 transitions. [2024-11-13 16:52:05,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 16:52:05,272 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:05,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 16:52:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:06,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1009 states and 1252 transitions. [2024-11-13 16:52:06,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1252 transitions. [2024-11-13 16:52:06,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 16:52:06,313 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:06,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 16:52:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:06,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1013 states and 1256 transitions. [2024-11-13 16:52:06,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1256 transitions. [2024-11-13 16:52:06,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 16:52:06,690 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:06,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:06,870 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 16:52:07,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1018 states and 1262 transitions. [2024-11-13 16:52:07,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1262 transitions. [2024-11-13 16:52:07,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 16:52:07,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:07,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:07,314 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 16:52:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:07,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1022 states and 1265 transitions. [2024-11-13 16:52:07,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1265 transitions. [2024-11-13 16:52:07,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-13 16:52:07,775 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:07,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:08,381 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 90 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:52:13,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:13,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1108 states and 1373 transitions. [2024-11-13 16:52:13,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1373 transitions. [2024-11-13 16:52:13,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 16:52:13,366 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:13,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:13,768 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 16:52:15,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:15,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1176 states and 1442 transitions. [2024-11-13 16:52:15,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1442 transitions. [2024-11-13 16:52:15,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 16:52:15,241 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:15,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 16:52:15,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:15,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1179 states and 1444 transitions. [2024-11-13 16:52:15,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1444 transitions. [2024-11-13 16:52:15,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-13 16:52:15,734 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:15,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:52:20,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:20,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1225 states and 1508 transitions. [2024-11-13 16:52:20,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1508 transitions. [2024-11-13 16:52:20,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-13 16:52:20,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:20,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:52:23,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1246 states and 1536 transitions. [2024-11-13 16:52:23,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 1536 transitions. [2024-11-13 16:52:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-13 16:52:23,009 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:23,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:23,402 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:52:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1249 states and 1541 transitions. [2024-11-13 16:52:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1541 transitions. [2024-11-13 16:52:23,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-13 16:52:23,949 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:23,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:52:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:25,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1255 states and 1549 transitions. [2024-11-13 16:52:25,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1549 transitions. [2024-11-13 16:52:25,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-13 16:52:25,255 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:25,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 16:52:26,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:26,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1280 states and 1575 transitions. [2024-11-13 16:52:26,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1575 transitions. [2024-11-13 16:52:26,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-13 16:52:26,304 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:26,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 16:52:26,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:26,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1284 states and 1580 transitions. [2024-11-13 16:52:26,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1580 transitions. [2024-11-13 16:52:26,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 16:52:26,884 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:26,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:27,335 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:52:28,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:28,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1289 states and 1592 transitions. [2024-11-13 16:52:28,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1592 transitions. [2024-11-13 16:52:28,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 16:52:28,421 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:28,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:52:29,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:29,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1290 states and 1592 transitions. [2024-11-13 16:52:29,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1592 transitions. [2024-11-13 16:52:29,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 16:52:29,201 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:29,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:29,600 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:52:30,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:30,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1291 states and 1592 transitions. [2024-11-13 16:52:30,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1592 transitions. [2024-11-13 16:52:30,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 16:52:30,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:30,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:52:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1360 states and 1676 transitions. [2024-11-13 16:52:32,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1676 transitions. [2024-11-13 16:52:32,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-13 16:52:32,478 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:32,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:32,800 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 16:52:33,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:33,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1379 states and 1699 transitions. [2024-11-13 16:52:33,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 1699 transitions. [2024-11-13 16:52:33,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-13 16:52:33,826 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:33,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 16:52:34,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:34,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1388 states and 1707 transitions. [2024-11-13 16:52:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1707 transitions. [2024-11-13 16:52:34,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-13 16:52:34,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:34,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:34,208 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-13 16:52:34,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:34,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1390 states and 1708 transitions. [2024-11-13 16:52:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1708 transitions. [2024-11-13 16:52:34,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-13 16:52:34,257 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:34,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-13 16:52:35,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:35,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1393 states and 1711 transitions. [2024-11-13 16:52:35,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1711 transitions. [2024-11-13 16:52:35,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-13 16:52:35,031 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:35,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 155 proven. 38 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 16:52:37,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1440 states and 1761 transitions. [2024-11-13 16:52:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1761 transitions. [2024-11-13 16:52:37,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 16:52:37,286 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:37,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-13 16:52:37,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:37,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1441 states and 1765 transitions. [2024-11-13 16:52:37,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1765 transitions. [2024-11-13 16:52:37,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 16:52:37,941 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:37,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 16:52:39,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:39,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1456 states and 1784 transitions. [2024-11-13 16:52:39,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1784 transitions. [2024-11-13 16:52:39,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-13 16:52:39,125 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:39,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:39,207 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-13 16:52:40,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:40,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1506 states and 1836 transitions. [2024-11-13 16:52:40,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1836 transitions. [2024-11-13 16:52:40,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-13 16:52:40,412 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:40,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:41,084 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 16:52:45,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1598 states and 1965 transitions. [2024-11-13 16:52:45,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 1965 transitions. [2024-11-13 16:52:45,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-13 16:52:45,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:45,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:46,124 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 16:52:47,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1606 states and 1979 transitions. [2024-11-13 16:52:47,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1979 transitions. [2024-11-13 16:52:47,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-13 16:52:47,836 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:47,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:48,712 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 128 proven. 21 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 16:52:49,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1621 states and 1996 transitions. [2024-11-13 16:52:49,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 1996 transitions. [2024-11-13 16:52:49,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 16:52:49,886 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:49,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:50,066 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 159 proven. 46 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-13 16:52:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 1640 states and 2016 transitions. [2024-11-13 16:52:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2016 transitions. [2024-11-13 16:52:51,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 16:52:51,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:51,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:51,229 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-13 16:52:52,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:52,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 1659 states and 2036 transitions. [2024-11-13 16:52:52,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2036 transitions. [2024-11-13 16:52:52,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 16:52:52,185 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:52,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 186 proven. 65 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-13 16:52:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 1720 states and 2102 transitions. [2024-11-13 16:52:55,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2102 transitions. [2024-11-13 16:52:55,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 16:52:55,317 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:55,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:55,394 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-13 16:52:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:52:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 1732 states and 2116 transitions. [2024-11-13 16:52:55,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2116 transitions. [2024-11-13 16:52:55,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 16:52:55,921 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:52:55,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:52:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:52:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 16:53:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:53:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2201 states to 1796 states and 2201 transitions. [2024-11-13 16:53:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2201 transitions. [2024-11-13 16:53:00,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 16:53:00,966 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:53:00,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:53:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:53:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 16:53:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:53:02,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 1807 states and 2212 transitions. [2024-11-13 16:53:02,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2212 transitions. [2024-11-13 16:53:02,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 16:53:02,337 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:53:02,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:53:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:53:02,729 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 16:53:03,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:53:03,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 1810 states and 2214 transitions. [2024-11-13 16:53:03,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2214 transitions. [2024-11-13 16:53:03,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 16:53:03,372 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:53:03,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:53:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:53:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 16:53:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 16:53:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 1816 states and 2221 transitions. [2024-11-13 16:53:03,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2221 transitions. [2024-11-13 16:53:03,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-13 16:53:03,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 16:53:03,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:53:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:53:03,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:53:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:53:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:53:04,156 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:53:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:53:04,319 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 106 iterations. [2024-11-13 16:53:04,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 04:53:04 ImpRootNode [2024-11-13 16:53:04,502 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 16:53:04,503 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:53:04,503 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:53:04,503 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:53:04,504 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:51:20" (3/4) ... [2024-11-13 16:53:04,506 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 16:53:04,714 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6d68d4f-263a-4f2e-89ff-3e03313497a2/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 16:53:04,714 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:53:04,717 INFO L158 Benchmark]: Toolchain (without parser) took 107379.99ms. Allocated memory was 109.1MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 81.5MB in the beginning and 829.6MB in the end (delta: -748.1MB). Peak memory consumption was 780.3MB. Max. memory is 16.1GB. [2024-11-13 16:53:04,717 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 83.9MB. Free memory is still 41.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:53:04,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 824.14ms. Allocated memory is still 109.1MB. Free memory was 81.5MB in the beginning and 54.7MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 16:53:04,719 INFO L158 Benchmark]: Boogie Procedure Inliner took 120.86ms. Allocated memory is still 109.1MB. Free memory was 54.7MB in the beginning and 49.1MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:53:04,720 INFO L158 Benchmark]: Boogie Preprocessor took 61.89ms. Allocated memory is still 109.1MB. Free memory was 49.1MB in the beginning and 45.0MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:53:04,720 INFO L158 Benchmark]: RCFGBuilder took 2283.05ms. Allocated memory is still 109.1MB. Free memory was 45.0MB in the beginning and 53.4MB in the end (delta: -8.4MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2024-11-13 16:53:04,720 INFO L158 Benchmark]: CodeCheck took 103872.54ms. Allocated memory was 109.1MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 53.4MB in the beginning and 854.7MB in the end (delta: -801.3MB). Peak memory consumption was 727.3MB. Max. memory is 16.1GB. [2024-11-13 16:53:04,721 INFO L158 Benchmark]: Witness Printer took 211.07ms. Allocated memory is still 1.6GB. Free memory was 854.7MB in the beginning and 829.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 16:53:04,725 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: 103.7s, OverallIterations: 106, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173312 SdHoareTripleChecker+Valid, 605.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169981 mSDsluCounter, 26270 SdHoareTripleChecker+Invalid, 511.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22097 mSDsCounter, 56327 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 389661 IncrementalHoareTripleChecker+Invalid, 445988 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56327 mSolverCounterUnsat, 4173 mSDtfsCounter, 389661 mSolverCounterSat, 6.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102227 GetRequests, 98290 SyntacticMatches, 3177 SemanticMatches, 760 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340874 ImplicationChecksByTransitivity, 65.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.7s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 20.0s InterpolantComputationTime, 14706 NumberOfCodeBlocks, 14706 NumberOfCodeBlocksAsserted, 106 NumberOfCheckSat, 14388 ConstructedInterpolants, 0 QuantifiedInterpolants, 64647 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 105 InterpolantComputations, 71 PerfectInterpolantSequences, 8880/9663 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: 417]: 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=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=0, a7=1, a8=13, 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=0, a7=1, a8=13, 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=0, a7=1, a8=13, 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=0, a7=1, a8=13, 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=0, a7=1, a8=13, 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=0, a7=1, a8=13, 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=0, a7=1, a8=13, 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=0, a7=1, a8=13, 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=0, a7=1, a8=13, 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=0, a7=1, a8=13, 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=0, a7=1, a8=13, 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 TRUE (((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1)) [L113] a20 = 0 [L114] a8 = 15 [L115] a17 = 0 [L116] a21 = 1 [L117] return -1; VAL [\result=-1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 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=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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=5, a17=0, a20=0, a21=1, a7=1, 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 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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [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=0, a20=0, a21=1, a7=1, 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] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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] [L416] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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] [L417] reach_error() VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45ms. Allocated memory is still 83.9MB. Free memory is still 41.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 824.14ms. Allocated memory is still 109.1MB. Free memory was 81.5MB in the beginning and 54.7MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 120.86ms. Allocated memory is still 109.1MB. Free memory was 54.7MB in the beginning and 49.1MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.89ms. Allocated memory is still 109.1MB. Free memory was 49.1MB in the beginning and 45.0MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2283.05ms. Allocated memory is still 109.1MB. Free memory was 45.0MB in the beginning and 53.4MB in the end (delta: -8.4MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * CodeCheck took 103872.54ms. Allocated memory was 109.1MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 53.4MB in the beginning and 854.7MB in the end (delta: -801.3MB). Peak memory consumption was 727.3MB. Max. memory is 16.1GB. * Witness Printer took 211.07ms. Allocated memory is still 1.6GB. Free memory was 854.7MB in the beginning and 829.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 16:53:04,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6d68d4f-263a-4f2e-89ff-3e03313497a2/bin/ukojak-verify-EEHR8qb7sm/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