./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label37.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21cb25b0-2089-4647-a64e-b099d9fbca22/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21cb25b0-2089-4647-a64e-b099d9fbca22/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21cb25b0-2089-4647-a64e-b099d9fbca22/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21cb25b0-2089-4647-a64e-b099d9fbca22/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label37.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21cb25b0-2089-4647-a64e-b099d9fbca22/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21cb25b0-2089-4647-a64e-b099d9fbca22/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6a31abd5185b15385b4060783f7e6ebda0d51c801a422158db36fc56fa68a0e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 00:59:17,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 00:59:17,724 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21cb25b0-2089-4647-a64e-b099d9fbca22/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 00:59:17,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 00:59:17,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 00:59:17,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 00:59:17,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 00:59:17,748 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 00:59:17,748 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 00:59:17,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 00:59:17,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 00:59:17,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 00:59:17,748 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 00:59:17,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 00:59:17,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 00:59:17,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 00:59:17,749 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 00:59:17,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 00:59:17,749 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 00:59:17,749 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 00:59:17,749 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 00:59:17,749 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 00:59:17,749 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 00:59:17,749 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 00:59:17,749 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 00:59:17,749 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 00:59:17,750 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 00:59:17,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 00:59:17,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 00:59:17,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 00:59:17,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 00:59:17,750 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 00:59:17,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 00:59:17,750 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21cb25b0-2089-4647-a64e-b099d9fbca22/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6a31abd5185b15385b4060783f7e6ebda0d51c801a422158db36fc56fa68a0e [2024-12-06 00:59:17,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 00:59:17,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 00:59:17,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 00:59:17,990 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 00:59:17,991 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 00:59:17,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21cb25b0-2089-4647-a64e-b099d9fbca22/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem02_label37.c [2024-12-06 00:59:20,670 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21cb25b0-2089-4647-a64e-b099d9fbca22/bin/ukojak-verify-CZk0znPC7b/data/48f705c16/88959abdb1064bec8f229477305e07da/FLAG33c66e16b [2024-12-06 00:59:20,911 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 00:59:20,911 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21cb25b0-2089-4647-a64e-b099d9fbca22/sv-benchmarks/c/eca-rers2012/Problem02_label37.c [2024-12-06 00:59:20,922 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21cb25b0-2089-4647-a64e-b099d9fbca22/bin/ukojak-verify-CZk0znPC7b/data/48f705c16/88959abdb1064bec8f229477305e07da/FLAG33c66e16b [2024-12-06 00:59:20,936 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21cb25b0-2089-4647-a64e-b099d9fbca22/bin/ukojak-verify-CZk0znPC7b/data/48f705c16/88959abdb1064bec8f229477305e07da [2024-12-06 00:59:20,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 00:59:20,940 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 00:59:20,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 00:59:20,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 00:59:20,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 00:59:20,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:59:20" (1/1) ... [2024-12-06 00:59:20,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2419b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:59:20, skipping insertion in model container [2024-12-06 00:59:20,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:59:20" (1/1) ... [2024-12-06 00:59:20,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 00:59:21,215 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_21cb25b0-2089-4647-a64e-b099d9fbca22/sv-benchmarks/c/eca-rers2012/Problem02_label37.c[19058,19071] [2024-12-06 00:59:21,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 00:59:21,244 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 00:59:21,304 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_21cb25b0-2089-4647-a64e-b099d9fbca22/sv-benchmarks/c/eca-rers2012/Problem02_label37.c[19058,19071] [2024-12-06 00:59:21,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 00:59:21,326 INFO L204 MainTranslator]: Completed translation [2024-12-06 00:59:21,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:59:21 WrapperNode [2024-12-06 00:59:21,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 00:59:21,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 00:59:21,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 00:59:21,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 00:59:21,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:59:21" (1/1) ... [2024-12-06 00:59:21,347 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:59:21" (1/1) ... [2024-12-06 00:59:21,380 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-12-06 00:59:21,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 00:59:21,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 00:59:21,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 00:59:21,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 00:59:21,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:59:21" (1/1) ... [2024-12-06 00:59:21,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:59:21" (1/1) ... [2024-12-06 00:59:21,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:59:21" (1/1) ... [2024-12-06 00:59:21,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:59:21" (1/1) ... [2024-12-06 00:59:21,409 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:59:21" (1/1) ... [2024-12-06 00:59:21,411 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:59:21" (1/1) ... [2024-12-06 00:59:21,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:59:21" (1/1) ... [2024-12-06 00:59:21,421 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:59:21" (1/1) ... [2024-12-06 00:59:21,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:59:21" (1/1) ... [2024-12-06 00:59:21,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 00:59:21,429 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 00:59:21,429 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 00:59:21,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 00:59:21,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:59:21" (1/1) ... [2024-12-06 00:59:21,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 00:59:21,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21cb25b0-2089-4647-a64e-b099d9fbca22/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 00:59:21,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21cb25b0-2089-4647-a64e-b099d9fbca22/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 00:59:21,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21cb25b0-2089-4647-a64e-b099d9fbca22/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 00:59:21,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 00:59:21,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 00:59:21,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 00:59:21,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 00:59:21,549 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 00:59:21,551 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 00:59:22,366 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-12-06 00:59:22,366 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 00:59:22,639 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 00:59:22,639 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 00:59:22,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:59:22 BoogieIcfgContainer [2024-12-06 00:59:22,639 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 00:59:22,640 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 00:59:22,640 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 00:59:22,649 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 00:59:22,649 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:59:22" (1/1) ... [2024-12-06 00:59:22,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 00:59:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:22,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-12-06 00:59:22,710 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-12-06 00:59:22,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-12-06 00:59:22,713 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:22,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:23,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:23,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 163 states and 300 transitions. [2024-12-06 00:59:23,712 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 300 transitions. [2024-12-06 00:59:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-06 00:59:23,714 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:23,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:24,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 166 states and 305 transitions. [2024-12-06 00:59:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 305 transitions. [2024-12-06 00:59:24,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-12-06 00:59:24,161 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:24,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:24,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:25,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:25,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 245 states and 421 transitions. [2024-12-06 00:59:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 421 transitions. [2024-12-06 00:59:25,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 00:59:25,036 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:25,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:25,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:25,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 250 states and 429 transitions. [2024-12-06 00:59:25,288 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 429 transitions. [2024-12-06 00:59:25,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-12-06 00:59:25,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:25,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:25,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:25,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 253 states and 434 transitions. [2024-12-06 00:59:25,560 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 434 transitions. [2024-12-06 00:59:25,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-12-06 00:59:25,561 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:25,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:26,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:26,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 257 states and 441 transitions. [2024-12-06 00:59:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 441 transitions. [2024-12-06 00:59:26,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-12-06 00:59:26,009 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:26,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:26,104 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 260 states and 446 transitions. [2024-12-06 00:59:26,218 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 446 transitions. [2024-12-06 00:59:26,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-12-06 00:59:26,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:26,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:26,320 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 00:59:27,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:27,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 347 states and 540 transitions. [2024-12-06 00:59:27,249 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 540 transitions. [2024-12-06 00:59:27,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-12-06 00:59:27,250 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:27,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:27,319 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:27,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:27,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 366 states and 560 transitions. [2024-12-06 00:59:27,486 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 560 transitions. [2024-12-06 00:59:27,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-06 00:59:27,488 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:27,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:27,583 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:28,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 391 states and 595 transitions. [2024-12-06 00:59:28,017 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 595 transitions. [2024-12-06 00:59:28,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-06 00:59:28,018 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:28,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:28,122 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:28,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:28,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 413 states and 617 transitions. [2024-12-06 00:59:28,313 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 617 transitions. [2024-12-06 00:59:28,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-06 00:59:28,314 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:28,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:28,365 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:28,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 435 states and 643 transitions. [2024-12-06 00:59:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 643 transitions. [2024-12-06 00:59:28,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-06 00:59:28,880 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:28,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:28,932 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 439 states and 645 transitions. [2024-12-06 00:59:29,204 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 645 transitions. [2024-12-06 00:59:29,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-06 00:59:29,205 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:29,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:29,308 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 468 states and 678 transitions. [2024-12-06 00:59:29,811 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 678 transitions. [2024-12-06 00:59:29,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-06 00:59:29,812 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:29,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:29,910 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:30,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:30,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 496 states and 713 transitions. [2024-12-06 00:59:30,463 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 713 transitions. [2024-12-06 00:59:30,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-06 00:59:30,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:30,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:30,539 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:30,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:30,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 500 states and 715 transitions. [2024-12-06 00:59:30,816 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 715 transitions. [2024-12-06 00:59:30,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-06 00:59:30,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:30,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:30,866 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 00:59:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:30,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 501 states and 716 transitions. [2024-12-06 00:59:30,942 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 716 transitions. [2024-12-06 00:59:30,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-06 00:59:30,943 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:30,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 533 states and 750 transitions. [2024-12-06 00:59:31,442 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 750 transitions. [2024-12-06 00:59:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-06 00:59:31,443 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:31,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 00:59:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 538 states and 755 transitions. [2024-12-06 00:59:31,543 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 755 transitions. [2024-12-06 00:59:31,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-12-06 00:59:31,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:31,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:31,616 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:31,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 571 states and 792 transitions. [2024-12-06 00:59:31,890 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 792 transitions. [2024-12-06 00:59:31,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 00:59:31,891 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:31,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:31,939 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 00:59:32,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 619 states and 845 transitions. [2024-12-06 00:59:32,660 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 845 transitions. [2024-12-06 00:59:32,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 00:59:32,661 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:32,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 00:59:33,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:33,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 645 states and 874 transitions. [2024-12-06 00:59:33,129 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 874 transitions. [2024-12-06 00:59:33,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 00:59:33,130 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:33,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:33,192 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 00:59:33,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:33,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 647 states and 875 transitions. [2024-12-06 00:59:33,348 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 875 transitions. [2024-12-06 00:59:33,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-12-06 00:59:33,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:33,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:33,453 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 00:59:33,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:33,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 671 states and 902 transitions. [2024-12-06 00:59:33,863 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 902 transitions. [2024-12-06 00:59:33,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-12-06 00:59:33,863 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:33,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:33,943 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 00:59:34,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:34,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 694 states and 928 transitions. [2024-12-06 00:59:34,389 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 928 transitions. [2024-12-06 00:59:34,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-12-06 00:59:34,390 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:34,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:34,489 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 00:59:34,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 696 states and 929 transitions. [2024-12-06 00:59:34,725 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 929 transitions. [2024-12-06 00:59:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-12-06 00:59:34,726 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:34,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 73 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:35,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:35,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 725 states and 961 transitions. [2024-12-06 00:59:35,312 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 961 transitions. [2024-12-06 00:59:35,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-12-06 00:59:35,313 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:35,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:35,399 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 73 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:35,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:35,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 751 states and 990 transitions. [2024-12-06 00:59:35,757 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 990 transitions. [2024-12-06 00:59:35,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-12-06 00:59:35,758 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:35,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:35,833 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 73 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:36,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:36,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 753 states and 991 transitions. [2024-12-06 00:59:36,001 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 991 transitions. [2024-12-06 00:59:36,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-12-06 00:59:36,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:36,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:36,078 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 00:59:36,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:36,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 762 states and 1002 transitions. [2024-12-06 00:59:36,216 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1002 transitions. [2024-12-06 00:59:36,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 00:59:36,217 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:36,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:36,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:36,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 794 states and 1036 transitions. [2024-12-06 00:59:36,704 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1036 transitions. [2024-12-06 00:59:36,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 00:59:36,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:36,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:36,749 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 00:59:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 795 states and 1037 transitions. [2024-12-06 00:59:36,790 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1037 transitions. [2024-12-06 00:59:36,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-06 00:59:36,790 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:36,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:36,852 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 00:59:36,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:36,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 797 states and 1039 transitions. [2024-12-06 00:59:36,919 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1039 transitions. [2024-12-06 00:59:36,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-12-06 00:59:36,921 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:36,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:36,997 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-06 00:59:37,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:37,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 824 states and 1068 transitions. [2024-12-06 00:59:37,231 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1068 transitions. [2024-12-06 00:59:37,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-06 00:59:37,232 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:37,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:37,279 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 00:59:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 833 states and 1078 transitions. [2024-12-06 00:59:37,589 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1078 transitions. [2024-12-06 00:59:37,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-06 00:59:37,590 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:37,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 00:59:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:37,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 842 states and 1089 transitions. [2024-12-06 00:59:37,904 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1089 transitions. [2024-12-06 00:59:37,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-06 00:59:37,905 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:37,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 00:59:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:38,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 845 states and 1091 transitions. [2024-12-06 00:59:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1091 transitions. [2024-12-06 00:59:38,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-06 00:59:38,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:38,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:38,222 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 00:59:38,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 846 states and 1092 transitions. [2024-12-06 00:59:38,264 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1092 transitions. [2024-12-06 00:59:38,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-06 00:59:38,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:38,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:38,312 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 00:59:38,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 847 states and 1093 transitions. [2024-12-06 00:59:38,354 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1093 transitions. [2024-12-06 00:59:38,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-06 00:59:38,355 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:38,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:38,407 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:38,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 876 states and 1123 transitions. [2024-12-06 00:59:38,582 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1123 transitions. [2024-12-06 00:59:38,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-06 00:59:38,583 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:38,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-06 00:59:38,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:38,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 883 states and 1131 transitions. [2024-12-06 00:59:38,911 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1131 transitions. [2024-12-06 00:59:38,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-06 00:59:38,911 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:38,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:38,988 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-06 00:59:39,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:39,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 890 states and 1141 transitions. [2024-12-06 00:59:39,404 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1141 transitions. [2024-12-06 00:59:39,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-06 00:59:39,405 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:39,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:39,506 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-06 00:59:39,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 893 states and 1143 transitions. [2024-12-06 00:59:39,746 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1143 transitions. [2024-12-06 00:59:39,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-06 00:59:39,746 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:39,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-12-06 00:59:40,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:40,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 899 states and 1151 transitions. [2024-12-06 00:59:40,016 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1151 transitions. [2024-12-06 00:59:40,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-06 00:59:40,017 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:40,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 966 states and 1225 transitions. [2024-12-06 00:59:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1225 transitions. [2024-12-06 00:59:41,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 00:59:41,860 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:41,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:41,934 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 00:59:42,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 968 states and 1227 transitions. [2024-12-06 00:59:42,003 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1227 transitions. [2024-12-06 00:59:42,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 00:59:42,004 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:42,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:42,065 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 00:59:42,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:42,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 970 states and 1229 transitions. [2024-12-06 00:59:42,129 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1229 transitions. [2024-12-06 00:59:42,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-06 00:59:42,130 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:42,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:42,240 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:42,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 999 states and 1258 transitions. [2024-12-06 00:59:42,453 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1258 transitions. [2024-12-06 00:59:42,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-06 00:59:42,455 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:42,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:43,000 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 71 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:45,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:45,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1066 states and 1329 transitions. [2024-12-06 00:59:45,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1329 transitions. [2024-12-06 00:59:45,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-06 00:59:45,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:45,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 71 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:48,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:48,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1130 states and 1398 transitions. [2024-12-06 00:59:48,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1398 transitions. [2024-12-06 00:59:48,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-06 00:59:48,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:48,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 71 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:48,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:48,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1135 states and 1401 transitions. [2024-12-06 00:59:48,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1401 transitions. [2024-12-06 00:59:48,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 00:59:48,920 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:48,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:50,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1141 states and 1408 transitions. [2024-12-06 00:59:50,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1408 transitions. [2024-12-06 00:59:50,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 00:59:50,101 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:50,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1146 states and 1414 transitions. [2024-12-06 00:59:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1414 transitions. [2024-12-06 00:59:51,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 00:59:51,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:51,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:51,302 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-06 00:59:52,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:52,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1167 states and 1439 transitions. [2024-12-06 00:59:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1439 transitions. [2024-12-06 00:59:52,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 00:59:52,141 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:52,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:52,233 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-06 00:59:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:52,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1170 states and 1442 transitions. [2024-12-06 00:59:52,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1442 transitions. [2024-12-06 00:59:52,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 00:59:52,574 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:52,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:52,627 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-06 00:59:52,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1172 states and 1444 transitions. [2024-12-06 00:59:52,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1444 transitions. [2024-12-06 00:59:52,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 00:59:52,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:52,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-06 00:59:53,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:53,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1175 states and 1447 transitions. [2024-12-06 00:59:53,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1447 transitions. [2024-12-06 00:59:53,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 00:59:53,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:53,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-06 00:59:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1200 states and 1472 transitions. [2024-12-06 00:59:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1472 transitions. [2024-12-06 00:59:53,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-06 00:59:53,435 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:53,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:53,578 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 00:59:54,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1248 states and 1525 transitions. [2024-12-06 00:59:54,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1525 transitions. [2024-12-06 00:59:54,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-06 00:59:54,623 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:54,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:54,675 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 00:59:55,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:55,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1293 states and 1577 transitions. [2024-12-06 00:59:55,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1577 transitions. [2024-12-06 00:59:55,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-06 00:59:55,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:55,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:55,544 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 00:59:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1295 states and 1578 transitions. [2024-12-06 00:59:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1578 transitions. [2024-12-06 00:59:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-06 00:59:55,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:55,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1321 states and 1606 transitions. [2024-12-06 00:59:56,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1606 transitions. [2024-12-06 00:59:56,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-06 00:59:56,212 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:56,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:56,254 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1346 states and 1636 transitions. [2024-12-06 00:59:57,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1636 transitions. [2024-12-06 00:59:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-06 00:59:57,193 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:57,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:57,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:57,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1366 states and 1656 transitions. [2024-12-06 00:59:57,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1656 transitions. [2024-12-06 00:59:57,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-06 00:59:57,561 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:57,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:57,602 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:57,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:57,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1368 states and 1657 transitions. [2024-12-06 00:59:57,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1657 transitions. [2024-12-06 00:59:57,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-06 00:59:57,846 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:57,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:57,901 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:58,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1370 states and 1658 transitions. [2024-12-06 00:59:58,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1658 transitions. [2024-12-06 00:59:58,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-12-06 00:59:58,134 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:58,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:59:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:58,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1377 states and 1665 transitions. [2024-12-06 00:59:58,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1665 transitions. [2024-12-06 00:59:58,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-06 00:59:58,516 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:58,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-12-06 00:59:58,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:58,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1378 states and 1675 transitions. [2024-12-06 00:59:58,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1675 transitions. [2024-12-06 00:59:58,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-12-06 00:59:58,698 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:58,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 91 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 00:59:59,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:59:59,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1381 states and 1682 transitions. [2024-12-06 00:59:59,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1682 transitions. [2024-12-06 00:59:59,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-12-06 00:59:59,679 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:59:59,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:59:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:59:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 91 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 01:00:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:00:00,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1384 states and 1686 transitions. [2024-12-06 01:00:00,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1686 transitions. [2024-12-06 01:00:00,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-12-06 01:00:00,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:00:00,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:00:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:00:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-12-06 01:00:00,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:00:00,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1403 states and 1705 transitions. [2024-12-06 01:00:00,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1705 transitions. [2024-12-06 01:00:00,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-12-06 01:00:00,305 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:00:00,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:00:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:00:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-12-06 01:00:00,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:00:00,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1404 states and 1705 transitions. [2024-12-06 01:00:00,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1705 transitions. [2024-12-06 01:00:00,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-12-06 01:00:00,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:00:00,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:00:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:00:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 01:00:01,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:00:01,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1483 states and 1786 transitions. [2024-12-06 01:00:01,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1786 transitions. [2024-12-06 01:00:01,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-12-06 01:00:01,013 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:00:01,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:00:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:00:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-12-06 01:00:01,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:00:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1484 states and 1786 transitions. [2024-12-06 01:00:01,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1786 transitions. [2024-12-06 01:00:01,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-06 01:00:01,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:00:01,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:00:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:00:01,256 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-12-06 01:00:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:00:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1403 states and 1698 transitions. [2024-12-06 01:00:01,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1698 transitions. [2024-12-06 01:00:01,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 01:00:01,364 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 76 iterations. [2024-12-06 01:00:01,371 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-06 01:00:12,469 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (let ((.cse2 (= ~a19~0 1))) (let ((.cse0 (not .cse2)) (.cse1 (= ~a25~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 (not (and (= ~a17~0 8) (= ~a28~0 10) (= ~a21~0 1) (not (= ~a11~0 1))))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse2) (and .cse0 (< ~a28~0 11)) (and .cse1 .cse2)))) [2024-12-06 01:00:12,469 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (let ((.cse2 (= ~a19~0 1))) (let ((.cse0 (not .cse2)) (.cse1 (= ~a25~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 (not (and (= ~a17~0 8) (= ~a28~0 10) (= ~a21~0 1) (not (= ~a11~0 1))))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse2) (and .cse0 (< ~a28~0 11)) (and .cse1 .cse2)))) [2024-12-06 01:00:12,469 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,470 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (let ((.cse2 (= ~a19~0 1))) (let ((.cse0 (not .cse2)) (.cse1 (= ~a25~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 (not (and (= ~a17~0 8) (= ~a28~0 10) (= ~a21~0 1) (not (= ~a11~0 1))))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse2) (and .cse0 (< ~a28~0 11)) (and .cse1 .cse2)))) [2024-12-06 01:00:12,470 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,470 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,470 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,470 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (let ((.cse2 (= ~a19~0 1))) (let ((.cse0 (not .cse2)) (.cse1 (= ~a25~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 (not (and (= ~a17~0 8) (= ~a28~0 10) (= ~a21~0 1) (not (= ~a11~0 1))))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse2) (and .cse0 (< ~a28~0 11)) (and .cse1 .cse2)))) [2024-12-06 01:00:12,470 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,470 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,470 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (let ((.cse2 (= ~a19~0 1))) (let ((.cse0 (not .cse2)) (.cse1 (= ~a25~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 (not (and (= ~a17~0 8) (= ~a28~0 10) (= ~a21~0 1) (not (= ~a11~0 1))))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse2) (and .cse0 (< ~a28~0 11)) (and .cse1 .cse2)))) [2024-12-06 01:00:12,470 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,471 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (let ((.cse2 (= ~a19~0 1))) (let ((.cse0 (not .cse2)) (.cse1 (= ~a25~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 (not (and (= ~a17~0 8) (= ~a28~0 10) (= ~a21~0 1) (not (= ~a11~0 1))))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse2) (and .cse0 (< ~a28~0 11)) (and .cse1 .cse2)))) [2024-12-06 01:00:12,471 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,471 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,471 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,471 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (let ((.cse2 (= ~a19~0 1))) (let ((.cse0 (not .cse2)) (.cse1 (= ~a25~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 (not (and (= ~a17~0 8) (= ~a28~0 10) (= ~a21~0 1) (not (= ~a11~0 1))))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse2) (and .cse0 (< ~a28~0 11)) (and .cse1 .cse2)))) [2024-12-06 01:00:12,471 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,471 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,471 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,471 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,472 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (let ((.cse2 (= ~a19~0 1))) (let ((.cse0 (not .cse2)) (.cse1 (= ~a25~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 (not (and (= ~a17~0 8) (= ~a28~0 10) (= ~a21~0 1) (not (= ~a11~0 1))))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse2) (and .cse0 (< ~a28~0 11)) (and .cse1 .cse2)))) [2024-12-06 01:00:12,472 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,472 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,472 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,472 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,472 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 01:00:12,472 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,472 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (let ((.cse2 (= ~a19~0 1))) (let ((.cse0 (not .cse2)) (.cse1 (= ~a25~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 (not (and (= ~a17~0 8) (= ~a28~0 10) (= ~a21~0 1) (not (= ~a11~0 1))))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse2) (and .cse0 (< ~a28~0 11)) (and .cse1 .cse2)))) [2024-12-06 01:00:12,472 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (let ((.cse2 (= ~a19~0 1))) (let ((.cse0 (not .cse2)) (.cse1 (= ~a25~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 (not (and (= ~a17~0 8) (= ~a28~0 10) (= ~a21~0 1) (not (= ~a11~0 1))))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse2) (and .cse0 (< ~a28~0 11)) (and .cse1 .cse2)))) [2024-12-06 01:00:12,473 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,473 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,473 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,473 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,473 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (let ((.cse2 (= ~a19~0 1))) (let ((.cse0 (not .cse2)) (.cse1 (= ~a25~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 (not (and (= ~a17~0 8) (= ~a28~0 10) (= ~a21~0 1) (not (= ~a11~0 1))))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse2) (and .cse0 (< ~a28~0 11)) (and .cse1 .cse2)))) [2024-12-06 01:00:12,473 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,473 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 542) no Hoare annotation was computed. [2024-12-06 01:00:12,473 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,473 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,474 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,474 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,474 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,474 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (let ((.cse2 (= ~a19~0 1))) (let ((.cse0 (not .cse2)) (.cse1 (= ~a25~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 (not (and (= ~a17~0 8) (= ~a28~0 10) (= ~a21~0 1) (not (= ~a11~0 1))))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse2) (and .cse0 (< ~a28~0 11)) (and .cse1 .cse2)))) [2024-12-06 01:00:12,474 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,474 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (let ((.cse2 (= ~a19~0 1))) (let ((.cse0 (not .cse2)) (.cse1 (= ~a25~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 (not (and (= ~a17~0 8) (= ~a28~0 10) (= ~a21~0 1) (not (= ~a11~0 1))))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse2) (and .cse0 (< ~a28~0 11)) (and .cse1 .cse2)))) [2024-12-06 01:00:12,474 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,474 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (let ((.cse2 (= ~a19~0 1))) (let ((.cse0 (not .cse2)) (.cse1 (= ~a25~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 (not (and (= ~a17~0 8) (= ~a28~0 10) (= ~a21~0 1) (not (= ~a11~0 1))))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse2) (and .cse0 (< ~a28~0 11)) (and .cse1 .cse2)))) [2024-12-06 01:00:12,474 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,474 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,474 INFO L77 FloydHoareUtils]: At program point L538-1(lines 39 608) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,474 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,475 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,475 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,475 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,475 INFO L77 FloydHoareUtils]: At program point L541-1(lines 39 608) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,475 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,475 INFO L75 FloydHoareUtils]: For program point L542(line 542) no Hoare annotation was computed. [2024-12-06 01:00:12,475 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,475 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-12-06 01:00:12,475 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,475 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,475 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,475 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,475 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,475 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,475 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,475 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,476 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (let ((.cse2 (= ~a19~0 1))) (let ((.cse0 (not .cse2)) (.cse1 (= ~a25~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 (not (and (= ~a17~0 8) (= ~a28~0 10) (= ~a21~0 1) (not (= ~a11~0 1))))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse2) (and .cse0 (< ~a28~0 11)) (and .cse1 .cse2)))) [2024-12-06 01:00:12,476 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,476 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,476 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (let ((.cse2 (= ~a19~0 1))) (let ((.cse0 (not .cse2)) (.cse1 (= ~a25~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 (not (and (= ~a17~0 8) (= ~a28~0 10) (= ~a21~0 1) (not (= ~a11~0 1))))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse2) (and .cse0 (< ~a28~0 11)) (and .cse1 .cse2)))) [2024-12-06 01:00:12,476 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,476 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,476 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,476 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,476 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,476 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (let ((.cse2 (= ~a19~0 1))) (let ((.cse0 (not .cse2)) (.cse1 (= ~a25~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 (not (and (= ~a17~0 8) (= ~a28~0 10) (= ~a21~0 1) (not (= ~a11~0 1))))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse2) (and .cse0 (< ~a28~0 11)) (and .cse1 .cse2)))) [2024-12-06 01:00:12,476 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 01:00:12,476 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (let ((.cse2 (= ~a19~0 1))) (let ((.cse0 (not .cse2)) (.cse1 (= ~a25~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 (not (and (= ~a17~0 8) (= ~a28~0 10) (= ~a21~0 1) (not (= ~a11~0 1))))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse2) (and .cse0 (< ~a28~0 11)) (and .cse1 .cse2)))) [2024-12-06 01:00:12,477 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (let ((.cse2 (= ~a19~0 1))) (let ((.cse0 (not .cse2)) (.cse1 (= ~a25~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 (not (and (= ~a17~0 8) (= ~a28~0 10) (= ~a21~0 1) (not (= ~a11~0 1))))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse2) (and .cse0 (< ~a28~0 11)) (and .cse1 .cse2)))) [2024-12-06 01:00:12,477 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,477 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,477 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,477 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (let ((.cse2 (= ~a19~0 1))) (let ((.cse0 (not .cse2)) (.cse1 (= ~a25~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 (not (and (= ~a17~0 8) (= ~a28~0 10) (= ~a21~0 1) (not (= ~a11~0 1))))) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse2) (and .cse0 (< ~a28~0 11)) (and .cse1 .cse2)))) [2024-12-06 01:00:12,477 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (not (and (<= 11 ~a28~0) (= ~a25~0 1) (not (= ~a19~0 1)))) [2024-12-06 01:00:12,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 01:00:12 ImpRootNode [2024-12-06 01:00:12,487 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 01:00:12,488 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 01:00:12,488 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 01:00:12,488 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 01:00:12,488 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:59:22" (3/4) ... [2024-12-06 01:00:12,490 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 01:00:12,503 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2024-12-06 01:00:12,503 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-12-06 01:00:12,504 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-12-06 01:00:12,505 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 01:00:12,617 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21cb25b0-2089-4647-a64e-b099d9fbca22/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 01:00:12,617 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21cb25b0-2089-4647-a64e-b099d9fbca22/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 01:00:12,617 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 01:00:12,618 INFO L158 Benchmark]: Toolchain (without parser) took 51678.68ms. Allocated memory was 117.4MB in the beginning and 696.3MB in the end (delta: 578.8MB). Free memory was 91.0MB in the beginning and 431.5MB in the end (delta: -340.5MB). Peak memory consumption was 239.8MB. Max. memory is 16.1GB. [2024-12-06 01:00:12,618 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 72.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 01:00:12,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.34ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 65.3MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 01:00:12,619 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.99ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 60.1MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 01:00:12,619 INFO L158 Benchmark]: Boogie Preprocessor took 46.91ms. Allocated memory is still 117.4MB. Free memory was 60.1MB in the beginning and 55.9MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 01:00:12,619 INFO L158 Benchmark]: RCFGBuilder took 1210.58ms. Allocated memory is still 117.4MB. Free memory was 55.9MB in the beginning and 30.2MB in the end (delta: 25.8MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2024-12-06 01:00:12,620 INFO L158 Benchmark]: CodeCheck took 49847.27ms. Allocated memory was 117.4MB in the beginning and 696.3MB in the end (delta: 578.8MB). Free memory was 30.2MB in the beginning and 444.1MB in the end (delta: -413.9MB). Peak memory consumption was 162.6MB. Max. memory is 16.1GB. [2024-12-06 01:00:12,620 INFO L158 Benchmark]: Witness Printer took 129.63ms. Allocated memory is still 696.3MB. Free memory was 444.1MB in the beginning and 431.5MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 01:00:12,622 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, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.7s, OverallIterations: 76, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 140552 SdHoareTripleChecker+Valid, 306.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 125378 mSDsluCounter, 26038 SdHoareTripleChecker+Invalid, 255.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20117 mSDsCounter, 54259 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 298690 IncrementalHoareTripleChecker+Invalid, 352949 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54259 mSolverCounterUnsat, 5921 mSDtfsCounter, 298690 mSolverCounterSat, 2.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75344 GetRequests, 73654 SyntacticMatches, 1218 SemanticMatches, 472 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129010 ImplicationChecksByTransitivity, 22.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 10381 NumberOfCodeBlocks, 10381 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 10306 ConstructedInterpolants, 0 QuantifiedInterpolants, 23373 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 75 InterpolantComputations, 62 PerfectInterpolantSequences, 5732/5830 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - PositiveResult [Line: 542]: 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: 39]: Location Invariant Derived location invariant: !(((11 <= a28) && (a25 == 1)) && (a19 != 1)) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: !(((11 <= a28) && (a25 == 1)) && (a19 != 1)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 72.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.34ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 65.3MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.99ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 60.1MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.91ms. Allocated memory is still 117.4MB. Free memory was 60.1MB in the beginning and 55.9MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1210.58ms. Allocated memory is still 117.4MB. Free memory was 55.9MB in the beginning and 30.2MB in the end (delta: 25.8MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * CodeCheck took 49847.27ms. Allocated memory was 117.4MB in the beginning and 696.3MB in the end (delta: 578.8MB). Free memory was 30.2MB in the beginning and 444.1MB in the end (delta: -413.9MB). Peak memory consumption was 162.6MB. Max. memory is 16.1GB. * Witness Printer took 129.63ms. Allocated memory is still 696.3MB. Free memory was 444.1MB in the beginning and 431.5MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 01:00:12,639 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21cb25b0-2089-4647-a64e-b099d9fbca22/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE