./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label34.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d10fd6e-f357-4455-9752-c16290d3ffb2/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d10fd6e-f357-4455-9752-c16290d3ffb2/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d10fd6e-f357-4455-9752-c16290d3ffb2/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d10fd6e-f357-4455-9752-c16290d3ffb2/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label34.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d10fd6e-f357-4455-9752-c16290d3ffb2/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d10fd6e-f357-4455-9752-c16290d3ffb2/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 734ea858638864cf111875fb6688bf68ceb15644fd98461d3cd9d71a49a35f2c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:36:50,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:36:50,447 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d10fd6e-f357-4455-9752-c16290d3ffb2/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 19:36:50,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:36:50,457 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 19:36:50,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:36:50,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:36:50,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 19:36:50,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:36:50,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:36:50,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:36:50,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:36:50,502 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:36:50,504 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:36:50,507 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:36:50,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:36:50,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:36:50,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:36:50,509 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:36:50,509 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:36:50,509 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:36:50,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:36:50,511 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:36:50,512 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 19:36:50,512 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 19:36:50,514 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 19:36:50,514 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:36:50,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:36:50,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:36:50,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:36:50,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:36:50,517 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 19:36:50,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:36:50,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d10fd6e-f357-4455-9752-c16290d3ffb2/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d10fd6e-f357-4455-9752-c16290d3ffb2/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 734ea858638864cf111875fb6688bf68ceb15644fd98461d3cd9d71a49a35f2c [2024-11-08 19:36:50,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:36:50,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:36:50,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:36:50,862 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:36:50,863 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:36:50,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d10fd6e-f357-4455-9752-c16290d3ffb2/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/eca-rers2012/Problem01_label34.c Unable to find full path for "g++" [2024-11-08 19:36:52,855 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:36:53,189 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:36:53,189 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d10fd6e-f357-4455-9752-c16290d3ffb2/sv-benchmarks/c/eca-rers2012/Problem01_label34.c [2024-11-08 19:36:53,219 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d10fd6e-f357-4455-9752-c16290d3ffb2/bin/ukojak-verify-ImItNfHLgk/data/a1a90f73b/1468ca3c90d94082807f78b928f41bf7/FLAG9b8b9b02b [2024-11-08 19:36:53,441 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d10fd6e-f357-4455-9752-c16290d3ffb2/bin/ukojak-verify-ImItNfHLgk/data/a1a90f73b/1468ca3c90d94082807f78b928f41bf7 [2024-11-08 19:36:53,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:36:53,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:36:53,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:36:53,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:36:53,458 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:36:53,459 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:36:53" (1/1) ... [2024-11-08 19:36:53,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f4cd67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:53, skipping insertion in model container [2024-11-08 19:36:53,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:36:53" (1/1) ... [2024-11-08 19:36:53,511 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:36:53,895 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_7d10fd6e-f357-4455-9752-c16290d3ffb2/sv-benchmarks/c/eca-rers2012/Problem01_label34.c[18605,18618] [2024-11-08 19:36:53,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:36:53,970 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:36:54,101 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_7d10fd6e-f357-4455-9752-c16290d3ffb2/sv-benchmarks/c/eca-rers2012/Problem01_label34.c[18605,18618] [2024-11-08 19:36:54,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:36:54,142 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:36:54,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:54 WrapperNode [2024-11-08 19:36:54,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:36:54,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:36:54,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:36:54,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:36:54,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:54" (1/1) ... [2024-11-08 19:36:54,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:54" (1/1) ... [2024-11-08 19:36:54,230 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-08 19:36:54,230 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:36:54,231 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:36:54,231 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:36:54,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:36:54,256 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:54" (1/1) ... [2024-11-08 19:36:54,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:54" (1/1) ... [2024-11-08 19:36:54,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:54" (1/1) ... [2024-11-08 19:36:54,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:54" (1/1) ... [2024-11-08 19:36:54,301 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:54" (1/1) ... [2024-11-08 19:36:54,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:54" (1/1) ... [2024-11-08 19:36:54,326 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:54" (1/1) ... [2024-11-08 19:36:54,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:54" (1/1) ... [2024-11-08 19:36:54,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:36:54,346 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:36:54,347 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:36:54,347 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:36:54,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:36:54" (1/1) ... [2024-11-08 19:36:54,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:36:54,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d10fd6e-f357-4455-9752-c16290d3ffb2/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 19:36:54,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d10fd6e-f357-4455-9752-c16290d3ffb2/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 19:36:54,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d10fd6e-f357-4455-9752-c16290d3ffb2/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 19:36:54,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:36:54,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 19:36:54,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:36:54,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:36:54,515 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:36:54,518 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:36:55,733 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-08 19:36:55,735 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:36:55,982 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:36:55,982 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:36:55,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:36:55 BoogieIcfgContainer [2024-11-08 19:36:55,983 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:36:55,984 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 19:36:55,984 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 19:36:55,996 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 19:36:55,997 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:36:55" (1/1) ... [2024-11-08 19:36:56,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:36:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:36:56,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-08 19:36:56,070 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-08 19:36:56,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-08 19:36:56,076 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:36:56,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:36:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:36:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:36:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 145 states and 231 transitions. [2024-11-08 19:36:57,449 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 231 transitions. [2024-11-08 19:36:57,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 19:36:57,453 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:36:57,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:36:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:57,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:36:58,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:36:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 218 states and 308 transitions. [2024-11-08 19:36:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 308 transitions. [2024-11-08 19:36:58,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 19:36:58,643 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:36:58,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:36:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:36:59,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:36:59,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 222 states and 315 transitions. [2024-11-08 19:36:59,032 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 315 transitions. [2024-11-08 19:36:59,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-08 19:36:59,035 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:36:59,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:36:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:36:59,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:36:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 223 states and 317 transitions. [2024-11-08 19:36:59,402 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 317 transitions. [2024-11-08 19:36:59,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-08 19:36:59,405 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:36:59,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:36:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:59,600 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:36:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:36:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 232 states and 330 transitions. [2024-11-08 19:36:59,944 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 330 transitions. [2024-11-08 19:36:59,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-08 19:36:59,949 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:36:59,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:36:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:00,144 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:00,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:00,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 241 states and 339 transitions. [2024-11-08 19:37:00,319 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 339 transitions. [2024-11-08 19:37:00,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 19:37:00,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:00,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:00,556 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:00,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:00,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 243 states and 342 transitions. [2024-11-08 19:37:00,624 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 342 transitions. [2024-11-08 19:37:00,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 19:37:00,625 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:00,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:01,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:01,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 258 states and 362 transitions. [2024-11-08 19:37:01,245 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 362 transitions. [2024-11-08 19:37:01,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 19:37:01,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:01,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:01,508 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:02,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:02,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 273 states and 382 transitions. [2024-11-08 19:37:02,094 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 382 transitions. [2024-11-08 19:37:02,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 19:37:02,098 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:02,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:02,248 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:02,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 277 states and 387 transitions. [2024-11-08 19:37:02,377 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 387 transitions. [2024-11-08 19:37:02,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 19:37:02,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:02,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:02,566 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:02,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 281 states and 396 transitions. [2024-11-08 19:37:02,969 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 396 transitions. [2024-11-08 19:37:02,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 19:37:02,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:02,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:03,067 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:03,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 286 states and 402 transitions. [2024-11-08 19:37:03,127 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 402 transitions. [2024-11-08 19:37:03,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 19:37:03,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:03,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:03,242 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:03,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 301 states and 422 transitions. [2024-11-08 19:37:03,743 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 422 transitions. [2024-11-08 19:37:03,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 19:37:03,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:03,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:03,860 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:37:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:04,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 320 states and 447 transitions. [2024-11-08 19:37:04,632 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 447 transitions. [2024-11-08 19:37:04,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 19:37:04,633 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:04,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:04,765 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:05,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:05,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 335 states and 466 transitions. [2024-11-08 19:37:05,397 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 466 transitions. [2024-11-08 19:37:05,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 19:37:05,399 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:05,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:05,510 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:05,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:05,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 339 states and 470 transitions. [2024-11-08 19:37:05,564 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 470 transitions. [2024-11-08 19:37:05,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 19:37:05,565 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:05,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:05,632 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 19:37:05,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:05,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 352 states and 484 transitions. [2024-11-08 19:37:05,880 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 484 transitions. [2024-11-08 19:37:05,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 19:37:05,881 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:05,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 19:37:06,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:06,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 354 states and 485 transitions. [2024-11-08 19:37:06,296 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 485 transitions. [2024-11-08 19:37:06,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 19:37:06,299 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:06,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 19:37:06,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:06,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 362 states and 495 transitions. [2024-11-08 19:37:06,729 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 495 transitions. [2024-11-08 19:37:06,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 19:37:06,730 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:06,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:07,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:07,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 377 states and 512 transitions. [2024-11-08 19:37:07,115 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 512 transitions. [2024-11-08 19:37:07,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 19:37:07,116 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:07,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:07,269 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:07,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:07,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 387 states and 524 transitions. [2024-11-08 19:37:07,477 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 524 transitions. [2024-11-08 19:37:07,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 19:37:07,479 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:07,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:07,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:07,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 389 states and 527 transitions. [2024-11-08 19:37:07,675 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 527 transitions. [2024-11-08 19:37:07,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 19:37:07,677 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:07,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:07,779 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:37:08,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:08,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 416 states and 559 transitions. [2024-11-08 19:37:08,518 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 559 transitions. [2024-11-08 19:37:08,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 19:37:08,519 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:08,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:08,591 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 19:37:08,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:08,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 420 states and 562 transitions. [2024-11-08 19:37:08,639 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 562 transitions. [2024-11-08 19:37:08,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 19:37:08,642 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:08,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:08,846 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:08,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:08,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 423 states and 566 transitions. [2024-11-08 19:37:08,945 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 566 transitions. [2024-11-08 19:37:08,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 19:37:08,947 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:08,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:09,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:09,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 437 states and 582 transitions. [2024-11-08 19:37:09,532 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 582 transitions. [2024-11-08 19:37:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 19:37:09,534 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:09,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:09,831 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:09,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 440 states and 585 transitions. [2024-11-08 19:37:09,999 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 585 transitions. [2024-11-08 19:37:10,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 19:37:10,001 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:10,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:10,154 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 19:37:10,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:10,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 446 states and 590 transitions. [2024-11-08 19:37:10,321 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 590 transitions. [2024-11-08 19:37:10,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 19:37:10,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:10,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 19:37:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:10,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 447 states and 591 transitions. [2024-11-08 19:37:10,551 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 591 transitions. [2024-11-08 19:37:10,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 19:37:10,553 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:10,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:10,650 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:10,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:10,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 461 states and 607 transitions. [2024-11-08 19:37:10,774 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 607 transitions. [2024-11-08 19:37:10,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 19:37:10,775 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:10,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:10,847 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:10,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:10,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 472 states and 620 transitions. [2024-11-08 19:37:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 620 transitions. [2024-11-08 19:37:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 19:37:10,943 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:10,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:11,016 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 19:37:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:11,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 476 states and 625 transitions. [2024-11-08 19:37:11,188 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 625 transitions. [2024-11-08 19:37:11,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 19:37:11,189 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:11,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:11,272 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:37:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 489 states and 639 transitions. [2024-11-08 19:37:11,457 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 639 transitions. [2024-11-08 19:37:11,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 19:37:11,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:11,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:11,569 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:11,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:11,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 512 states and 665 transitions. [2024-11-08 19:37:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 665 transitions. [2024-11-08 19:37:11,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 19:37:11,740 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:11,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:11,823 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 19:37:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 521 states and 674 transitions. [2024-11-08 19:37:12,090 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 674 transitions. [2024-11-08 19:37:12,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 19:37:12,092 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:12,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 19:37:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:13,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 637 states and 798 transitions. [2024-11-08 19:37:13,915 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 798 transitions. [2024-11-08 19:37:13,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 19:37:13,917 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:13,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:14,089 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 52 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:14,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:14,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 679 states and 844 transitions. [2024-11-08 19:37:14,627 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 844 transitions. [2024-11-08 19:37:14,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 19:37:14,629 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:14,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-08 19:37:15,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:15,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 697 states and 863 transitions. [2024-11-08 19:37:15,071 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 863 transitions. [2024-11-08 19:37:15,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 19:37:15,072 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:15,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 19:37:15,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:15,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 703 states and 870 transitions. [2024-11-08 19:37:15,281 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 870 transitions. [2024-11-08 19:37:15,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 19:37:15,284 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:15,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:15,372 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 19:37:15,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:15,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 718 states and 888 transitions. [2024-11-08 19:37:15,564 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 888 transitions. [2024-11-08 19:37:15,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 19:37:15,566 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:15,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:15,739 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 19:37:15,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:15,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 719 states and 889 transitions. [2024-11-08 19:37:15,809 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 889 transitions. [2024-11-08 19:37:15,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 19:37:15,809 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:15,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 70 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 19:37:18,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 770 states and 957 transitions. [2024-11-08 19:37:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 957 transitions. [2024-11-08 19:37:18,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 19:37:18,041 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:18,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:18,201 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 19:37:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 776 states and 965 transitions. [2024-11-08 19:37:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 965 transitions. [2024-11-08 19:37:18,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 19:37:18,427 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:18,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:18,581 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:18,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:18,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 804 states and 996 transitions. [2024-11-08 19:37:18,970 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 996 transitions. [2024-11-08 19:37:18,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 19:37:18,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:18,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:19,065 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 19:37:19,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:19,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 809 states and 1000 transitions. [2024-11-08 19:37:19,229 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1000 transitions. [2024-11-08 19:37:19,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 19:37:19,230 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:19,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:19,336 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 19:37:19,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 822 states and 1013 transitions. [2024-11-08 19:37:19,530 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1013 transitions. [2024-11-08 19:37:19,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 19:37:19,532 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:19,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 19:37:19,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:19,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 823 states and 1016 transitions. [2024-11-08 19:37:19,710 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1016 transitions. [2024-11-08 19:37:19,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 19:37:19,715 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:19,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:19,836 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-08 19:37:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:19,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 824 states and 1016 transitions. [2024-11-08 19:37:19,880 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1016 transitions. [2024-11-08 19:37:19,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 19:37:19,882 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:19,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:20,056 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-08 19:37:20,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:20,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 825 states and 1018 transitions. [2024-11-08 19:37:20,415 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1018 transitions. [2024-11-08 19:37:20,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 19:37:20,416 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:20,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:20,639 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:21,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:21,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 869 states and 1063 transitions. [2024-11-08 19:37:21,217 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1063 transitions. [2024-11-08 19:37:21,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 19:37:21,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:21,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:21,570 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 19:37:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:21,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 880 states and 1076 transitions. [2024-11-08 19:37:21,928 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1076 transitions. [2024-11-08 19:37:21,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 19:37:21,929 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:21,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 19:37:22,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:22,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 894 states and 1089 transitions. [2024-11-08 19:37:22,204 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1089 transitions. [2024-11-08 19:37:22,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 19:37:22,205 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:22,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 19:37:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:22,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 897 states and 1091 transitions. [2024-11-08 19:37:22,367 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1091 transitions. [2024-11-08 19:37:22,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 19:37:22,369 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:22,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 19:37:22,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 904 states and 1098 transitions. [2024-11-08 19:37:22,676 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1098 transitions. [2024-11-08 19:37:22,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 19:37:22,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:22,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 99 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 19:37:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:23,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 906 states and 1100 transitions. [2024-11-08 19:37:23,073 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1100 transitions. [2024-11-08 19:37:23,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 19:37:23,075 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:23,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 19:37:23,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:23,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 933 states and 1135 transitions. [2024-11-08 19:37:23,647 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1135 transitions. [2024-11-08 19:37:23,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 19:37:23,649 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:23,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:23,799 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 19:37:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:24,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 934 states and 1135 transitions. [2024-11-08 19:37:24,083 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1135 transitions. [2024-11-08 19:37:24,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 19:37:24,083 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:24,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:24,179 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 19:37:24,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:24,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 947 states and 1149 transitions. [2024-11-08 19:37:24,405 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1149 transitions. [2024-11-08 19:37:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 19:37:24,406 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:24,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 19:37:24,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:24,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 951 states and 1157 transitions. [2024-11-08 19:37:24,822 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1157 transitions. [2024-11-08 19:37:24,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 19:37:24,823 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:24,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:25,037 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 19:37:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 952 states and 1157 transitions. [2024-11-08 19:37:25,234 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1157 transitions. [2024-11-08 19:37:25,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 19:37:25,236 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:25,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 19:37:25,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:25,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 953 states and 1157 transitions. [2024-11-08 19:37:25,628 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1157 transitions. [2024-11-08 19:37:25,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 19:37:25,629 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:25,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-08 19:37:27,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:27,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1025 states and 1231 transitions. [2024-11-08 19:37:27,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1231 transitions. [2024-11-08 19:37:27,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 19:37:27,406 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:27,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:27,588 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 19:37:28,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:28,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1046 states and 1259 transitions. [2024-11-08 19:37:28,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1259 transitions. [2024-11-08 19:37:28,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 19:37:28,622 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:28,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:28,860 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 19:37:29,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:29,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1047 states and 1259 transitions. [2024-11-08 19:37:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1259 transitions. [2024-11-08 19:37:29,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 19:37:29,143 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:29,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:29,214 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 19:37:29,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:29,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1049 states and 1260 transitions. [2024-11-08 19:37:29,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1260 transitions. [2024-11-08 19:37:29,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 19:37:29,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:29,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:29,346 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 19:37:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1074 states and 1287 transitions. [2024-11-08 19:37:29,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1287 transitions. [2024-11-08 19:37:29,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 19:37:29,790 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:29,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:30,582 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:33,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:33,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1172 states and 1400 transitions. [2024-11-08 19:37:33,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1400 transitions. [2024-11-08 19:37:33,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 19:37:33,296 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:33,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:34,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:34,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1177 states and 1405 transitions. [2024-11-08 19:37:34,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1405 transitions. [2024-11-08 19:37:34,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 19:37:34,107 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:34,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:34,281 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 19:37:34,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1201 states and 1427 transitions. [2024-11-08 19:37:34,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1427 transitions. [2024-11-08 19:37:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 19:37:34,726 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:34,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:34,885 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 19:37:35,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:35,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1202 states and 1427 transitions. [2024-11-08 19:37:35,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1427 transitions. [2024-11-08 19:37:35,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 19:37:35,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:35,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:35,977 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 171 proven. 17 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-08 19:37:38,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1243 states and 1488 transitions. [2024-11-08 19:37:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1488 transitions. [2024-11-08 19:37:38,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 19:37:38,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:38,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:38,336 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 137 proven. 37 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-08 19:37:39,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:39,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1275 states and 1524 transitions. [2024-11-08 19:37:39,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1524 transitions. [2024-11-08 19:37:39,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-08 19:37:39,923 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:39,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 127 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 19:37:43,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:43,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1319 states and 1582 transitions. [2024-11-08 19:37:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1582 transitions. [2024-11-08 19:37:43,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-08 19:37:43,014 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:43,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:43,368 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 127 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 19:37:44,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:44,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1328 states and 1593 transitions. [2024-11-08 19:37:44,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1593 transitions. [2024-11-08 19:37:44,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 19:37:44,117 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:44,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:44,232 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-08 19:37:44,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:44,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1332 states and 1596 transitions. [2024-11-08 19:37:44,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1596 transitions. [2024-11-08 19:37:44,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 19:37:44,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:44,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-08 19:37:45,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:45,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1350 states and 1619 transitions. [2024-11-08 19:37:45,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1619 transitions. [2024-11-08 19:37:45,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 19:37:45,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:45,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-08 19:37:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1354 states and 1624 transitions. [2024-11-08 19:37:45,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1624 transitions. [2024-11-08 19:37:45,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 19:37:45,897 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:45,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:48,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1469 states and 1757 transitions. [2024-11-08 19:37:48,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1757 transitions. [2024-11-08 19:37:48,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 19:37:48,823 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:48,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 146 proven. 49 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 19:37:51,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:51,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1508 states and 1802 transitions. [2024-11-08 19:37:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1802 transitions. [2024-11-08 19:37:51,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 19:37:51,205 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:51,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-08 19:37:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:51,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1509 states and 1802 transitions. [2024-11-08 19:37:51,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1802 transitions. [2024-11-08 19:37:51,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 19:37:51,391 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:51,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:51,760 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:54,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:54,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1583 states and 1892 transitions. [2024-11-08 19:37:54,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 1892 transitions. [2024-11-08 19:37:54,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 19:37:54,778 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:54,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:55,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:55,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1588 states and 1896 transitions. [2024-11-08 19:37:55,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 1896 transitions. [2024-11-08 19:37:55,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 19:37:55,561 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:55,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:56,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1604 states and 1916 transitions. [2024-11-08 19:37:56,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 1916 transitions. [2024-11-08 19:37:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 19:37:56,981 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:56,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:57,332 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:58,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:58,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1617 states and 1929 transitions. [2024-11-08 19:37:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 1929 transitions. [2024-11-08 19:37:58,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 19:37:58,155 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:58,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:58,281 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 19:37:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1624 states and 1937 transitions. [2024-11-08 19:37:59,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 1937 transitions. [2024-11-08 19:37:59,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 19:37:59,123 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:59,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 19:37:59,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:59,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1628 states and 1940 transitions. [2024-11-08 19:37:59,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 1940 transitions. [2024-11-08 19:37:59,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 19:37:59,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:59,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:59,875 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 19:38:00,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:00,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1632 states and 1943 transitions. [2024-11-08 19:38:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 1943 transitions. [2024-11-08 19:38:00,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 19:38:00,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:00,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 159 proven. 37 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-08 19:38:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1980 states to 1664 states and 1980 transitions. [2024-11-08 19:38:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 1980 transitions. [2024-11-08 19:38:02,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 19:38:02,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:02,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,703 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 19:38:04,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 1700 states and 2019 transitions. [2024-11-08 19:38:04,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2019 transitions. [2024-11-08 19:38:04,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 19:38:04,715 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:04,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 176 proven. 65 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-08 19:38:07,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:07,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 1723 states and 2048 transitions. [2024-11-08 19:38:07,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2048 transitions. [2024-11-08 19:38:07,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 19:38:07,090 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:07,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:07,546 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 216 proven. 58 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-08 19:38:08,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 1729 states and 2055 transitions. [2024-11-08 19:38:08,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2055 transitions. [2024-11-08 19:38:08,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 19:38:08,831 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:08,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:09,316 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-08 19:38:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 1777 states and 2112 transitions. [2024-11-08 19:38:12,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2112 transitions. [2024-11-08 19:38:12,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 19:38:12,426 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:12,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:13,076 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-08 19:38:13,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:13,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 1782 states and 2116 transitions. [2024-11-08 19:38:13,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2116 transitions. [2024-11-08 19:38:13,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 19:38:13,879 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:13,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:14,186 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 185 proven. 56 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-08 19:38:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:14,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 1800 states and 2136 transitions. [2024-11-08 19:38:14,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2136 transitions. [2024-11-08 19:38:14,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 19:38:14,834 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:14,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:15,484 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:38:17,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:17,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 1895 states and 2243 transitions. [2024-11-08 19:38:17,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2243 transitions. [2024-11-08 19:38:17,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 19:38:17,886 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:17,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:18,179 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 192 proven. 60 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-08 19:38:21,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:21,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 1952 states and 2311 transitions. [2024-11-08 19:38:21,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2311 transitions. [2024-11-08 19:38:21,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 19:38:21,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:21,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:22,226 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 19:38:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2455 states to 2072 states and 2455 transitions. [2024-11-08 19:38:27,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2455 transitions. [2024-11-08 19:38:27,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-08 19:38:27,929 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:27,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:28,572 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 19:38:31,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2547 states to 2157 states and 2547 transitions. [2024-11-08 19:38:31,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 2547 transitions. [2024-11-08 19:38:31,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-08 19:38:31,023 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:31,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:31,114 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-08 19:38:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:31,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2165 states and 2555 transitions. [2024-11-08 19:38:31,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 2555 transitions. [2024-11-08 19:38:31,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-08 19:38:31,629 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:31,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 187 proven. 6 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-08 19:38:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:33,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2172 states and 2561 transitions. [2024-11-08 19:38:33,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 2561 transitions. [2024-11-08 19:38:33,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-08 19:38:33,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:33,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 187 proven. 6 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-08 19:38:34,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2176 states and 2564 transitions. [2024-11-08 19:38:34,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 2564 transitions. [2024-11-08 19:38:34,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-08 19:38:34,663 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:34,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 280 proven. 23 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-08 19:38:38,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:38,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2207 states and 2601 transitions. [2024-11-08 19:38:38,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 2601 transitions. [2024-11-08 19:38:38,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-08 19:38:38,204 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:38,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:38,727 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 206 proven. 8 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-08 19:38:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:39,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2232 states and 2626 transitions. [2024-11-08 19:38:39,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 2626 transitions. [2024-11-08 19:38:39,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-08 19:38:39,874 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:39,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 206 proven. 54 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-08 19:38:41,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2245 states and 2640 transitions. [2024-11-08 19:38:41,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 2640 transitions. [2024-11-08 19:38:41,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-08 19:38:41,803 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:41,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-08 19:38:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2258 states and 2657 transitions. [2024-11-08 19:38:43,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 2657 transitions. [2024-11-08 19:38:43,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-08 19:38:43,833 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:43,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:44,422 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 206 proven. 54 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-08 19:38:45,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:45,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2259 states and 2658 transitions. [2024-11-08 19:38:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 2658 transitions. [2024-11-08 19:38:45,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-08 19:38:45,139 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:45,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-11-08 19:38:46,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:46,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2273 states and 2673 transitions. [2024-11-08 19:38:46,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 2673 transitions. [2024-11-08 19:38:46,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-08 19:38:46,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:46,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-11-08 19:38:46,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:46,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2678 states to 2277 states and 2678 transitions. [2024-11-08 19:38:46,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 2678 transitions. [2024-11-08 19:38:46,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-08 19:38:46,968 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:46,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:47,188 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-08 19:38:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:48,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2297 states and 2704 transitions. [2024-11-08 19:38:48,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2297 states and 2704 transitions. [2024-11-08 19:38:48,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-08 19:38:48,547 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:48,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-08 19:38:49,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2306 states and 2711 transitions. [2024-11-08 19:38:49,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 2711 transitions. [2024-11-08 19:38:49,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-08 19:38:49,737 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:49,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-08 19:38:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:50,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2315 states and 2718 transitions. [2024-11-08 19:38:50,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 2718 transitions. [2024-11-08 19:38:50,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-08 19:38:50,839 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:50,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:51,014 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-08 19:38:51,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2733 states to 2329 states and 2733 transitions. [2024-11-08 19:38:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 2733 transitions. [2024-11-08 19:38:51,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-08 19:38:51,726 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:51,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:51,930 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-08 19:38:52,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2733 states to 2330 states and 2733 transitions. [2024-11-08 19:38:52,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 2733 transitions. [2024-11-08 19:38:52,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 19:38:52,513 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:52,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:52,692 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-08 19:38:53,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:53,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2346 states and 2749 transitions. [2024-11-08 19:38:53,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 2749 transitions. [2024-11-08 19:38:53,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 19:38:53,690 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:53,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:53,853 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-08 19:38:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2360 states and 2764 transitions. [2024-11-08 19:38:54,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 2764 transitions. [2024-11-08 19:38:54,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 19:38:54,779 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:54,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:54,937 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-08 19:38:55,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:55,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2361 states and 2764 transitions. [2024-11-08 19:38:55,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 2764 transitions. [2024-11-08 19:38:55,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 19:38:55,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:55,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:56,203 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 19:38:58,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:58,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2837 states to 2430 states and 2837 transitions. [2024-11-08 19:38:58,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 2837 transitions. [2024-11-08 19:38:58,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-08 19:38:58,756 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:58,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 19:39:00,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:00,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2847 states to 2439 states and 2847 transitions. [2024-11-08 19:39:00,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2439 states and 2847 transitions. [2024-11-08 19:39:00,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-08 19:39:00,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:00,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:00,456 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-08 19:39:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:02,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2874 states to 2463 states and 2874 transitions. [2024-11-08 19:39:02,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 2874 transitions. [2024-11-08 19:39:02,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 19:39:02,690 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:02,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 19:39:06,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:06,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2488 states and 2901 transitions. [2024-11-08 19:39:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 2901 transitions. [2024-11-08 19:39:06,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 19:39:06,076 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:06,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:07,093 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:39:13,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:13,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2980 states to 2559 states and 2980 transitions. [2024-11-08 19:39:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 2980 transitions. [2024-11-08 19:39:13,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 19:39:13,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:13,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:13,632 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:39:14,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:14,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2564 states and 2984 transitions. [2024-11-08 19:39:14,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 2984 transitions. [2024-11-08 19:39:14,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-08 19:39:14,628 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:14,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 19:39:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:15,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2991 states to 2571 states and 2991 transitions. [2024-11-08 19:39:15,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 2991 transitions. [2024-11-08 19:39:15,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-08 19:39:15,412 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:15,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 19:39:17,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:17,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 2602 states and 3024 transitions. [2024-11-08 19:39:17,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 3024 transitions. [2024-11-08 19:39:17,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 19:39:17,498 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:17,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:17,607 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-08 19:39:18,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 2607 states and 3028 transitions. [2024-11-08 19:39:18,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 3028 transitions. [2024-11-08 19:39:18,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 19:39:18,320 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:18,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:18,498 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-08 19:39:19,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:19,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 2615 states and 3036 transitions. [2024-11-08 19:39:19,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 3036 transitions. [2024-11-08 19:39:19,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 19:39:19,275 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:19,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-08 19:39:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:19,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 2616 states and 3036 transitions. [2024-11-08 19:39:19,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 3036 transitions. [2024-11-08 19:39:19,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 19:39:19,564 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:19,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:19,738 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-08 19:39:20,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:20,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3051 states to 2630 states and 3051 transitions. [2024-11-08 19:39:20,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3051 transitions. [2024-11-08 19:39:20,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 19:39:20,724 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:20,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:20,826 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-08 19:39:21,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 2638 states and 3059 transitions. [2024-11-08 19:39:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2638 states and 3059 transitions. [2024-11-08 19:39:21,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 19:39:21,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:21,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 19:39:21,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 2641 states and 3063 transitions. [2024-11-08 19:39:21,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2641 states and 3063 transitions. [2024-11-08 19:39:21,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 19:39:21,801 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:21,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:22,657 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-08 19:39:25,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:25,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 2768 states and 3194 transitions. [2024-11-08 19:39:25,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 3194 transitions. [2024-11-08 19:39:25,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-08 19:39:25,583 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:25,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:25,910 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 288 proven. 59 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2024-11-08 19:39:26,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:26,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 2769 states and 3195 transitions. [2024-11-08 19:39:26,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2769 states and 3195 transitions. [2024-11-08 19:39:26,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-08 19:39:26,095 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:26,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 19:39:33,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3279 states to 2835 states and 3279 transitions. [2024-11-08 19:39:33,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2835 states and 3279 transitions. [2024-11-08 19:39:33,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-08 19:39:33,631 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:33,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:34,007 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 19:39:34,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:34,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3285 states to 2842 states and 3285 transitions. [2024-11-08 19:39:34,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2842 states and 3285 transitions. [2024-11-08 19:39:34,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-08 19:39:34,830 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:34,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:35,421 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 19:39:36,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:36,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3291 states to 2849 states and 3291 transitions. [2024-11-08 19:39:36,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2849 states and 3291 transitions. [2024-11-08 19:39:36,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-08 19:39:36,233 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:36,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 293 proven. 122 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-08 19:39:41,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 2873 states and 3319 transitions. [2024-11-08 19:39:41,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2873 states and 3319 transitions. [2024-11-08 19:39:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-08 19:39:41,025 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:41,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:41,485 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-08 19:39:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3362 states to 2910 states and 3362 transitions. [2024-11-08 19:39:44,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 3362 transitions. [2024-11-08 19:39:44,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-08 19:39:44,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:44,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 293 proven. 122 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-08 19:39:46,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:46,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3379 states to 2924 states and 3379 transitions. [2024-11-08 19:39:46,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 3379 transitions. [2024-11-08 19:39:46,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-08 19:39:46,390 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:46,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:47,195 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-08 19:39:53,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:53,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 2967 states and 3445 transitions. [2024-11-08 19:39:53,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2967 states and 3445 transitions. [2024-11-08 19:39:53,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 19:39:53,195 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 140 iterations. [2024-11-08 19:39:53,205 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-08 19:40:29,223 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-11-08 19:40:29,223 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,224 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,224 INFO L77 FloydHoareUtils]: At program point L500-1(lines 40 585) the Hoare annotation is: (not (and (not (= ~a20~0 1)) (not (= ~a17~0 1)) (= ~a7~0 1))) [2024-11-08 19:40:29,224 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,225 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,225 INFO L75 FloydHoareUtils]: For program point L501(line 501) no Hoare annotation was computed. [2024-11-08 19:40:29,225 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse3 (= ~a16~0 4)) (.cse1 (= ~a8~0 15)) (.cse2 (= ~a17~0 1)) (.cse6 (= ~a7~0 1)) (.cse0 (= ~a12~0 8)) (.cse4 (= 14 ~a8~0)) (.cse7 (= 5 ~a16~0)) (.cse5 (= ~a21~0 1))) (or (and (not (and .cse0 (= ~a7~0 0) .cse1)) .cse2) (and .cse2 (not .cse3)) (and .cse0 .cse4 .cse5 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 2)) .cse2) (and .cse0 .cse5 .cse6 .cse1 .cse3) (and .cse0 .cse7 .cse5 .cse1) (= ~a20~0 1) (and (not .cse5) .cse2) (and (not .cse2) (not .cse6)) (and .cse0 .cse4 .cse7 .cse5))) [2024-11-08 19:40:29,225 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,226 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,226 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-11-08 19:40:29,227 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,227 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-11-08 19:40:29,227 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,227 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,228 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (let ((.cse3 (= ~a16~0 4)) (.cse1 (= ~a8~0 15)) (.cse2 (= ~a17~0 1)) (.cse6 (= ~a7~0 1)) (.cse0 (= ~a12~0 8)) (.cse4 (= 14 ~a8~0)) (.cse7 (= 5 ~a16~0)) (.cse5 (= ~a21~0 1))) (or (and (not (and .cse0 (= ~a7~0 0) .cse1)) .cse2) (and .cse2 (not .cse3)) (and .cse0 .cse4 .cse5 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 2)) .cse2) (and .cse0 .cse5 .cse6 .cse1 .cse3) (and .cse0 .cse7 .cse5 .cse1) (= ~a20~0 1) (and (not .cse5) .cse2) (and (not .cse2) (not .cse6)) (and .cse0 .cse4 .cse7 .cse5))) [2024-11-08 19:40:29,228 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,228 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,229 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,229 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,229 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,230 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,230 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,230 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,231 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,231 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-11-08 19:40:29,231 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,232 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-11-08 19:40:29,232 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (let ((.cse3 (= ~a16~0 4)) (.cse1 (= ~a8~0 15)) (.cse2 (= ~a17~0 1)) (.cse6 (= ~a7~0 1)) (.cse0 (= ~a12~0 8)) (.cse4 (= 14 ~a8~0)) (.cse7 (= 5 ~a16~0)) (.cse5 (= ~a21~0 1))) (or (and (not (and .cse0 (= ~a7~0 0) .cse1)) .cse2) (and .cse2 (not .cse3)) (and .cse0 .cse4 .cse5 .cse3) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 2)) .cse2) (and .cse0 .cse5 .cse6 .cse1 .cse3) (and .cse0 .cse7 .cse5 .cse1) (= ~a20~0 1) (and (not .cse5) .cse2) (and (not .cse2) (not .cse6)) (and .cse0 .cse4 .cse7 .cse5))) [2024-11-08 19:40:29,232 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,232 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,233 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,233 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,233 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-11-08 19:40:29,234 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,234 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,234 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,234 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-11-08 19:40:29,235 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,235 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,235 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-11-08 19:40:29,236 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,236 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,236 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,237 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,237 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,237 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,237 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,238 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-08 19:40:29,238 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-11-08 19:40:29,238 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-08 19:40:29,238 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,239 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,239 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,239 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-11-08 19:40:29,240 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,240 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,240 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,240 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-08 19:40:29,241 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,241 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,241 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-11-08 19:40:29,242 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,242 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,242 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,242 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,243 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,243 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,243 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 501) no Hoare annotation was computed. [2024-11-08 19:40:29,244 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,244 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,244 INFO L77 FloydHoareUtils]: At program point L497-1(lines 40 585) the Hoare annotation is: (not (and (not (= ~a20~0 1)) (not (= ~a17~0 1)) (= ~a7~0 1))) [2024-11-08 19:40:29,244 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,245 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,245 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse2 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3)) (not (= ~a20~0 1)) (not (and .cse0 .cse3 .cse4 .cse5)) (not (= ~a17~0 1)) (not (and .cse0 .cse2 .cse3 .cse4)) (= ~a7~0 1) (not (and .cse0 .cse1 .cse3 .cse5))))) [2024-11-08 19:40:29,245 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 4)) (.cse4 (= ~a17~0 ~a7~0)) (.cse9 (not .cse6)) (.cse7 (= ~a8~0 15)) (.cse5 (= ~a20~0 ~a7~0)) (.cse0 (= ~a12~0 8)) (.cse1 (= 14 ~a8~0)) (.cse8 (= 5 ~a16~0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (and .cse4 .cse3)) .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse8 .cse2 .cse7) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse4) (= ~a17~0 1) (and .cse9 (not .cse0)) (and .cse9 (not (and .cse2 .cse7 .cse5))) (and .cse0 .cse1 .cse8 .cse2)))) [2024-11-08 19:40:29,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 07:40:29 ImpRootNode [2024-11-08 19:40:29,266 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 19:40:29,267 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:40:29,267 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:40:29,267 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:40:29,268 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:36:55" (3/4) ... [2024-11-08 19:40:29,270 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 19:40:29,286 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-11-08 19:40:29,287 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-08 19:40:29,288 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 19:40:29,289 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 19:40:29,488 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d10fd6e-f357-4455-9752-c16290d3ffb2/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 19:40:29,488 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d10fd6e-f357-4455-9752-c16290d3ffb2/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-08 19:40:29,488 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:40:29,489 INFO L158 Benchmark]: Toolchain (without parser) took 216042.09ms. Allocated memory was 161.5MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 122.5MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 942.6MB. Max. memory is 16.1GB. [2024-11-08 19:40:29,489 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 119.5MB. Free memory was 87.4MB in the beginning and 87.4MB in the end (delta: 29.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:40:29,490 INFO L158 Benchmark]: CACSL2BoogieTranslator took 691.56ms. Allocated memory is still 161.5MB. Free memory was 121.9MB in the beginning and 92.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 19:40:29,490 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.08ms. Allocated memory is still 161.5MB. Free memory was 92.5MB in the beginning and 86.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 19:40:29,490 INFO L158 Benchmark]: Boogie Preprocessor took 114.69ms. Allocated memory is still 161.5MB. Free memory was 86.2MB in the beginning and 82.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:40:29,491 INFO L158 Benchmark]: RCFGBuilder took 1636.68ms. Allocated memory is still 161.5MB. Free memory was 82.0MB in the beginning and 67.3MB in the end (delta: 14.7MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2024-11-08 19:40:29,491 INFO L158 Benchmark]: CodeCheck took 213282.29ms. Allocated memory was 161.5MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 67.3MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 871.7MB. Max. memory is 16.1GB. [2024-11-08 19:40:29,492 INFO L158 Benchmark]: Witness Printer took 221.92ms. Allocated memory is still 2.7GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 19:40:29,495 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: 177.2s, OverallIterations: 140, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 386082 SdHoareTripleChecker+Valid, 1066.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 385115 mSDsluCounter, 66305 SdHoareTripleChecker+Invalid, 912.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57192 mSDsCounter, 95866 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 833845 IncrementalHoareTripleChecker+Invalid, 929711 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95866 mSolverCounterUnsat, 9113 mSDtfsCounter, 833845 mSolverCounterSat, 10.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161814 GetRequests, 155359 SyntacticMatches, 5413 SemanticMatches, 1042 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704179 ImplicationChecksByTransitivity, 114.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 35.5s InterpolantComputationTime, 24398 NumberOfCodeBlocks, 24398 NumberOfCodeBlocksAsserted, 139 NumberOfCheckSat, 24259 ConstructedInterpolants, 0 QuantifiedInterpolants, 131156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 139 InterpolantComputations, 85 PerfectInterpolantSequences, 22799/26377 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 - PositiveResult [Line: 501]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: !((((((!((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a21 == 1)) && (a20 != 1)) && !((((a12 == 8) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && (a17 != 1)) && !((((a12 == 8) && (5 == a16)) && (a21 == 1)) && (a8 == 15))) && (a7 == 1)) && !((((a12 == 8) && (14 == a8)) && (a21 == 1)) && (a16 == 4))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !((((((!((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a21 == 1)) && (a20 != 1)) && !((((a12 == 8) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && (a17 != 1)) && !((((a12 == 8) && (5 == a16)) && (a21 == 1)) && (a8 == 15))) && (a7 == 1)) && !((((a12 == 8) && (14 == a8)) && (a21 == 1)) && (a16 == 4))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 119.5MB. Free memory was 87.4MB in the beginning and 87.4MB in the end (delta: 29.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 691.56ms. Allocated memory is still 161.5MB. Free memory was 121.9MB in the beginning and 92.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.08ms. Allocated memory is still 161.5MB. Free memory was 92.5MB in the beginning and 86.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.69ms. Allocated memory is still 161.5MB. Free memory was 86.2MB in the beginning and 82.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1636.68ms. Allocated memory is still 161.5MB. Free memory was 82.0MB in the beginning and 67.3MB in the end (delta: 14.7MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. * CodeCheck took 213282.29ms. Allocated memory was 161.5MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 67.3MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 871.7MB. Max. memory is 16.1GB. * Witness Printer took 221.92ms. Allocated memory is still 2.7GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-08 19:40:29,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d10fd6e-f357-4455-9752-c16290d3ffb2/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE