./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-restricted-15/b.10.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_15ee676c-a459-484a-b11e-095adda906a9/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ee676c-a459-484a-b11e-095adda906a9/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_15ee676c-a459-484a-b11e-095adda906a9/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ee676c-a459-484a-b11e-095adda906a9/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/termination-restricted-15/b.10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ee676c-a459-484a-b11e-095adda906a9/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_15ee676c-a459-484a-b11e-095adda906a9/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 4036e0056477b4442ec4a799960d03c7e149261f5dcf8c079ae548d48df77b04 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 06:20:58,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 06:20:58,488 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ee676c-a459-484a-b11e-095adda906a9/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Overflow-64bit-Kojak_Default.epf [2024-12-06 06:20:58,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 06:20:58,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 06:20:58,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 06:20:58,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 06:20:58,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 06:20:58,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 06:20:58,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 06:20:58,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 06:20:58,517 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 06:20:58,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 06:20:58,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 06:20:58,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 06:20:58,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 06:20:58,518 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 06:20:58,518 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-12-06 06:20:58,518 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-06 06:20:58,518 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 06:20:58,518 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 06:20:58,518 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 06:20:58,518 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 06:20:58,519 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 06:20:58,519 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 06:20:58,519 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 06:20:58,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 06:20:58,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 06:20:58,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 06:20:58,519 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 06:20:58,519 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 06:20:58,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 06:20:58,519 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_15ee676c-a459-484a-b11e-095adda906a9/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 -> 4036e0056477b4442ec4a799960d03c7e149261f5dcf8c079ae548d48df77b04 [2024-12-06 06:20:58,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 06:20:58,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 06:20:58,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 06:20:58,784 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 06:20:58,785 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 06:20:58,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ee676c-a459-484a-b11e-095adda906a9/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/termination-restricted-15/b.10.c [2024-12-06 06:21:01,420 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ee676c-a459-484a-b11e-095adda906a9/bin/ukojak-verify-CZk0znPC7b/data/92e1d77cd/4b91c6a31afb4c0aa66633f913170fa0/FLAG009312d37 [2024-12-06 06:21:01,647 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 06:21:01,648 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ee676c-a459-484a-b11e-095adda906a9/sv-benchmarks/c/termination-restricted-15/b.10.c [2024-12-06 06:21:01,653 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ee676c-a459-484a-b11e-095adda906a9/bin/ukojak-verify-CZk0znPC7b/data/92e1d77cd/4b91c6a31afb4c0aa66633f913170fa0/FLAG009312d37 [2024-12-06 06:21:01,999 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ee676c-a459-484a-b11e-095adda906a9/bin/ukojak-verify-CZk0znPC7b/data/92e1d77cd/4b91c6a31afb4c0aa66633f913170fa0 [2024-12-06 06:21:02,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 06:21:02,003 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 06:21:02,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 06:21:02,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 06:21:02,007 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 06:21:02,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:21:02" (1/1) ... [2024-12-06 06:21:02,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2678ed8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:02, skipping insertion in model container [2024-12-06 06:21:02,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:21:02" (1/1) ... [2024-12-06 06:21:02,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 06:21:02,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 06:21:02,148 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 06:21:02,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 06:21:02,174 INFO L204 MainTranslator]: Completed translation [2024-12-06 06:21:02,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:02 WrapperNode [2024-12-06 06:21:02,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 06:21:02,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 06:21:02,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 06:21:02,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 06:21:02,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:02" (1/1) ... [2024-12-06 06:21:02,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:02" (1/1) ... [2024-12-06 06:21:02,200 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2024-12-06 06:21:02,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 06:21:02,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 06:21:02,201 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 06:21:02,201 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 06:21:02,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:02" (1/1) ... [2024-12-06 06:21:02,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:02" (1/1) ... [2024-12-06 06:21:02,208 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:02" (1/1) ... [2024-12-06 06:21:02,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:02" (1/1) ... [2024-12-06 06:21:02,210 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:02" (1/1) ... [2024-12-06 06:21:02,211 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:02" (1/1) ... [2024-12-06 06:21:02,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:02" (1/1) ... [2024-12-06 06:21:02,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:02" (1/1) ... [2024-12-06 06:21:02,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:02" (1/1) ... [2024-12-06 06:21:02,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 06:21:02,218 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 06:21:02,218 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 06:21:02,218 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 06:21:02,219 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:02" (1/1) ... [2024-12-06 06:21:02,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 06:21:02,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ee676c-a459-484a-b11e-095adda906a9/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 06:21:02,248 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ee676c-a459-484a-b11e-095adda906a9/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 06:21:02,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ee676c-a459-484a-b11e-095adda906a9/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 06:21:02,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 06:21:02,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 06:21:02,326 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 06:21:02,327 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 06:21:02,448 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-12-06 06:21:02,448 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 06:21:02,464 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 06:21:02,464 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-06 06:21:02,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:21:02 BoogieIcfgContainer [2024-12-06 06:21:02,465 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 06:21:02,465 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 06:21:02,465 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 06:21:02,473 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 06:21:02,473 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:21:02" (1/1) ... [2024-12-06 06:21:02,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 06:21:02,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 34 states and 41 transitions. [2024-12-06 06:21:02,521 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-12-06 06:21:02,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-06 06:21:02,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:02,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:02,641 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 06:21:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:02,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 37 states and 46 transitions. [2024-12-06 06:21:02,683 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2024-12-06 06:21:02,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-06 06:21:02,683 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:02,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:02,756 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 06:21:02,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:02,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 36 states and 45 transitions. [2024-12-06 06:21:02,878 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-12-06 06:21:02,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 06:21:02,879 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:02,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:02,908 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 06:21:02,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 40 states and 52 transitions. [2024-12-06 06:21:02,932 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2024-12-06 06:21:02,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 06:21:02,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:02,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:02,979 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 06:21:03,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 42 states and 54 transitions. [2024-12-06 06:21:03,127 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2024-12-06 06:21:03,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 06:21:03,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:03,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:03,168 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 06:21:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:03,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 49 states and 65 transitions. [2024-12-06 06:21:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2024-12-06 06:21:03,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 06:21:03,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:03,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:03,530 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 06:21:03,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 50 states and 65 transitions. [2024-12-06 06:21:03,553 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2024-12-06 06:21:03,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 06:21:03,553 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:03,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:03,623 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 06:21:04,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 59 states and 81 transitions. [2024-12-06 06:21:04,238 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2024-12-06 06:21:04,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 06:21:04,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:04,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:04,333 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 06:21:04,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:04,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 62 states and 84 transitions. [2024-12-06 06:21:04,966 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 84 transitions. [2024-12-06 06:21:04,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 06:21:04,967 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:04,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:05,105 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 06:21:05,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:05,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 66 states and 91 transitions. [2024-12-06 06:21:05,578 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2024-12-06 06:21:05,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 06:21:05,580 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:05,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:05,604 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 06:21:06,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:06,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 70 states and 99 transitions. [2024-12-06 06:21:06,100 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 99 transitions. [2024-12-06 06:21:06,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 06:21:06,101 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:06,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:06,152 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 06:21:06,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:06,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 71 states and 100 transitions. [2024-12-06 06:21:06,202 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2024-12-06 06:21:06,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 06:21:06,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:06,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:06,440 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 06:21:07,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:07,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 73 states and 101 transitions. [2024-12-06 06:21:07,111 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2024-12-06 06:21:07,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 06:21:07,111 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:07,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:07,135 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 06:21:07,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 76 states and 106 transitions. [2024-12-06 06:21:07,537 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 106 transitions. [2024-12-06 06:21:07,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 06:21:07,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:07,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:07,670 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 06:21:09,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 84 states and 117 transitions. [2024-12-06 06:21:09,232 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 117 transitions. [2024-12-06 06:21:09,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 06:21:09,233 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:09,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:09,251 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 06:21:10,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:10,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 89 states and 127 transitions. [2024-12-06 06:21:10,257 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2024-12-06 06:21:10,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 06:21:10,257 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:10,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:10,270 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 06:21:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 97 states and 142 transitions. [2024-12-06 06:21:10,774 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2024-12-06 06:21:10,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 06:21:10,775 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:10,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:10,857 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 06:21:10,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:10,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 96 states and 141 transitions. [2024-12-06 06:21:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 141 transitions. [2024-12-06 06:21:10,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 06:21:10,941 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:10,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:10,957 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 06:21:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:11,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 102 states and 151 transitions. [2024-12-06 06:21:11,895 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2024-12-06 06:21:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 06:21:11,895 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:11,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:11,915 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 06:21:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 104 states and 152 transitions. [2024-12-06 06:21:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2024-12-06 06:21:12,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 06:21:12,281 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:12,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:12,467 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 06:21:13,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:13,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 105 states and 153 transitions. [2024-12-06 06:21:13,150 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2024-12-06 06:21:13,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 06:21:13,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:13,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:13,174 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 06:21:13,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:13,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 107 states and 156 transitions. [2024-12-06 06:21:13,868 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2024-12-06 06:21:13,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 06:21:13,869 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:13,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:13,888 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 06:21:14,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 109 states and 157 transitions. [2024-12-06 06:21:14,323 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-12-06 06:21:14,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 06:21:14,323 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:14,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:14,335 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 06:21:17,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:17,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 121 states and 170 transitions. [2024-12-06 06:21:17,023 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 170 transitions. [2024-12-06 06:21:17,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 06:21:17,024 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:17,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:17,038 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 06:21:17,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:17,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 121 states and 169 transitions. [2024-12-06 06:21:17,517 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 169 transitions. [2024-12-06 06:21:17,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 06:21:17,518 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:17,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:17,733 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 06:21:18,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 120 states and 164 transitions. [2024-12-06 06:21:18,444 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 164 transitions. [2024-12-06 06:21:18,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 06:21:18,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:18,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:18,544 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 06:21:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:18,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 120 states and 163 transitions. [2024-12-06 06:21:18,912 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 163 transitions. [2024-12-06 06:21:18,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 06:21:18,913 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:18,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:18,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 06:21:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 123 states and 166 transitions. [2024-12-06 06:21:19,552 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 166 transitions. [2024-12-06 06:21:19,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-06 06:21:19,552 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:19,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:19,572 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 06:21:20,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:20,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 129 states and 174 transitions. [2024-12-06 06:21:20,711 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 174 transitions. [2024-12-06 06:21:20,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 06:21:20,712 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:20,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:20,861 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:21:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 132 states and 178 transitions. [2024-12-06 06:21:21,929 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 178 transitions. [2024-12-06 06:21:21,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 06:21:21,929 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:21,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 06:21:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 134 states and 179 transitions. [2024-12-06 06:21:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 179 transitions. [2024-12-06 06:21:23,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-06 06:21:23,671 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:23,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:23,692 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:21:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:23,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 129 states and 173 transitions. [2024-12-06 06:21:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 173 transitions. [2024-12-06 06:21:23,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-06 06:21:23,890 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:23,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:23,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:21:24,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 131 states and 174 transitions. [2024-12-06 06:21:24,450 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 174 transitions. [2024-12-06 06:21:24,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-06 06:21:24,450 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:21:24,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:21:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:21:24,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:21:24,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:21:24,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 59 states and 74 transitions. [2024-12-06 06:21:24,669 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2024-12-06 06:21:24,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 06:21:24,669 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 34 iterations. [2024-12-06 06:21:24,677 INFO L726 CodeCheckObserver]: All specifications hold 10 specifications checked. All of them hold [2024-12-06 06:21:27,595 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 11) no Hoare annotation was computed. [2024-12-06 06:21:27,596 INFO L77 FloydHoareUtils]: At program point L15(lines 15 19) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648)) (<= |ULTIMATE.start_main_~y~0#1| 2147483647)) [2024-12-06 06:21:27,596 INFO L77 FloydHoareUtils]: At program point L15-2(lines 11 21) the Hoare annotation is: (let ((.cse0 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))) (.cse1 (+ |ULTIMATE.start_main_~y~0#1| 2147483648)) (.cse3 (<= |ULTIMATE.start_main_~x~0#1| 2147483647)) (.cse2 (+ |ULTIMATE.start_main_~x~0#1| 1))) (or (and .cse0 (< .cse1 0) (<= .cse2 0)) (and .cse3 .cse0 (<= 0 .cse1) (<= |ULTIMATE.start_main_~y~0#1| 2147483647)) (and .cse3 (< 0 .cse2) (< 2147483647 |ULTIMATE.start_main_~y~0#1|)))) [2024-12-06 06:21:27,596 INFO L77 FloydHoareUtils]: At program point L11-1(line 11) the Hoare annotation is: (let ((.cse5 (+ |ULTIMATE.start_main_~x~0#1| 1))) (let ((.cse0 (<= |ULTIMATE.start_main_~x~0#1| 2147483647)) (.cse2 (< 0 .cse5)) (.cse1 (not |ULTIMATE.start_main_#t~short2#1|)) (.cse3 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))) (.cse4 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))) (or (and .cse0 (or .cse1 .cse2) (or (< |ULTIMATE.start_main_~x~0#1| 0) |ULTIMATE.start_main_#t~short2#1|) .cse3 (<= 0 .cse4) (<= |ULTIMATE.start_main_~y~0#1| 2147483647)) (and .cse0 .cse2 (< 2147483647 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_#t~short2#1|) (and .cse1 .cse3 (< .cse4 0) (<= .cse5 0))))) [2024-12-06 06:21:27,596 INFO L77 FloydHoareUtils]: At program point L11-2(line 11) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (< 0 (+ |ULTIMATE.start_main_~x~0#1| 1)) (<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))) [2024-12-06 06:21:27,596 INFO L77 FloydHoareUtils]: At program point L11-3(line 11) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (< 0 (+ |ULTIMATE.start_main_~x~0#1| 1)) (<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))) [2024-12-06 06:21:27,597 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2024-12-06 06:21:27,597 INFO L77 FloydHoareUtils]: At program point L11-5(line 11) the Hoare annotation is: (let ((.cse3 (+ |ULTIMATE.start_main_~x~0#1| 1))) (let ((.cse0 (<= |ULTIMATE.start_main_~x~0#1| 2147483647)) (.cse1 (< 0 .cse3)) (.cse2 (not |ULTIMATE.start_main_#t~short2#1|))) (or (and .cse0 (< (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647) .cse1 (<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))) (and .cse0 .cse2 .cse1 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| 2147483648))) (and .cse2 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648)) (<= |ULTIMATE.start_main_~y~0#1| 2147483647) (<= .cse3 0))))) [2024-12-06 06:21:27,597 INFO L77 FloydHoareUtils]: At program point L11-6(line 11) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_main_~x~0#1| 1))) (let ((.cse0 (not |ULTIMATE.start_main_#t~short4#1|)) (.cse2 (<= |ULTIMATE.start_main_~x~0#1| 2147483647)) (.cse3 (< 0 .cse1))) (or (and .cse0 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648)) (<= |ULTIMATE.start_main_~y~0#1| 2147483647) (<= .cse1 0)) (and .cse0 .cse2 .cse3 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| 2147483648))) (and .cse2 (< (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647) .cse3 (<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648)))))) [2024-12-06 06:21:27,597 INFO L77 FloydHoareUtils]: At program point L11-8(line 11) the Hoare annotation is: (let ((.cse0 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648)))) (or (and .cse0 |ULTIMATE.start_main_#t~short3#1| (<= |ULTIMATE.start_main_~y~0#1| 2147483647) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0)) (and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) .cse0 (not |ULTIMATE.start_main_#t~short3#1|) (<= 0 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| 2147483648))))) [2024-12-06 06:21:27,598 INFO L77 FloydHoareUtils]: At program point L11-9(line 11) the Hoare annotation is: (and (<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648)) (<= |ULTIMATE.start_main_~y~0#1| 2147483647) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0)) [2024-12-06 06:21:27,598 INFO L77 FloydHoareUtils]: At program point L11-10(line 11) the Hoare annotation is: (and (<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648)) (<= |ULTIMATE.start_main_~y~0#1| 2147483647) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0)) [2024-12-06 06:21:27,598 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 11) no Hoare annotation was computed. [2024-12-06 06:21:27,598 INFO L77 FloydHoareUtils]: At program point L11-12(line 11) the Hoare annotation is: (or (and (<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648)) (<= |ULTIMATE.start_main_~y~0#1| 2147483647) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0) (<= 0 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| 2147483648))) (not |ULTIMATE.start_main_#t~short3#1|)) [2024-12-06 06:21:27,598 INFO L77 FloydHoareUtils]: At program point L11-13(line 11) the Hoare annotation is: (let ((.cse2 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| 2147483648))) (.cse0 (<= |ULTIMATE.start_main_~x~0#1| 2147483647)) (.cse3 (+ |ULTIMATE.start_main_~x~0#1| 1)) (.cse1 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))) (or (not |ULTIMATE.start_main_#t~short4#1|) (and .cse0 (< .cse1 0) .cse2) (and (<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648)) (<= |ULTIMATE.start_main_~y~0#1| 2147483647) (<= .cse3 0) .cse2) (and (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646) .cse0 (< 0 .cse3) (<= 0 .cse1)))) [2024-12-06 06:21:27,598 INFO L77 FloydHoareUtils]: At program point L11-14(line 11) the Hoare annotation is: (let ((.cse2 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| 2147483648))) (.cse0 (<= |ULTIMATE.start_main_~x~0#1| 2147483647)) (.cse3 (+ |ULTIMATE.start_main_~x~0#1| 1)) (.cse1 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))) (or (and .cse0 (< .cse1 0) .cse2) (not |ULTIMATE.start_main_#t~short5#1|) (and (<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648)) (<= |ULTIMATE.start_main_~y~0#1| 2147483647) (<= .cse3 0) .cse2) (and (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646) .cse0 (< 0 .cse3) (<= 0 .cse1)))) [2024-12-06 06:21:27,598 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 11) no Hoare annotation was computed. [2024-12-06 06:21:27,599 INFO L77 FloydHoareUtils]: At program point L11-15(line 11) the Hoare annotation is: (let ((.cse2 (<= 0 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| 2147483648))) (.cse0 (<= |ULTIMATE.start_main_~x~0#1| 2147483647)) (.cse3 (+ |ULTIMATE.start_main_~x~0#1| 1)) (.cse1 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))) (or (and .cse0 (< .cse1 0) .cse2) (and (<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648)) (<= |ULTIMATE.start_main_~y~0#1| 2147483647) (<= .cse3 0) .cse2) (and (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646) .cse0 (< 0 .cse3) (<= 0 .cse1)))) [2024-12-06 06:21:27,599 INFO L77 FloydHoareUtils]: At program point L11-16(line 11) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~x~0#1| 1))) (or (and (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (< 0 .cse0)) (and (<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648)) (<= |ULTIMATE.start_main_~y~0#1| 2147483647) (<= .cse0 0)))) [2024-12-06 06:21:27,599 INFO L77 FloydHoareUtils]: At program point L11-18(lines 11 21) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~y~0#1| 2147483647))) (or (not |ULTIMATE.start_main_#t~short5#1|) (and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (< 0 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) .cse0) (and (<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648)) (< 1 |ULTIMATE.start_main_~y~0#1|) .cse0 (<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0)))) [2024-12-06 06:21:27,599 INFO L77 FloydHoareUtils]: At program point L11-19(lines 11 21) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~y~0#1| 2147483647))) (or (and (<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648)) (<= 2 |ULTIMATE.start_main_~y~0#1|) .cse0 (<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0)) (and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) .cse0))) [2024-12-06 06:21:27,599 INFO L77 FloydHoareUtils]: At program point L11-21(lines 11 21) the Hoare annotation is: true [2024-12-06 06:21:27,599 INFO L77 FloydHoareUtils]: At program point L16(line 16) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648)) (<= |ULTIMATE.start_main_~y~0#1| 2147483647)) [2024-12-06 06:21:27,599 INFO L77 FloydHoareUtils]: At program point L16-1(line 16) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~y~0#1| 2147483647))) (or (and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) .cse0) (and (<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648)) .cse0 (<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0)))) [2024-12-06 06:21:27,599 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 16) no Hoare annotation was computed. [2024-12-06 06:21:27,600 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 11) no Hoare annotation was computed. [2024-12-06 06:21:27,600 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 06:21:27,600 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 11) no Hoare annotation was computed. [2024-12-06 06:21:27,600 INFO L77 FloydHoareUtils]: At program point L13(line 13) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~x~0#1|) (<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))) [2024-12-06 06:21:27,600 INFO L77 FloydHoareUtils]: At program point L13-1(line 13) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~x~0#1|) (<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))) [2024-12-06 06:21:27,600 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 16) no Hoare annotation was computed. [2024-12-06 06:21:27,600 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 06:21:27,600 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 11) no Hoare annotation was computed. [2024-12-06 06:21:27,600 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2024-12-06 06:21:27,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 06:21:27 ImpRootNode [2024-12-06 06:21:27,611 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 06:21:27,611 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 06:21:27,611 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 06:21:27,611 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 06:21:27,612 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:21:02" (3/4) ... [2024-12-06 06:21:27,614 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 06:21:27,618 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-12-06 06:21:27,619 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-12-06 06:21:27,619 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-12-06 06:21:27,691 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ee676c-a459-484a-b11e-095adda906a9/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 06:21:27,691 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ee676c-a459-484a-b11e-095adda906a9/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 06:21:27,691 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 06:21:27,692 INFO L158 Benchmark]: Toolchain (without parser) took 25689.35ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 117.3MB in the beginning and 197.2MB in the end (delta: -79.9MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. [2024-12-06 06:21:27,693 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 06:21:27,693 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.87ms. Allocated memory is still 142.6MB. Free memory was 117.3MB in the beginning and 107.1MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 06:21:27,693 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.52ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 106.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 06:21:27,694 INFO L158 Benchmark]: Boogie Preprocessor took 16.47ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 105.5MB in the end (delta: 627.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 06:21:27,694 INFO L158 Benchmark]: RCFGBuilder took 246.41ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 93.6MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 06:21:27,694 INFO L158 Benchmark]: CodeCheck took 25145.57ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 93.6MB in the beginning and 202.7MB in the end (delta: -109.1MB). Peak memory consumption was 144.3MB. Max. memory is 16.1GB. [2024-12-06 06:21:27,695 INFO L158 Benchmark]: Witness Printer took 80.33ms. Allocated memory is still 268.4MB. Free memory was 202.7MB in the beginning and 197.2MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 06:21:27,697 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, 34 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 22.2s, OverallIterations: 34, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5046 SdHoareTripleChecker+Valid, 12.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4003 mSDsluCounter, 2591 SdHoareTripleChecker+Invalid, 11.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1652 mSDsCounter, 2566 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11293 IncrementalHoareTripleChecker+Invalid, 13859 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2566 mSolverCounterUnsat, 939 mSDtfsCounter, 11293 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4412 GetRequests, 3824 SyntacticMatches, 188 SemanticMatches, 400 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77765 ImplicationChecksByTransitivity, 20.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 524 NumberOfCodeBlocks, 524 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 491 ConstructedInterpolants, 0 QuantifiedInterpolants, 1564 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 31 PerfectInterpolantSequences, 56/66 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: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: 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: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: (((((0 <= (x + 2147483648)) && ((y + 2147483648) < 0)) && (((long) x + 1) <= 0)) || ((((x <= 2147483647) && (0 <= (x + 2147483648))) && (0 <= (y + 2147483648))) && (y <= 2147483647))) || (((x <= 2147483647) && (0 < ((long) x + 1))) && (2147483647 < y))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.87ms. Allocated memory is still 142.6MB. Free memory was 117.3MB in the beginning and 107.1MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.52ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 106.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.47ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 105.5MB in the end (delta: 627.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 246.41ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 93.6MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 25145.57ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 93.6MB in the beginning and 202.7MB in the end (delta: -109.1MB). Peak memory consumption was 144.3MB. Max. memory is 16.1GB. * Witness Printer took 80.33ms. Allocated memory is still 268.4MB. Free memory was 202.7MB in the beginning and 197.2MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 06:21:27,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15ee676c-a459-484a-b11e-095adda906a9/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