./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/loops/eureka_05.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8343c8c3-4fe8-4461-85aa-7cd25e581634/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8343c8c3-4fe8-4461-85aa-7cd25e581634/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8343c8c3-4fe8-4461-85aa-7cd25e581634/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8343c8c3-4fe8-4461-85aa-7cd25e581634/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/loops/eureka_05.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8343c8c3-4fe8-4461-85aa-7cd25e581634/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Overflow-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8343c8c3-4fe8-4461-85aa-7cd25e581634/bin/ukojak-verify-EEHR8qb7sm --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:14:32,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:14:32,394 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8343c8c3-4fe8-4461-85aa-7cd25e581634/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Overflow-32bit-Kojak_Default.epf [2024-11-13 23:14:32,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:14:32,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 23:14:32,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:14:32,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:14:32,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 23:14:32,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 23:14:32,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 23:14:32,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:14:32,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 23:14:32,423 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:14:32,423 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 23:14:32,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:14:32,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:14:32,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 23:14:32,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:14:32,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 23:14:32,424 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:14:32,424 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-13 23:14:32,424 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 23:14:32,424 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:14:32,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 23:14:32,425 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:14:32,425 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 23:14:32,425 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 23:14:32,425 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 23:14:32,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:14:32,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 23:14:32,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:14:32,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:14:32,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 23:14:32,426 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 23:14:32,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 23:14:32,426 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_8343c8c3-4fe8-4461-85aa-7cd25e581634/bin/ukojak-verify-EEHR8qb7sm Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab [2024-11-13 23:14:32,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:14:32,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:14:32,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:14:32,779 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:14:32,779 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:14:32,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8343c8c3-4fe8-4461-85aa-7cd25e581634/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/loops/eureka_05.i Unable to find full path for "g++" [2024-11-13 23:14:34,610 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:14:34,903 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:14:34,904 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8343c8c3-4fe8-4461-85aa-7cd25e581634/sv-benchmarks/c/loops/eureka_05.i [2024-11-13 23:14:34,911 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8343c8c3-4fe8-4461-85aa-7cd25e581634/bin/ukojak-verify-EEHR8qb7sm/data/41e4e35a4/d740389824f444c5aa6e709dbf0a0d78/FLAG2561bc179 [2024-11-13 23:14:35,180 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8343c8c3-4fe8-4461-85aa-7cd25e581634/bin/ukojak-verify-EEHR8qb7sm/data/41e4e35a4/d740389824f444c5aa6e709dbf0a0d78 [2024-11-13 23:14:35,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:14:35,183 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:14:35,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:14:35,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:14:35,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:14:35,190 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:14:35" (1/1) ... [2024-11-13 23:14:35,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@555d94d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:14:35, skipping insertion in model container [2024-11-13 23:14:35,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:14:35" (1/1) ... [2024-11-13 23:14:35,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:14:35,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:14:35,396 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:14:35,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:14:35,436 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:14:35,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:14:35 WrapperNode [2024-11-13 23:14:35,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:14:35,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:14:35,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:14:35,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:14:35,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:14:35" (1/1) ... [2024-11-13 23:14:35,452 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:14:35" (1/1) ... [2024-11-13 23:14:35,471 INFO L138 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2024-11-13 23:14:35,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:14:35,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:14:35,472 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:14:35,472 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:14:35,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:14:35" (1/1) ... [2024-11-13 23:14:35,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:14:35" (1/1) ... [2024-11-13 23:14:35,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:14:35" (1/1) ... [2024-11-13 23:14:35,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:14:35" (1/1) ... [2024-11-13 23:14:35,487 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:14:35" (1/1) ... [2024-11-13 23:14:35,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:14:35" (1/1) ... [2024-11-13 23:14:35,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:14:35" (1/1) ... [2024-11-13 23:14:35,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:14:35" (1/1) ... [2024-11-13 23:14:35,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:14:35,495 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:14:35,495 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:14:35,496 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:14:35,497 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:14:35" (1/1) ... [2024-11-13 23:14:35,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 23:14:35,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8343c8c3-4fe8-4461-85aa-7cd25e581634/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 23:14:35,529 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8343c8c3-4fe8-4461-85aa-7cd25e581634/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 23:14:35,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8343c8c3-4fe8-4461-85aa-7cd25e581634/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 23:14:35,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:14:35,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 23:14:35,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 23:14:35,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 23:14:35,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:14:35,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:14:35,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 23:14:35,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 23:14:35,654 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:14:35,656 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:14:35,847 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-13 23:14:35,848 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:14:35,933 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:14:35,933 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-13 23:14:35,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:14:35 BoogieIcfgContainer [2024-11-13 23:14:35,933 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:14:35,934 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 23:14:35,934 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 23:14:35,945 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 23:14:35,945 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:14:35" (1/1) ... [2024-11-13 23:14:35,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:14:36,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:36,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 26 states and 29 transitions. [2024-11-13 23:14:36,009 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-13 23:14:36,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 23:14:36,011 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:36,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:36,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:14:36,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:36,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 28 states and 32 transitions. [2024-11-13 23:14:36,306 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-13 23:14:36,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 23:14:36,307 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:36,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:14:36,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 27 states and 30 transitions. [2024-11-13 23:14:36,572 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-11-13 23:14:36,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 23:14:36,573 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:36,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:36,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:14:36,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:36,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 26 states and 29 transitions. [2024-11-13 23:14:36,737 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-13 23:14:36,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 23:14:36,737 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:36,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:14:36,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:36,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 28 states and 33 transitions. [2024-11-13 23:14:36,887 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-11-13 23:14:36,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 23:14:36,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:36,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:14:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:37,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 31 states and 39 transitions. [2024-11-13 23:14:37,609 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-11-13 23:14:37,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 23:14:37,609 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:37,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:37,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:14:37,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:37,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 32 states and 40 transitions. [2024-11-13 23:14:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-11-13 23:14:37,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 23:14:37,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:37,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:37,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:14:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:37,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 34 states and 44 transitions. [2024-11-13 23:14:37,913 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-11-13 23:14:37,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 23:14:37,916 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:37,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:14:38,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:38,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 36 states and 46 transitions. [2024-11-13 23:14:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2024-11-13 23:14:38,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 23:14:38,349 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:38,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:38,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 23:14:38,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:38,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 34 states and 42 transitions. [2024-11-13 23:14:38,623 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2024-11-13 23:14:38,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 23:14:38,623 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:38,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:14:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:39,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 37 states and 45 transitions. [2024-11-13 23:14:39,373 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2024-11-13 23:14:39,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 23:14:39,374 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:39,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:39,594 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:14:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:40,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 40 states and 48 transitions. [2024-11-13 23:14:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-11-13 23:14:40,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 23:14:40,175 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:40,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:14:41,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:41,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 43 states and 50 transitions. [2024-11-13 23:14:41,006 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-11-13 23:14:41,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 23:14:41,006 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:41,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:41,192 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 23:14:41,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:41,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 45 states and 55 transitions. [2024-11-13 23:14:41,546 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2024-11-13 23:14:41,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 23:14:41,546 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:41,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:41,595 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 23:14:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 46 states and 56 transitions. [2024-11-13 23:14:41,614 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-11-13 23:14:41,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 23:14:41,614 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:41,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:41,808 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 23:14:42,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:42,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 49 states and 63 transitions. [2024-11-13 23:14:42,281 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2024-11-13 23:14:42,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 23:14:42,281 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:42,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 23:14:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:42,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 51 states and 67 transitions. [2024-11-13 23:14:42,614 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-11-13 23:14:42,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 23:14:42,615 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:42,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:42,704 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 23:14:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:43,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 53 states and 69 transitions. [2024-11-13 23:14:43,148 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2024-11-13 23:14:43,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 23:14:43,149 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:43,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:43,336 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 23:14:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 54 states and 69 transitions. [2024-11-13 23:14:43,454 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2024-11-13 23:14:43,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 23:14:43,455 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:43,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:43,661 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 23:14:43,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:43,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 56 states and 72 transitions. [2024-11-13 23:14:43,819 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2024-11-13 23:14:43,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 23:14:43,820 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:43,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:43,966 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 23:14:44,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 59 states and 76 transitions. [2024-11-13 23:14:44,245 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2024-11-13 23:14:44,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 23:14:44,245 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:44,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:44,467 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 23:14:45,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:45,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 62 states and 82 transitions. [2024-11-13 23:14:45,030 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2024-11-13 23:14:45,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 23:14:45,031 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:45,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:45,096 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 23:14:45,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:45,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 63 states and 83 transitions. [2024-11-13 23:14:45,113 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2024-11-13 23:14:45,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 23:14:45,113 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:45,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:45,314 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-13 23:14:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 65 states and 91 transitions. [2024-11-13 23:14:45,912 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2024-11-13 23:14:45,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 23:14:45,914 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:45,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:46,055 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 23:14:46,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:46,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 68 states and 95 transitions. [2024-11-13 23:14:46,469 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2024-11-13 23:14:46,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 23:14:46,469 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:46,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:46,515 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 23:14:46,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:46,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 70 states and 96 transitions. [2024-11-13 23:14:46,815 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2024-11-13 23:14:46,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 23:14:46,816 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:46,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:47,066 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 23:14:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 73 states and 104 transitions. [2024-11-13 23:14:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 104 transitions. [2024-11-13 23:14:47,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 23:14:47,611 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:47,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 23:14:48,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:48,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 76 states and 107 transitions. [2024-11-13 23:14:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 107 transitions. [2024-11-13 23:14:48,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 23:14:48,694 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:48,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:48,766 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-13 23:14:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:49,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 78 states and 108 transitions. [2024-11-13 23:14:49,045 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2024-11-13 23:14:49,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 23:14:49,045 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:49,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 23:14:49,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:49,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 81 states and 116 transitions. [2024-11-13 23:14:49,962 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2024-11-13 23:14:49,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 23:14:49,962 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:49,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:50,315 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 23:14:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 84 states and 119 transitions. [2024-11-13 23:14:51,219 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2024-11-13 23:14:51,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 23:14:51,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:51,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-13 23:14:51,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:51,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 86 states and 120 transitions. [2024-11-13 23:14:51,567 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 120 transitions. [2024-11-13 23:14:51,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 23:14:51,567 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:51,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 23:14:52,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:52,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 89 states and 128 transitions. [2024-11-13 23:14:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2024-11-13 23:14:52,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 23:14:52,541 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:52,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:52,941 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 23:14:53,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:53,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 92 states and 130 transitions. [2024-11-13 23:14:53,855 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2024-11-13 23:14:53,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 23:14:53,855 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:53,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:53,931 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 23:14:54,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:54,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 94 states and 131 transitions. [2024-11-13 23:14:54,308 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2024-11-13 23:14:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 23:14:54,309 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:54,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:14:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:55,710 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-13 23:15:06,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 110 states and 148 transitions. [2024-11-13 23:15:06,097 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 148 transitions. [2024-11-13 23:15:06,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 23:15:06,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:06,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:06,284 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-13 23:15:07,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:07,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 112 states and 151 transitions. [2024-11-13 23:15:07,058 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 151 transitions. [2024-11-13 23:15:07,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-13 23:15:07,058 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:07,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:07,541 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-13 23:15:09,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 115 states and 155 transitions. [2024-11-13 23:15:09,349 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 155 transitions. [2024-11-13 23:15:09,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-13 23:15:09,349 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:09,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-13 23:15:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:11,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 118 states and 169 transitions. [2024-11-13 23:15:11,175 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 169 transitions. [2024-11-13 23:15:11,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-13 23:15:11,175 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:11,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:11,246 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-13 23:15:11,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 119 states and 170 transitions. [2024-11-13 23:15:11,810 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 170 transitions. [2024-11-13 23:15:11,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 23:15:11,811 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:11,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:12,023 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-13 23:15:12,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:12,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 118 states and 169 transitions. [2024-11-13 23:15:12,568 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 169 transitions. [2024-11-13 23:15:12,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 23:15:12,568 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:12,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:12,604 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-13 23:15:13,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:13,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 120 states and 170 transitions. [2024-11-13 23:15:13,137 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 170 transitions. [2024-11-13 23:15:13,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-13 23:15:13,138 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:13,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 23:15:16,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 131 states and 187 transitions. [2024-11-13 23:15:16,395 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 187 transitions. [2024-11-13 23:15:16,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-13 23:15:16,396 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:16,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-13 23:15:17,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:17,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 133 states and 188 transitions. [2024-11-13 23:15:17,024 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 188 transitions. [2024-11-13 23:15:17,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-13 23:15:17,025 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:17,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:17,156 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-13 23:15:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 134 states and 190 transitions. [2024-11-13 23:15:17,804 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 190 transitions. [2024-11-13 23:15:17,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-13 23:15:17,804 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:17,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-13 23:15:18,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 137 states and 194 transitions. [2024-11-13 23:15:18,751 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 194 transitions. [2024-11-13 23:15:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-13 23:15:18,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:18,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:18,804 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-13 23:15:19,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 139 states and 195 transitions. [2024-11-13 23:15:19,392 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 195 transitions. [2024-11-13 23:15:19,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 23:15:19,393 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:19,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:19,430 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-13 23:15:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 141 states and 196 transitions. [2024-11-13 23:15:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 196 transitions. [2024-11-13 23:15:20,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 23:15:20,104 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:20,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-13 23:15:20,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 142 states and 198 transitions. [2024-11-13 23:15:20,976 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 198 transitions. [2024-11-13 23:15:20,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-13 23:15:20,976 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:20,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:21,576 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-13 23:15:22,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:22,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 145 states and 202 transitions. [2024-11-13 23:15:22,851 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 202 transitions. [2024-11-13 23:15:22,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-13 23:15:22,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:22,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:22,893 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-13 23:15:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:23,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 147 states and 203 transitions. [2024-11-13 23:15:23,494 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 203 transitions. [2024-11-13 23:15:23,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-13 23:15:23,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:23,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:23,532 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-13 23:15:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 149 states and 204 transitions. [2024-11-13 23:15:24,235 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 204 transitions. [2024-11-13 23:15:24,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-13 23:15:24,236 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:24,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 26 proven. 47 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-13 23:15:29,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:29,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 158 states and 218 transitions. [2024-11-13 23:15:29,199 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 218 transitions. [2024-11-13 23:15:29,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-13 23:15:29,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:29,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:30,128 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 22 proven. 39 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-13 23:15:31,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:31,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 161 states and 221 transitions. [2024-11-13 23:15:31,537 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 221 transitions. [2024-11-13 23:15:31,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-13 23:15:31,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:31,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:31,592 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-13 23:15:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 162 states and 224 transitions. [2024-11-13 23:15:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 224 transitions. [2024-11-13 23:15:32,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-13 23:15:32,431 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:32,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:32,931 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 3 proven. 68 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 23:15:38,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:38,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 174 states and 242 transitions. [2024-11-13 23:15:38,782 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 242 transitions. [2024-11-13 23:15:38,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-13 23:15:38,783 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:38,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-13 23:15:46,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 187 states and 258 transitions. [2024-11-13 23:15:46,406 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 258 transitions. [2024-11-13 23:15:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-13 23:15:46,407 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:46,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:46,968 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 23:15:48,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:48,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 189 states and 261 transitions. [2024-11-13 23:15:48,164 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 261 transitions. [2024-11-13 23:15:48,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 23:15:48,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:48,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 30 proven. 64 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 23:15:49,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:49,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 191 states and 262 transitions. [2024-11-13 23:15:49,150 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 262 transitions. [2024-11-13 23:15:49,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-13 23:15:49,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:49,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 23:15:50,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 192 states and 262 transitions. [2024-11-13 23:15:50,073 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 262 transitions. [2024-11-13 23:15:50,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-13 23:15:50,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:50,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:50,109 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-11-13 23:15:50,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 194 states and 263 transitions. [2024-11-13 23:15:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 263 transitions. [2024-11-13 23:15:50,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-13 23:15:50,864 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:50,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:50,931 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2024-11-13 23:15:52,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 196 states and 261 transitions. [2024-11-13 23:15:52,258 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 261 transitions. [2024-11-13 23:15:52,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 23:15:52,258 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:52,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:52,961 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-13 23:15:59,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:15:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 206 states and 275 transitions. [2024-11-13 23:15:59,327 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 275 transitions. [2024-11-13 23:15:59,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 23:15:59,327 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:15:59,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:15:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:15:59,375 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-11-13 23:16:00,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:16:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 208 states and 276 transitions. [2024-11-13 23:16:00,088 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 276 transitions. [2024-11-13 23:16:00,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 23:16:00,088 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:16:00,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:16:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:16:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 56 proven. 130 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-13 23:16:04,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:16:04,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 213 states and 282 transitions. [2024-11-13 23:16:04,085 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 282 transitions. [2024-11-13 23:16:04,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 23:16:04,085 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:16:04,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:16:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:16:04,388 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 40 proven. 135 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-13 23:16:05,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:16:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 216 states and 285 transitions. [2024-11-13 23:16:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 285 transitions. [2024-11-13 23:16:05,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 23:16:05,953 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:16:05,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:16:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:16:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 40 proven. 135 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-13 23:16:07,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:16:07,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 218 states and 286 transitions. [2024-11-13 23:16:07,108 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 286 transitions. [2024-11-13 23:16:07,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 23:16:07,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:16:07,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:16:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:16:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-13 23:16:07,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:16:07,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 220 states and 287 transitions. [2024-11-13 23:16:07,964 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 287 transitions. [2024-11-13 23:16:07,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-13 23:16:07,964 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:16:07,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:16:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:16:09,394 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 72 proven. 135 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-13 23:16:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:16:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 228 states and 296 transitions. [2024-11-13 23:16:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 296 transitions. [2024-11-13 23:16:15,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 23:16:15,063 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:16:15,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:16:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:16:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-13 23:16:21,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:16:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 235 states and 306 transitions. [2024-11-13 23:16:21,554 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 306 transitions. [2024-11-13 23:16:21,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-13 23:16:21,554 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:16:21,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:16:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:16:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 99 proven. 146 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-13 23:16:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:16:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 88 states and 90 transitions. [2024-11-13 23:16:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2024-11-13 23:16:27,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-13 23:16:27,644 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:16:27,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:16:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:16:28,045 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-11-13 23:16:29,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:16:29,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 90 states and 93 transitions. [2024-11-13 23:16:29,001 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2024-11-13 23:16:29,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-13 23:16:29,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:16:29,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:16:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:16:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-11-13 23:16:30,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:16:30,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 89 states and 92 transitions. [2024-11-13 23:16:30,920 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2024-11-13 23:16:30,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 23:16:30,920 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:16:30,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:16:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:16:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-11-13 23:16:32,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:16:32,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 86 states and 87 transitions. [2024-11-13 23:16:32,157 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2024-11-13 23:16:32,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 23:16:32,157 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 74 iterations. [2024-11-13 23:16:32,167 INFO L729 CodeCheckObserver]: All specifications hold 10 specifications checked. All of them hold [2024-11-13 23:16:38,029 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2024-11-13 23:16:38,029 INFO L77 FloydHoareUtils]: At program point L44-2(line 44) the Hoare annotation is: (let ((.cse0 (<= 5 ~n~0)) (.cse1 (<= ~n~0 5))) (or (and (<= 0 |ULTIMATE.start_main_#t~post7#1|) (< |ULTIMATE.start_main_#t~post7#1| 1) .cse0 .cse1) (and (<= 3 |ULTIMATE.start_main_#t~post7#1|) (< |ULTIMATE.start_main_#t~post7#1| 4) .cse0 .cse1) (and (< |ULTIMATE.start_main_#t~post7#1| 3) .cse0 (<= 2 |ULTIMATE.start_main_#t~post7#1|) .cse1) (and .cse0 (< |ULTIMATE.start_main_#t~post7#1| 2) .cse1 (<= 1 |ULTIMATE.start_main_#t~post7#1|)) (and (<= 4 |ULTIMATE.start_main_#t~post7#1|) .cse0 (<= |ULTIMATE.start_main_#t~post7#1| 4) .cse1))) [2024-11-13 23:16:38,030 INFO L77 FloydHoareUtils]: At program point L44-3(line 44) the Hoare annotation is: (and (<= 5 ~n~0) (<= |ULTIMATE.start_main_#t~post7#1| 4) (<= ~n~0 5)) [2024-11-13 23:16:38,030 INFO L77 FloydHoareUtils]: At program point L44-4(lines 44 45) the Hoare annotation is: (and (<= 5 ~n~0) (<= ~n~0 5) (<= |ULTIMATE.start_main_~i~1#1| 4)) [2024-11-13 23:16:38,030 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2024-11-13 23:16:38,030 INFO L77 FloydHoareUtils]: At program point L32(line 32) the Hoare annotation is: (let ((.cse2 (< 2 |ULTIMATE.start_SelectionSort_~lh~0#1|)) (.cse1 (+ 2 |ULTIMATE.start_SelectionSort_~lh~0#1|)) (.cse0 (<= ~n~0 5))) (or (and (<= 5 ~n~0) .cse0 (= |ULTIMATE.start_SelectionSort_~lh~0#1| 0)) (and (< ~n~0 .cse1) .cse2 (<= |ULTIMATE.start_SelectionSort_~lh~0#1| 4)) (and .cse2 .cse0 (<= .cse1 ~n~0)) (and (< 1 |ULTIMATE.start_SelectionSort_~lh~0#1|) (<= (+ 3 |ULTIMATE.start_SelectionSort_~lh~0#1|) ~n~0) .cse0) (and (<= 1 |ULTIMATE.start_SelectionSort_~lh~0#1|) (<= (+ |ULTIMATE.start_SelectionSort_~lh~0#1| 4) ~n~0) .cse0))) [2024-11-13 23:16:38,030 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 44) no Hoare annotation was computed. [2024-11-13 23:16:38,030 INFO L77 FloydHoareUtils]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse2 (< 2 |ULTIMATE.start_SelectionSort_~lh~0#1|)) (.cse1 (+ 2 |ULTIMATE.start_SelectionSort_~lh~0#1|)) (.cse0 (<= ~n~0 5))) (or (and (<= 5 ~n~0) .cse0 (= |ULTIMATE.start_SelectionSort_~lh~0#1| 0)) (and (< ~n~0 .cse1) .cse2 (<= |ULTIMATE.start_SelectionSort_~lh~0#1| 4)) (and .cse2 .cse0 (<= .cse1 ~n~0)) (and (< 1 |ULTIMATE.start_SelectionSort_~lh~0#1|) (<= (+ 3 |ULTIMATE.start_SelectionSort_~lh~0#1|) ~n~0) .cse0) (and (<= 1 |ULTIMATE.start_SelectionSort_~lh~0#1|) (<= (+ |ULTIMATE.start_SelectionSort_~lh~0#1| 4) ~n~0) .cse0))) [2024-11-13 23:16:38,030 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2024-11-13 23:16:38,031 INFO L77 FloydHoareUtils]: At program point L32-4(line 32) the Hoare annotation is: (let ((.cse11 (+ |ULTIMATE.start_SelectionSort_#t~post3#1| 1)) (.cse13 (+ |ULTIMATE.start_SelectionSort_~lh~0#1| 4)) (.cse8 (+ |ULTIMATE.start_SelectionSort_#t~post3#1| 2)) (.cse4 (+ |ULTIMATE.start_SelectionSort_#t~post3#1| 3))) (let ((.cse2 (<= ~n~0 .cse4)) (.cse3 (<= |ULTIMATE.start_SelectionSort_#t~post3#1| 2)) (.cse9 (< 2 |ULTIMATE.start_SelectionSort_#t~post3#1|)) (.cse12 (<= (+ 3 |ULTIMATE.start_SelectionSort_~lh~0#1|) ~n~0)) (.cse7 (<= |ULTIMATE.start_SelectionSort_#t~post3#1| 3)) (.cse10 (<= ~n~0 .cse8)) (.cse1 (= |ULTIMATE.start_SelectionSort_~lh~0#1| 0)) (.cse5 (<= 1 |ULTIMATE.start_SelectionSort_~lh~0#1|)) (.cse14 (<= |ULTIMATE.start_SelectionSort_#t~post3#1| 4)) (.cse6 (<= .cse13 ~n~0)) (.cse15 (<= ~n~0 .cse11))) (or (let ((.cse0 (+ |ULTIMATE.start_SelectionSort_#t~post3#1| 4))) (and (<= ~n~0 .cse0) (<= 1 |ULTIMATE.start_SelectionSort_#t~post3#1|) (<= |ULTIMATE.start_SelectionSort_#t~post3#1| 1) .cse1 (<= .cse0 ~n~0))) (and .cse2 (< 1 |ULTIMATE.start_SelectionSort_#t~post3#1|) .cse3 (<= .cse4 ~n~0) .cse1) (and .cse2 .cse5 .cse3 .cse6) (and .cse7 (<= .cse8 ~n~0) .cse9 .cse1 .cse10) (and (< .cse11 ~n~0) .cse7 .cse12 (< ~n~0 .cse13) .cse9 .cse10) (and .cse14 (< 1 |ULTIMATE.start_SelectionSort_~lh~0#1|) .cse12 .cse15) (and .cse14 (< 2 |ULTIMATE.start_SelectionSort_~lh~0#1|) .cse15 (<= (+ 2 |ULTIMATE.start_SelectionSort_~lh~0#1|) ~n~0)) (and .cse5 .cse7 .cse6 .cse10) (and .cse14 (<= 5 ~n~0) .cse1 .cse15) (and .cse5 .cse14 .cse6 .cse15)))) [2024-11-13 23:16:38,031 INFO L77 FloydHoareUtils]: At program point L32-5(line 32) the Hoare annotation is: (let ((.cse11 (+ |ULTIMATE.start_SelectionSort_#t~post3#1| 1)) (.cse13 (+ |ULTIMATE.start_SelectionSort_~lh~0#1| 4)) (.cse8 (+ |ULTIMATE.start_SelectionSort_#t~post3#1| 2)) (.cse4 (+ |ULTIMATE.start_SelectionSort_#t~post3#1| 3))) (let ((.cse2 (<= ~n~0 .cse4)) (.cse3 (<= |ULTIMATE.start_SelectionSort_#t~post3#1| 2)) (.cse9 (< 2 |ULTIMATE.start_SelectionSort_#t~post3#1|)) (.cse12 (<= (+ 3 |ULTIMATE.start_SelectionSort_~lh~0#1|) ~n~0)) (.cse7 (<= |ULTIMATE.start_SelectionSort_#t~post3#1| 3)) (.cse10 (<= ~n~0 .cse8)) (.cse1 (= |ULTIMATE.start_SelectionSort_~lh~0#1| 0)) (.cse5 (<= 1 |ULTIMATE.start_SelectionSort_~lh~0#1|)) (.cse14 (<= |ULTIMATE.start_SelectionSort_#t~post3#1| 4)) (.cse6 (<= .cse13 ~n~0)) (.cse15 (<= ~n~0 .cse11))) (or (let ((.cse0 (+ |ULTIMATE.start_SelectionSort_#t~post3#1| 4))) (and (<= ~n~0 .cse0) (<= 1 |ULTIMATE.start_SelectionSort_#t~post3#1|) (<= |ULTIMATE.start_SelectionSort_#t~post3#1| 1) .cse1 (<= .cse0 ~n~0))) (and .cse2 (< 1 |ULTIMATE.start_SelectionSort_#t~post3#1|) .cse3 (<= .cse4 ~n~0) .cse1) (and .cse2 .cse5 .cse3 .cse6) (and .cse7 (<= .cse8 ~n~0) .cse9 .cse1 .cse10) (and (< .cse11 ~n~0) .cse7 .cse12 (< ~n~0 .cse13) .cse9 .cse10) (and .cse14 (< 1 |ULTIMATE.start_SelectionSort_~lh~0#1|) .cse12 .cse15) (and .cse14 (< 2 |ULTIMATE.start_SelectionSort_~lh~0#1|) .cse15 (<= (+ 2 |ULTIMATE.start_SelectionSort_~lh~0#1|) ~n~0)) (and .cse5 .cse7 .cse6 .cse10) (and .cse14 (<= 5 ~n~0) .cse1 .cse15) (and .cse5 .cse14 .cse6 .cse15)))) [2024-11-13 23:16:38,031 INFO L77 FloydHoareUtils]: At program point L32-6(lines 32 33) the Hoare annotation is: (let ((.cse24 (+ |ULTIMATE.start_SelectionSort_~i~0#1| 2)) (.cse20 (+ |ULTIMATE.start_SelectionSort_~i~0#1| 1)) (.cse2 (+ 2 |ULTIMATE.start_SelectionSort_~lh~0#1|)) (.cse8 (+ |ULTIMATE.start_SelectionSort_~lh~0#1| 4)) (.cse12 (+ 3 |ULTIMATE.start_SelectionSort_~lh~0#1|))) (let ((.cse3 (<= 1 |ULTIMATE.start_SelectionSort_~lh~0#1|)) (.cse10 (< |ULTIMATE.start_SelectionSort_~i~0#1| ~n~0)) (.cse6 (<= |ULTIMATE.start_SelectionSort_~lh~0#1| 2147483646)) (.cse15 (<= .cse12 ~n~0)) (.cse16 (< ~n~0 .cse8)) (.cse4 (< 4 |ULTIMATE.start_SelectionSort_~i~0#1|)) (.cse17 (< 2 |ULTIMATE.start_SelectionSort_~lh~0#1|)) (.cse5 (<= ~n~0 5)) (.cse14 (<= .cse2 ~n~0)) (.cse18 (<= ~n~0 |ULTIMATE.start_SelectionSort_~i~0#1|)) (.cse7 (< 1 |ULTIMATE.start_SelectionSort_~i~0#1|)) (.cse9 (<= ~n~0 .cse20)) (.cse11 (<= |ULTIMATE.start_SelectionSort_~i~0#1| 4)) (.cse13 (< 3 |ULTIMATE.start_SelectionSort_~i~0#1|)) (.cse19 (< 2 |ULTIMATE.start_SelectionSort_~i~0#1|)) (.cse21 (<= ~n~0 .cse24)) (.cse1 (= |ULTIMATE.start_SelectionSort_~lh~0#1| 0)) (.cse22 (<= |ULTIMATE.start_SelectionSort_~i~0#1| 3))) (or (let ((.cse0 (+ |ULTIMATE.start_SelectionSort_~i~0#1| 4))) (and (<= ~n~0 .cse0) (<= .cse0 ~n~0) (<= |ULTIMATE.start_SelectionSort_~i~0#1| 1) (<= 1 |ULTIMATE.start_SelectionSort_~i~0#1|) .cse1)) (and (< ~n~0 .cse2) .cse3 .cse4 .cse5 .cse6) (and .cse3 .cse7 (<= .cse8 ~n~0) .cse5) (and .cse9 .cse10 .cse11 (< ~n~0 .cse12) .cse13 .cse14) (and (< 1 |ULTIMATE.start_SelectionSort_~lh~0#1|) .cse4 .cse15 .cse5) (and .cse9 .cse10 .cse11 .cse15 .cse16 .cse13) (and .cse11 .cse17 .cse18 .cse6 .cse13) (and .cse19 (< .cse20 ~n~0) .cse15 .cse21 .cse16 .cse22) (and .cse4 .cse17 .cse5 .cse14) (and (<= 5 ~n~0) (<= |ULTIMATE.start_SelectionSort_~i~0#1| 5) .cse18 .cse1) (let ((.cse23 (+ |ULTIMATE.start_SelectionSort_~i~0#1| 3))) (and (<= |ULTIMATE.start_SelectionSort_~i~0#1| 2) (<= .cse23 ~n~0) .cse7 (<= ~n~0 .cse23) .cse1)) (and .cse9 (<= .cse20 ~n~0) .cse11 .cse1 .cse13) (and (<= .cse24 ~n~0) .cse19 .cse21 .cse1 .cse22)))) [2024-11-13 23:16:38,032 INFO L77 FloydHoareUtils]: At program point L49-2(line 49) the Hoare annotation is: (or (and (<= |ULTIMATE.start_main_#t~post9#1| 4) (<= 1 |ULTIMATE.start_main_#t~post9#1|)) (= |ULTIMATE.start_main_#t~post9#1| 0)) [2024-11-13 23:16:38,032 INFO L77 FloydHoareUtils]: At program point L49-3(line 49) the Hoare annotation is: (or (and (<= |ULTIMATE.start_main_#t~post9#1| 4) (<= 1 |ULTIMATE.start_main_#t~post9#1|)) (= |ULTIMATE.start_main_#t~post9#1| 0)) [2024-11-13 23:16:38,032 INFO L77 FloydHoareUtils]: At program point L49-4(lines 49 50) the Hoare annotation is: (<= 0 |ULTIMATE.start_main_~i~1#1|) [2024-11-13 23:16:38,032 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 49) no Hoare annotation was computed. [2024-11-13 23:16:38,032 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 44) no Hoare annotation was computed. [2024-11-13 23:16:38,032 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 23:16:38,032 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2024-11-13 23:16:38,032 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 49) no Hoare annotation was computed. [2024-11-13 23:16:38,033 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 23:16:38,033 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2024-11-13 23:16:38,033 INFO L77 FloydHoareUtils]: At program point L30-2(line 30) the Hoare annotation is: (let ((.cse1 (<= 1 |ULTIMATE.start_SelectionSort_#t~post6#1|)) (.cse0 (+ |ULTIMATE.start_SelectionSort_#t~post6#1| 2)) (.cse2 (<= ~n~0 5))) (or (and (< ~n~0 .cse0) (<= |ULTIMATE.start_SelectionSort_#t~post6#1| 2147483646) .cse1 .cse2) (and (< 1 |ULTIMATE.start_SelectionSort_#t~post6#1|) .cse2 (<= (+ |ULTIMATE.start_SelectionSort_#t~post6#1| 3) ~n~0)) (and (<= (+ |ULTIMATE.start_SelectionSort_#t~post6#1| 4) ~n~0) .cse1 .cse2) (and (= |ULTIMATE.start_SelectionSort_#t~post6#1| 0) (<= 5 ~n~0) .cse2) (and (<= .cse0 ~n~0) (<= 3 |ULTIMATE.start_SelectionSort_#t~post6#1|) .cse2))) [2024-11-13 23:16:38,033 INFO L77 FloydHoareUtils]: At program point L30-3(line 30) the Hoare annotation is: (let ((.cse1 (<= 1 |ULTIMATE.start_SelectionSort_#t~post6#1|)) (.cse0 (+ |ULTIMATE.start_SelectionSort_#t~post6#1| 2)) (.cse2 (<= ~n~0 5))) (or (and (< ~n~0 .cse0) (<= |ULTIMATE.start_SelectionSort_#t~post6#1| 2147483646) .cse1 .cse2) (and (< 1 |ULTIMATE.start_SelectionSort_#t~post6#1|) .cse2 (<= (+ |ULTIMATE.start_SelectionSort_#t~post6#1| 3) ~n~0)) (and (<= (+ |ULTIMATE.start_SelectionSort_#t~post6#1| 4) ~n~0) .cse1 .cse2) (and (= |ULTIMATE.start_SelectionSort_#t~post6#1| 0) (<= 5 ~n~0) .cse2) (and (<= .cse0 ~n~0) (<= 3 |ULTIMATE.start_SelectionSort_#t~post6#1|) .cse2))) [2024-11-13 23:16:38,033 INFO L77 FloydHoareUtils]: At program point L30-4(lines 30 37) the Hoare annotation is: (let ((.cse1 (< 1 |ULTIMATE.start_SelectionSort_~lh~0#1|)) (.cse0 (<= ~n~0 5))) (or (and (<= 5 ~n~0) .cse0 (= |ULTIMATE.start_SelectionSort_~lh~0#1| 0)) (and (<= 4 |ULTIMATE.start_SelectionSort_~lh~0#1|) .cse0) (and .cse1 .cse0 (< ~n~0 (+ |ULTIMATE.start_SelectionSort_~lh~0#1| 1))) (and (< 2 |ULTIMATE.start_SelectionSort_~lh~0#1|) .cse0 (<= (+ 2 |ULTIMATE.start_SelectionSort_~lh~0#1|) ~n~0)) (and .cse1 (<= (+ 3 |ULTIMATE.start_SelectionSort_~lh~0#1|) ~n~0) .cse0) (and (<= 1 |ULTIMATE.start_SelectionSort_~lh~0#1|) (<= (+ |ULTIMATE.start_SelectionSort_~lh~0#1| 4) ~n~0) .cse0))) [2024-11-13 23:16:38,034 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2024-11-13 23:16:38,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 11:16:38 ImpRootNode [2024-11-13 23:16:38,067 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 23:16:38,067 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 23:16:38,068 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 23:16:38,068 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 23:16:38,068 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:14:35" (3/4) ... [2024-11-13 23:16:38,071 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 23:16:38,085 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-13 23:16:38,089 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-13 23:16:38,089 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 23:16:38,089 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-13 23:16:38,171 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8343c8c3-4fe8-4461-85aa-7cd25e581634/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 23:16:38,172 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8343c8c3-4fe8-4461-85aa-7cd25e581634/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 23:16:38,172 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 23:16:38,173 INFO L158 Benchmark]: Toolchain (without parser) took 122989.85ms. Allocated memory was 117.4MB in the beginning and 906.0MB in the end (delta: 788.5MB). Free memory was 93.9MB in the beginning and 682.7MB in the end (delta: -588.9MB). Peak memory consumption was 194.1MB. Max. memory is 16.1GB. [2024-11-13 23:16:38,175 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 167.8MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:16:38,175 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.01ms. Allocated memory is still 117.4MB. Free memory was 93.9MB in the beginning and 82.8MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 23:16:38,175 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.78ms. Allocated memory is still 117.4MB. Free memory was 82.8MB in the beginning and 81.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:16:38,175 INFO L158 Benchmark]: Boogie Preprocessor took 23.20ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 80.5MB in the end (delta: 935.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:16:38,176 INFO L158 Benchmark]: RCFGBuilder took 438.20ms. Allocated memory is still 117.4MB. Free memory was 80.5MB in the beginning and 64.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 23:16:38,176 INFO L158 Benchmark]: CodeCheck took 122132.78ms. Allocated memory was 117.4MB in the beginning and 906.0MB in the end (delta: 788.5MB). Free memory was 64.2MB in the beginning and 690.9MB in the end (delta: -626.6MB). Peak memory consumption was 168.9MB. Max. memory is 16.1GB. [2024-11-13 23:16:38,177 INFO L158 Benchmark]: Witness Printer took 104.65ms. Allocated memory is still 906.0MB. Free memory was 690.9MB in the beginning and 682.7MB in the end (delta: 8.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:16:38,179 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, 26 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 116.2s, OverallIterations: 74, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10331 SdHoareTripleChecker+Valid, 72.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9025 mSDsluCounter, 473 SdHoareTripleChecker+Invalid, 62.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 15476 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47907 IncrementalHoareTripleChecker+Invalid, 63383 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15476 mSolverCounterUnsat, 339 mSDtfsCounter, 47907 mSolverCounterSat, 1.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20400 GetRequests, 18439 SyntacticMatches, 1199 SemanticMatches, 762 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291378 ImplicationChecksByTransitivity, 106.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 19.8s InterpolantComputationTime, 2992 NumberOfCodeBlocks, 2992 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 2919 ConstructedInterpolants, 0 QuantifiedInterpolants, 7911 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 73 InterpolantComputations, 33 PerfectInterpolantSequences, 5490/7251 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: 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: 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: 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: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: 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: 49]: Loop Invariant Derived loop invariant: (0 <= i) - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (((5 <= n) && (n <= 5)) && (i <= 4)) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((((((((((((((n <= ((long long) i + 4)) && (((long long) i + 4) <= n)) && (i <= 1)) && (1 <= i)) && (lh == 0)) || (((((n < ((long long) 2 + lh)) && (1 <= lh)) && (4 < i)) && (n <= 5)) && (lh <= 2147483646))) || ((((1 <= lh) && (1 < i)) && (((long long) lh + 4) <= n)) && (n <= 5))) || ((((((n <= ((long long) i + 1)) && (i < n)) && (i <= 4)) && (n < ((long long) 3 + lh))) && (3 < i)) && (((long long) 2 + lh) <= n))) || ((((1 < lh) && (4 < i)) && (((long long) 3 + lh) <= n)) && (n <= 5))) || ((((((n <= ((long long) i + 1)) && (i < n)) && (i <= 4)) && (((long long) 3 + lh) <= n)) && (n < ((long long) lh + 4))) && (3 < i))) || (((((i <= 4) && (2 < lh)) && (n <= i)) && (lh <= 2147483646)) && (3 < i))) || ((((((2 < i) && (((long long) i + 1) < n)) && (((long long) 3 + lh) <= n)) && (n <= ((long long) i + 2))) && (n < ((long long) lh + 4))) && (i <= 3))) || ((((4 < i) && (2 < lh)) && (n <= 5)) && (((long long) 2 + lh) <= n))) || ((((5 <= n) && (i <= 5)) && (n <= i)) && (lh == 0))) || (((((i <= 2) && (((long long) i + 3) <= n)) && (1 < i)) && (n <= ((long long) i + 3))) && (lh == 0))) || (((((n <= ((long long) i + 1)) && (((long long) i + 1) <= n)) && (i <= 4)) && (lh == 0)) && (3 < i))) || (((((((long long) i + 2) <= n) && (2 < i)) && (n <= ((long long) i + 2))) && (lh == 0)) && (i <= 3))) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((5 <= n) && (n <= 5)) && (lh == 0)) || ((4 <= lh) && (n <= 5))) || (((1 < lh) && (n <= 5)) && (n < ((long long) lh + 1)))) || (((2 < lh) && (n <= 5)) && (((long long) 2 + lh) <= n))) || (((1 < lh) && (((long long) 3 + lh) <= n)) && (n <= 5))) || (((1 <= lh) && (((long long) lh + 4) <= n)) && (n <= 5))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 167.8MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.01ms. Allocated memory is still 117.4MB. Free memory was 93.9MB in the beginning and 82.8MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.78ms. Allocated memory is still 117.4MB. Free memory was 82.8MB in the beginning and 81.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.20ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 80.5MB in the end (delta: 935.5kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 438.20ms. Allocated memory is still 117.4MB. Free memory was 80.5MB in the beginning and 64.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 122132.78ms. Allocated memory was 117.4MB in the beginning and 906.0MB in the end (delta: 788.5MB). Free memory was 64.2MB in the beginning and 690.9MB in the end (delta: -626.6MB). Peak memory consumption was 168.9MB. Max. memory is 16.1GB. * Witness Printer took 104.65ms. Allocated memory is still 906.0MB. Free memory was 690.9MB in the beginning and 682.7MB in the end (delta: 8.1MB). There was no memory consumed. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-13 23:16:38,210 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8343c8c3-4fe8-4461-85aa-7cd25e581634/bin/ukojak-verify-EEHR8qb7sm/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