./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label57.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_739f2ca0-36bc-4530-955b-1bbb7d49df67/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_739f2ca0-36bc-4530-955b-1bbb7d49df67/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_739f2ca0-36bc-4530-955b-1bbb7d49df67/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_739f2ca0-36bc-4530-955b-1bbb7d49df67/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label57.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_739f2ca0-36bc-4530-955b-1bbb7d49df67/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_739f2ca0-36bc-4530-955b-1bbb7d49df67/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 0128e00bf508dfedd424bfda3d692f75ea10f378731858e87047f02277f2ca04 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-05 21:26:49,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-05 21:26:49,084 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_739f2ca0-36bc-4530-955b-1bbb7d49df67/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-05 21:26:49,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-05 21:26:49,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-05 21:26:49,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-05 21:26:49,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-05 21:26:49,108 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-05 21:26:49,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-05 21:26:49,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-05 21:26:49,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-05 21:26:49,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-05 21:26:49,109 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-05 21:26:49,109 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-05 21:26:49,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-05 21:26:49,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-05 21:26:49,109 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-05 21:26:49,109 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-05 21:26:49,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-05 21:26:49,110 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-05 21:26:49,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-05 21:26:49,110 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-05 21:26:49,110 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-05 21:26:49,110 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-05 21:26:49,110 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-05 21:26:49,110 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-05 21:26:49,110 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-05 21:26:49,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 21:26:49,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-05 21:26:49,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-05 21:26:49,111 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-05 21:26:49,111 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-05 21:26:49,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-05 21:26:49,111 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_739f2ca0-36bc-4530-955b-1bbb7d49df67/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 -> 0128e00bf508dfedd424bfda3d692f75ea10f378731858e87047f02277f2ca04 [2024-12-05 21:26:49,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-05 21:26:49,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-05 21:26:49,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-05 21:26:49,346 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-05 21:26:49,346 INFO L274 PluginConnector]: CDTParser initialized [2024-12-05 21:26:49,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_739f2ca0-36bc-4530-955b-1bbb7d49df67/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem01_label57.c [2024-12-05 21:26:52,019 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_739f2ca0-36bc-4530-955b-1bbb7d49df67/bin/ukojak-verify-CZk0znPC7b/data/ad42ea1e7/922b30b51d6e4fcab44b20c4c868fc73/FLAGb84402b28 [2024-12-05 21:26:52,282 INFO L384 CDTParser]: Found 1 translation units. [2024-12-05 21:26:52,283 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_739f2ca0-36bc-4530-955b-1bbb7d49df67/sv-benchmarks/c/eca-rers2012/Problem01_label57.c [2024-12-05 21:26:52,295 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_739f2ca0-36bc-4530-955b-1bbb7d49df67/bin/ukojak-verify-CZk0znPC7b/data/ad42ea1e7/922b30b51d6e4fcab44b20c4c868fc73/FLAGb84402b28 [2024-12-05 21:26:52,311 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_739f2ca0-36bc-4530-955b-1bbb7d49df67/bin/ukojak-verify-CZk0znPC7b/data/ad42ea1e7/922b30b51d6e4fcab44b20c4c868fc73 [2024-12-05 21:26:52,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-05 21:26:52,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-05 21:26:52,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-05 21:26:52,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-05 21:26:52,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-05 21:26:52,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11ff16cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52, skipping insertion in model container [2024-12-05 21:26:52,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,353 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-05 21:26:52,590 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_739f2ca0-36bc-4530-955b-1bbb7d49df67/sv-benchmarks/c/eca-rers2012/Problem01_label57.c[15253,15266] [2024-12-05 21:26:52,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 21:26:52,635 INFO L200 MainTranslator]: Completed pre-run [2024-12-05 21:26:52,694 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_739f2ca0-36bc-4530-955b-1bbb7d49df67/sv-benchmarks/c/eca-rers2012/Problem01_label57.c[15253,15266] [2024-12-05 21:26:52,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 21:26:52,729 INFO L204 MainTranslator]: Completed translation [2024-12-05 21:26:52,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52 WrapperNode [2024-12-05 21:26:52,729 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-05 21:26:52,730 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-05 21:26:52,730 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-05 21:26:52,730 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-05 21:26:52,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,791 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-12-05 21:26:52,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-05 21:26:52,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-05 21:26:52,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-05 21:26:52,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-05 21:26:52,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,803 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,803 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,822 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,824 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-05 21:26:52,847 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-05 21:26:52,847 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-05 21:26:52,847 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-05 21:26:52,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 21:26:52,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_739f2ca0-36bc-4530-955b-1bbb7d49df67/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-05 21:26:52,878 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_739f2ca0-36bc-4530-955b-1bbb7d49df67/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-05 21:26:52,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_739f2ca0-36bc-4530-955b-1bbb7d49df67/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-05 21:26:52,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-05 21:26:52,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-05 21:26:52,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-05 21:26:52,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-05 21:26:52,968 INFO L234 CfgBuilder]: Building ICFG [2024-12-05 21:26:52,970 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-05 21:26:53,785 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-05 21:26:53,785 INFO L283 CfgBuilder]: Performing block encoding [2024-12-05 21:26:54,023 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-05 21:26:54,023 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-05 21:26:54,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:26:54 BoogieIcfgContainer [2024-12-05 21:26:54,023 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-05 21:26:54,024 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-05 21:26:54,024 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-05 21:26:54,034 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-05 21:26:54,034 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:26:54" (1/1) ... [2024-12-05 21:26:54,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 21:26:54,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-12-05 21:26:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-12-05 21:26:54,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-05 21:26:54,096 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:54,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:54,469 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-05 21:26:54,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:54,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2024-12-05 21:26:54,999 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2024-12-05 21:26:55,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-05 21:26:55,001 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:55,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 21:26:55,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2024-12-05 21:26:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2024-12-05 21:26:55,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-12-05 21:26:55,432 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:55,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:55,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:26:55,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:55,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 150 states and 244 transitions. [2024-12-05 21:26:55,650 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 244 transitions. [2024-12-05 21:26:55,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-12-05 21:26:55,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:55,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:55,760 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 21:26:55,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:55,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2024-12-05 21:26:55,932 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2024-12-05 21:26:55,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-12-05 21:26:55,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:55,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:56,086 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:26:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 159 states and 258 transitions. [2024-12-05 21:26:56,284 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 258 transitions. [2024-12-05 21:26:56,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-05 21:26:56,285 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:56,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:56,396 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:26:56,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 160 states and 259 transitions. [2024-12-05 21:26:56,517 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 259 transitions. [2024-12-05 21:26:56,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-05 21:26:56,519 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:56,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:26:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 168 states and 268 transitions. [2024-12-05 21:26:56,739 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 268 transitions. [2024-12-05 21:26:56,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-05 21:26:56,740 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:56,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:56,887 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-05 21:26:57,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:57,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 182 states and 286 transitions. [2024-12-05 21:26:57,166 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 286 transitions. [2024-12-05 21:26:57,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-12-05 21:26:57,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:57,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:57,256 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:26:57,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 197 states and 306 transitions. [2024-12-05 21:26:57,680 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 306 transitions. [2024-12-05 21:26:57,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-05 21:26:57,680 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:57,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:57,825 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-05 21:26:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 212 states and 327 transitions. [2024-12-05 21:26:58,391 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 327 transitions. [2024-12-05 21:26:58,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-05 21:26:58,392 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:58,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:58,491 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-05 21:26:59,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:59,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 230 states and 356 transitions. [2024-12-05 21:26:59,167 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2024-12-05 21:26:59,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-12-05 21:26:59,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:59,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:59,259 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:26:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:59,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 232 states and 359 transitions. [2024-12-05 21:26:59,432 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2024-12-05 21:26:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-12-05 21:26:59,432 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:59,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:59,495 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:26:59,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:59,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 237 states and 365 transitions. [2024-12-05 21:26:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 365 transitions. [2024-12-05 21:26:59,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-05 21:26:59,597 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:59,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:59,669 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 21:26:59,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:59,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 238 states and 366 transitions. [2024-12-05 21:26:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 366 transitions. [2024-12-05 21:26:59,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-05 21:26:59,810 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:59,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:59,873 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-05 21:27:00,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:00,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 257 states and 395 transitions. [2024-12-05 21:27:00,584 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 395 transitions. [2024-12-05 21:27:00,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-05 21:27:00,584 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:00,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:00,620 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-05 21:27:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 258 states and 396 transitions. [2024-12-05 21:27:00,758 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 396 transitions. [2024-12-05 21:27:00,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-05 21:27:00,759 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:00,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 273 states and 415 transitions. [2024-12-05 21:27:01,224 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 415 transitions. [2024-12-05 21:27:01,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-12-05 21:27:01,226 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:01,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:01,304 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 21:27:01,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:01,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 291 states and 435 transitions. [2024-12-05 21:27:01,863 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 435 transitions. [2024-12-05 21:27:01,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-12-05 21:27:01,864 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:01,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 295 states and 439 transitions. [2024-12-05 21:27:01,948 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 439 transitions. [2024-12-05 21:27:01,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-12-05 21:27:01,949 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:01,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:02,019 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-05 21:27:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 299 states and 444 transitions. [2024-12-05 21:27:02,313 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 444 transitions. [2024-12-05 21:27:02,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-05 21:27:02,314 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:02,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 21:27:02,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:02,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 307 states and 459 transitions. [2024-12-05 21:27:02,710 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 459 transitions. [2024-12-05 21:27:02,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-05 21:27:02,711 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:02,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:02,761 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 21:27:03,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:03,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 313 states and 467 transitions. [2024-12-05 21:27:03,117 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 467 transitions. [2024-12-05 21:27:03,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-05 21:27:03,119 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:03,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:03,171 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 21:27:03,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 316 states and 471 transitions. [2024-12-05 21:27:03,341 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 471 transitions. [2024-12-05 21:27:03,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-05 21:27:03,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:03,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:03,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:03,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 331 states and 491 transitions. [2024-12-05 21:27:03,767 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 491 transitions. [2024-12-05 21:27:03,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-12-05 21:27:03,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:03,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:03,871 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:04,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 345 states and 508 transitions. [2024-12-05 21:27:04,083 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 508 transitions. [2024-12-05 21:27:04,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-05 21:27:04,083 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:04,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:04,183 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-05 21:27:04,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 347 states and 510 transitions. [2024-12-05 21:27:04,387 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 510 transitions. [2024-12-05 21:27:04,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-05 21:27:04,388 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:04,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 21:27:04,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:04,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 353 states and 516 transitions. [2024-12-05 21:27:04,660 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 516 transitions. [2024-12-05 21:27:04,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-05 21:27:04,661 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:04,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:04,713 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 21:27:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 357 states and 519 transitions. [2024-12-05 21:27:04,747 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 519 transitions. [2024-12-05 21:27:04,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-05 21:27:04,748 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:04,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:04,851 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-05 21:27:04,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:04,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 359 states and 522 transitions. [2024-12-05 21:27:04,893 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 522 transitions. [2024-12-05 21:27:04,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-05 21:27:04,894 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:04,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:05,007 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:05,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 373 states and 540 transitions. [2024-12-05 21:27:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 540 transitions. [2024-12-05 21:27:05,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-05 21:27:05,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:05,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 377 states and 545 transitions. [2024-12-05 21:27:05,724 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 545 transitions. [2024-12-05 21:27:05,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-05 21:27:05,724 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:05,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:05,780 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-05 21:27:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 379 states and 548 transitions. [2024-12-05 21:27:05,933 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 548 transitions. [2024-12-05 21:27:05,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-05 21:27:05,934 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:05,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:06,128 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-05 21:27:06,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:06,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 386 states and 555 transitions. [2024-12-05 21:27:06,432 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 555 transitions. [2024-12-05 21:27:06,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-05 21:27:06,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:06,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:06,502 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 21:27:06,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:06,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 395 states and 564 transitions. [2024-12-05 21:27:06,836 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 564 transitions. [2024-12-05 21:27:06,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-05 21:27:06,837 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:06,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:06,911 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 21:27:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:07,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 399 states and 567 transitions. [2024-12-05 21:27:07,125 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 567 transitions. [2024-12-05 21:27:07,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-05 21:27:07,126 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:07,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:07,193 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 21:27:07,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 402 states and 569 transitions. [2024-12-05 21:27:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 569 transitions. [2024-12-05 21:27:07,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-05 21:27:07,376 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:07,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:07,449 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:07,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:07,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 472 states and 647 transitions. [2024-12-05 21:27:07,959 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 647 transitions. [2024-12-05 21:27:07,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-05 21:27:07,960 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:07,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:08,003 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 486 states and 664 transitions. [2024-12-05 21:27:08,079 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 664 transitions. [2024-12-05 21:27:08,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-05 21:27:08,079 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:08,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:08,115 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:08,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 497 states and 678 transitions. [2024-12-05 21:27:08,244 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 678 transitions. [2024-12-05 21:27:08,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-05 21:27:08,244 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:08,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:08,310 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:08,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 504 states and 686 transitions. [2024-12-05 21:27:08,363 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 686 transitions. [2024-12-05 21:27:08,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-05 21:27:08,364 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:08,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:08,400 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 21:27:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:08,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 506 states and 688 transitions. [2024-12-05 21:27:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 688 transitions. [2024-12-05 21:27:08,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-05 21:27:08,429 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:08,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:08,465 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 21:27:08,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:08,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 513 states and 695 transitions. [2024-12-05 21:27:08,568 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 695 transitions. [2024-12-05 21:27:08,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-05 21:27:08,569 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:08,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:09,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:09,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 551 states and 739 transitions. [2024-12-05 21:27:09,255 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 739 transitions. [2024-12-05 21:27:09,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-05 21:27:09,255 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:09,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:09,299 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:09,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:09,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 554 states and 741 transitions. [2024-12-05 21:27:09,488 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 741 transitions. [2024-12-05 21:27:09,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-05 21:27:09,489 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:09,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:09,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 557 states and 743 transitions. [2024-12-05 21:27:09,745 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 743 transitions. [2024-12-05 21:27:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-05 21:27:09,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:09,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:09,792 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 571 states and 758 transitions. [2024-12-05 21:27:09,872 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 758 transitions. [2024-12-05 21:27:09,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-12-05 21:27:09,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:09,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 21:27:09,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:09,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 580 states and 766 transitions. [2024-12-05 21:27:09,998 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 766 transitions. [2024-12-05 21:27:09,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-05 21:27:09,999 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:09,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:10,068 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:10,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:10,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 588 states and 775 transitions. [2024-12-05 21:27:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 775 transitions. [2024-12-05 21:27:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-05 21:27:10,250 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:10,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:10,304 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-12-05 21:27:10,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:10,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 672 states and 862 transitions. [2024-12-05 21:27:10,926 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 862 transitions. [2024-12-05 21:27:10,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-05 21:27:10,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:10,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:11,103 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:11,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 703 states and 897 transitions. [2024-12-05 21:27:11,603 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 897 transitions. [2024-12-05 21:27:11,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-12-05 21:27:11,603 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:11,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:11,664 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 21:27:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:11,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 708 states and 901 transitions. [2024-12-05 21:27:11,799 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 901 transitions. [2024-12-05 21:27:11,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-12-05 21:27:11,799 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:11,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:11,907 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 66 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-05 21:27:12,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:12,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 711 states and 904 transitions. [2024-12-05 21:27:12,025 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 904 transitions. [2024-12-05 21:27:12,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-12-05 21:27:12,025 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:12,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-05 21:27:12,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:12,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 725 states and 921 transitions. [2024-12-05 21:27:12,375 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 921 transitions. [2024-12-05 21:27:12,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-05 21:27:12,375 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:12,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 752 states and 949 transitions. [2024-12-05 21:27:12,597 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 949 transitions. [2024-12-05 21:27:12,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-05 21:27:12,597 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:12,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 769 states and 967 transitions. [2024-12-05 21:27:12,888 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 967 transitions. [2024-12-05 21:27:12,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-05 21:27:12,889 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:12,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:12,960 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:13,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:13,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 792 states and 991 transitions. [2024-12-05 21:27:13,280 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 991 transitions. [2024-12-05 21:27:13,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-05 21:27:13,281 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:13,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:13,346 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-05 21:27:13,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 793 states and 991 transitions. [2024-12-05 21:27:13,378 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 991 transitions. [2024-12-05 21:27:13,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-05 21:27:13,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:13,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:13,731 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:15,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 865 states and 1084 transitions. [2024-12-05 21:27:15,911 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1084 transitions. [2024-12-05 21:27:15,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-05 21:27:15,911 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:15,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:16,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 869 states and 1089 transitions. [2024-12-05 21:27:16,534 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1089 transitions. [2024-12-05 21:27:16,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-05 21:27:16,535 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:16,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:16,590 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:17,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:17,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 896 states and 1120 transitions. [2024-12-05 21:27:17,119 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1120 transitions. [2024-12-05 21:27:17,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-05 21:27:17,119 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:17,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:17,337 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 961 states and 1192 transitions. [2024-12-05 21:27:19,016 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1192 transitions. [2024-12-05 21:27:19,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-05 21:27:19,017 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:19,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:19,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 976 states and 1207 transitions. [2024-12-05 21:27:19,242 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1207 transitions. [2024-12-05 21:27:19,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-05 21:27:19,242 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:19,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:19,302 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-05 21:27:19,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:19,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 989 states and 1220 transitions. [2024-12-05 21:27:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1220 transitions. [2024-12-05 21:27:19,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-05 21:27:19,383 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:19,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-05 21:27:19,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 990 states and 1221 transitions. [2024-12-05 21:27:19,477 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1221 transitions. [2024-12-05 21:27:19,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-05 21:27:19,478 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:19,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-05 21:27:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1003 states and 1235 transitions. [2024-12-05 21:27:19,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1235 transitions. [2024-12-05 21:27:19,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-05 21:27:19,587 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:19,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:19,884 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:22,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:22,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1086 states and 1333 transitions. [2024-12-05 21:27:22,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1333 transitions. [2024-12-05 21:27:22,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-12-05 21:27:22,325 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:22,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:22,494 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:23,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1105 states and 1353 transitions. [2024-12-05 21:27:23,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1353 transitions. [2024-12-05 21:27:23,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-12-05 21:27:23,001 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:23,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:23,121 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-05 21:27:24,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:24,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1140 states and 1396 transitions. [2024-12-05 21:27:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1396 transitions. [2024-12-05 21:27:24,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-12-05 21:27:24,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:24,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:24,578 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-05 21:27:25,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:25,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1149 states and 1407 transitions. [2024-12-05 21:27:25,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1407 transitions. [2024-12-05 21:27:25,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-12-05 21:27:25,078 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:25,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:25,418 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-05 21:27:26,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:26,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1158 states and 1417 transitions. [2024-12-05 21:27:26,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1417 transitions. [2024-12-05 21:27:26,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-12-05 21:27:26,188 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:26,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:26,324 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-05 21:27:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:26,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1220 states and 1478 transitions. [2024-12-05 21:27:26,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1478 transitions. [2024-12-05 21:27:26,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-12-05 21:27:26,863 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:26,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:26,972 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-05 21:27:27,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:27,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1221 states and 1479 transitions. [2024-12-05 21:27:27,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1479 transitions. [2024-12-05 21:27:27,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-12-05 21:27:27,186 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:27,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:27,249 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-12-05 21:27:27,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:27,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1239 states and 1499 transitions. [2024-12-05 21:27:27,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1499 transitions. [2024-12-05 21:27:27,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-12-05 21:27:27,740 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:27,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-05 21:27:29,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:29,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1298 states and 1565 transitions. [2024-12-05 21:27:29,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1565 transitions. [2024-12-05 21:27:29,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-12-05 21:27:29,441 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:29,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-05 21:27:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1300 states and 1567 transitions. [2024-12-05 21:27:29,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1567 transitions. [2024-12-05 21:27:29,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-12-05 21:27:29,834 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:29,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:30,290 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:34,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:34,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1379 states and 1673 transitions. [2024-12-05 21:27:34,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 1673 transitions. [2024-12-05 21:27:34,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-12-05 21:27:34,874 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:34,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:36,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:36,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1399 states and 1696 transitions. [2024-12-05 21:27:36,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1696 transitions. [2024-12-05 21:27:36,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-12-05 21:27:36,393 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:36,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-05 21:27:37,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:37,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1423 states and 1722 transitions. [2024-12-05 21:27:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1722 transitions. [2024-12-05 21:27:37,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-12-05 21:27:37,189 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:37,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:37,276 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-05 21:27:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:37,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1424 states and 1722 transitions. [2024-12-05 21:27:37,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1722 transitions. [2024-12-05 21:27:37,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-12-05 21:27:37,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:37,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:37,579 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-05 21:27:37,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:37,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1428 states and 1725 transitions. [2024-12-05 21:27:37,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1725 transitions. [2024-12-05 21:27:37,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-05 21:27:37,903 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:37,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-12-05 21:27:38,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:38,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1498 states and 1803 transitions. [2024-12-05 21:27:38,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1803 transitions. [2024-12-05 21:27:38,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-05 21:27:38,785 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:38,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:39,240 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1503 states and 1815 transitions. [2024-12-05 21:27:40,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1815 transitions. [2024-12-05 21:27:40,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-05 21:27:40,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:40,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:40,301 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:40,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:40,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1504 states and 1815 transitions. [2024-12-05 21:27:40,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1815 transitions. [2024-12-05 21:27:40,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-05 21:27:40,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:40,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:41,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:41,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1505 states and 1815 transitions. [2024-12-05 21:27:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1815 transitions. [2024-12-05 21:27:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-05 21:27:41,247 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:41,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:41,726 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:42,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:42,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1574 states and 1899 transitions. [2024-12-05 21:27:42,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 1899 transitions. [2024-12-05 21:27:42,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-12-05 21:27:42,812 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:42,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:43,015 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-05 21:27:43,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1593 states and 1922 transitions. [2024-12-05 21:27:43,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 1922 transitions. [2024-12-05 21:27:43,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-05 21:27:43,846 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:43,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 1776 states and 2131 transitions. [2024-12-05 21:27:48,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2131 transitions. [2024-12-05 21:27:48,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-05 21:27:48,595 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:48,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:48,902 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-05 21:27:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:49,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 1791 states and 2150 transitions. [2024-12-05 21:27:49,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2150 transitions. [2024-12-05 21:27:49,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-05 21:27:49,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:49,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:49,583 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 21:27:50,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:50,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 1811 states and 2188 transitions. [2024-12-05 21:27:50,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2188 transitions. [2024-12-05 21:27:50,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-05 21:27:50,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:50,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:51,271 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:53,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:53,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 1873 states and 2271 transitions. [2024-12-05 21:27:53,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2271 transitions. [2024-12-05 21:27:53,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-05 21:27:53,552 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:53,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 21:27:54,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:54,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 1881 states and 2281 transitions. [2024-12-05 21:27:54,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2281 transitions. [2024-12-05 21:27:54,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-05 21:27:54,707 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:54,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:55,007 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:55,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 1894 states and 2298 transitions. [2024-12-05 21:27:55,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2298 transitions. [2024-12-05 21:27:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-05 21:27:55,700 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:55,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:56,108 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 1895 states and 2298 transitions. [2024-12-05 21:27:56,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2298 transitions. [2024-12-05 21:27:56,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-05 21:27:56,538 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:56,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:56,667 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 21:27:56,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:56,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 1898 states and 2303 transitions. [2024-12-05 21:27:56,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2303 transitions. [2024-12-05 21:27:56,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-05 21:27:56,994 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:56,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 21:27:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:58,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 1923 states and 2327 transitions. [2024-12-05 21:27:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2327 transitions. [2024-12-05 21:27:58,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-12-05 21:27:58,242 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:58,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:58,612 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 135 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:28:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 1984 states and 2404 transitions. [2024-12-05 21:28:01,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 2404 transitions. [2024-12-05 21:28:01,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-05 21:28:01,899 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:01,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:01,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:02,360 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 205 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-05 21:28:04,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:04,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2067 states and 2502 transitions. [2024-12-05 21:28:04,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 2502 transitions. [2024-12-05 21:28:04,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-05 21:28:04,719 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:04,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 205 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-05 21:28:05,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:05,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2071 states and 2505 transitions. [2024-12-05 21:28:05,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 2505 transitions. [2024-12-05 21:28:05,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-05 21:28:05,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:05,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:05,663 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-05 21:28:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:06,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2525 states to 2091 states and 2525 transitions. [2024-12-05 21:28:06,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 2525 transitions. [2024-12-05 21:28:06,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-05 21:28:06,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:06,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:06,820 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 137 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-12-05 21:28:07,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:07,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2547 states to 2111 states and 2547 transitions. [2024-12-05 21:28:07,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 2547 transitions. [2024-12-05 21:28:07,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-12-05 21:28:07,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:07,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:07,082 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-12-05 21:28:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2116 states and 2555 transitions. [2024-12-05 21:28:07,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2555 transitions. [2024-12-05 21:28:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-05 21:28:07,417 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:07,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:07,695 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-05 21:28:08,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:08,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2136 states and 2578 transitions. [2024-12-05 21:28:08,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 2578 transitions. [2024-12-05 21:28:08,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-05 21:28:08,663 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:08,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:08,889 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-05 21:28:11,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2193 states and 2644 transitions. [2024-12-05 21:28:11,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 2644 transitions. [2024-12-05 21:28:11,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-05 21:28:11,928 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:11,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:28:12,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:12,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2206 states and 2656 transitions. [2024-12-05 21:28:12,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 2656 transitions. [2024-12-05 21:28:12,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-05 21:28:12,622 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:12,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:12,693 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-12-05 21:28:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2276 states and 2728 transitions. [2024-12-05 21:28:13,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 2728 transitions. [2024-12-05 21:28:13,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-12-05 21:28:13,268 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:13,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 158 proven. 88 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-05 21:28:14,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:14,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2748 states to 2288 states and 2748 transitions. [2024-12-05 21:28:14,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 2748 transitions. [2024-12-05 21:28:14,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-12-05 21:28:14,169 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:14,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 175 proven. 42 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-05 21:28:15,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:15,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2752 states to 2291 states and 2752 transitions. [2024-12-05 21:28:15,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 2752 transitions. [2024-12-05 21:28:15,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-12-05 21:28:15,046 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:15,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-05 21:28:15,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2767 states to 2303 states and 2767 transitions. [2024-12-05 21:28:15,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 2767 transitions. [2024-12-05 21:28:15,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-12-05 21:28:15,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:15,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:16,373 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-12-05 21:28:17,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:17,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2793 states to 2318 states and 2793 transitions. [2024-12-05 21:28:17,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2793 transitions. [2024-12-05 21:28:17,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-12-05 21:28:17,493 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:17,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:17,698 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-12-05 21:28:18,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:18,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2340 states and 2819 transitions. [2024-12-05 21:28:18,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 2819 transitions. [2024-12-05 21:28:18,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-12-05 21:28:18,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:18,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-12-05 21:28:20,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2863 states to 2377 states and 2863 transitions. [2024-12-05 21:28:20,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 2863 transitions. [2024-12-05 21:28:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-12-05 21:28:20,797 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:20,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-05 21:28:21,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:21,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2396 states and 2883 transitions. [2024-12-05 21:28:21,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 2883 transitions. [2024-12-05 21:28:21,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-12-05 21:28:21,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:21,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 174 proven. 116 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-05 21:28:22,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:22,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2407 states and 2895 transitions. [2024-12-05 21:28:22,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 2895 transitions. [2024-12-05 21:28:22,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-12-05 21:28:22,807 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:22,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 182 proven. 112 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-05 21:28:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:24,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2431 states and 2926 transitions. [2024-12-05 21:28:24,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 2926 transitions. [2024-12-05 21:28:24,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-12-05 21:28:24,695 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:24,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:25,180 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 178 proven. 30 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-05 21:28:26,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:26,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2433 states and 2929 transitions. [2024-12-05 21:28:26,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 2929 transitions. [2024-12-05 21:28:26,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-12-05 21:28:26,268 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:26,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 186 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-12-05 21:28:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:27,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2437 states and 2934 transitions. [2024-12-05 21:28:27,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 2934 transitions. [2024-12-05 21:28:27,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-05 21:28:27,091 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:27,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:27,153 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-05 21:28:27,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:27,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2438 states and 2938 transitions. [2024-12-05 21:28:27,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2438 states and 2938 transitions. [2024-12-05 21:28:27,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-05 21:28:27,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:27,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:27,727 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-05 21:28:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:28,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2445 states and 2944 transitions. [2024-12-05 21:28:28,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 2944 transitions. [2024-12-05 21:28:28,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-05 21:28:28,179 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:28,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-05 21:28:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2446 states and 2945 transitions. [2024-12-05 21:28:28,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 2945 transitions. [2024-12-05 21:28:28,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-05 21:28:28,821 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:28,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:29,506 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 192 proven. 59 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-05 21:28:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:32,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2477 states and 2986 transitions. [2024-12-05 21:28:32,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 2986 transitions. [2024-12-05 21:28:32,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-05 21:28:32,208 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:32,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:32,736 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 200 proven. 63 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-12-05 21:28:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:35,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 2500 states and 3017 transitions. [2024-12-05 21:28:35,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3017 transitions. [2024-12-05 21:28:35,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-12-05 21:28:35,506 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:35,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:35,902 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 198 proven. 61 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-05 21:28:38,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:38,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3045 states to 2521 states and 3045 transitions. [2024-12-05 21:28:38,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 3045 transitions. [2024-12-05 21:28:38,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-12-05 21:28:38,071 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:38,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:38,318 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 198 proven. 61 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-05 21:28:39,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:39,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3052 states to 2529 states and 3052 transitions. [2024-12-05 21:28:39,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2529 states and 3052 transitions. [2024-12-05 21:28:39,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-05 21:28:39,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:39,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:39,370 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 169 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-05 21:28:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 2549 states and 3082 transitions. [2024-12-05 21:28:42,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 3082 transitions. [2024-12-05 21:28:42,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-05 21:28:42,305 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:42,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-05 21:28:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:44,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 2559 states and 3094 transitions. [2024-12-05 21:28:44,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 3094 transitions. [2024-12-05 21:28:44,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-12-05 21:28:44,471 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:44,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 171 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 21:28:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:48,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 2625 states and 3175 transitions. [2024-12-05 21:28:48,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 3175 transitions. [2024-12-05 21:28:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-05 21:28:48,899 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:48,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:49,169 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 172 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-05 21:28:50,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3192 states to 2641 states and 3192 transitions. [2024-12-05 21:28:50,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2641 states and 3192 transitions. [2024-12-05 21:28:50,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-05 21:28:50,161 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:50,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:50,435 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-12-05 21:28:51,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:51,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3218 states to 2665 states and 3218 transitions. [2024-12-05 21:28:51,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 3218 transitions. [2024-12-05 21:28:51,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-05 21:28:51,638 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:51,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 230 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:28:53,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:53,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 2735 states and 3289 transitions. [2024-12-05 21:28:53,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 3289 transitions. [2024-12-05 21:28:53,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-05 21:28:53,877 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:53,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 21:28:56,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:56,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 2760 states and 3317 transitions. [2024-12-05 21:28:56,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 3317 transitions. [2024-12-05 21:28:56,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-05 21:28:56,360 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:56,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:56,610 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 21:28:57,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 2764 states and 3321 transitions. [2024-12-05 21:28:57,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3321 transitions. [2024-12-05 21:28:57,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-05 21:28:57,858 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:57,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:29:00,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3345 states to 2786 states and 3345 transitions. [2024-12-05 21:29:00,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 3345 transitions. [2024-12-05 21:29:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-05 21:29:00,431 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:00,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:29:03,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 2835 states and 3394 transitions. [2024-12-05 21:29:03,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2835 states and 3394 transitions. [2024-12-05 21:29:03,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-12-05 21:29:03,086 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:03,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:03,341 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 224 proven. 65 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-12-05 21:29:05,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:05,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3414 states to 2853 states and 3414 transitions. [2024-12-05 21:29:05,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 3414 transitions. [2024-12-05 21:29:05,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-12-05 21:29:05,121 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:05,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 224 proven. 65 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-12-05 21:29:05,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:06,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3418 states to 2857 states and 3418 transitions. [2024-12-05 21:29:06,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 3418 transitions. [2024-12-05 21:29:06,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-12-05 21:29:06,053 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:06,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 190 proven. 132 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-05 21:29:06,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:06,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3423 states to 2863 states and 3423 transitions. [2024-12-05 21:29:06,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 3423 transitions. [2024-12-05 21:29:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-05 21:29:06,993 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:06,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:07,075 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-12-05 21:29:07,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:07,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3495 states to 2933 states and 3495 transitions. [2024-12-05 21:29:07,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2933 states and 3495 transitions. [2024-12-05 21:29:07,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-05 21:29:07,832 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:07,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:07,904 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-12-05 21:29:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3529 states to 2958 states and 3529 transitions. [2024-12-05 21:29:10,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 3529 transitions. [2024-12-05 21:29:10,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-12-05 21:29:10,369 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:10,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:10,568 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 288 proven. 59 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-12-05 21:29:12,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:12,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3541 states to 2966 states and 3541 transitions. [2024-12-05 21:29:12,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2966 states and 3541 transitions. [2024-12-05 21:29:12,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-12-05 21:29:12,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:12,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:12,603 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-12-05 21:29:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:15,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3601 states to 3018 states and 3601 transitions. [2024-12-05 21:29:15,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 3601 transitions. [2024-12-05 21:29:15,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-12-05 21:29:15,143 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:15,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-12-05 21:29:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3055 states and 3635 transitions. [2024-12-05 21:29:16,501 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 3635 transitions. [2024-12-05 21:29:16,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-12-05 21:29:16,503 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:16,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:16,573 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-12-05 21:29:17,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3067 states and 3648 transitions. [2024-12-05 21:29:17,341 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 3648 transitions. [2024-12-05 21:29:17,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-12-05 21:29:17,343 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:17,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-12-05 21:29:19,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:19,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3091 states and 3680 transitions. [2024-12-05 21:29:19,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3091 states and 3680 transitions. [2024-12-05 21:29:19,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-12-05 21:29:19,693 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:19,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-12-05 21:29:21,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:21,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3711 states to 3114 states and 3711 transitions. [2024-12-05 21:29:21,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 3711 transitions. [2024-12-05 21:29:21,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-12-05 21:29:21,013 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:21,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:21,106 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-12-05 21:29:22,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:22,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3126 states and 3722 transitions. [2024-12-05 21:29:22,030 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 3722 transitions. [2024-12-05 21:29:22,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-12-05 21:29:22,031 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:22,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:22,241 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-12-05 21:29:22,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:22,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3723 states to 3128 states and 3723 transitions. [2024-12-05 21:29:22,710 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 3723 transitions. [2024-12-05 21:29:22,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-05 21:29:22,712 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:22,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 3 proven. 287 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-12-05 21:29:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3801 states to 3198 states and 3801 transitions. [2024-12-05 21:29:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 3198 states and 3801 transitions. [2024-12-05 21:29:25,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-05 21:29:25,661 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:25,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 3 proven. 287 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-12-05 21:29:27,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3872 states to 3268 states and 3872 transitions. [2024-12-05 21:29:27,406 INFO L276 IsEmpty]: Start isEmpty. Operand 3268 states and 3872 transitions. [2024-12-05 21:29:27,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-05 21:29:27,408 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:27,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:27,709 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 3 proven. 287 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-12-05 21:29:28,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3896 states to 3293 states and 3896 transitions. [2024-12-05 21:29:28,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 3896 transitions. [2024-12-05 21:29:28,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-05 21:29:28,939 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:28,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 3 proven. 287 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-12-05 21:29:30,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3939 states to 3334 states and 3939 transitions. [2024-12-05 21:29:30,191 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 3939 transitions. [2024-12-05 21:29:30,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-05 21:29:30,192 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:30,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 3 proven. 287 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-12-05 21:29:31,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:31,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3339 states and 3944 transitions. [2024-12-05 21:29:31,270 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 3944 transitions. [2024-12-05 21:29:31,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-05 21:29:31,273 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:31,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:31,569 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 3 proven. 287 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-12-05 21:29:32,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:32,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3987 states to 3380 states and 3987 transitions. [2024-12-05 21:29:32,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 3987 transitions. [2024-12-05 21:29:32,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-05 21:29:32,978 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:32,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:33,450 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 3 proven. 287 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-12-05 21:29:33,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:33,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3987 states to 3381 states and 3987 transitions. [2024-12-05 21:29:33,618 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 3987 transitions. [2024-12-05 21:29:33,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-05 21:29:33,620 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:33,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 21:29:33,652 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 21:29:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 21:29:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 21:29:33,858 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 21:29:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 21:29:33,982 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 154 iterations. [2024-12-05 21:29:34,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 05.12 09:29:34 ImpRootNode [2024-12-05 21:29:34,103 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-05 21:29:34,104 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-05 21:29:34,104 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-05 21:29:34,104 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-05 21:29:34,105 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:26:54" (3/4) ... [2024-12-05 21:29:34,106 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-05 21:29:34,262 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 268. [2024-12-05 21:29:34,422 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_739f2ca0-36bc-4530-955b-1bbb7d49df67/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-05 21:29:34,422 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_739f2ca0-36bc-4530-955b-1bbb7d49df67/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-05 21:29:34,422 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-05 21:29:34,423 INFO L158 Benchmark]: Toolchain (without parser) took 162108.50ms. Allocated memory was 142.6MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 115.9MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 937.3MB. Max. memory is 16.1GB. [2024-12-05 21:29:34,423 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 142.6MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 21:29:34,424 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.32ms. Allocated memory is still 142.6MB. Free memory was 115.8MB in the beginning and 88.4MB in the end (delta: 27.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-05 21:29:34,424 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.21ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 83.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 21:29:34,424 INFO L158 Benchmark]: Boogie Preprocessor took 54.15ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 78.9MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 21:29:34,424 INFO L158 Benchmark]: RCFGBuilder took 1176.76ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 64.8MB in the end (delta: 14.1MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. [2024-12-05 21:29:34,424 INFO L158 Benchmark]: CodeCheck took 160079.35ms. Allocated memory was 142.6MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 64.8MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 843.8MB. Max. memory is 16.1GB. [2024-12-05 21:29:34,425 INFO L158 Benchmark]: Witness Printer took 318.34ms. Allocated memory is still 2.4GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-12-05 21:29:34,426 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: 159.9s, OverallIterations: 154, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 472929 SdHoareTripleChecker+Valid, 991.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 468062 mSDsluCounter, 64933 SdHoareTripleChecker+Invalid, 844.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55094 mSDsCounter, 113793 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1034057 IncrementalHoareTripleChecker+Invalid, 1147850 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113793 mSolverCounterUnsat, 9839 mSDtfsCounter, 1034057 mSolverCounterSat, 8.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 179694 GetRequests, 171630 SyntacticMatches, 6820 SemanticMatches, 1244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112887 ImplicationChecksByTransitivity, 111.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.7s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 25.4s InterpolantComputationTime, 26660 NumberOfCodeBlocks, 26660 NumberOfCodeBlocksAsserted, 154 NumberOfCheckSat, 26244 ConstructedInterpolants, 0 QuantifiedInterpolants, 147883 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 153 InterpolantComputations, 91 PerfectInterpolantSequences, 21569/26920 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: 420]: 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND TRUE ((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5)) [L376] a21 = 1 [L377] a7 = 0 [L378] a17 = 0 [L379] a8 = 14 [L380] a20 = 0 [L381] return -1; VAL [\result=-1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, 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=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L420] reach_error() VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, 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.30ms. Allocated memory is still 142.6MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.32ms. Allocated memory is still 142.6MB. Free memory was 115.8MB in the beginning and 88.4MB in the end (delta: 27.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.21ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 83.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.15ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 78.9MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1176.76ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 64.8MB in the end (delta: 14.1MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. * CodeCheck took 160079.35ms. Allocated memory was 142.6MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 64.8MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 843.8MB. Max. memory is 16.1GB. * Witness Printer took 318.34ms. Allocated memory is still 2.4GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-12-05 21:29:34,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_739f2ca0-36bc-4530-955b-1bbb7d49df67/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, 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