./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/loop-invgen/id_build.i.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64eb06-1d0b-4ae9-a6e0-34b8b89237e0/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64eb06-1d0b-4ae9-a6e0-34b8b89237e0/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_da64eb06-1d0b-4ae9-a6e0-34b8b89237e0/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64eb06-1d0b-4ae9-a6e0-34b8b89237e0/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/loop-invgen/id_build.i.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64eb06-1d0b-4ae9-a6e0-34b8b89237e0/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Overflow-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64eb06-1d0b-4ae9-a6e0-34b8b89237e0/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f03a9521f9986f7627623e3bf6c079dbfbe3dc9d9c229ed8d14a2828a7d6850 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 01:41:36,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 01:41:36,893 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64eb06-1d0b-4ae9-a6e0-34b8b89237e0/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Overflow-32bit-Kojak_Default.epf [2024-12-06 01:41:36,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 01:41:36,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 01:41:36,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 01:41:36,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 01:41:36,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 01:41:36,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 01:41:36,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 01:41:36,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 01:41:36,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 01:41:36,917 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 01:41:36,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 01:41:36,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 01:41:36,917 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 01:41:36,917 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 01:41:36,917 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 01:41:36,917 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 01:41:36,918 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-12-06 01:41:36,918 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-06 01:41:36,918 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 01:41:36,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 01:41:36,918 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 01:41:36,918 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 01:41:36,918 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 01:41:36,918 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 01:41:36,918 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 01:41:36,918 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 01:41:36,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 01:41:36,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 01:41:36,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 01:41:36,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 01:41:36,919 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 01:41:36,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 01:41:36,919 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_da64eb06-1d0b-4ae9-a6e0-34b8b89237e0/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 ! overflow) ) 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 -> 2f03a9521f9986f7627623e3bf6c079dbfbe3dc9d9c229ed8d14a2828a7d6850 [2024-12-06 01:41:37,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 01:41:37,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 01:41:37,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 01:41:37,145 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 01:41:37,145 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 01:41:37,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64eb06-1d0b-4ae9-a6e0-34b8b89237e0/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/loop-invgen/id_build.i.v+lhb-reducer.c [2024-12-06 01:41:39,738 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64eb06-1d0b-4ae9-a6e0-34b8b89237e0/bin/ukojak-verify-CZk0znPC7b/data/2023cf3dd/b63f7aada4eb4799ae9fc626375306ff/FLAG5df48825b [2024-12-06 01:41:39,957 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 01:41:39,958 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64eb06-1d0b-4ae9-a6e0-34b8b89237e0/sv-benchmarks/c/loop-invgen/id_build.i.v+lhb-reducer.c [2024-12-06 01:41:39,964 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64eb06-1d0b-4ae9-a6e0-34b8b89237e0/bin/ukojak-verify-CZk0znPC7b/data/2023cf3dd/b63f7aada4eb4799ae9fc626375306ff/FLAG5df48825b [2024-12-06 01:41:40,322 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64eb06-1d0b-4ae9-a6e0-34b8b89237e0/bin/ukojak-verify-CZk0znPC7b/data/2023cf3dd/b63f7aada4eb4799ae9fc626375306ff [2024-12-06 01:41:40,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 01:41:40,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 01:41:40,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 01:41:40,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 01:41:40,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 01:41:40,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:41:40" (1/1) ... [2024-12-06 01:41:40,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2517c4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:40, skipping insertion in model container [2024-12-06 01:41:40,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:41:40" (1/1) ... [2024-12-06 01:41:40,345 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 01:41:40,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 01:41:40,476 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 01:41:40,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 01:41:40,505 INFO L204 MainTranslator]: Completed translation [2024-12-06 01:41:40,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:40 WrapperNode [2024-12-06 01:41:40,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 01:41:40,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 01:41:40,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 01:41:40,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 01:41:40,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:40" (1/1) ... [2024-12-06 01:41:40,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:40" (1/1) ... [2024-12-06 01:41:40,528 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2024-12-06 01:41:40,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 01:41:40,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 01:41:40,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 01:41:40,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 01:41:40,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:40" (1/1) ... [2024-12-06 01:41:40,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:40" (1/1) ... [2024-12-06 01:41:40,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:40" (1/1) ... [2024-12-06 01:41:40,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:40" (1/1) ... [2024-12-06 01:41:40,539 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:40" (1/1) ... [2024-12-06 01:41:40,540 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:40" (1/1) ... [2024-12-06 01:41:40,542 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:40" (1/1) ... [2024-12-06 01:41:40,543 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:40" (1/1) ... [2024-12-06 01:41:40,544 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:40" (1/1) ... [2024-12-06 01:41:40,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 01:41:40,546 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 01:41:40,546 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 01:41:40,546 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 01:41:40,547 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:40" (1/1) ... [2024-12-06 01:41:40,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 01:41:40,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64eb06-1d0b-4ae9-a6e0-34b8b89237e0/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 01:41:40,573 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64eb06-1d0b-4ae9-a6e0-34b8b89237e0/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 01:41:40,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64eb06-1d0b-4ae9-a6e0-34b8b89237e0/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 01:41:40,597 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-12-06 01:41:40,597 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-12-06 01:41:40,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 01:41:40,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 01:41:40,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 01:41:40,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 01:41:40,641 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 01:41:40,643 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 01:41:40,789 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-12-06 01:41:40,789 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 01:41:40,808 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 01:41:40,808 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-06 01:41:40,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:41:40 BoogieIcfgContainer [2024-12-06 01:41:40,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 01:41:40,809 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 01:41:40,809 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 01:41:40,816 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 01:41:40,816 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:41:40" (1/1) ... [2024-12-06 01:41:40,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 01:41:40,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:40,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 55 states and 63 transitions. [2024-12-06 01:41:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2024-12-06 01:41:40,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-06 01:41:40,863 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:40,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:40,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:41,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:41,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 58 states and 70 transitions. [2024-12-06 01:41:41,058 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2024-12-06 01:41:41,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-06 01:41:41,058 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:41,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:41,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 50 states and 57 transitions. [2024-12-06 01:41:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-12-06 01:41:41,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-06 01:41:41,171 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:41,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:41,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 49 states and 56 transitions. [2024-12-06 01:41:41,413 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2024-12-06 01:41:41,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 01:41:41,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:41,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:41,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 48 states and 55 transitions. [2024-12-06 01:41:41,763 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2024-12-06 01:41:41,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 01:41:41,763 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:41,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:41,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 47 states and 54 transitions. [2024-12-06 01:41:42,123 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2024-12-06 01:41:42,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 01:41:42,126 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:42,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:42,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:42,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 49 states and 56 transitions. [2024-12-06 01:41:42,283 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2024-12-06 01:41:42,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 01:41:42,283 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:42,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:42,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:42,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 52 states and 60 transitions. [2024-12-06 01:41:42,375 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2024-12-06 01:41:42,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 01:41:42,376 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:42,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:42,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:42,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 56 states and 66 transitions. [2024-12-06 01:41:42,583 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2024-12-06 01:41:42,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 01:41:42,583 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:42,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:42,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:42,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 61 states and 73 transitions. [2024-12-06 01:41:42,754 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2024-12-06 01:41:42,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 01:41:42,754 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:42,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:42,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:42,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 68 states and 84 transitions. [2024-12-06 01:41:42,970 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2024-12-06 01:41:42,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 01:41:42,971 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:42,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:43,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:43,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 69 states and 85 transitions. [2024-12-06 01:41:43,013 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2024-12-06 01:41:43,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 01:41:43,014 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:43,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 74 states and 94 transitions. [2024-12-06 01:41:43,243 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2024-12-06 01:41:43,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 01:41:43,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:43,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:43,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:43,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 79 states and 105 transitions. [2024-12-06 01:41:43,480 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 105 transitions. [2024-12-06 01:41:43,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 01:41:43,480 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:43,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:43,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:43,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 85 states and 116 transitions. [2024-12-06 01:41:43,594 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 116 transitions. [2024-12-06 01:41:43,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 01:41:43,594 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:43,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 86 states and 117 transitions. [2024-12-06 01:41:43,636 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2024-12-06 01:41:43,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 01:41:43,637 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:43,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:43,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:43,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 94 states and 130 transitions. [2024-12-06 01:41:43,812 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions. [2024-12-06 01:41:43,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 01:41:43,813 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:43,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 98 states and 135 transitions. [2024-12-06 01:41:43,896 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2024-12-06 01:41:43,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 01:41:43,897 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:43,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:44,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 99 states and 137 transitions. [2024-12-06 01:41:44,092 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 137 transitions. [2024-12-06 01:41:44,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-06 01:41:44,093 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:44,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 01:41:44,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:44,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 100 states and 139 transitions. [2024-12-06 01:41:44,151 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2024-12-06 01:41:44,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 01:41:44,152 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:44,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 01:41:44,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:44,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 101 states and 141 transitions. [2024-12-06 01:41:44,208 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2024-12-06 01:41:44,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-06 01:41:44,209 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:44,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:44,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 01:41:44,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:44,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 103 states and 144 transitions. [2024-12-06 01:41:44,283 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 144 transitions. [2024-12-06 01:41:44,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-06 01:41:44,284 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:44,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:44,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-06 01:41:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:44,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 104 states and 145 transitions. [2024-12-06 01:41:44,360 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 145 transitions. [2024-12-06 01:41:44,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-06 01:41:44,360 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:44,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:44,429 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:44,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:44,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 117 states and 162 transitions. [2024-12-06 01:41:44,899 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 162 transitions. [2024-12-06 01:41:44,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-06 01:41:44,899 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:44,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:45,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 121 states and 173 transitions. [2024-12-06 01:41:45,364 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 173 transitions. [2024-12-06 01:41:45,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-06 01:41:45,365 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:45,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 01:41:45,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 124 states and 178 transitions. [2024-12-06 01:41:45,768 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 178 transitions. [2024-12-06 01:41:45,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-06 01:41:45,768 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:45,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:45,799 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 01:41:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 127 states and 183 transitions. [2024-12-06 01:41:46,068 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 183 transitions. [2024-12-06 01:41:46,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-06 01:41:46,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:46,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:46,102 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 01:41:46,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 130 states and 187 transitions. [2024-12-06 01:41:46,312 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 187 transitions. [2024-12-06 01:41:46,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 01:41:46,312 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:46,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:46,347 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 01:41:46,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:46,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 134 states and 192 transitions. [2024-12-06 01:41:46,691 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 192 transitions. [2024-12-06 01:41:46,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 01:41:46,691 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:46,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 01:41:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:46,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 137 states and 196 transitions. [2024-12-06 01:41:46,766 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 196 transitions. [2024-12-06 01:41:46,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 01:41:46,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:46,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 01:41:46,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 138 states and 200 transitions. [2024-12-06 01:41:46,858 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 200 transitions. [2024-12-06 01:41:46,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 01:41:46,858 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:46,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:46,878 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 01:41:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:46,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 141 states and 205 transitions. [2024-12-06 01:41:46,933 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 205 transitions. [2024-12-06 01:41:46,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 01:41:46,934 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:46,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:46,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 01:41:47,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:47,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 142 states and 206 transitions. [2024-12-06 01:41:47,086 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 206 transitions. [2024-12-06 01:41:47,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 01:41:47,086 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:47,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:47,104 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 01:41:47,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:47,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 143 states and 207 transitions. [2024-12-06 01:41:47,232 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 207 transitions. [2024-12-06 01:41:47,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 01:41:47,233 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:47,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:47,301 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:47,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:47,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 157 states and 223 transitions. [2024-12-06 01:41:47,768 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 223 transitions. [2024-12-06 01:41:47,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-12-06 01:41:47,768 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:47,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:47,877 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 01:41:48,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 160 states and 233 transitions. [2024-12-06 01:41:48,560 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 233 transitions. [2024-12-06 01:41:48,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-12-06 01:41:48,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:48,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:48,578 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-06 01:41:48,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:48,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 162 states and 237 transitions. [2024-12-06 01:41:48,711 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 237 transitions. [2024-12-06 01:41:48,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-12-06 01:41:48,711 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:48,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-12-06 01:41:49,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:49,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 162 states and 236 transitions. [2024-12-06 01:41:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 236 transitions. [2024-12-06 01:41:49,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-12-06 01:41:49,038 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:49,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:49,078 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-06 01:41:49,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:49,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 164 states and 238 transitions. [2024-12-06 01:41:49,196 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 238 transitions. [2024-12-06 01:41:49,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-12-06 01:41:49,197 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:49,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:49,224 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-06 01:41:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:49,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 167 states and 241 transitions. [2024-12-06 01:41:49,422 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 241 transitions. [2024-12-06 01:41:49,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-12-06 01:41:49,422 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:49,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:49,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 181 states and 257 transitions. [2024-12-06 01:41:49,946 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 257 transitions. [2024-12-06 01:41:49,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-12-06 01:41:49,947 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:49,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:50,052 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 16 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 195 states and 273 transitions. [2024-12-06 01:41:50,575 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 273 transitions. [2024-12-06 01:41:50,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-12-06 01:41:50,575 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:50,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:50,691 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:51,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:51,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 209 states and 289 transitions. [2024-12-06 01:41:51,239 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 289 transitions. [2024-12-06 01:41:51,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-06 01:41:51,240 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:51,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 26 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:51,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:51,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 223 states and 305 transitions. [2024-12-06 01:41:51,952 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 305 transitions. [2024-12-06 01:41:51,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-06 01:41:51,953 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:51,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 31 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:41:52,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:52,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 237 states and 320 transitions. [2024-12-06 01:41:52,504 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 320 transitions. [2024-12-06 01:41:52,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-12-06 01:41:52,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:52,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-12-06 01:41:53,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:53,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 243 states and 333 transitions. [2024-12-06 01:41:53,626 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 333 transitions. [2024-12-06 01:41:53,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-12-06 01:41:53,627 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:53,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:53,667 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2024-12-06 01:41:54,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 244 states and 334 transitions. [2024-12-06 01:41:54,069 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 334 transitions. [2024-12-06 01:41:54,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-12-06 01:41:54,070 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:54,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:54,114 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-12-06 01:41:54,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:54,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 246 states and 336 transitions. [2024-12-06 01:41:54,395 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 336 transitions. [2024-12-06 01:41:54,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-12-06 01:41:54,396 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:54,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-12-06 01:41:54,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 247 states and 336 transitions. [2024-12-06 01:41:54,539 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 336 transitions. [2024-12-06 01:41:54,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-06 01:41:54,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:54,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-12-06 01:41:55,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:55,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 249 states and 338 transitions. [2024-12-06 01:41:55,226 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 338 transitions. [2024-12-06 01:41:55,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-06 01:41:55,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:55,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:55,280 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-12-06 01:41:56,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:56,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 259 states and 351 transitions. [2024-12-06 01:41:56,028 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 351 transitions. [2024-12-06 01:41:56,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-06 01:41:56,028 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:56,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2024-12-06 01:41:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:56,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 260 states and 352 transitions. [2024-12-06 01:41:56,502 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 352 transitions. [2024-12-06 01:41:56,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-06 01:41:56,503 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:56,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:56,556 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 116 proven. 1 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-12-06 01:41:56,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:56,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 261 states and 357 transitions. [2024-12-06 01:41:56,756 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 357 transitions. [2024-12-06 01:41:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-12-06 01:41:56,757 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:56,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2024-12-06 01:41:57,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:57,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 263 states and 360 transitions. [2024-12-06 01:41:57,156 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 360 transitions. [2024-12-06 01:41:57,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-12-06 01:41:57,157 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:57,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2024-12-06 01:41:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 267 states and 365 transitions. [2024-12-06 01:41:57,459 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 365 transitions. [2024-12-06 01:41:57,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-12-06 01:41:57,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:57,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:57,491 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-12-06 01:41:57,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:57,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 272 states and 371 transitions. [2024-12-06 01:41:57,747 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 371 transitions. [2024-12-06 01:41:57,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 01:41:57,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:57,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:57,771 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-12-06 01:41:58,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:58,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 277 states and 379 transitions. [2024-12-06 01:41:58,414 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 379 transitions. [2024-12-06 01:41:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-06 01:41:58,414 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:58,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:58,441 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2024-12-06 01:41:58,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 277 states and 378 transitions. [2024-12-06 01:41:58,829 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 378 transitions. [2024-12-06 01:41:58,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-12-06 01:41:58,829 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:58,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:58,859 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-12-06 01:41:59,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:41:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 279 states and 379 transitions. [2024-12-06 01:41:59,122 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 379 transitions. [2024-12-06 01:41:59,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-12-06 01:41:59,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:41:59,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:41:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:41:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 206 proven. 13 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-12-06 01:42:00,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 290 states and 394 transitions. [2024-12-06 01:42:00,433 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 394 transitions. [2024-12-06 01:42:00,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-12-06 01:42:00,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:00,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:00,468 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 206 proven. 13 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-12-06 01:42:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:00,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 294 states and 397 transitions. [2024-12-06 01:42:00,680 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 397 transitions. [2024-12-06 01:42:00,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-06 01:42:00,681 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:00,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:00,707 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 473 trivial. 0 not checked. [2024-12-06 01:42:01,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:01,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 300 states and 406 transitions. [2024-12-06 01:42:01,799 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 406 transitions. [2024-12-06 01:42:01,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-06 01:42:01,799 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:01,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 473 trivial. 0 not checked. [2024-12-06 01:42:02,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 296 states and 400 transitions. [2024-12-06 01:42:02,110 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 400 transitions. [2024-12-06 01:42:02,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-06 01:42:02,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:02,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 604 trivial. 0 not checked. [2024-12-06 01:42:02,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 297 states and 401 transitions. [2024-12-06 01:42:02,752 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 401 transitions. [2024-12-06 01:42:02,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-06 01:42:02,753 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:02,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:02,870 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 223 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2024-12-06 01:42:05,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:05,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 324 states and 450 transitions. [2024-12-06 01:42:05,548 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 450 transitions. [2024-12-06 01:42:05,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-06 01:42:05,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:05,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:05,612 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 223 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2024-12-06 01:42:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 328 states and 453 transitions. [2024-12-06 01:42:05,928 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 453 transitions. [2024-12-06 01:42:05,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 01:42:05,928 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:05,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:05,959 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-12-06 01:42:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:06,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 334 states and 464 transitions. [2024-12-06 01:42:06,998 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 464 transitions. [2024-12-06 01:42:06,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 01:42:06,998 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:06,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:07,113 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2024-12-06 01:42:09,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:09,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 366 states and 515 transitions. [2024-12-06 01:42:09,062 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 515 transitions. [2024-12-06 01:42:09,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-06 01:42:09,062 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:09,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:09,090 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-12-06 01:42:09,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:09,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 370 states and 522 transitions. [2024-12-06 01:42:09,646 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 522 transitions. [2024-12-06 01:42:09,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-06 01:42:09,646 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:09,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-12-06 01:42:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:09,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 371 states and 524 transitions. [2024-12-06 01:42:09,962 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 524 transitions. [2024-12-06 01:42:09,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-06 01:42:09,963 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:09,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:10,007 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-12-06 01:42:10,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 373 states and 526 transitions. [2024-12-06 01:42:10,658 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 526 transitions. [2024-12-06 01:42:10,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 01:42:10,658 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:10,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:10,690 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2024-12-06 01:42:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:11,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 375 states and 528 transitions. [2024-12-06 01:42:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 528 transitions. [2024-12-06 01:42:11,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-06 01:42:11,182 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:11,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:11,236 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 272 proven. 16 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-12-06 01:42:12,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 389 states and 544 transitions. [2024-12-06 01:42:12,095 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 544 transitions. [2024-12-06 01:42:12,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-12-06 01:42:12,095 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:12,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2024-12-06 01:42:14,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:14,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 400 states and 561 transitions. [2024-12-06 01:42:14,085 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 561 transitions. [2024-12-06 01:42:14,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-12-06 01:42:14,086 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:14,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:14,119 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2024-12-06 01:42:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 404 states and 564 transitions. [2024-12-06 01:42:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 564 transitions. [2024-12-06 01:42:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-12-06 01:42:14,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:14,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:14,493 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2024-12-06 01:42:15,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 407 states and 568 transitions. [2024-12-06 01:42:15,569 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 568 transitions. [2024-12-06 01:42:15,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-12-06 01:42:15,570 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:15,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:15,630 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2024-12-06 01:42:17,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:17,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 416 states and 581 transitions. [2024-12-06 01:42:17,066 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 581 transitions. [2024-12-06 01:42:17,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-12-06 01:42:17,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:17,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2024-12-06 01:42:17,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:17,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 420 states and 584 transitions. [2024-12-06 01:42:17,529 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 584 transitions. [2024-12-06 01:42:17,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-12-06 01:42:17,530 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:17,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 0 proven. 331 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2024-12-06 01:42:19,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:19,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 433 states and 601 transitions. [2024-12-06 01:42:19,011 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 601 transitions. [2024-12-06 01:42:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-12-06 01:42:19,011 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:19,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 751 trivial. 0 not checked. [2024-12-06 01:42:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:19,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 437 states and 605 transitions. [2024-12-06 01:42:19,757 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 605 transitions. [2024-12-06 01:42:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-12-06 01:42:19,757 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:19,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:19,801 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2024-12-06 01:42:20,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:20,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 440 states and 608 transitions. [2024-12-06 01:42:20,188 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 608 transitions. [2024-12-06 01:42:20,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-12-06 01:42:20,188 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:20,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:20,239 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 384 proven. 45 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-12-06 01:42:21,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:21,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 454 states and 624 transitions. [2024-12-06 01:42:21,034 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 624 transitions. [2024-12-06 01:42:21,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-06 01:42:21,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:21,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:21,108 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 496 proven. 88 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-12-06 01:42:21,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:21,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 468 states and 640 transitions. [2024-12-06 01:42:21,836 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 640 transitions. [2024-12-06 01:42:21,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-12-06 01:42:21,837 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:21,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 608 proven. 145 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-12-06 01:42:22,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:22,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 482 states and 656 transitions. [2024-12-06 01:42:22,788 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 656 transitions. [2024-12-06 01:42:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 01:42:22,788 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:22,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1293 backedges. 720 proven. 216 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-12-06 01:42:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:23,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 496 states and 672 transitions. [2024-12-06 01:42:23,758 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 672 transitions. [2024-12-06 01:42:23,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-12-06 01:42:23,759 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:23,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:23,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 832 proven. 301 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-12-06 01:42:24,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:24,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 510 states and 687 transitions. [2024-12-06 01:42:24,678 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 687 transitions. [2024-12-06 01:42:24,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 01:42:24,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:24,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1701 backedges. 42 proven. 902 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2024-12-06 01:42:25,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 511 states and 689 transitions. [2024-12-06 01:42:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 689 transitions. [2024-12-06 01:42:25,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-12-06 01:42:25,417 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:25,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2099 backedges. 461 proven. 0 refuted. 0 times theorem prover too weak. 1638 trivial. 0 not checked. [2024-12-06 01:42:29,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:29,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 542 states and 746 transitions. [2024-12-06 01:42:29,939 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 746 transitions. [2024-12-06 01:42:29,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-12-06 01:42:29,940 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:29,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2099 backedges. 461 proven. 0 refuted. 0 times theorem prover too weak. 1638 trivial. 0 not checked. [2024-12-06 01:42:30,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:30,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 546 states and 749 transitions. [2024-12-06 01:42:30,414 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 749 transitions. [2024-12-06 01:42:30,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-12-06 01:42:30,415 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:30,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:30,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 0 proven. 461 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2024-12-06 01:42:31,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 553 states and 765 transitions. [2024-12-06 01:42:31,930 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 765 transitions. [2024-12-06 01:42:31,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-12-06 01:42:31,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:31,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2131 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2131 trivial. 0 not checked. [2024-12-06 01:42:32,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 555 states and 766 transitions. [2024-12-06 01:42:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 766 transitions. [2024-12-06 01:42:32,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-12-06 01:42:32,635 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:32,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:32,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2131 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2131 trivial. 0 not checked. [2024-12-06 01:42:33,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:33,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 556 states and 769 transitions. [2024-12-06 01:42:33,570 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 769 transitions. [2024-12-06 01:42:33,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-12-06 01:42:33,571 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:33,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:33,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2131 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2131 trivial. 0 not checked. [2024-12-06 01:42:34,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:34,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 557 states and 771 transitions. [2024-12-06 01:42:34,150 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 771 transitions. [2024-12-06 01:42:34,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-12-06 01:42:34,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:34,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2148 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 1646 trivial. 0 not checked. [2024-12-06 01:42:34,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:34,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 561 states and 778 transitions. [2024-12-06 01:42:34,949 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 778 transitions. [2024-12-06 01:42:34,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-12-06 01:42:34,950 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:34,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2148 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 1646 trivial. 0 not checked. [2024-12-06 01:42:35,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:35,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 565 states and 785 transitions. [2024-12-06 01:42:35,877 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 785 transitions. [2024-12-06 01:42:35,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-12-06 01:42:35,878 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:35,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:35,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2148 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 1646 trivial. 0 not checked. [2024-12-06 01:42:36,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:36,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 566 states and 787 transitions. [2024-12-06 01:42:36,297 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 787 transitions. [2024-12-06 01:42:36,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-12-06 01:42:36,298 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:36,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:36,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2148 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 1646 trivial. 0 not checked. [2024-12-06 01:42:36,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 567 states and 789 transitions. [2024-12-06 01:42:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 789 transitions. [2024-12-06 01:42:36,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-12-06 01:42:36,878 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:36,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:36,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2165 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 1715 trivial. 0 not checked. [2024-12-06 01:42:37,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:37,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 569 states and 795 transitions. [2024-12-06 01:42:37,822 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 795 transitions. [2024-12-06 01:42:37,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-12-06 01:42:37,823 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:37,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:37,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2165 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 1715 trivial. 0 not checked. [2024-12-06 01:42:38,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:38,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 570 states and 797 transitions. [2024-12-06 01:42:38,301 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 797 transitions. [2024-12-06 01:42:38,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-12-06 01:42:38,302 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:38,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2140 trivial. 0 not checked. [2024-12-06 01:42:38,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:38,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 572 states and 798 transitions. [2024-12-06 01:42:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 798 transitions. [2024-12-06 01:42:38,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-12-06 01:42:38,905 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:38,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:38,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2140 trivial. 0 not checked. [2024-12-06 01:42:39,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:39,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 573 states and 798 transitions. [2024-12-06 01:42:39,561 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 798 transitions. [2024-12-06 01:42:39,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-12-06 01:42:39,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:39,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:39,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2157 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2157 trivial. 0 not checked. [2024-12-06 01:42:40,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:40,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 575 states and 799 transitions. [2024-12-06 01:42:40,136 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 799 transitions. [2024-12-06 01:42:40,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-12-06 01:42:40,136 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:40,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:40,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2157 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2157 trivial. 0 not checked. [2024-12-06 01:42:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 576 states and 799 transitions. [2024-12-06 01:42:40,819 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 799 transitions. [2024-12-06 01:42:40,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-12-06 01:42:40,820 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:40,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2191 backedges. 551 proven. 16 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-12-06 01:42:42,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:42,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 590 states and 817 transitions. [2024-12-06 01:42:42,458 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 817 transitions. [2024-12-06 01:42:42,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-12-06 01:42:42,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:42,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:42,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2191 backedges. 551 proven. 16 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-12-06 01:42:43,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:43,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 594 states and 820 transitions. [2024-12-06 01:42:43,012 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 820 transitions. [2024-12-06 01:42:43,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-12-06 01:42:43,013 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:43,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2308 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 2061 trivial. 0 not checked. [2024-12-06 01:42:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 594 states and 819 transitions. [2024-12-06 01:42:43,522 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 819 transitions. [2024-12-06 01:42:43,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-12-06 01:42:43,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:43,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:43,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2308 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 2061 trivial. 0 not checked. [2024-12-06 01:42:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 594 states and 818 transitions. [2024-12-06 01:42:44,098 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 818 transitions. [2024-12-06 01:42:44,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-12-06 01:42:44,099 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:44,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:44,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2348 backedges. 681 proven. 0 refuted. 0 times theorem prover too weak. 1667 trivial. 0 not checked. [2024-12-06 01:42:46,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:46,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 607 states and 835 transitions. [2024-12-06 01:42:46,159 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 835 transitions. [2024-12-06 01:42:46,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-12-06 01:42:46,160 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:46,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:46,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2348 backedges. 681 proven. 0 refuted. 0 times theorem prover too weak. 1667 trivial. 0 not checked. [2024-12-06 01:42:46,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 611 states and 838 transitions. [2024-12-06 01:42:46,750 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 838 transitions. [2024-12-06 01:42:46,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-12-06 01:42:46,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:46,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:46,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2348 backedges. 681 proven. 0 refuted. 0 times theorem prover too weak. 1667 trivial. 0 not checked. [2024-12-06 01:42:47,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:47,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 612 states and 839 transitions. [2024-12-06 01:42:47,257 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 839 transitions. [2024-12-06 01:42:47,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-12-06 01:42:47,258 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:47,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 0 proven. 681 refuted. 0 times theorem prover too weak. 1669 trivial. 0 not checked. [2024-12-06 01:42:48,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:48,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 616 states and 846 transitions. [2024-12-06 01:42:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 846 transitions. [2024-12-06 01:42:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-12-06 01:42:48,657 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:48,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2382 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2382 trivial. 0 not checked. [2024-12-06 01:42:49,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 618 states and 847 transitions. [2024-12-06 01:42:49,482 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 847 transitions. [2024-12-06 01:42:49,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-12-06 01:42:49,483 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:49,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2382 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2382 trivial. 0 not checked. [2024-12-06 01:42:50,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:50,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 622 states and 851 transitions. [2024-12-06 01:42:50,413 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 851 transitions. [2024-12-06 01:42:50,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-12-06 01:42:50,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:50,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:50,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2382 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2382 trivial. 0 not checked. [2024-12-06 01:42:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 622 states and 850 transitions. [2024-12-06 01:42:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 850 transitions. [2024-12-06 01:42:51,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-12-06 01:42:51,114 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:51,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:51,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2400 backedges. 722 proven. 0 refuted. 0 times theorem prover too weak. 1678 trivial. 0 not checked. [2024-12-06 01:42:51,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:51,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 625 states and 853 transitions. [2024-12-06 01:42:51,564 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 853 transitions. [2024-12-06 01:42:51,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-12-06 01:42:51,564 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:51,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:51,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2400 backedges. 722 proven. 0 refuted. 0 times theorem prover too weak. 1678 trivial. 0 not checked. [2024-12-06 01:42:52,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:52,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 628 states and 856 transitions. [2024-12-06 01:42:52,291 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 856 transitions. [2024-12-06 01:42:52,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-12-06 01:42:52,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:52,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 675 proven. 0 refuted. 0 times theorem prover too weak. 1743 trivial. 0 not checked. [2024-12-06 01:42:52,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 628 states and 855 transitions. [2024-12-06 01:42:52,783 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 855 transitions. [2024-12-06 01:42:52,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-12-06 01:42:52,784 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:52,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:52,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2445 backedges. 776 proven. 45 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-12-06 01:42:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:54,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 642 states and 873 transitions. [2024-12-06 01:42:54,242 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 873 transitions. [2024-12-06 01:42:54,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-12-06 01:42:54,242 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:54,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:54,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2445 backedges. 776 proven. 45 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-12-06 01:42:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 646 states and 876 transitions. [2024-12-06 01:42:54,790 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 876 transitions. [2024-12-06 01:42:54,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-12-06 01:42:54,791 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:54,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2713 backedges. 1001 proven. 88 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-12-06 01:42:56,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:56,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 660 states and 894 transitions. [2024-12-06 01:42:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 894 transitions. [2024-12-06 01:42:56,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-12-06 01:42:56,587 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:56,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2713 backedges. 1001 proven. 88 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-12-06 01:42:57,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 664 states and 897 transitions. [2024-12-06 01:42:57,221 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 897 transitions. [2024-12-06 01:42:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-12-06 01:42:57,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:57,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2995 backedges. 1226 proven. 145 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-12-06 01:42:58,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 678 states and 915 transitions. [2024-12-06 01:42:58,931 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 915 transitions. [2024-12-06 01:42:58,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-12-06 01:42:58,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:58,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:59,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2995 backedges. 1226 proven. 145 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-12-06 01:42:59,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:42:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 682 states and 918 transitions. [2024-12-06 01:42:59,573 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 918 transitions. [2024-12-06 01:42:59,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-12-06 01:42:59,573 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:42:59,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:42:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:42:59,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3291 backedges. 1451 proven. 216 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-12-06 01:43:01,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:43:01,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 696 states and 936 transitions. [2024-12-06 01:43:01,292 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 936 transitions. [2024-12-06 01:43:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-12-06 01:43:01,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:43:01,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:43:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:43:01,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3291 backedges. 1451 proven. 216 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-12-06 01:43:02,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:43:02,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 700 states and 939 transitions. [2024-12-06 01:43:02,097 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 939 transitions. [2024-12-06 01:43:02,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-12-06 01:43:02,098 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:43:02,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:43:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:43:02,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3601 backedges. 1676 proven. 301 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-12-06 01:43:03,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:43:03,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 714 states and 955 transitions. [2024-12-06 01:43:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 955 transitions. [2024-12-06 01:43:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-12-06 01:43:03,703 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:43:03,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:43:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:43:03,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3601 backedges. 1676 proven. 301 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-12-06 01:43:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:43:04,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 718 states and 958 transitions. [2024-12-06 01:43:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 958 transitions. [2024-12-06 01:43:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-12-06 01:43:04,572 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:43:04,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:43:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:43:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 1000 proven. 1768 refuted. 0 times theorem prover too weak. 1157 trivial. 0 not checked. [2024-12-06 01:43:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:43:15,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 833 states and 1095 transitions. [2024-12-06 01:43:15,313 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1095 transitions. [2024-12-06 01:43:15,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2024-12-06 01:43:15,314 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:43:15,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:43:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:43:15,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4263 backedges. 2535 proven. 99 refuted. 0 times theorem prover too weak. 1629 trivial. 0 not checked. [2024-12-06 01:43:16,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:43:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 429 states and 501 transitions. [2024-12-06 01:43:16,171 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 501 transitions. [2024-12-06 01:43:16,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 01:43:16,171 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 129 iterations. [2024-12-06 01:43:16,178 INFO L726 CodeCheckObserver]: All specifications hold 18 specifications checked. All of them hold [2024-12-06 01:43:27,466 INFO L77 FloydHoareUtils]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2024-12-06 01:43:27,466 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line 4) the Hoare annotation is: true [2024-12-06 01:43:27,466 INFO L77 FloydHoareUtils]: At program point L64(line 64) the Hoare annotation is: true [2024-12-06 01:43:27,466 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2024-12-06 01:43:27,466 INFO L77 FloydHoareUtils]: At program point L64-1(line 64) the Hoare annotation is: true [2024-12-06 01:43:27,466 INFO L77 FloydHoareUtils]: At program point L48(line 48) the Hoare annotation is: true [2024-12-06 01:43:27,466 INFO L77 FloydHoareUtils]: At program point L48-1(line 48) the Hoare annotation is: true [2024-12-06 01:43:27,466 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 75) no Hoare annotation was computed. [2024-12-06 01:43:27,466 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2024-12-06 01:43:27,466 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 13 102) the Hoare annotation is: true [2024-12-06 01:43:27,467 INFO L77 FloydHoareUtils]: At program point L40(lines 39 89) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-12-06 01:43:27,467 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2024-12-06 01:43:27,467 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2024-12-06 01:43:27,467 INFO L75 FloydHoareUtils]: For program point L94(line 94) no Hoare annotation was computed. [2024-12-06 01:43:27,467 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2024-12-06 01:43:27,467 INFO L75 FloydHoareUtils]: For program point L94-1(line 94) no Hoare annotation was computed. [2024-12-06 01:43:27,467 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 94) no Hoare annotation was computed. [2024-12-06 01:43:27,468 INFO L77 FloydHoareUtils]: At program point L53(line 53) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-12-06 01:43:27,469 INFO L77 FloydHoareUtils]: At program point L53-1(line 53) the Hoare annotation is: (let ((.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse18 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse17 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse14 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse15 (< 3 |ULTIMATE.start_main_~main__j~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse13 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse20 (<= 0 (+ 2147483649 |ULTIMATE.start_main_~main__j~0#1|))) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse8 (<= 1 |ULTIMATE.start_main_~main__j~0#1|) .cse9 .cse10 .cse13 .cse2) (and .cse8 .cse9 .cse14 .cse10 .cse2 .cse15) (and .cse16 .cse1 .cse17 .cse2 .cse4) (and .cse8 .cse9 .cse18 .cse10 .cse19 .cse2) (and .cse1 .cse18 .cse19 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse14 .cse7 .cse2 .cse15) (and .cse1 .cse7 .cse13 .cse2 .cse20) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse18 .cse7 .cse19 .cse2) (and .cse16 .cse1 .cse17 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse16 .cse9 .cse17 .cse10 .cse2) (and .cse1 .cse14 .cse2 .cse4 .cse15) (and .cse1 .cse13 .cse2 .cse20 .cse4))) [2024-12-06 01:43:27,469 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2024-12-06 01:43:27,469 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 53) no Hoare annotation was computed. [2024-12-06 01:43:27,469 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2024-12-06 01:43:27,469 INFO L77 FloydHoareUtils]: At program point L33(lines 33 89) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647) (= |ULTIMATE.start_main_~main__i~0#1| 0) (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) [2024-12-06 01:43:27,469 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 01:43:27,469 INFO L77 FloydHoareUtils]: At program point L62(lines 62 70) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-12-06 01:43:27,470 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2024-12-06 01:43:27,470 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 94) no Hoare annotation was computed. [2024-12-06 01:43:27,470 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2024-12-06 01:43:27,470 INFO L77 FloydHoareUtils]: At program point L46(lines 46 87) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-12-06 01:43:27,470 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 53) no Hoare annotation was computed. [2024-12-06 01:43:27,470 INFO L77 FloydHoareUtils]: At program point L75(line 75) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse1 (< 0 (+ |ULTIMATE.start_main_~main__nlen~0#1| 2147483648)))) (or (and (<= |ULTIMATE.start_main_~main__i~0#1| 1) .cse0 (<= 1 |ULTIMATE.start_main_~main__i~0#1|) .cse1) (and .cse0 (= |ULTIMATE.start_main_~main__i~0#1| 0) .cse1) (and (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|)) (< |ULTIMATE.start_main_~main__i~0#1| 1) (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648)) .cse1) (and (< 1 |ULTIMATE.start_main_~main__i~0#1|) (<= |ULTIMATE.start_main_~main__i~0#1| 2147483646) .cse0 .cse1))) [2024-12-06 01:43:27,470 INFO L77 FloydHoareUtils]: At program point L75-1(line 75) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse1 (< 0 (+ |ULTIMATE.start_main_~main__nlen~0#1| 2147483648)))) (or (and .cse0 (= |ULTIMATE.start_main_~main__i~0#1| 0) .cse1) (and (<= |ULTIMATE.start_main_~main__i~0#1| 1) (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ |ULTIMATE.start_main_~main__i~0#1| 2147483646)) (<= 0 (+ 2147483649 |ULTIMATE.start_main_~main__i~0#1|)) .cse1) (and (< 1 |ULTIMATE.start_main_~main__i~0#1|) (<= |ULTIMATE.start_main_~main__i~0#1| 2147483646) .cse0 .cse1))) [2024-12-06 01:43:27,470 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 01:43:27,471 INFO L77 FloydHoareUtils]: At program point $Ultimate##10(lines 55 86) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse1 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse2 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse4 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse5 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse3 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse3) (and .cse4 .cse5 (= |ULTIMATE.start_main_~main__i~0#1| 0) .cse3) (and .cse0 (<= 1 |ULTIMATE.start_main_~main__j~0#1|) .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse3 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)))) [2024-12-06 01:43:27,471 INFO L77 FloydHoareUtils]: At program point $Ultimate##2(lines 23 101) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647) (= |ULTIMATE.start_main_~main__i~0#1| 0)) [2024-12-06 01:43:27,471 INFO L77 FloydHoareUtils]: At program point L30(line 30) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647) (= |ULTIMATE.start_main_~main__i~0#1| 0) (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) [2024-12-06 01:43:27,471 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2024-12-06 01:43:27,471 INFO L77 FloydHoareUtils]: At program point L30-1(line 30) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647) (= |ULTIMATE.start_main_~main__i~0#1| 0) (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) [2024-12-06 01:43:27,471 INFO L77 FloydHoareUtils]: At program point L30-2(line 30) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647) (= |ULTIMATE.start_main_~main__i~0#1| 0) (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) [2024-12-06 01:43:27,471 INFO L77 FloydHoareUtils]: At program point L30-3(line 30) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647) (= |ULTIMATE.start_main_~main__i~0#1| 0) (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) [2024-12-06 01:43:27,471 INFO L77 FloydHoareUtils]: At program point L59(line 59) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-12-06 01:43:27,471 INFO L77 FloydHoareUtils]: At program point L26(lines 26 96) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647) (= |ULTIMATE.start_main_~main__i~0#1| 0) (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) [2024-12-06 01:43:27,472 INFO L77 FloydHoareUtils]: At program point L59-1(line 59) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-12-06 01:43:27,472 INFO L77 FloydHoareUtils]: At program point L59-2(line 59) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-12-06 01:43:27,472 INFO L77 FloydHoareUtils]: At program point L59-3(line 59) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-12-06 01:43:27,472 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 75) no Hoare annotation was computed. [2024-12-06 01:43:27,472 INFO L77 FloydHoareUtils]: At program point L76(lines 76 85) the Hoare annotation is: (let ((.cse0 (< 0 (+ |ULTIMATE.start_main_~main__nlen~0#1| 2147483648)))) (or (and (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~main__i~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|)) (< |ULTIMATE.start_main_~main__i~0#1| 1) (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648)) .cse0))) [2024-12-06 01:43:27,473 INFO L77 FloydHoareUtils]: At program point L43(line 43) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-12-06 01:43:27,473 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2024-12-06 01:43:27,473 INFO L77 FloydHoareUtils]: At program point L43-1(line 43) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-12-06 01:43:27,473 INFO L77 FloydHoareUtils]: At program point L43-2(line 43) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-12-06 01:43:27,473 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2024-12-06 01:43:27,474 INFO L77 FloydHoareUtils]: At program point L43-3(line 43) the Hoare annotation is: (let ((.cse13 (<= 0 (+ |ULTIMATE.start_main_~main__j~0#1| 2147483648))) (.cse14 (< |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse16 (<= |ULTIMATE.start_main_~main__j~0#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main__j~0#1| 5)) (.cse12 (< 4 |ULTIMATE.start_main_~main__j~0#1|)) (.cse5 (< 5 |ULTIMATE.start_main_~main__j~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~main__j~0#1| 6)) (.cse21 (< 6 |ULTIMATE.start_main_~main__j~0#1|)) (.cse22 (<= |ULTIMATE.start_main_~main__j~0#1| 7)) (.cse7 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse0 (< 1 |ULTIMATE.start_main_~main__j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~main__j~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~main__nlen~0#1| (+ 2147483645 |ULTIMATE.start_main_~main__i~0#1|))) (.cse19 (<= |ULTIMATE.start_main_~main__j~0#1| 3)) (.cse9 (< |ULTIMATE.start_main_~main__i~0#1| 1)) (.cse20 (< 2 |ULTIMATE.start_main_~main__j~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~main__i~0#1| 2147483648))) (.cse1 (<= |ULTIMATE.start_main_~main__nlen~0#1| 2147483647)) (.cse17 (<= |ULTIMATE.start_main_~main__j~0#1| 4)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__i~0#1| 1) |ULTIMATE.start_main_~main__nlen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (.cse18 (< 3 |ULTIMATE.start_main_~main__j~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2) (and .cse1 .cse11 .cse7 .cse2 .cse12) (and .cse8 .cse9 .cse11 .cse10 .cse2 .cse12) (and .cse13 .cse1 .cse14 .cse2 .cse4) (and .cse8 .cse15 .cse9 .cse10 .cse16 .cse2) (and .cse8 .cse9 .cse17 .cse10 .cse2 .cse18) (and .cse15 .cse1 .cse7 .cse16 .cse2) (and .cse19 .cse1 .cse20 .cse2 .cse4) (and .cse8 .cse9 .cse21 .cse10 .cse22 .cse2) (and .cse13 .cse1 .cse14 .cse7 .cse2) (and .cse1 .cse21 .cse22 .cse2 .cse4) (and .cse15 .cse1 .cse16 .cse2 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse2) (and .cse1 .cse17 .cse7 .cse2 .cse18) (and .cse1 .cse11 .cse2 .cse12 .cse4) (and .cse5 .cse8 .cse9 .cse6 .cse10 .cse2) (and .cse1 .cse21 .cse7 .cse22 .cse2) (and .cse19 .cse1 .cse20 .cse7 .cse2) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3) (and .cse8 .cse19 .cse9 .cse20 .cse10 .cse2) (and .cse1 .cse17 .cse2 .cse4 .cse18))) [2024-12-06 01:43:27,474 INFO L77 FloydHoareUtils]: At program point L35(line 35) the Hoare annotation is: true [2024-12-06 01:43:27,474 INFO L77 FloydHoareUtils]: At program point L35-1(line 35) the Hoare annotation is: true [2024-12-06 01:43:27,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 01:43:27 ImpRootNode [2024-12-06 01:43:27,501 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 01:43:27,502 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 01:43:27,502 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 01:43:27,502 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 01:43:27,503 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:41:40" (3/4) ... [2024-12-06 01:43:27,505 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 01:43:27,508 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2024-12-06 01:43:27,513 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-12-06 01:43:27,513 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-12-06 01:43:27,513 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-12-06 01:43:27,513 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 01:43:27,593 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64eb06-1d0b-4ae9-a6e0-34b8b89237e0/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 01:43:27,594 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64eb06-1d0b-4ae9-a6e0-34b8b89237e0/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 01:43:27,594 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 01:43:27,594 INFO L158 Benchmark]: Toolchain (without parser) took 107269.90ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 117.1MB in the beginning and 858.0MB in the end (delta: -740.8MB). Peak memory consumption was 689.1MB. Max. memory is 16.1GB. [2024-12-06 01:43:27,595 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 142.6MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 01:43:27,595 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.33ms. Allocated memory is still 142.6MB. Free memory was 116.8MB in the beginning and 106.1MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 01:43:27,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.96ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 104.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 01:43:27,595 INFO L158 Benchmark]: Boogie Preprocessor took 15.94ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 103.9MB in the end (delta: 808.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 01:43:27,596 INFO L158 Benchmark]: RCFGBuilder took 262.79ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 90.2MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 01:43:27,596 INFO L158 Benchmark]: CodeCheck took 106692.24ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 90.2MB in the beginning and 866.3MB in the end (delta: -776.1MB). Peak memory consumption was 663.9MB. Max. memory is 16.1GB. [2024-12-06 01:43:27,596 INFO L158 Benchmark]: Witness Printer took 91.63ms. Allocated memory is still 1.6GB. Free memory was 866.3MB in the beginning and 858.0MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 01:43:27,598 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 2 procedures, 55 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 95.3s, OverallIterations: 129, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108268 SdHoareTripleChecker+Valid, 194.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105223 mSDsluCounter, 63169 SdHoareTripleChecker+Invalid, 170.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47146 mSDsCounter, 18802 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 200169 IncrementalHoareTripleChecker+Invalid, 218971 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18802 mSolverCounterUnsat, 16023 mSDtfsCounter, 200169 mSolverCounterSat, 3.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127073 GetRequests, 117868 SyntacticMatches, 8191 SemanticMatches, 1014 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678252 ImplicationChecksByTransitivity, 78.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 19845 NumberOfCodeBlocks, 19845 NumberOfCodeBlocksAsserted, 128 NumberOfCheckSat, 19717 ConstructedInterpolants, 0 QuantifiedInterpolants, 46803 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 128 InterpolantComputations, 88 PerfectInterpolantSequences, 125802/134556 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: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 23]: Location Invariant Derived location invariant: ((main__nlen <= 2147483647) && (main__i == 0)) - InvariantResult [Line: 55]: Location Invariant Derived location invariant: ((((((((main__nlen <= ((long long) 2147483645 + main__i)) && (main__i < 1)) && (0 <= (main__i + 2147483648))) && (main__j == 0)) && (((long long) main__i + 1) <= main__nlen)) || ((((0 <= (main__j + 2147483648)) && (main__nlen <= 2147483647)) && (main__i == 0)) && (((long long) main__i + 1) <= main__nlen))) || (((((main__nlen <= ((long long) 2147483645 + main__i)) && (1 <= main__j)) && (main__i < 1)) && (0 <= (main__i + 2147483648))) && (((long long) main__i + 1) <= main__nlen))) || ((((0 <= (main__j + 2147483648)) && (main__nlen <= 2147483647)) && (((long long) main__i + 1) <= main__nlen)) && (1 <= main__i))) - InvariantResult [Line: 39]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((((1 < main__j) && (main__nlen <= 2147483647)) && (((long long) main__i + 1) <= main__nlen)) && (main__j <= 2)) && (1 <= main__i)) || (((((5 < main__j) && (main__nlen <= 2147483647)) && (main__j <= 6)) && (((long long) main__i + 1) <= main__nlen)) && (1 <= main__i))) || (((((1 < main__j) && (main__nlen <= 2147483647)) && (main__i == 0)) && (((long long) main__i + 1) <= main__nlen)) && (main__j <= 2))) || (((((main__nlen <= ((long long) 2147483645 + main__i)) && (main__i < 1)) && (0 <= (main__i + 2147483648))) && (main__j == 0)) && (((long long) main__i + 1) <= main__nlen))) || (((((main__nlen <= 2147483647) && (main__j <= 5)) && (main__i == 0)) && (((long long) main__i + 1) <= main__nlen)) && (4 < main__j))) || ((((((main__nlen <= ((long long) 2147483645 + main__i)) && (main__i < 1)) && (main__j <= 5)) && (0 <= (main__i + 2147483648))) && (((long long) main__i + 1) <= main__nlen)) && (4 < main__j))) || (((((0 <= (main__j + 2147483648)) && (main__nlen <= 2147483647)) && (main__j < 1)) && (((long long) main__i + 1) <= main__nlen)) && (1 <= main__i))) || ((((((main__nlen <= ((long long) 2147483645 + main__i)) && (1 <= main__j)) && (main__i < 1)) && (0 <= (main__i + 2147483648))) && (main__j <= 1)) && (((long long) main__i + 1) <= main__nlen))) || ((((((main__nlen <= ((long long) 2147483645 + main__i)) && (main__i < 1)) && (main__j <= 4)) && (0 <= (main__i + 2147483648))) && (((long long) main__i + 1) <= main__nlen)) && (3 < main__j))) || (((((1 <= main__j) && (main__nlen <= 2147483647)) && (main__i == 0)) && (main__j <= 1)) && (((long long) main__i + 1) <= main__nlen))) || (((((main__j <= 3) && (main__nlen <= 2147483647)) && (2 < main__j)) && (((long long) main__i + 1) <= main__nlen)) && (1 <= main__i))) || ((((((main__nlen <= ((long long) 2147483645 + main__i)) && (main__i < 1)) && (6 < main__j)) && (0 <= (main__i + 2147483648))) && (main__j <= 7)) && (((long long) main__i + 1) <= main__nlen))) || (((((0 <= (main__j + 2147483648)) && (main__nlen <= 2147483647)) && (main__j < 1)) && (main__i == 0)) && (((long long) main__i + 1) <= main__nlen))) || (((((main__nlen <= 2147483647) && (6 < main__j)) && (main__j <= 7)) && (((long long) main__i + 1) <= main__nlen)) && (1 <= main__i))) || (((((1 <= main__j) && (main__nlen <= 2147483647)) && (main__j <= 1)) && (((long long) main__i + 1) <= main__nlen)) && (1 <= main__i))) || (((((5 < main__j) && (main__nlen <= 2147483647)) && (main__i == 0)) && (main__j <= 6)) && (((long long) main__i + 1) <= main__nlen))) || (((((main__nlen <= 2147483647) && (main__j <= 4)) && (main__i == 0)) && (((long long) main__i + 1) <= main__nlen)) && (3 < main__j))) || (((((main__nlen <= 2147483647) && (main__j <= 5)) && (((long long) main__i + 1) <= main__nlen)) && (4 < main__j)) && (1 <= main__i))) || ((((((5 < main__j) && (main__nlen <= ((long long) 2147483645 + main__i))) && (main__i < 1)) && (main__j <= 6)) && (0 <= (main__i + 2147483648))) && (((long long) main__i + 1) <= main__nlen))) || (((((main__nlen <= 2147483647) && (6 < main__j)) && (main__i == 0)) && (main__j <= 7)) && (((long long) main__i + 1) <= main__nlen))) || (((((main__j <= 3) && (main__nlen <= 2147483647)) && (2 < main__j)) && (main__i == 0)) && (((long long) main__i + 1) <= main__nlen))) || ((((((main__nlen <= ((long long) 2147483645 + main__i)) && (1 < main__j)) && (main__i < 1)) && (0 <= (main__i + 2147483648))) && (((long long) main__i + 1) <= main__nlen)) && (main__j <= 2))) || ((((((main__nlen <= ((long long) 2147483645 + main__i)) && (main__j <= 3)) && (main__i < 1)) && (2 < main__j)) && (0 <= (main__i + 2147483648))) && (((long long) main__i + 1) <= main__nlen))) || (((((main__nlen <= 2147483647) && (main__j <= 4)) && (((long long) main__i + 1) <= main__nlen)) && (1 <= main__i)) && (3 < main__j))) - ProcedureContractResult [Line: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error. Ensures: ((__return_main == \old(__return_main)) && (__return_100 == \old(__return_100))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 142.6MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.33ms. Allocated memory is still 142.6MB. Free memory was 116.8MB in the beginning and 106.1MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.96ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 104.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 15.94ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 103.9MB in the end (delta: 808.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 262.79ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 90.2MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * CodeCheck took 106692.24ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 90.2MB in the beginning and 866.3MB in the end (delta: -776.1MB). Peak memory consumption was 663.9MB. Max. memory is 16.1GB. * Witness Printer took 91.63ms. Allocated memory is still 1.6GB. Free memory was 866.3MB in the beginning and 858.0MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 01:43:27,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64eb06-1d0b-4ae9-a6e0-34b8b89237e0/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