./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-restricted-15/NO_04.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_8e9328ca-2693-4cd5-b980-66641ec2c6e7/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e9328ca-2693-4cd5-b980-66641ec2c6e7/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_8e9328ca-2693-4cd5-b980-66641ec2c6e7/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e9328ca-2693-4cd5-b980-66641ec2c6e7/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/termination-restricted-15/NO_04.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e9328ca-2693-4cd5-b980-66641ec2c6e7/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Overflow-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e9328ca-2693-4cd5-b980-66641ec2c6e7/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 64bit --witnessprinter.graph.data.programhash 26441cee42562e2fd703b97b1a86d2baa847af9810285d31267fccda11d2ea67 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 04:33:01,467 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 04:33:01,525 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e9328ca-2693-4cd5-b980-66641ec2c6e7/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Overflow-64bit-Kojak_Default.epf [2024-12-06 04:33:01,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 04:33:01,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 04:33:01,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 04:33:01,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 04:33:01,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 04:33:01,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 04:33:01,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 04:33:01,551 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 04:33:01,552 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 04:33:01,552 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 04:33:01,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 04:33:01,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 04:33:01,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 04:33:01,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 04:33:01,552 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-12-06 04:33:01,552 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-06 04:33:01,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 04:33:01,552 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 04:33:01,552 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 04:33:01,553 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 04:33:01,553 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 04:33:01,553 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 04:33:01,553 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 04:33:01,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 04:33:01,553 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 04:33:01,553 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 04:33:01,553 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 04:33:01,553 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 04:33:01,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 04:33:01,553 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_8e9328ca-2693-4cd5-b980-66641ec2c6e7/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26441cee42562e2fd703b97b1a86d2baa847af9810285d31267fccda11d2ea67 [2024-12-06 04:33:01,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 04:33:01,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 04:33:01,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 04:33:01,799 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 04:33:01,799 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 04:33:01,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e9328ca-2693-4cd5-b980-66641ec2c6e7/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/termination-restricted-15/NO_04.c [2024-12-06 04:33:04,427 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e9328ca-2693-4cd5-b980-66641ec2c6e7/bin/ukojak-verify-CZk0znPC7b/data/89e3ae514/e3b41258084b49bea881035a4acf07ae/FLAG52fad6212 [2024-12-06 04:33:04,603 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 04:33:04,604 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e9328ca-2693-4cd5-b980-66641ec2c6e7/sv-benchmarks/c/termination-restricted-15/NO_04.c [2024-12-06 04:33:04,609 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e9328ca-2693-4cd5-b980-66641ec2c6e7/bin/ukojak-verify-CZk0znPC7b/data/89e3ae514/e3b41258084b49bea881035a4acf07ae/FLAG52fad6212 [2024-12-06 04:33:04,989 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e9328ca-2693-4cd5-b980-66641ec2c6e7/bin/ukojak-verify-CZk0znPC7b/data/89e3ae514/e3b41258084b49bea881035a4acf07ae [2024-12-06 04:33:04,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 04:33:04,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 04:33:04,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 04:33:04,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 04:33:04,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 04:33:04,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:33:04" (1/1) ... [2024-12-06 04:33:04,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b490804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:04, skipping insertion in model container [2024-12-06 04:33:04,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:33:04" (1/1) ... [2024-12-06 04:33:05,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 04:33:05,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 04:33:05,129 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 04:33:05,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 04:33:05,155 INFO L204 MainTranslator]: Completed translation [2024-12-06 04:33:05,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:05 WrapperNode [2024-12-06 04:33:05,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 04:33:05,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 04:33:05,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 04:33:05,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 04:33:05,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:05" (1/1) ... [2024-12-06 04:33:05,166 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:05" (1/1) ... [2024-12-06 04:33:05,180 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2024-12-06 04:33:05,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 04:33:05,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 04:33:05,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 04:33:05,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 04:33:05,188 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:05" (1/1) ... [2024-12-06 04:33:05,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:05" (1/1) ... [2024-12-06 04:33:05,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:05" (1/1) ... [2024-12-06 04:33:05,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:05" (1/1) ... [2024-12-06 04:33:05,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:05" (1/1) ... [2024-12-06 04:33:05,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:05" (1/1) ... [2024-12-06 04:33:05,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:05" (1/1) ... [2024-12-06 04:33:05,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:05" (1/1) ... [2024-12-06 04:33:05,198 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:05" (1/1) ... [2024-12-06 04:33:05,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 04:33:05,200 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 04:33:05,200 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 04:33:05,200 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 04:33:05,201 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:05" (1/1) ... [2024-12-06 04:33:05,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 04:33:05,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e9328ca-2693-4cd5-b980-66641ec2c6e7/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 04:33:05,230 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e9328ca-2693-4cd5-b980-66641ec2c6e7/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 04:33:05,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e9328ca-2693-4cd5-b980-66641ec2c6e7/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 04:33:05,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 04:33:05,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 04:33:05,320 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 04:33:05,322 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 04:33:05,496 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2024-12-06 04:33:05,496 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 04:33:05,524 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 04:33:05,524 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2024-12-06 04:33:05,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:33:05 BoogieIcfgContainer [2024-12-06 04:33:05,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 04:33:05,525 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 04:33:05,525 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 04:33:05,535 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 04:33:05,535 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:33:05" (1/1) ... [2024-12-06 04:33:05,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 04:33:05,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:05,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 67 states and 71 transitions. [2024-12-06 04:33:05,583 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2024-12-06 04:33:05,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-06 04:33:05,586 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:05,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:05,696 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 04:33:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:05,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 69 states and 74 transitions. [2024-12-06 04:33:05,735 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2024-12-06 04:33:05,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-06 04:33:05,735 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:05,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:05,766 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 04:33:05,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:05,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 72 states and 78 transitions. [2024-12-06 04:33:05,824 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-12-06 04:33:05,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 04:33:05,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:05,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:05,867 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 04:33:05,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 75 states and 83 transitions. [2024-12-06 04:33:05,916 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2024-12-06 04:33:05,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 04:33:05,916 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:05,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:05,941 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 04:33:06,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:06,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 77 states and 88 transitions. [2024-12-06 04:33:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2024-12-06 04:33:06,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 04:33:06,015 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:06,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:06,057 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 04:33:06,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:06,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 80 states and 94 transitions. [2024-12-06 04:33:06,216 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2024-12-06 04:33:06,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 04:33:06,216 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:06,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:06,239 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 04:33:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:06,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 83 states and 101 transitions. [2024-12-06 04:33:06,378 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2024-12-06 04:33:06,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 04:33:06,378 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:06,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:06,434 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 04:33:06,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:06,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 82 states and 100 transitions. [2024-12-06 04:33:06,515 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2024-12-06 04:33:06,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 04:33:06,515 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:06,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:33:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 83 states and 100 transitions. [2024-12-06 04:33:06,570 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2024-12-06 04:33:06,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 04:33:06,570 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:06,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:06,598 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 04:33:06,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:06,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 85 states and 102 transitions. [2024-12-06 04:33:06,622 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions. [2024-12-06 04:33:06,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 04:33:06,623 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:06,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 04:33:06,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:06,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 84 states and 101 transitions. [2024-12-06 04:33:06,720 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2024-12-06 04:33:06,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 04:33:06,721 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:06,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:06,758 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 04:33:07,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 90 states and 111 transitions. [2024-12-06 04:33:07,003 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2024-12-06 04:33:07,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 04:33:07,004 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:07,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:07,026 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 04:33:07,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:07,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 95 states and 119 transitions. [2024-12-06 04:33:07,216 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 119 transitions. [2024-12-06 04:33:07,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 04:33:07,216 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:07,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:07,253 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 04:33:07,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:07,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 102 states and 132 transitions. [2024-12-06 04:33:07,498 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 132 transitions. [2024-12-06 04:33:07,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 04:33:07,498 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:07,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:07,520 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 04:33:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:07,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 105 states and 139 transitions. [2024-12-06 04:33:07,591 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 139 transitions. [2024-12-06 04:33:07,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 04:33:07,592 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:07,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:07,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 04:33:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 108 states and 147 transitions. [2024-12-06 04:33:07,792 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2024-12-06 04:33:07,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 04:33:07,793 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:07,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:07,837 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 04:33:08,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 110 states and 151 transitions. [2024-12-06 04:33:08,061 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 151 transitions. [2024-12-06 04:33:08,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 04:33:08,062 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:08,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:08,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 04:33:08,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 113 states and 159 transitions. [2024-12-06 04:33:08,216 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2024-12-06 04:33:08,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 04:33:08,217 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:08,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:33:08,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 114 states and 161 transitions. [2024-12-06 04:33:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 161 transitions. [2024-12-06 04:33:08,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 04:33:08,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:08,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:08,468 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 04:33:08,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:08,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 119 states and 171 transitions. [2024-12-06 04:33:08,958 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2024-12-06 04:33:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 04:33:08,958 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:08,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 04:33:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:08,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 121 states and 175 transitions. [2024-12-06 04:33:08,998 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 175 transitions. [2024-12-06 04:33:08,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 04:33:08,999 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:08,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:09,048 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 04:33:09,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:09,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 120 states and 174 transitions. [2024-12-06 04:33:09,165 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 174 transitions. [2024-12-06 04:33:09,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 04:33:09,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:09,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:09,189 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 04:33:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 122 states and 176 transitions. [2024-12-06 04:33:09,213 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 176 transitions. [2024-12-06 04:33:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 04:33:09,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:09,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:09,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 04:33:09,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:09,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 127 states and 182 transitions. [2024-12-06 04:33:09,494 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 182 transitions. [2024-12-06 04:33:09,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 04:33:09,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:09,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:09,547 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 04:33:10,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 133 states and 193 transitions. [2024-12-06 04:33:10,008 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 193 transitions. [2024-12-06 04:33:10,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 04:33:10,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:10,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 04:33:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:10,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 138 states and 199 transitions. [2024-12-06 04:33:10,239 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 199 transitions. [2024-12-06 04:33:10,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 04:33:10,240 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:10,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:10,261 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 04:33:10,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:10,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 145 states and 210 transitions. [2024-12-06 04:33:10,716 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 210 transitions. [2024-12-06 04:33:10,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 04:33:10,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:10,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 04:33:10,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:10,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 148 states and 219 transitions. [2024-12-06 04:33:10,818 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 219 transitions. [2024-12-06 04:33:10,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 04:33:10,819 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:10,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:10,876 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 04:33:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:11,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 151 states and 230 transitions. [2024-12-06 04:33:11,152 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 230 transitions. [2024-12-06 04:33:11,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 04:33:11,152 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:11,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:33:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 152 states and 232 transitions. [2024-12-06 04:33:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2024-12-06 04:33:11,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 04:33:11,386 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:11,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:11,403 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 04:33:11,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:11,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 159 states and 243 transitions. [2024-12-06 04:33:11,670 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 243 transitions. [2024-12-06 04:33:11,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 04:33:11,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:11,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:11,706 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 04:33:11,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:11,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 162 states and 248 transitions. [2024-12-06 04:33:11,967 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 248 transitions. [2024-12-06 04:33:11,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 04:33:11,967 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:11,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:11,981 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 04:33:12,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:12,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 164 states and 251 transitions. [2024-12-06 04:33:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 251 transitions. [2024-12-06 04:33:12,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 04:33:12,195 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:12,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:12,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 04:33:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:12,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 173 states and 263 transitions. [2024-12-06 04:33:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 263 transitions. [2024-12-06 04:33:12,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 04:33:12,657 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:12,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:12,715 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 04:33:13,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 177 states and 269 transitions. [2024-12-06 04:33:13,155 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 269 transitions. [2024-12-06 04:33:13,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 04:33:13,156 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:13,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:13,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 04:33:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 179 states and 272 transitions. [2024-12-06 04:33:13,464 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 272 transitions. [2024-12-06 04:33:13,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 04:33:13,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:13,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:13,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 04:33:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 188 states and 283 transitions. [2024-12-06 04:33:13,845 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 283 transitions. [2024-12-06 04:33:13,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 04:33:13,845 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:13,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:13,914 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 04:33:14,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 194 states and 297 transitions. [2024-12-06 04:33:14,867 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 297 transitions. [2024-12-06 04:33:14,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 04:33:14,868 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:14,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:14,949 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 04:33:16,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:16,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 201 states and 312 transitions. [2024-12-06 04:33:16,155 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 312 transitions. [2024-12-06 04:33:16,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-06 04:33:16,155 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:16,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:16,171 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 04:33:16,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 203 states and 315 transitions. [2024-12-06 04:33:16,468 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 315 transitions. [2024-12-06 04:33:16,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-06 04:33:16,468 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:16,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:16,482 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 04:33:16,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 204 states and 316 transitions. [2024-12-06 04:33:16,648 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 316 transitions. [2024-12-06 04:33:16,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-06 04:33:16,657 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:16,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:33:17,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:17,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 205 states and 318 transitions. [2024-12-06 04:33:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 318 transitions. [2024-12-06 04:33:17,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-06 04:33:17,015 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:17,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:17,033 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 04:33:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 207 states and 320 transitions. [2024-12-06 04:33:17,067 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 320 transitions. [2024-12-06 04:33:17,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 04:33:17,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:17,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:17,094 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 04:33:17,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:17,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 209 states and 322 transitions. [2024-12-06 04:33:17,141 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 322 transitions. [2024-12-06 04:33:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-06 04:33:17,141 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:17,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:17,221 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 04:33:17,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:17,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 208 states and 321 transitions. [2024-12-06 04:33:17,283 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 321 transitions. [2024-12-06 04:33:17,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-06 04:33:17,284 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:17,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:17,367 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 04:33:18,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:18,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 219 states and 342 transitions. [2024-12-06 04:33:18,866 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 342 transitions. [2024-12-06 04:33:18,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 04:33:18,866 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:18,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:18,962 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 04:33:19,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:19,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 222 states and 347 transitions. [2024-12-06 04:33:19,350 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 347 transitions. [2024-12-06 04:33:19,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 04:33:19,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:19,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:19,434 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 04:33:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:21,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 234 states and 376 transitions. [2024-12-06 04:33:21,339 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 376 transitions. [2024-12-06 04:33:21,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-06 04:33:21,339 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:21,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 04:33:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:21,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 236 states and 377 transitions. [2024-12-06 04:33:21,721 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 377 transitions. [2024-12-06 04:33:21,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-06 04:33:21,722 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:21,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:21,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:33:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:22,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 238 states and 380 transitions. [2024-12-06 04:33:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 380 transitions. [2024-12-06 04:33:22,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 04:33:22,300 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:22,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:22,313 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 04:33:22,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 239 states and 381 transitions. [2024-12-06 04:33:22,722 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 381 transitions. [2024-12-06 04:33:22,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-06 04:33:22,722 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:33:22,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:33:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:33:22,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:33:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:33:23,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 30 states and 32 transitions. [2024-12-06 04:33:23,002 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-12-06 04:33:23,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 04:33:23,003 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 52 iterations. [2024-12-06 04:33:23,012 INFO L726 CodeCheckObserver]: All specifications hold 30 specifications checked. All of them hold [2024-12-06 04:33:23,266 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2024-12-06 04:33:23,267 INFO L77 FloydHoareUtils]: At program point L19(line 19) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))) (and (<= 0 .cse0) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= .cse0 0) (<= 0 |ULTIMATE.start_main_~i~0#1|))) [2024-12-06 04:33:23,267 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2024-12-06 04:33:23,267 INFO L77 FloydHoareUtils]: At program point L19-1(line 19) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))) (and (<= 0 .cse0) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= .cse0 0) (<= 0 |ULTIMATE.start_main_~i~0#1|))) [2024-12-06 04:33:23,267 INFO L77 FloydHoareUtils]: At program point L19-2(line 19) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))) (and (<= 0 .cse0) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= .cse0 0) (<= 0 |ULTIMATE.start_main_~i~0#1|))) [2024-12-06 04:33:23,267 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2024-12-06 04:33:23,267 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2024-12-06 04:33:23,267 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 16) no Hoare annotation was computed. [2024-12-06 04:33:23,267 INFO L75 FloydHoareUtils]: For program point L28(line 28) no Hoare annotation was computed. [2024-12-06 04:33:23,267 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2024-12-06 04:33:23,267 INFO L77 FloydHoareUtils]: At program point L20-1(lines 20 31) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|)) (.cse1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))) (and (<= 0 .cse0) (<= .cse0 3) (<= 0 .cse1) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= .cse1 0) (<= |ULTIMATE.start_main_~j~0#1| 0))) [2024-12-06 04:33:23,267 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2024-12-06 04:33:23,267 INFO L77 FloydHoareUtils]: At program point L20-3(lines 20 31) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|) 3) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 3 |ULTIMATE.start_main_~k~0#1|)) [2024-12-06 04:33:23,267 INFO L75 FloydHoareUtils]: For program point L20-4(lines 20 31) no Hoare annotation was computed. [2024-12-06 04:33:23,268 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2024-12-06 04:33:23,268 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 16) no Hoare annotation was computed. [2024-12-06 04:33:23,268 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2024-12-06 04:33:23,268 INFO L77 FloydHoareUtils]: At program point L21(line 21) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|)) (.cse1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))) (and (<= 0 .cse0) (<= .cse0 3) (<= 0 .cse1) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= .cse1 0) (<= |ULTIMATE.start_main_~j~0#1| 0))) [2024-12-06 04:33:23,268 INFO L77 FloydHoareUtils]: At program point L21-1(line 21) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|)) (.cse1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))) (and (<= 0 .cse0) (<= .cse0 3) (<= 0 .cse1) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= .cse1 0) (<= |ULTIMATE.start_main_~j~0#1| 0))) [2024-12-06 04:33:23,268 INFO L77 FloydHoareUtils]: At program point L21-2(line 21) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|)) (.cse1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))) (and (<= 0 .cse0) (<= .cse0 3) (<= 0 .cse1) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= .cse1 0) (<= |ULTIMATE.start_main_~j~0#1| 0))) [2024-12-06 04:33:23,268 INFO L77 FloydHoareUtils]: At program point L21-3(line 21) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|)) (.cse1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))) (and (<= 0 .cse0) (<= .cse0 3) (<= 0 .cse1) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= .cse1 0) (<= |ULTIMATE.start_main_~j~0#1| 0))) [2024-12-06 04:33:23,268 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2024-12-06 04:33:23,268 INFO L77 FloydHoareUtils]: At program point L21-4(line 21) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|)) (.cse1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))) (and (<= 0 .cse0) (<= .cse0 3) (<= 0 .cse1) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= .cse1 0) (<= |ULTIMATE.start_main_~j~0#1| 0))) [2024-12-06 04:33:23,268 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2024-12-06 04:33:23,268 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 04:33:23,268 INFO L75 FloydHoareUtils]: For program point L30(line 30) no Hoare annotation was computed. [2024-12-06 04:33:23,269 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2024-12-06 04:33:23,269 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2024-12-06 04:33:23,269 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2024-12-06 04:33:23,269 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2024-12-06 04:33:23,269 INFO L77 FloydHoareUtils]: At program point L23-1(lines 23 29) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (.cse1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~l~0#1|))) (and (<= 0 .cse0) (<= .cse1 3) (<= .cse0 0) (<= 0 .cse1) (<= |ULTIMATE.start_main_~l~0#1| 0) (<= 0 |ULTIMATE.start_main_~l~0#1|))) [2024-12-06 04:33:23,269 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2024-12-06 04:33:23,269 INFO L77 FloydHoareUtils]: At program point L23-3(lines 23 29) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))) (and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1|)) (<= 0 .cse0) (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~l~0#1|) 3) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= .cse0 0) (<= |ULTIMATE.start_main_~l~0#1| 0) (<= 0 |ULTIMATE.start_main_~l~0#1|) (<= (+ |ULTIMATE.start_main_~l~0#1| 4) |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))) [2024-12-06 04:33:23,269 INFO L75 FloydHoareUtils]: For program point L23-4(lines 23 29) no Hoare annotation was computed. [2024-12-06 04:33:23,269 INFO L77 FloydHoareUtils]: At program point L15-1(lines 15 35) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|)) [2024-12-06 04:33:23,269 INFO L77 FloydHoareUtils]: At program point L15-3(lines 15 35) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|)) [2024-12-06 04:33:23,269 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2024-12-06 04:33:23,269 INFO L75 FloydHoareUtils]: For program point L32(line 32) no Hoare annotation was computed. [2024-12-06 04:33:23,269 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2024-12-06 04:33:23,270 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) no Hoare annotation was computed. [2024-12-06 04:33:23,270 INFO L77 FloydHoareUtils]: At program point L24(line 24) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~l~0#1|))) (and (<= .cse0 3) (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|) 0) (<= 0 .cse0) (<= |ULTIMATE.start_main_~l~0#1| 0) (<= 0 |ULTIMATE.start_main_~l~0#1|))) [2024-12-06 04:33:23,270 INFO L77 FloydHoareUtils]: At program point L24-1(line 24) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~l~0#1|))) (and (<= .cse0 3) (<= 0 .cse0) (<= |ULTIMATE.start_main_~l~0#1| 0) (<= 0 |ULTIMATE.start_main_~l~0#1|))) [2024-12-06 04:33:23,270 INFO L77 FloydHoareUtils]: At program point L24-2(line 24) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~l~0#1|))) (and (<= .cse0 3) (<= 0 .cse0) (<= |ULTIMATE.start_main_~l~0#1| 0) (<= 0 |ULTIMATE.start_main_~l~0#1|))) [2024-12-06 04:33:23,270 INFO L77 FloydHoareUtils]: At program point L24-3(line 24) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~l~0#1|))) (and (<= .cse0 3) (<= 0 .cse0) (<= |ULTIMATE.start_main_~l~0#1| 0) (<= 0 |ULTIMATE.start_main_~l~0#1|))) [2024-12-06 04:33:23,270 INFO L77 FloydHoareUtils]: At program point L24-4(line 24) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~l~0#1|))) (and (<= .cse0 3) (<= 0 .cse0) (<= |ULTIMATE.start_main_~l~0#1| 0) (<= 0 |ULTIMATE.start_main_~l~0#1|))) [2024-12-06 04:33:23,270 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2024-12-06 04:33:23,270 INFO L77 FloydHoareUtils]: At program point L24-5(line 24) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~l~0#1|))) (and (<= .cse0 3) (<= 0 .cse0) (<= |ULTIMATE.start_main_~l~0#1| 0) (<= 0 |ULTIMATE.start_main_~l~0#1|))) [2024-12-06 04:33:23,270 INFO L77 FloydHoareUtils]: At program point L24-6(line 24) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~l~0#1|))) (and (<= .cse0 3) (<= 0 .cse0) (<= |ULTIMATE.start_main_~l~0#1| 0) (<= 0 |ULTIMATE.start_main_~l~0#1|))) [2024-12-06 04:33:23,270 INFO L77 FloydHoareUtils]: At program point L16(line 16) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|)) [2024-12-06 04:33:23,270 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2024-12-06 04:33:23,270 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2024-12-06 04:33:23,271 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2024-12-06 04:33:23,271 INFO L77 FloydHoareUtils]: At program point L25-1(lines 25 27) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~m~0#1|) (<= |ULTIMATE.start_main_~m~0#1| 1003) (<= 0 |ULTIMATE.start_main_~l~0#1|)) [2024-12-06 04:33:23,271 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) no Hoare annotation was computed. [2024-12-06 04:33:23,271 INFO L77 FloydHoareUtils]: At program point L25-3(lines 25 27) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~m~0#1|) (<= |ULTIMATE.start_main_~m~0#1| 1003) (<= 0 |ULTIMATE.start_main_~l~0#1|)) [2024-12-06 04:33:23,271 INFO L75 FloydHoareUtils]: For program point L25-4(lines 25 27) no Hoare annotation was computed. [2024-12-06 04:33:23,271 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2024-12-06 04:33:23,271 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2024-12-06 04:33:23,271 INFO L75 FloydHoareUtils]: For program point L34(line 34) no Hoare annotation was computed. [2024-12-06 04:33:23,271 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2024-12-06 04:33:23,271 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2024-12-06 04:33:23,271 INFO L77 FloydHoareUtils]: At program point L26(line 26) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~m~0#1|) (<= |ULTIMATE.start_main_~m~0#1| 1003) (<= 0 |ULTIMATE.start_main_~l~0#1|)) [2024-12-06 04:33:23,271 INFO L77 FloydHoareUtils]: At program point L18-1(lines 18 33) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))) (and (<= 0 .cse0) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= .cse0 0) (<= 0 |ULTIMATE.start_main_~i~0#1|))) [2024-12-06 04:33:23,271 INFO L77 FloydHoareUtils]: At program point L18-3(lines 18 33) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|))) (and (<= 0 .cse0) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= .cse0 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~a~0#1|))) [2024-12-06 04:33:23,271 INFO L75 FloydHoareUtils]: For program point L18-4(lines 18 33) no Hoare annotation was computed. [2024-12-06 04:33:23,271 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2024-12-06 04:33:23,271 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2024-12-06 04:33:23,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 04:33:23 ImpRootNode [2024-12-06 04:33:23,285 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 04:33:23,285 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 04:33:23,286 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 04:33:23,286 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 04:33:23,286 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:33:05" (3/4) ... [2024-12-06 04:33:23,288 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 04:33:23,294 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-12-06 04:33:23,294 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-12-06 04:33:23,294 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-12-06 04:33:23,368 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e9328ca-2693-4cd5-b980-66641ec2c6e7/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 04:33:23,368 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e9328ca-2693-4cd5-b980-66641ec2c6e7/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 04:33:23,368 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 04:33:23,369 INFO L158 Benchmark]: Toolchain (without parser) took 18376.77ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 117.0MB in the beginning and 87.5MB in the end (delta: 29.5MB). Peak memory consumption was 103.7MB. Max. memory is 16.1GB. [2024-12-06 04:33:23,369 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 142.6MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:33:23,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.40ms. Allocated memory is still 142.6MB. Free memory was 117.0MB in the beginning and 106.9MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 04:33:23,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.72ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 105.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:33:23,370 INFO L158 Benchmark]: Boogie Preprocessor took 18.21ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 104.8MB in the end (delta: 804.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:33:23,370 INFO L158 Benchmark]: RCFGBuilder took 324.47ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 90.0MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 04:33:23,370 INFO L158 Benchmark]: CodeCheck took 17760.03ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 90.0MB in the beginning and 91.8MB in the end (delta: -1.9MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. [2024-12-06 04:33:23,371 INFO L158 Benchmark]: Witness Printer took 82.76ms. Allocated memory is still 218.1MB. Free memory was 91.8MB in the beginning and 87.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 04:33:23,372 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 67 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 17.5s, OverallIterations: 52, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9766 SdHoareTripleChecker+Valid, 25.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9319 mSDsluCounter, 2250 SdHoareTripleChecker+Invalid, 21.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1964 mSDsCounter, 2870 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25959 IncrementalHoareTripleChecker+Invalid, 28829 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2870 mSolverCounterUnsat, 286 mSDtfsCounter, 25959 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7095 GetRequests, 6303 SyntacticMatches, 418 SemanticMatches, 374 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78998 ImplicationChecksByTransitivity, 14.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 901 NumberOfCodeBlocks, 901 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 850 ConstructedInterpolants, 0 QuantifiedInterpolants, 2803 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 51 InterpolantComputations, 51 PerfectInterpolantSequences, 57/57 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: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: 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: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((long) i + j) + k) <= 3) && (0 <= ((long) i + j))) && (i <= 0)) && (0 <= i)) && (3 <= k)) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((((0 <= ((long) i + j)) && (i <= 0)) && (((long) i + j) <= 0)) && (0 <= i)) && (((long) 2 + j) <= a)) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((i <= 0) && (0 <= i)) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((0 <= m) && (m <= 1003)) && (0 <= l)) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((((((0 <= (((long) i + j) + k)) && (0 <= ((long) i + j))) && (((((long) i + j) + k) + l) <= 3)) && (0 <= j)) && (((long) i + j) <= 0)) && (l <= 0)) && (0 <= l)) && (((long) l + 4) <= b)) && (j <= 0)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 142.6MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.40ms. Allocated memory is still 142.6MB. Free memory was 117.0MB in the beginning and 106.9MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.72ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 105.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.21ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 104.8MB in the end (delta: 804.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 324.47ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 90.0MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 17760.03ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 90.0MB in the beginning and 91.8MB in the end (delta: -1.9MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. * Witness Printer took 82.76ms. Allocated memory is still 218.1MB. Free memory was 91.8MB in the beginning and 87.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 04:33:23,388 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e9328ca-2693-4cd5-b980-66641ec2c6e7/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