./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label37.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94fd81ec-59ab-4823-8b1d-226bdce8f078/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94fd81ec-59ab-4823-8b1d-226bdce8f078/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94fd81ec-59ab-4823-8b1d-226bdce8f078/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94fd81ec-59ab-4823-8b1d-226bdce8f078/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label37.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94fd81ec-59ab-4823-8b1d-226bdce8f078/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94fd81ec-59ab-4823-8b1d-226bdce8f078/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 889703d30f71ddcf9dd164cd63c57e33725418944081edb29f7e0df12e48cb88 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 01:53:37,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 01:53:37,857 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94fd81ec-59ab-4823-8b1d-226bdce8f078/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 01:53:37,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 01:53:37,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 01:53:37,884 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 01:53:37,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 01:53:37,885 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 01:53:37,885 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 01:53:37,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 01:53:37,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 01:53:37,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 01:53:37,885 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 01:53:37,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 01:53:37,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 01:53:37,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 01:53:37,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 01:53:37,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 01:53:37,886 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 01:53:37,886 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 01:53:37,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 01:53:37,886 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 01:53:37,886 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 01:53:37,887 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 01:53:37,887 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 01:53:37,887 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 01:53:37,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 01:53:37,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 01:53:37,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 01:53:37,887 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 01:53:37,887 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 01:53:37,887 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 01:53:37,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 01:53:37,888 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_94fd81ec-59ab-4823-8b1d-226bdce8f078/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 889703d30f71ddcf9dd164cd63c57e33725418944081edb29f7e0df12e48cb88 [2024-12-06 01:53:38,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 01:53:38,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 01:53:38,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 01:53:38,152 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 01:53:38,153 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 01:53:38,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94fd81ec-59ab-4823-8b1d-226bdce8f078/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem01_label37.c [2024-12-06 01:53:40,780 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94fd81ec-59ab-4823-8b1d-226bdce8f078/bin/ukojak-verify-CZk0znPC7b/data/aa7ef02b3/f88c819487af4601a4c433d516fd766f/FLAG3112676b1 [2024-12-06 01:53:41,047 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 01:53:41,047 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94fd81ec-59ab-4823-8b1d-226bdce8f078/sv-benchmarks/c/eca-rers2012/Problem01_label37.c [2024-12-06 01:53:41,059 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94fd81ec-59ab-4823-8b1d-226bdce8f078/bin/ukojak-verify-CZk0znPC7b/data/aa7ef02b3/f88c819487af4601a4c433d516fd766f/FLAG3112676b1 [2024-12-06 01:53:41,357 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94fd81ec-59ab-4823-8b1d-226bdce8f078/bin/ukojak-verify-CZk0znPC7b/data/aa7ef02b3/f88c819487af4601a4c433d516fd766f [2024-12-06 01:53:41,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 01:53:41,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 01:53:41,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 01:53:41,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 01:53:41,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 01:53:41,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:53:41" (1/1) ... [2024-12-06 01:53:41,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f37f9e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:41, skipping insertion in model container [2024-12-06 01:53:41,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:53:41" (1/1) ... [2024-12-06 01:53:41,386 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 01:53:41,611 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_94fd81ec-59ab-4823-8b1d-226bdce8f078/sv-benchmarks/c/eca-rers2012/Problem01_label37.c[14876,14889] [2024-12-06 01:53:41,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 01:53:41,653 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 01:53:41,721 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_94fd81ec-59ab-4823-8b1d-226bdce8f078/sv-benchmarks/c/eca-rers2012/Problem01_label37.c[14876,14889] [2024-12-06 01:53:41,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 01:53:41,754 INFO L204 MainTranslator]: Completed translation [2024-12-06 01:53:41,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:41 WrapperNode [2024-12-06 01:53:41,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 01:53:41,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 01:53:41,756 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 01:53:41,756 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 01:53:41,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:41" (1/1) ... [2024-12-06 01:53:41,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:41" (1/1) ... [2024-12-06 01:53:41,809 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-12-06 01:53:41,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 01:53:41,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 01:53:41,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 01:53:41,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 01:53:41,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:41" (1/1) ... [2024-12-06 01:53:41,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:41" (1/1) ... [2024-12-06 01:53:41,819 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:41" (1/1) ... [2024-12-06 01:53:41,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:41" (1/1) ... [2024-12-06 01:53:41,838 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:41" (1/1) ... [2024-12-06 01:53:41,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:41" (1/1) ... [2024-12-06 01:53:41,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:41" (1/1) ... [2024-12-06 01:53:41,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:41" (1/1) ... [2024-12-06 01:53:41,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:41" (1/1) ... [2024-12-06 01:53:41,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 01:53:41,862 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 01:53:41,862 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 01:53:41,862 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 01:53:41,863 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:41" (1/1) ... [2024-12-06 01:53:41,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 01:53:41,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94fd81ec-59ab-4823-8b1d-226bdce8f078/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 01:53:41,892 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94fd81ec-59ab-4823-8b1d-226bdce8f078/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 01:53:41,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94fd81ec-59ab-4823-8b1d-226bdce8f078/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 01:53:41,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 01:53:41,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 01:53:41,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 01:53:41,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 01:53:41,974 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 01:53:41,975 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 01:53:42,800 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-06 01:53:42,801 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 01:53:42,990 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 01:53:42,990 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 01:53:42,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:53:42 BoogieIcfgContainer [2024-12-06 01:53:42,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 01:53:42,991 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 01:53:42,991 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 01:53:42,998 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 01:53:42,998 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:53:42" (1/1) ... [2024-12-06 01:53:43,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 01:53:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:43,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-12-06 01:53:43,045 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-12-06 01:53:43,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-06 01:53:43,048 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:43,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:43,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:43,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 145 states and 243 transitions. [2024-12-06 01:53:43,992 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 243 transitions. [2024-12-06 01:53:43,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-06 01:53:43,994 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:43,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:44,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:44,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 218 states and 323 transitions. [2024-12-06 01:53:44,999 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 323 transitions. [2024-12-06 01:53:45,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-06 01:53:45,001 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:45,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:45,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:45,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 219 states and 326 transitions. [2024-12-06 01:53:45,455 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 326 transitions. [2024-12-06 01:53:45,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-12-06 01:53:45,457 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:45,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 229 states and 341 transitions. [2024-12-06 01:53:45,863 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 341 transitions. [2024-12-06 01:53:45,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 01:53:45,866 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:45,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:46,099 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:46,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:46,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 240 states and 357 transitions. [2024-12-06 01:53:46,514 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 357 transitions. [2024-12-06 01:53:46,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 01:53:46,515 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:46,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:46,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 243 states and 361 transitions. [2024-12-06 01:53:46,735 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 361 transitions. [2024-12-06 01:53:46,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 01:53:46,735 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:46,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:46,840 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:46,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 253 states and 372 transitions. [2024-12-06 01:53:46,970 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 372 transitions. [2024-12-06 01:53:46,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 01:53:46,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:46,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:47,081 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:47,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 267 states and 388 transitions. [2024-12-06 01:53:47,466 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 388 transitions. [2024-12-06 01:53:47,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-12-06 01:53:47,467 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:47,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 01:53:47,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:47,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 268 states and 390 transitions. [2024-12-06 01:53:47,746 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 390 transitions. [2024-12-06 01:53:47,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-12-06 01:53:47,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:47,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:47,825 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 01:53:47,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 271 states and 394 transitions. [2024-12-06 01:53:47,980 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 394 transitions. [2024-12-06 01:53:47,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 01:53:47,980 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:47,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:48,111 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 286 states and 416 transitions. [2024-12-06 01:53:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 416 transitions. [2024-12-06 01:53:48,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 01:53:48,731 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:48,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:48,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 289 states and 419 transitions. [2024-12-06 01:53:48,967 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 419 transitions. [2024-12-06 01:53:48,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 01:53:48,968 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:48,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:49,040 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:49,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:49,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 296 states and 426 transitions. [2024-12-06 01:53:49,211 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 426 transitions. [2024-12-06 01:53:49,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 01:53:49,211 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:49,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:49,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:49,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 299 states and 429 transitions. [2024-12-06 01:53:49,433 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 429 transitions. [2024-12-06 01:53:49,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 01:53:49,434 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:49,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:49,510 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 314 states and 450 transitions. [2024-12-06 01:53:49,724 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 450 transitions. [2024-12-06 01:53:49,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-06 01:53:49,725 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:49,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:49,812 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:50,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 330 states and 472 transitions. [2024-12-06 01:53:50,495 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 472 transitions. [2024-12-06 01:53:50,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-06 01:53:50,496 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:50,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:50,543 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:50,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 337 states and 479 transitions. [2024-12-06 01:53:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 479 transitions. [2024-12-06 01:53:50,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-06 01:53:50,734 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:50,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:50,769 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:50,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:50,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 340 states and 482 transitions. [2024-12-06 01:53:50,905 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 482 transitions. [2024-12-06 01:53:50,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-06 01:53:50,906 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:50,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:50,945 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 01:53:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:51,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 341 states and 483 transitions. [2024-12-06 01:53:51,058 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 483 transitions. [2024-12-06 01:53:51,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-06 01:53:51,059 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:51,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:51,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:51,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 350 states and 495 transitions. [2024-12-06 01:53:51,416 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 495 transitions. [2024-12-06 01:53:51,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-12-06 01:53:51,417 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:51,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:51,507 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 01:53:51,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 354 states and 499 transitions. [2024-12-06 01:53:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 499 transitions. [2024-12-06 01:53:51,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 01:53:51,684 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:51,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:52,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:52,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 363 states and 513 transitions. [2024-12-06 01:53:52,060 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 513 transitions. [2024-12-06 01:53:52,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 01:53:52,060 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:52,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:52,111 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:52,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 367 states and 517 transitions. [2024-12-06 01:53:52,278 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 517 transitions. [2024-12-06 01:53:52,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-06 01:53:52,279 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:52,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:52,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:52,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 386 states and 542 transitions. [2024-12-06 01:53:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 542 transitions. [2024-12-06 01:53:52,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-12-06 01:53:52,870 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:52,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:52,938 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 01:53:53,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:53,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 388 states and 544 transitions. [2024-12-06 01:53:53,041 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 544 transitions. [2024-12-06 01:53:53,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-12-06 01:53:53,042 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:53,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:53,073 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 01:53:53,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 392 states and 548 transitions. [2024-12-06 01:53:53,222 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 548 transitions. [2024-12-06 01:53:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-06 01:53:53,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:53,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:53,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:53,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 409 states and 568 transitions. [2024-12-06 01:53:53,541 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 568 transitions. [2024-12-06 01:53:53,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-06 01:53:53,542 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:53,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:53,601 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 01:53:54,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 427 states and 591 transitions. [2024-12-06 01:53:54,247 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 591 transitions. [2024-12-06 01:53:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-06 01:53:54,248 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:54,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:54,337 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 01:53:54,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:54,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 436 states and 600 transitions. [2024-12-06 01:53:54,629 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 600 transitions. [2024-12-06 01:53:54,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-06 01:53:54,629 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:54,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:54,669 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 01:53:55,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 451 states and 617 transitions. [2024-12-06 01:53:55,124 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 617 transitions. [2024-12-06 01:53:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-06 01:53:55,124 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:55,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:55,292 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:55,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:55,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 463 states and 629 transitions. [2024-12-06 01:53:55,807 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 629 transitions. [2024-12-06 01:53:55,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 01:53:55,808 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:55,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:55,865 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 01:53:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 469 states and 636 transitions. [2024-12-06 01:53:56,134 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 636 transitions. [2024-12-06 01:53:56,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 01:53:56,134 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:56,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:56,205 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 01:53:56,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 473 states and 640 transitions. [2024-12-06 01:53:56,517 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 640 transitions. [2024-12-06 01:53:56,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 01:53:56,517 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:56,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:56,594 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:57,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:57,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 561 states and 740 transitions. [2024-12-06 01:53:57,165 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 740 transitions. [2024-12-06 01:53:57,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-06 01:53:57,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:57,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 01:53:57,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 565 states and 743 transitions. [2024-12-06 01:53:57,433 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 743 transitions. [2024-12-06 01:53:57,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-12-06 01:53:57,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:57,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:57,604 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 47 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 580 states and 763 transitions. [2024-12-06 01:53:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 763 transitions. [2024-12-06 01:53:58,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-12-06 01:53:58,194 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:58,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 47 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:53:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:58,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 583 states and 767 transitions. [2024-12-06 01:53:58,553 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 767 transitions. [2024-12-06 01:53:58,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-06 01:53:58,553 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:58,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:58,650 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 01:53:59,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 621 states and 812 transitions. [2024-12-06 01:53:59,455 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 812 transitions. [2024-12-06 01:53:59,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-12-06 01:53:59,455 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:59,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:59,536 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 01:54:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 632 states and 827 transitions. [2024-12-06 01:54:00,131 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 827 transitions. [2024-12-06 01:54:00,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-12-06 01:54:00,132 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:00,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-06 01:54:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 637 states and 838 transitions. [2024-12-06 01:54:00,502 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 838 transitions. [2024-12-06 01:54:00,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-12-06 01:54:00,502 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:00,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-06 01:54:00,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 640 states and 842 transitions. [2024-12-06 01:54:00,727 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 842 transitions. [2024-12-06 01:54:00,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-12-06 01:54:00,727 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:00,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 56 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 01:54:01,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:01,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 647 states and 854 transitions. [2024-12-06 01:54:01,170 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 854 transitions. [2024-12-06 01:54:01,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-12-06 01:54:01,171 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:01,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 01:54:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 654 states and 864 transitions. [2024-12-06 01:54:01,561 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 864 transitions. [2024-12-06 01:54:01,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-12-06 01:54:01,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:01,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:01,601 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 01:54:01,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 661 states and 871 transitions. [2024-12-06 01:54:01,996 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 871 transitions. [2024-12-06 01:54:01,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-12-06 01:54:01,997 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:01,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:02,043 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 01:54:02,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 684 states and 900 transitions. [2024-12-06 01:54:02,619 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 900 transitions. [2024-12-06 01:54:02,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-12-06 01:54:02,619 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:02,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:02,690 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 01:54:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 720 states and 938 transitions. [2024-12-06 01:54:03,308 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 938 transitions. [2024-12-06 01:54:03,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-12-06 01:54:03,309 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:03,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:03,355 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 01:54:03,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 729 states and 948 transitions. [2024-12-06 01:54:03,683 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 948 transitions. [2024-12-06 01:54:03,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-06 01:54:03,684 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:03,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 01:54:03,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 736 states and 956 transitions. [2024-12-06 01:54:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 956 transitions. [2024-12-06 01:54:03,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-06 01:54:03,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:03,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:03,966 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 01:54:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:04,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 745 states and 965 transitions. [2024-12-06 01:54:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 965 transitions. [2024-12-06 01:54:04,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-06 01:54:04,446 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:04,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:04,526 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 01:54:05,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:05,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 762 states and 987 transitions. [2024-12-06 01:54:05,048 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 987 transitions. [2024-12-06 01:54:05,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-06 01:54:05,049 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:05,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:05,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:05,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 763 states and 988 transitions. [2024-12-06 01:54:05,522 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 988 transitions. [2024-12-06 01:54:05,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-06 01:54:05,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:05,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:05,662 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:06,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 773 states and 999 transitions. [2024-12-06 01:54:06,306 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 999 transitions. [2024-12-06 01:54:06,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-06 01:54:06,306 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:06,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:06,461 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:06,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:06,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 776 states and 1002 transitions. [2024-12-06 01:54:06,660 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1002 transitions. [2024-12-06 01:54:06,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 01:54:06,661 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:06,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 01:54:06,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:06,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 789 states and 1016 transitions. [2024-12-06 01:54:06,920 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1016 transitions. [2024-12-06 01:54:06,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 01:54:06,921 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:06,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 01:54:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:07,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 798 states and 1026 transitions. [2024-12-06 01:54:07,280 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1026 transitions. [2024-12-06 01:54:07,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-12-06 01:54:07,281 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:07,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:07,363 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 01:54:08,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 814 states and 1046 transitions. [2024-12-06 01:54:08,245 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1046 transitions. [2024-12-06 01:54:08,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-12-06 01:54:08,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:08,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:08,314 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 01:54:08,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:08,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 821 states and 1053 transitions. [2024-12-06 01:54:08,748 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1053 transitions. [2024-12-06 01:54:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-12-06 01:54:08,748 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:08,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:08,789 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 01:54:09,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 825 states and 1058 transitions. [2024-12-06 01:54:09,021 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1058 transitions. [2024-12-06 01:54:09,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 01:54:09,022 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:09,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:09,090 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 01:54:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:09,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 832 states and 1065 transitions. [2024-12-06 01:54:09,459 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1065 transitions. [2024-12-06 01:54:09,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 01:54:09,460 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:09,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 01:54:09,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:09,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 837 states and 1069 transitions. [2024-12-06 01:54:09,734 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1069 transitions. [2024-12-06 01:54:09,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-12-06 01:54:09,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:09,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:10,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:10,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 868 states and 1118 transitions. [2024-12-06 01:54:10,210 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1118 transitions. [2024-12-06 01:54:10,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-12-06 01:54:10,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:10,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 69 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:10,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 882 states and 1135 transitions. [2024-12-06 01:54:10,820 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1135 transitions. [2024-12-06 01:54:10,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 01:54:10,821 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:10,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 01:54:11,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:11,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 884 states and 1139 transitions. [2024-12-06 01:54:11,094 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1139 transitions. [2024-12-06 01:54:11,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-12-06 01:54:11,095 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:11,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:11,140 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:11,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 928 states and 1187 transitions. [2024-12-06 01:54:11,895 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1187 transitions. [2024-12-06 01:54:11,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-12-06 01:54:11,896 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:11,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:12,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:12,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 935 states and 1194 transitions. [2024-12-06 01:54:12,412 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1194 transitions. [2024-12-06 01:54:12,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-06 01:54:12,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:12,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:12,468 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:13,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 964 states and 1229 transitions. [2024-12-06 01:54:13,079 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1229 transitions. [2024-12-06 01:54:13,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-06 01:54:13,080 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:13,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:13,134 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:13,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:13,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 966 states and 1230 transitions. [2024-12-06 01:54:13,396 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1230 transitions. [2024-12-06 01:54:13,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 01:54:13,397 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:13,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:13,448 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:15,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:15,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 994 states and 1272 transitions. [2024-12-06 01:54:15,532 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1272 transitions. [2024-12-06 01:54:15,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 01:54:15,532 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:15,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:15,584 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:17,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1014 states and 1303 transitions. [2024-12-06 01:54:17,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1303 transitions. [2024-12-06 01:54:17,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 01:54:17,331 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:17,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:17,384 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:18,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:18,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1026 states and 1316 transitions. [2024-12-06 01:54:18,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1316 transitions. [2024-12-06 01:54:18,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 01:54:18,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:18,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:18,279 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:18,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1035 states and 1330 transitions. [2024-12-06 01:54:18,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1330 transitions. [2024-12-06 01:54:18,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 01:54:18,816 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:18,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:18,868 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:19,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:19,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1044 states and 1339 transitions. [2024-12-06 01:54:19,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1339 transitions. [2024-12-06 01:54:19,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 01:54:19,290 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:19,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:19,342 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1048 states and 1342 transitions. [2024-12-06 01:54:19,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1342 transitions. [2024-12-06 01:54:19,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 01:54:19,748 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:19,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:19,799 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:20,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:20,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1057 states and 1350 transitions. [2024-12-06 01:54:20,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1350 transitions. [2024-12-06 01:54:20,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 01:54:20,430 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:20,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:20,500 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:21,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1061 states and 1355 transitions. [2024-12-06 01:54:21,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1355 transitions. [2024-12-06 01:54:21,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 01:54:21,088 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:21,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:21,140 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:21,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:21,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1071 states and 1363 transitions. [2024-12-06 01:54:21,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1363 transitions. [2024-12-06 01:54:21,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 01:54:21,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:21,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:21,749 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:22,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:22,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1078 states and 1369 transitions. [2024-12-06 01:54:22,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1369 transitions. [2024-12-06 01:54:22,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 01:54:22,192 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:22,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:22,244 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:22,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:22,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1085 states and 1376 transitions. [2024-12-06 01:54:22,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1376 transitions. [2024-12-06 01:54:22,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 01:54:22,856 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:22,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:22,908 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:23,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:23,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1087 states and 1377 transitions. [2024-12-06 01:54:23,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1377 transitions. [2024-12-06 01:54:23,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 01:54:23,232 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:23,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:23,292 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1098 states and 1387 transitions. [2024-12-06 01:54:23,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1387 transitions. [2024-12-06 01:54:23,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-12-06 01:54:23,362 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:23,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:23,534 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:54:23,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:23,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1101 states and 1390 transitions. [2024-12-06 01:54:23,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1390 transitions. [2024-12-06 01:54:23,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-12-06 01:54:23,608 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:23,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:54:23,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1104 states and 1393 transitions. [2024-12-06 01:54:23,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1393 transitions. [2024-12-06 01:54:23,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-12-06 01:54:23,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:23,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:24,031 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 01:54:24,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:24,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1105 states and 1394 transitions. [2024-12-06 01:54:24,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1394 transitions. [2024-12-06 01:54:24,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-12-06 01:54:24,270 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:24,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:24,363 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 01:54:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:25,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1119 states and 1411 transitions. [2024-12-06 01:54:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1411 transitions. [2024-12-06 01:54:25,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-12-06 01:54:25,351 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:25,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:54:25,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:25,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1137 states and 1431 transitions. [2024-12-06 01:54:25,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1431 transitions. [2024-12-06 01:54:25,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-12-06 01:54:25,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:25,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:54:26,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:26,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1138 states and 1431 transitions. [2024-12-06 01:54:26,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1431 transitions. [2024-12-06 01:54:26,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-12-06 01:54:26,155 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:26,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:26,244 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:27,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:27,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1149 states and 1444 transitions. [2024-12-06 01:54:27,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1444 transitions. [2024-12-06 01:54:27,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-12-06 01:54:27,061 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:27,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-12-06 01:54:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1162 states and 1458 transitions. [2024-12-06 01:54:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1458 transitions. [2024-12-06 01:54:27,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-06 01:54:27,297 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:27,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 01:54:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:27,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1163 states and 1459 transitions. [2024-12-06 01:54:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1459 transitions. [2024-12-06 01:54:27,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-12-06 01:54:27,391 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:27,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:27,497 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:54:27,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1183 states and 1483 transitions. [2024-12-06 01:54:27,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1483 transitions. [2024-12-06 01:54:27,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 01:54:27,784 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:27,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:27,872 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-12-06 01:54:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1194 states and 1495 transitions. [2024-12-06 01:54:28,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1495 transitions. [2024-12-06 01:54:28,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-12-06 01:54:28,223 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:28,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-12-06 01:54:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:28,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1195 states and 1496 transitions. [2024-12-06 01:54:28,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1496 transitions. [2024-12-06 01:54:28,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-12-06 01:54:28,316 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:28,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:28,581 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 137 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:30,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:30,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1265 states and 1570 transitions. [2024-12-06 01:54:30,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1570 transitions. [2024-12-06 01:54:30,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-12-06 01:54:30,326 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:30,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:30,492 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 137 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1280 states and 1588 transitions. [2024-12-06 01:54:30,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1588 transitions. [2024-12-06 01:54:30,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-12-06 01:54:30,937 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:30,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:31,153 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 137 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:31,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1291 states and 1598 transitions. [2024-12-06 01:54:31,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1598 transitions. [2024-12-06 01:54:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-12-06 01:54:31,463 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:31,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:31,686 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 137 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:32,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:32,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1303 states and 1612 transitions. [2024-12-06 01:54:32,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1612 transitions. [2024-12-06 01:54:32,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-12-06 01:54:32,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:32,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:32,290 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 137 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:54:32,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:32,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1305 states and 1613 transitions. [2024-12-06 01:54:32,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1613 transitions. [2024-12-06 01:54:32,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 01:54:32,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:32,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:32,512 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-12-06 01:54:32,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:32,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1316 states and 1625 transitions. [2024-12-06 01:54:32,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1625 transitions. [2024-12-06 01:54:32,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 01:54:32,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:32,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:33,213 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 143 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:54:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1385 states and 1725 transitions. [2024-12-06 01:54:36,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1725 transitions. [2024-12-06 01:54:36,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 01:54:36,934 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:36,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 143 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:54:38,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:38,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1421 states and 1766 transitions. [2024-12-06 01:54:38,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1766 transitions. [2024-12-06 01:54:38,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-12-06 01:54:38,940 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:38,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:54:40,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:40,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1435 states and 1785 transitions. [2024-12-06 01:54:40,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1785 transitions. [2024-12-06 01:54:40,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-12-06 01:54:40,439 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:40,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:40,510 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:54:41,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:41,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1437 states and 1785 transitions. [2024-12-06 01:54:41,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1785 transitions. [2024-12-06 01:54:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-12-06 01:54:41,117 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:41,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:41,188 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:54:41,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1438 states and 1787 transitions. [2024-12-06 01:54:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1787 transitions. [2024-12-06 01:54:41,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 01:54:41,543 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:41,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:41,811 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:54:43,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:43,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1456 states and 1808 transitions. [2024-12-06 01:54:43,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1808 transitions. [2024-12-06 01:54:43,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 01:54:43,284 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:43,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:43,386 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:54:44,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:44,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1490 states and 1841 transitions. [2024-12-06 01:54:44,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1841 transitions. [2024-12-06 01:54:44,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-12-06 01:54:44,647 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:44,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:45,149 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:54:46,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:46,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1560 states and 1912 transitions. [2024-12-06 01:54:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1912 transitions. [2024-12-06 01:54:46,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-12-06 01:54:46,774 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:46,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:46,944 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:54:47,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:47,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1561 states and 1912 transitions. [2024-12-06 01:54:47,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1912 transitions. [2024-12-06 01:54:47,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-12-06 01:54:47,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:47,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-12-06 01:54:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1574 states and 1925 transitions. [2024-12-06 01:54:47,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 1925 transitions. [2024-12-06 01:54:47,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-12-06 01:54:47,403 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:47,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:48,151 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 168 proven. 36 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:54:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:49,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1622 states and 1987 transitions. [2024-12-06 01:54:49,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1987 transitions. [2024-12-06 01:54:49,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-12-06 01:54:49,594 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:49,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:49,660 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-06 01:54:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:50,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 1643 states and 2013 transitions. [2024-12-06 01:54:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2013 transitions. [2024-12-06 01:54:50,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-12-06 01:54:50,578 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:50,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:50,643 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-06 01:54:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 1663 states and 2033 transitions. [2024-12-06 01:54:52,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2033 transitions. [2024-12-06 01:54:52,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 01:54:52,027 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:52,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 01:54:59,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:54:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 1727 states and 2132 transitions. [2024-12-06 01:54:59,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2132 transitions. [2024-12-06 01:54:59,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 01:54:59,320 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:54:59,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:54:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:54:59,657 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 01:55:03,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:03,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 1770 states and 2191 transitions. [2024-12-06 01:55:03,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2191 transitions. [2024-12-06 01:55:03,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 01:55:03,640 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:03,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:03,966 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 01:55:04,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 1772 states and 2196 transitions. [2024-12-06 01:55:04,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2196 transitions. [2024-12-06 01:55:04,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 01:55:04,480 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:04,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:04,813 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 01:55:06,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:06,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 1790 states and 2215 transitions. [2024-12-06 01:55:06,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2215 transitions. [2024-12-06 01:55:06,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 01:55:06,771 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:06,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:07,092 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 01:55:07,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 1801 states and 2225 transitions. [2024-12-06 01:55:07,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2225 transitions. [2024-12-06 01:55:07,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 01:55:07,903 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:07,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:08,150 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 01:55:09,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:09,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 1810 states and 2236 transitions. [2024-12-06 01:55:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2236 transitions. [2024-12-06 01:55:09,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 01:55:09,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:09,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:09,585 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 01:55:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 1815 states and 2241 transitions. [2024-12-06 01:55:10,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2241 transitions. [2024-12-06 01:55:10,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 01:55:10,078 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:10,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 01:55:10,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:10,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 1817 states and 2242 transitions. [2024-12-06 01:55:10,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2242 transitions. [2024-12-06 01:55:10,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 01:55:10,730 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:10,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:10,972 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 01:55:11,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:11,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 1819 states and 2244 transitions. [2024-12-06 01:55:11,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 2244 transitions. [2024-12-06 01:55:11,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 01:55:11,482 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:11,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:11,797 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 01:55:12,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:12,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 1824 states and 2248 transitions. [2024-12-06 01:55:12,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2248 transitions. [2024-12-06 01:55:12,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 01:55:12,308 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:12,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 01:55:13,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:13,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 1831 states and 2255 transitions. [2024-12-06 01:55:13,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2255 transitions. [2024-12-06 01:55:13,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 01:55:13,361 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:13,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:13,599 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 01:55:14,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:14,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 1836 states and 2259 transitions. [2024-12-06 01:55:14,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2259 transitions. [2024-12-06 01:55:14,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 01:55:14,158 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:14,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 01:55:14,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:14,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 1838 states and 2261 transitions. [2024-12-06 01:55:14,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2261 transitions. [2024-12-06 01:55:14,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 01:55:14,916 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:14,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:15,161 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 01:55:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:15,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 1843 states and 2265 transitions. [2024-12-06 01:55:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2265 transitions. [2024-12-06 01:55:15,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 01:55:15,622 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:15,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:15,975 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 01:55:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:16,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 1845 states and 2266 transitions. [2024-12-06 01:55:16,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2266 transitions. [2024-12-06 01:55:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 01:55:16,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:16,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:16,827 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 01:55:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 1850 states and 2270 transitions. [2024-12-06 01:55:17,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2270 transitions. [2024-12-06 01:55:17,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 01:55:17,319 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:17,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 01:55:18,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:18,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 1854 states and 2273 transitions. [2024-12-06 01:55:18,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2273 transitions. [2024-12-06 01:55:18,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 01:55:18,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:18,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:18,399 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 01:55:18,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 1858 states and 2276 transitions. [2024-12-06 01:55:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2276 transitions. [2024-12-06 01:55:18,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 01:55:18,866 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:18,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 01:55:19,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:19,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 1862 states and 2280 transitions. [2024-12-06 01:55:19,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2280 transitions. [2024-12-06 01:55:19,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 01:55:19,209 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:19,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:19,623 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 198 proven. 51 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-12-06 01:55:20,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:20,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 1877 states and 2298 transitions. [2024-12-06 01:55:20,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2298 transitions. [2024-12-06 01:55:20,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-12-06 01:55:20,323 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:20,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:20,386 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-12-06 01:55:20,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 1882 states and 2304 transitions. [2024-12-06 01:55:20,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2304 transitions. [2024-12-06 01:55:20,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-12-06 01:55:20,708 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:20,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:20,771 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-12-06 01:55:21,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:21,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 1887 states and 2309 transitions. [2024-12-06 01:55:21,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2309 transitions. [2024-12-06 01:55:21,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-12-06 01:55:21,121 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:21,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:21,200 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:55:22,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:22,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 1926 states and 2352 transitions. [2024-12-06 01:55:22,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2352 transitions. [2024-12-06 01:55:22,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 01:55:22,383 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:22,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:22,519 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 94 proven. 162 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 01:55:22,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:22,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 1927 states and 2352 transitions. [2024-12-06 01:55:22,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2352 transitions. [2024-12-06 01:55:22,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-12-06 01:55:22,593 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:22,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:22,656 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-12-06 01:55:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 1931 states and 2356 transitions. [2024-12-06 01:55:22,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2356 transitions. [2024-12-06 01:55:22,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-12-06 01:55:22,732 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:22,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-12-06 01:55:22,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 1935 states and 2360 transitions. [2024-12-06 01:55:22,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2360 transitions. [2024-12-06 01:55:22,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-12-06 01:55:22,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:22,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:23,543 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 192 proven. 21 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-12-06 01:55:25,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:25,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 1939 states and 2365 transitions. [2024-12-06 01:55:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2365 transitions. [2024-12-06 01:55:25,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-12-06 01:55:25,123 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:25,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 192 proven. 21 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-12-06 01:55:25,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 1942 states and 2367 transitions. [2024-12-06 01:55:25,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2367 transitions. [2024-12-06 01:55:25,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:55:25,897 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:25,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:26,518 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:55:38,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2040 states and 2513 transitions. [2024-12-06 01:55:38,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 2513 transitions. [2024-12-06 01:55:38,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:55:38,867 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:38,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:39,131 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:55:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:41,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2059 states and 2530 transitions. [2024-12-06 01:55:41,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 2530 transitions. [2024-12-06 01:55:41,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:55:41,918 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:41,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:42,186 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:55:45,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:45,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2075 states and 2554 transitions. [2024-12-06 01:55:45,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 2554 transitions. [2024-12-06 01:55:45,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:55:45,036 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:45,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:55:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:46,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2082 states and 2565 transitions. [2024-12-06 01:55:46,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2565 transitions. [2024-12-06 01:55:46,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:55:46,452 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:46,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:46,733 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:55:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2091 states and 2576 transitions. [2024-12-06 01:55:48,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 2576 transitions. [2024-12-06 01:55:48,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:55:48,229 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:48,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:55:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:49,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2098 states and 2583 transitions. [2024-12-06 01:55:49,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2583 transitions. [2024-12-06 01:55:49,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:55:49,099 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:49,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:55:50,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:50,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2105 states and 2589 transitions. [2024-12-06 01:55:50,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 2589 transitions. [2024-12-06 01:55:50,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:55:50,462 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:50,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:55:51,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 2107 states and 2591 transitions. [2024-12-06 01:55:51,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 2591 transitions. [2024-12-06 01:55:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:55:51,374 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:51,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:51,638 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:55:52,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:52,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2112 states and 2595 transitions. [2024-12-06 01:55:52,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2595 transitions. [2024-12-06 01:55:52,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:55:52,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:52,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:55:53,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:53,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2117 states and 2599 transitions. [2024-12-06 01:55:53,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 2599 transitions. [2024-12-06 01:55:53,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:55:53,211 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:53,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:55:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:54,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2132 states and 2620 transitions. [2024-12-06 01:55:54,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2620 transitions. [2024-12-06 01:55:54,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:55:54,263 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:54,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:54,527 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:55:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2137 states and 2626 transitions. [2024-12-06 01:55:55,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 2626 transitions. [2024-12-06 01:55:55,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:55:55,191 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:55,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:55:57,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:57,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2151 states and 2641 transitions. [2024-12-06 01:55:57,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 2641 transitions. [2024-12-06 01:55:57,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:55:57,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:57,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:55:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2156 states and 2645 transitions. [2024-12-06 01:55:58,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2645 transitions. [2024-12-06 01:55:58,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:55:58,779 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:58,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:55:59,040 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:55:59,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:55:59,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2158 states and 2646 transitions. [2024-12-06 01:55:59,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 2646 transitions. [2024-12-06 01:55:59,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:55:59,750 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:55:59,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:55:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:56:00,010 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:56:01,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:56:01,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2167 states and 2658 transitions. [2024-12-06 01:56:01,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 2658 transitions. [2024-12-06 01:56:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:56:01,819 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:56:01,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:56:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:56:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:56:02,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:56:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2169 states and 2660 transitions. [2024-12-06 01:56:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2660 transitions. [2024-12-06 01:56:02,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:56:02,846 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:56:02,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:56:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:56:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:56:03,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:56:03,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2171 states and 2662 transitions. [2024-12-06 01:56:03,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 2662 transitions. [2024-12-06 01:56:03,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:56:03,857 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:56:03,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:56:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:56:04,116 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:56:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:56:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2178 states and 2668 transitions. [2024-12-06 01:56:05,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 2668 transitions. [2024-12-06 01:56:05,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:56:05,453 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:56:05,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:56:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:56:05,715 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:56:06,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:56:06,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2183 states and 2673 transitions. [2024-12-06 01:56:06,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 2673 transitions. [2024-12-06 01:56:06,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:56:06,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:56:06,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:56:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:56:06,722 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:56:07,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:56:07,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2186 states and 2676 transitions. [2024-12-06 01:56:07,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 2676 transitions. [2024-12-06 01:56:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:56:07,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:56:07,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:56:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:56:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:56:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:56:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2188 states and 2677 transitions. [2024-12-06 01:56:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 2677 transitions. [2024-12-06 01:56:08,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:56:08,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:56:08,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:56:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:56:08,506 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:56:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:56:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2192 states and 2681 transitions. [2024-12-06 01:56:09,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 2681 transitions. [2024-12-06 01:56:09,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-12-06 01:56:09,139 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:56:09,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:56:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:56:09,398 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 232 proven. 46 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-12-06 01:56:09,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:56:09,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2193 states and 2681 transitions. [2024-12-06 01:56:09,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 2681 transitions. [2024-12-06 01:56:09,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-12-06 01:56:09,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:56:09,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:56:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:56:09,795 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-12-06 01:56:10,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:56:10,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2223 states and 2711 transitions. [2024-12-06 01:56:10,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 2711 transitions. [2024-12-06 01:56:10,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-12-06 01:56:10,315 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:56:10,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:56:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:56:10,756 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 242 proven. 62 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-12-06 01:56:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:56:13,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2238 states and 2735 transitions. [2024-12-06 01:56:13,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 2735 transitions. [2024-12-06 01:56:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-12-06 01:56:13,922 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:56:13,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:56:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:56:14,092 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-12-06 01:56:15,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:56:15,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2252 states and 2753 transitions. [2024-12-06 01:56:15,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 2753 transitions. [2024-12-06 01:56:15,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-12-06 01:56:15,742 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:56:15,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:56:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 01:56:15,773 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 01:56:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 01:56:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 01:56:16,015 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 01:56:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 01:56:16,144 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 167 iterations. [2024-12-06 01:56:16,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 01:56:16 ImpRootNode [2024-12-06 01:56:16,260 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 01:56:16,261 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 01:56:16,261 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 01:56:16,261 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 01:56:16,261 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:53:42" (3/4) ... [2024-12-06 01:56:16,262 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-06 01:56:16,413 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 267. [2024-12-06 01:56:16,545 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94fd81ec-59ab-4823-8b1d-226bdce8f078/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 01:56:16,546 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94fd81ec-59ab-4823-8b1d-226bdce8f078/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 01:56:16,546 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 01:56:16,547 INFO L158 Benchmark]: Toolchain (without parser) took 155187.28ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 115.8MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-12-06 01:56:16,547 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 142.6MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 01:56:16,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.47ms. Allocated memory is still 142.6MB. Free memory was 115.6MB in the beginning and 88.8MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 01:56:16,548 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.97ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 83.5MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 01:56:16,548 INFO L158 Benchmark]: Boogie Preprocessor took 51.20ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 79.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 01:56:16,549 INFO L158 Benchmark]: RCFGBuilder took 1128.90ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 64.7MB in the end (delta: 14.6MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2024-12-06 01:56:16,549 INFO L158 Benchmark]: CodeCheck took 153268.70ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 64.7MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-12-06 01:56:16,549 INFO L158 Benchmark]: Witness Printer took 285.84ms. Allocated memory is still 2.8GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 46.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-12-06 01:56:16,551 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: 153.1s, OverallIterations: 167, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 424332 SdHoareTripleChecker+Valid, 887.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 422688 mSDsluCounter, 78139 SdHoareTripleChecker+Invalid, 756.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67491 mSDsCounter, 115183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 916530 IncrementalHoareTripleChecker+Invalid, 1031713 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115183 mSolverCounterUnsat, 10648 mSDtfsCounter, 916530 mSolverCounterSat, 7.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 201774 GetRequests, 195721 SyntacticMatches, 4743 SemanticMatches, 1310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099549 ImplicationChecksByTransitivity, 110.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.8s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 23.3s InterpolantComputationTime, 30283 NumberOfCodeBlocks, 30283 NumberOfCodeBlocksAsserted, 167 NumberOfCheckSat, 29852 ConstructedInterpolants, 0 QuantifiedInterpolants, 114469 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 166 InterpolantComputations, 94 PerfectInterpolantSequences, 27676/30445 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, ConComCheckerStatistics: No data available - CounterExampleResult [Line: 411]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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) [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) [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) [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) [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND TRUE ((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5)) [L388] a21 = 1 [L389] a16 = 6 [L390] a7 = 0 [L391] return -1; VAL [\result=-1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L410] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1)) VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L411] reach_error() VAL [a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 142.6MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.47ms. Allocated memory is still 142.6MB. Free memory was 115.6MB in the beginning and 88.8MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.97ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 83.5MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.20ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 79.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1128.90ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 64.7MB in the end (delta: 14.6MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. * CodeCheck took 153268.70ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 64.7MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 285.84ms. Allocated memory is still 2.8GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 46.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-12-06 01:56:16,574 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94fd81ec-59ab-4823-8b1d-226bdce8f078/bin/ukojak-verify-CZk0znPC7b/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