./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label29.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0557641d-488f-4541-b961-4598ef5586c9/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0557641d-488f-4541-b961-4598ef5586c9/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0557641d-488f-4541-b961-4598ef5586c9/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0557641d-488f-4541-b961-4598ef5586c9/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label29.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0557641d-488f-4541-b961-4598ef5586c9/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0557641d-488f-4541-b961-4598ef5586c9/bin/ukojak-verify-ENZ3QT5qd3 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85e05dcbef11985a579e446d2c280cce8be43c2367f7e9a1fa9ca1daed3123bb --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 05:22:56,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 05:22:56,638 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0557641d-488f-4541-b961-4598ef5586c9/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 05:22:56,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 05:22:56,645 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 05:22:56,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 05:22:56,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 05:22:56,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 05:22:56,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 05:22:56,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 05:22:56,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 05:22:56,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 05:22:56,679 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 05:22:56,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 05:22:56,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 05:22:56,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 05:22:56,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 05:22:56,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 05:22:56,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 05:22:56,681 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 05:22:56,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 05:22:56,681 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 05:22:56,682 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 05:22:56,682 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 05:22:56,682 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 05:22:56,682 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 05:22:56,682 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 05:22:56,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 05:22:56,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 05:22:56,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 05:22:56,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 05:22:56,683 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 05:22:56,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 05:22:56,684 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_0557641d-488f-4541-b961-4598ef5586c9/bin/ukojak-verify-ENZ3QT5qd3 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 85e05dcbef11985a579e446d2c280cce8be43c2367f7e9a1fa9ca1daed3123bb [2024-11-25 05:22:56,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 05:22:57,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 05:22:57,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 05:22:57,016 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 05:22:57,017 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 05:22:57,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0557641d-488f-4541-b961-4598ef5586c9/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/eca-rers2012/Problem01_label29.c [2024-11-25 05:23:00,060 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0557641d-488f-4541-b961-4598ef5586c9/bin/ukojak-verify-ENZ3QT5qd3/data/d22482810/a1c4722197cc43e7bdfce4b14df2e344/FLAG79ac56a1b [2024-11-25 05:23:00,429 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 05:23:00,429 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0557641d-488f-4541-b961-4598ef5586c9/sv-benchmarks/c/eca-rers2012/Problem01_label29.c [2024-11-25 05:23:00,445 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0557641d-488f-4541-b961-4598ef5586c9/bin/ukojak-verify-ENZ3QT5qd3/data/d22482810/a1c4722197cc43e7bdfce4b14df2e344/FLAG79ac56a1b [2024-11-25 05:23:00,474 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0557641d-488f-4541-b961-4598ef5586c9/bin/ukojak-verify-ENZ3QT5qd3/data/d22482810/a1c4722197cc43e7bdfce4b14df2e344 [2024-11-25 05:23:00,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 05:23:00,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 05:23:00,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 05:23:00,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 05:23:00,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 05:23:00,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:23:00" (1/1) ... [2024-11-25 05:23:00,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59713276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:00, skipping insertion in model container [2024-11-25 05:23:00,490 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:23:00" (1/1) ... [2024-11-25 05:23:00,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 05:23:00,907 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0557641d-488f-4541-b961-4598ef5586c9/sv-benchmarks/c/eca-rers2012/Problem01_label29.c[18109,18122] [2024-11-25 05:23:00,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 05:23:00,987 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 05:23:01,073 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0557641d-488f-4541-b961-4598ef5586c9/sv-benchmarks/c/eca-rers2012/Problem01_label29.c[18109,18122] [2024-11-25 05:23:01,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 05:23:01,130 INFO L204 MainTranslator]: Completed translation [2024-11-25 05:23:01,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:01 WrapperNode [2024-11-25 05:23:01,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 05:23:01,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 05:23:01,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 05:23:01,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 05:23:01,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:01" (1/1) ... [2024-11-25 05:23:01,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:01" (1/1) ... [2024-11-25 05:23:01,231 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-25 05:23:01,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 05:23:01,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 05:23:01,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 05:23:01,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 05:23:01,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:01" (1/1) ... [2024-11-25 05:23:01,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:01" (1/1) ... [2024-11-25 05:23:01,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:01" (1/1) ... [2024-11-25 05:23:01,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:01" (1/1) ... [2024-11-25 05:23:01,279 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:01" (1/1) ... [2024-11-25 05:23:01,285 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:01" (1/1) ... [2024-11-25 05:23:01,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:01" (1/1) ... [2024-11-25 05:23:01,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:01" (1/1) ... [2024-11-25 05:23:01,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:01" (1/1) ... [2024-11-25 05:23:01,325 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 05:23:01,330 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 05:23:01,330 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 05:23:01,330 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 05:23:01,331 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:01" (1/1) ... [2024-11-25 05:23:01,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 05:23:01,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0557641d-488f-4541-b961-4598ef5586c9/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 05:23:01,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0557641d-488f-4541-b961-4598ef5586c9/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 05:23:01,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0557641d-488f-4541-b961-4598ef5586c9/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 05:23:01,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 05:23:01,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 05:23:01,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 05:23:01,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 05:23:01,491 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 05:23:01,493 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 05:23:02,735 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-25 05:23:02,735 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 05:23:03,121 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 05:23:03,121 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 05:23:03,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:23:03 BoogieIcfgContainer [2024-11-25 05:23:03,122 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 05:23:03,125 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 05:23:03,125 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 05:23:03,135 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 05:23:03,135 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:23:03" (1/1) ... [2024-11-25 05:23:03,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 05:23:03,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:03,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-25 05:23:03,210 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-25 05:23:03,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-25 05:23:03,215 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:03,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:23:05,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2024-11-25 05:23:05,088 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2024-11-25 05:23:05,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-25 05:23:05,094 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:05,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:05,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:23:06,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:06,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 214 states and 297 transitions. [2024-11-25 05:23:06,392 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 297 transitions. [2024-11-25 05:23:06,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-25 05:23:06,394 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:06,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:23:07,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:07,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 283 states and 367 transitions. [2024-11-25 05:23:07,739 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 367 transitions. [2024-11-25 05:23:07,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-25 05:23:07,743 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:07,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:23:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:08,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 297 states and 386 transitions. [2024-11-25 05:23:08,762 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2024-11-25 05:23:08,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-25 05:23:08,770 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:08,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 05:23:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:09,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 306 states and 397 transitions. [2024-11-25 05:23:09,224 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 397 transitions. [2024-11-25 05:23:09,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-25 05:23:09,225 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:09,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:09,503 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 05:23:09,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:09,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 308 states and 399 transitions. [2024-11-25 05:23:09,602 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2024-11-25 05:23:09,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-25 05:23:09,603 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:09,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:09,840 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 05:23:11,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:11,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 334 states and 431 transitions. [2024-11-25 05:23:11,040 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 431 transitions. [2024-11-25 05:23:11,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-25 05:23:11,042 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:11,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 05:23:12,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:12,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 351 states and 451 transitions. [2024-11-25 05:23:12,066 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 451 transitions. [2024-11-25 05:23:12,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-25 05:23:12,068 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:12,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:12,345 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 05:23:13,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:13,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 380 states and 483 transitions. [2024-11-25 05:23:13,138 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 483 transitions. [2024-11-25 05:23:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-25 05:23:13,140 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:13,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:13,465 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 05:23:14,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:14,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 428 states and 537 transitions. [2024-11-25 05:23:14,913 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 537 transitions. [2024-11-25 05:23:14,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-25 05:23:14,915 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:14,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:15,214 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-25 05:23:15,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 431 states and 541 transitions. [2024-11-25 05:23:15,519 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 541 transitions. [2024-11-25 05:23:15,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-25 05:23:15,521 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:15,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:23:17,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:17,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 494 states and 612 transitions. [2024-11-25 05:23:17,856 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 612 transitions. [2024-11-25 05:23:17,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-25 05:23:17,858 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:17,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:18,189 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:23:18,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:18,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 496 states and 613 transitions. [2024-11-25 05:23:18,422 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 613 transitions. [2024-11-25 05:23:18,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-25 05:23:18,424 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:18,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:18,509 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-25 05:23:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:19,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 513 states and 633 transitions. [2024-11-25 05:23:19,012 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 633 transitions. [2024-11-25 05:23:19,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-25 05:23:19,014 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:19,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:19,323 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:23:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:19,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 514 states and 633 transitions. [2024-11-25 05:23:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 633 transitions. [2024-11-25 05:23:19,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-25 05:23:19,439 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:19,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:23:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:21,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 583 states and 718 transitions. [2024-11-25 05:23:21,715 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 718 transitions. [2024-11-25 05:23:21,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-25 05:23:21,718 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:21,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:22,043 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:23:23,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 602 states and 739 transitions. [2024-11-25 05:23:23,216 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 739 transitions. [2024-11-25 05:23:23,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-25 05:23:23,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:23,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:23:23,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:23,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 604 states and 740 transitions. [2024-11-25 05:23:23,828 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 740 transitions. [2024-11-25 05:23:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-25 05:23:23,831 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:23,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:24,158 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 05:23:24,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:24,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 606 states and 743 transitions. [2024-11-25 05:23:24,406 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 743 transitions. [2024-11-25 05:23:24,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-25 05:23:24,409 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:24,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:24,671 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 05:23:25,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:25,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 631 states and 770 transitions. [2024-11-25 05:23:25,899 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 770 transitions. [2024-11-25 05:23:25,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-25 05:23:25,901 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:25,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-25 05:23:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 656 states and 795 transitions. [2024-11-25 05:23:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 795 transitions. [2024-11-25 05:23:26,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-25 05:23:26,382 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:26,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:23:28,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:28,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 686 states and 833 transitions. [2024-11-25 05:23:28,556 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 833 transitions. [2024-11-25 05:23:28,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-25 05:23:28,557 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:28,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:28,912 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:23:29,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:29,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 688 states and 834 transitions. [2024-11-25 05:23:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 834 transitions. [2024-11-25 05:23:29,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-25 05:23:29,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:29,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:29,475 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:23:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:30,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 735 states and 896 transitions. [2024-11-25 05:23:30,808 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 896 transitions. [2024-11-25 05:23:30,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-25 05:23:30,811 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:30,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:30,935 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:23:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:32,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 769 states and 939 transitions. [2024-11-25 05:23:32,074 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 939 transitions. [2024-11-25 05:23:32,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-25 05:23:32,077 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:32,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:23:35,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 853 states and 1034 transitions. [2024-11-25 05:23:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1034 transitions. [2024-11-25 05:23:35,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-25 05:23:35,923 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:35,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:23:37,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:37,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 902 states and 1096 transitions. [2024-11-25 05:23:37,640 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1096 transitions. [2024-11-25 05:23:37,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-25 05:23:37,642 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:37,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:37,907 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:23:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:38,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 905 states and 1100 transitions. [2024-11-25 05:23:38,327 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1100 transitions. [2024-11-25 05:23:38,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-25 05:23:38,328 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:38,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:38,855 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:23:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 967 states and 1173 transitions. [2024-11-25 05:23:40,490 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1173 transitions. [2024-11-25 05:23:40,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-25 05:23:40,491 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:40,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:23:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:41,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 969 states and 1174 transitions. [2024-11-25 05:23:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1174 transitions. [2024-11-25 05:23:41,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 05:23:41,248 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:41,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:23:44,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:44,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1062 states and 1287 transitions. [2024-11-25 05:23:44,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1287 transitions. [2024-11-25 05:23:44,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 05:23:44,426 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:44,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:23:45,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:45,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1066 states and 1292 transitions. [2024-11-25 05:23:45,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1292 transitions. [2024-11-25 05:23:45,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 05:23:45,300 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:45,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 05:23:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:47,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1101 states and 1336 transitions. [2024-11-25 05:23:47,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1336 transitions. [2024-11-25 05:23:47,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-25 05:23:47,492 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:47,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 05:23:48,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:48,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1116 states and 1355 transitions. [2024-11-25 05:23:48,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1355 transitions. [2024-11-25 05:23:48,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-25 05:23:48,247 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:48,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:48,430 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-25 05:23:50,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:50,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1186 states and 1427 transitions. [2024-11-25 05:23:50,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1427 transitions. [2024-11-25 05:23:50,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 05:23:50,796 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:50,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:51,209 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:23:53,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:53,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1255 states and 1506 transitions. [2024-11-25 05:23:53,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1506 transitions. [2024-11-25 05:23:53,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-25 05:23:53,604 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:53,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:54,007 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 05:23:55,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1315 states and 1579 transitions. [2024-11-25 05:23:55,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1579 transitions. [2024-11-25 05:23:55,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-25 05:23:55,270 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:55,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:23:56,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:56,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1353 states and 1622 transitions. [2024-11-25 05:23:56,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1622 transitions. [2024-11-25 05:23:56,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 05:23:56,924 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:56,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-25 05:23:57,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1377 states and 1648 transitions. [2024-11-25 05:23:57,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1648 transitions. [2024-11-25 05:23:57,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 05:23:57,892 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:57,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-25 05:23:58,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:58,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1390 states and 1662 transitions. [2024-11-25 05:23:58,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1662 transitions. [2024-11-25 05:23:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 05:23:58,642 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:58,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:59,057 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 05:24:00,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:00,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1411 states and 1690 transitions. [2024-11-25 05:24:00,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1690 transitions. [2024-11-25 05:24:00,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 05:24:00,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:00,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:01,026 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 05:24:03,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1445 states and 1726 transitions. [2024-11-25 05:24:03,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1726 transitions. [2024-11-25 05:24:03,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-25 05:24:03,596 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:03,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:04,009 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:24:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:06,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1486 states and 1777 transitions. [2024-11-25 05:24:06,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1777 transitions. [2024-11-25 05:24:06,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-25 05:24:06,989 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:06,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:07,260 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:24:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1519 states and 1813 transitions. [2024-11-25 05:24:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1813 transitions. [2024-11-25 05:24:09,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-25 05:24:09,359 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:09,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:09,678 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:24:10,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1520 states and 1813 transitions. [2024-11-25 05:24:10,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1813 transitions. [2024-11-25 05:24:10,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 05:24:10,140 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:10,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:10,756 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 05:24:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1582 states and 1890 transitions. [2024-11-25 05:24:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1890 transitions. [2024-11-25 05:24:14,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 05:24:14,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:14,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 05:24:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1591 states and 1898 transitions. [2024-11-25 05:24:15,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 1898 transitions. [2024-11-25 05:24:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 05:24:15,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:15,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 05:24:15,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:15,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1593 states and 1902 transitions. [2024-11-25 05:24:15,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 1902 transitions. [2024-11-25 05:24:15,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 05:24:15,890 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:15,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:16,228 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-25 05:24:16,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:16,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1596 states and 1905 transitions. [2024-11-25 05:24:16,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 1905 transitions. [2024-11-25 05:24:16,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-25 05:24:16,380 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:16,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:17,250 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:24:21,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 1730 states and 2054 transitions. [2024-11-25 05:24:21,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2054 transitions. [2024-11-25 05:24:21,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 05:24:21,633 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:21,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 58 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 05:24:22,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:22,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 1755 states and 2080 transitions. [2024-11-25 05:24:22,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2080 transitions. [2024-11-25 05:24:22,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 05:24:22,796 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:22,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:23,302 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:24:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:24,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 1768 states and 2094 transitions. [2024-11-25 05:24:24,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2094 transitions. [2024-11-25 05:24:24,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 05:24:24,134 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:24,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:24:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:24,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 1771 states and 2098 transitions. [2024-11-25 05:24:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2098 transitions. [2024-11-25 05:24:24,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 05:24:24,999 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:24,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-25 05:24:28,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:28,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 1859 states and 2203 transitions. [2024-11-25 05:24:28,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2203 transitions. [2024-11-25 05:24:28,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-25 05:24:28,405 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:28,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:24:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:30,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 1933 states and 2279 transitions. [2024-11-25 05:24:30,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2279 transitions. [2024-11-25 05:24:30,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-25 05:24:30,889 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:30,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:31,315 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 05:24:33,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:33,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 1954 states and 2301 transitions. [2024-11-25 05:24:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2301 transitions. [2024-11-25 05:24:33,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-25 05:24:33,078 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:33,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-25 05:24:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:33,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 1956 states and 2303 transitions. [2024-11-25 05:24:33,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2303 transitions. [2024-11-25 05:24:33,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-25 05:24:33,712 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:33,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:34,005 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-25 05:24:34,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:34,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 1971 states and 2320 transitions. [2024-11-25 05:24:34,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2320 transitions. [2024-11-25 05:24:34,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-25 05:24:34,692 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:34,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:34,989 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-25 05:24:36,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:36,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2008 states and 2365 transitions. [2024-11-25 05:24:36,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 2365 transitions. [2024-11-25 05:24:36,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-25 05:24:36,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:36,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 05:24:38,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:38,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2019 states and 2377 transitions. [2024-11-25 05:24:38,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 2377 transitions. [2024-11-25 05:24:38,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-25 05:24:38,132 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:38,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 05:24:39,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:39,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2022 states and 2381 transitions. [2024-11-25 05:24:39,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2381 transitions. [2024-11-25 05:24:39,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-25 05:24:39,290 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:39,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:39,559 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 186 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 05:24:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2027 states and 2386 transitions. [2024-11-25 05:24:40,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2386 transitions. [2024-11-25 05:24:40,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-25 05:24:40,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:40,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:40,620 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-25 05:24:41,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:41,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 2041 states and 2402 transitions. [2024-11-25 05:24:41,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2402 transitions. [2024-11-25 05:24:41,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-25 05:24:41,368 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:41,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-25 05:24:43,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:43,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2082 states and 2450 transitions. [2024-11-25 05:24:43,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2450 transitions. [2024-11-25 05:24:43,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-25 05:24:43,349 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:43,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:43,828 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 199 proven. 49 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 05:24:47,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:47,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2121 states and 2505 transitions. [2024-11-25 05:24:47,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2505 transitions. [2024-11-25 05:24:47,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 05:24:47,252 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:47,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-25 05:24:48,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:48,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2135 states and 2520 transitions. [2024-11-25 05:24:48,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 2520 transitions. [2024-11-25 05:24:48,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 05:24:48,294 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:48,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-25 05:24:49,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2138 states and 2523 transitions. [2024-11-25 05:24:49,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 2523 transitions. [2024-11-25 05:24:49,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-25 05:24:49,309 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:49,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:49,453 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-25 05:24:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2150 states and 2537 transitions. [2024-11-25 05:24:50,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 2537 transitions. [2024-11-25 05:24:50,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-25 05:24:50,881 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:50,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:51,094 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-25 05:24:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2152 states and 2541 transitions. [2024-11-25 05:24:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2541 transitions. [2024-11-25 05:24:51,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 05:24:51,784 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:51,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-25 05:24:52,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:52,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2164 states and 2554 transitions. [2024-11-25 05:24:52,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 2554 transitions. [2024-11-25 05:24:52,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 05:24:52,779 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:52,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:53,154 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:24:57,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:57,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2209 states and 2607 transitions. [2024-11-25 05:24:57,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2607 transitions. [2024-11-25 05:24:57,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 05:24:57,686 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:57,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:25:03,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2278 states and 2692 transitions. [2024-11-25 05:25:03,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 2692 transitions. [2024-11-25 05:25:03,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 05:25:03,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:03,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:25:04,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:04,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2280 states and 2693 transitions. [2024-11-25 05:25:04,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 2693 transitions. [2024-11-25 05:25:04,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 05:25:04,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:04,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:04,648 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 05:25:05,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2283 states and 2697 transitions. [2024-11-25 05:25:05,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 2697 transitions. [2024-11-25 05:25:05,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-25 05:25:05,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:05,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:06,004 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:25:06,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:06,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2292 states and 2706 transitions. [2024-11-25 05:25:06,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 2706 transitions. [2024-11-25 05:25:06,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-25 05:25:06,188 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:06,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:06,580 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-25 05:25:07,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:07,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2316 states and 2732 transitions. [2024-11-25 05:25:07,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 2732 transitions. [2024-11-25 05:25:07,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-25 05:25:07,374 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:07,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:08,037 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:25:13,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2393 states and 2827 transitions. [2024-11-25 05:25:13,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 2827 transitions. [2024-11-25 05:25:13,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-25 05:25:13,118 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:13,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:25:14,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:14,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2397 states and 2831 transitions. [2024-11-25 05:25:14,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 2831 transitions. [2024-11-25 05:25:14,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-25 05:25:14,165 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:14,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:14,444 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 05:25:17,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2412 states and 2854 transitions. [2024-11-25 05:25:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 2854 transitions. [2024-11-25 05:25:17,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-25 05:25:17,912 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:17,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:18,187 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 05:25:19,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2863 states to 2417 states and 2863 transitions. [2024-11-25 05:25:19,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 2863 transitions. [2024-11-25 05:25:19,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-25 05:25:19,525 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:19,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:19,873 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 05:25:20,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:20,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2419 states and 2865 transitions. [2024-11-25 05:25:20,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 2865 transitions. [2024-11-25 05:25:20,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-25 05:25:20,568 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:20,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-25 05:25:21,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:21,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2422 states and 2871 transitions. [2024-11-25 05:25:21,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 2871 transitions. [2024-11-25 05:25:21,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 05:25:21,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:21,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:21,979 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 05:25:23,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:23,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2433 states and 2884 transitions. [2024-11-25 05:25:23,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 2884 transitions. [2024-11-25 05:25:23,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 05:25:23,944 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:23,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:25:33,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:33,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2507 states and 2966 transitions. [2024-11-25 05:25:33,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 2966 transitions. [2024-11-25 05:25:33,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 05:25:33,204 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:33,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:33,563 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:25:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:38,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 2552 states and 3013 transitions. [2024-11-25 05:25:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3013 transitions. [2024-11-25 05:25:38,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 05:25:38,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:38,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:38,629 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:25:39,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:39,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 2554 states and 3014 transitions. [2024-11-25 05:25:39,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3014 transitions. [2024-11-25 05:25:39,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 05:25:39,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:39,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:25:40,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:40,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 2556 states and 3015 transitions. [2024-11-25 05:25:40,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 3015 transitions. [2024-11-25 05:25:40,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 05:25:40,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:40,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:40,593 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-25 05:25:42,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:42,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 2559 states and 3022 transitions. [2024-11-25 05:25:42,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 3022 transitions. [2024-11-25 05:25:42,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 05:25:42,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:42,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-25 05:25:42,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3026 states to 2560 states and 3026 transitions. [2024-11-25 05:25:42,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3026 transitions. [2024-11-25 05:25:42,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 05:25:42,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:42,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:43,010 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-25 05:25:43,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:43,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3026 states to 2561 states and 3026 transitions. [2024-11-25 05:25:43,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 3026 transitions. [2024-11-25 05:25:43,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-25 05:25:43,750 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:43,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:25:44,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:44,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3033 states to 2568 states and 3033 transitions. [2024-11-25 05:25:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3033 transitions. [2024-11-25 05:25:44,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-25 05:25:44,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:44,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:44,898 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 224 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 05:25:47,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:47,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3064 states to 2591 states and 3064 transitions. [2024-11-25 05:25:47,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 3064 transitions. [2024-11-25 05:25:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-25 05:25:47,945 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:47,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:48,247 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 05:25:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3097 states to 2622 states and 3097 transitions. [2024-11-25 05:25:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2622 states and 3097 transitions. [2024-11-25 05:25:52,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 05:25:52,203 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:52,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:52,698 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 05:25:52,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:52,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 2625 states and 3101 transitions. [2024-11-25 05:25:52,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 3101 transitions. [2024-11-25 05:25:52,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 05:25:52,901 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:52,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 05:25:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:55,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 2637 states and 3116 transitions. [2024-11-25 05:25:55,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 3116 transitions. [2024-11-25 05:25:55,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 05:25:55,040 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:55,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-25 05:26:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:26:03,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 2764 states and 3270 transitions. [2024-11-25 05:26:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3270 transitions. [2024-11-25 05:26:03,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 05:26:03,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:26:03,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:26:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:26:04,013 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:26:07,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:26:07,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3339 states to 2825 states and 3339 transitions. [2024-11-25 05:26:07,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3339 transitions. [2024-11-25 05:26:07,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 05:26:07,538 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:26:07,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:26:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:26:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:26:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:26:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3345 states to 2830 states and 3345 transitions. [2024-11-25 05:26:08,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 3345 transitions. [2024-11-25 05:26:08,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-25 05:26:08,360 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:26:08,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:26:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:26:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-11-25 05:26:08,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:26:08,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3345 states to 2831 states and 3345 transitions. [2024-11-25 05:26:08,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 3345 transitions. [2024-11-25 05:26:08,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-25 05:26:08,683 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:26:08,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:26:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:26:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-25 05:26:13,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:26:13,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 2883 states and 3394 transitions. [2024-11-25 05:26:13,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 3394 transitions. [2024-11-25 05:26:13,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-25 05:26:13,350 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 101 iterations. [2024-11-25 05:26:13,359 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-25 05:26:57,804 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a16~0 4)) (.cse13 (= 14 ~a8~0)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a8~0 15)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse10 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse10 (not (and .cse5 (= ~a17~0 ~a7~0))) .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse6) (and .cse1 .cse13 .cse7 .cse2 .cse3) (and .cse10 (not .cse12) .cse11) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9)))) [2024-11-25 05:26:57,806 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,806 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,807 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,807 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,807 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,807 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse5 (= ~a20~0 1))) (let ((.cse9 (= ~a16~0 4)) (.cse10 (= 14 ~a8~0)) (.cse7 (not .cse5)) (.cse1 (= ~a12~0 8)) (.cse2 (= 5 ~a16~0)) (.cse6 (= ~a8~0 15)) (.cse8 (not .cse4)) (.cse0 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (<= ~a8~0 13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (and .cse1 (= ~a16~0 6) .cse6))) (and .cse7 .cse1 .cse8 .cse3 .cse6 .cse9) (and .cse7 .cse1 .cse10 .cse8 .cse3 .cse9) (and .cse1 .cse10 .cse2 .cse8 .cse3) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse8 .cse0) (and .cse0 (not (and .cse3 .cse5)))))) [2024-11-25 05:26:57,807 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,808 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-25 05:26:57,808 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,808 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a16~0 4)) (.cse13 (= 14 ~a8~0)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a8~0 15)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse10 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse10 (not (and .cse5 (= ~a17~0 ~a7~0))) .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse6) (and .cse1 .cse13 .cse7 .cse2 .cse3) (and .cse10 (not .cse12) .cse11) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9)))) [2024-11-25 05:26:57,808 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,809 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,809 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,809 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse5 (= ~a20~0 1))) (let ((.cse9 (= ~a16~0 4)) (.cse10 (= 14 ~a8~0)) (.cse7 (not .cse5)) (.cse1 (= ~a12~0 8)) (.cse2 (= 5 ~a16~0)) (.cse6 (= ~a8~0 15)) (.cse8 (not .cse4)) (.cse0 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (<= ~a8~0 13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (and .cse1 (= ~a16~0 6) .cse6))) (and .cse7 .cse1 .cse8 .cse3 .cse6 .cse9) (and .cse7 .cse1 .cse10 .cse8 .cse3 .cse9) (and .cse1 .cse10 .cse2 .cse8 .cse3) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse8 .cse0) (and .cse0 (not (and .cse3 .cse5)))))) [2024-11-25 05:26:57,810 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,811 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,811 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,811 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,812 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,812 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,812 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,812 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,813 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a16~0 4)) (.cse13 (= 14 ~a8~0)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a8~0 15)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse10 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse10 (not (and .cse5 (= ~a17~0 ~a7~0))) .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse6) (and .cse1 .cse13 .cse7 .cse2 .cse3) (and .cse10 (not .cse12) .cse11) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9)))) [2024-11-25 05:26:57,813 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,814 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-25 05:26:57,814 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,814 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse5 (= ~a20~0 1))) (let ((.cse9 (= ~a16~0 4)) (.cse10 (= 14 ~a8~0)) (.cse7 (not .cse5)) (.cse1 (= ~a12~0 8)) (.cse2 (= 5 ~a16~0)) (.cse6 (= ~a8~0 15)) (.cse8 (not .cse4)) (.cse0 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (<= ~a8~0 13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (and .cse1 (= ~a16~0 6) .cse6))) (and .cse7 .cse1 .cse8 .cse3 .cse6 .cse9) (and .cse7 .cse1 .cse10 .cse8 .cse3 .cse9) (and .cse1 .cse10 .cse2 .cse8 .cse3) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse8 .cse0) (and .cse0 (not (and .cse3 .cse5)))))) [2024-11-25 05:26:57,814 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,815 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,816 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,817 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-25 05:26:57,817 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,817 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,817 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,817 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a16~0 4)) (.cse13 (= 14 ~a8~0)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a8~0 15)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse10 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse10 (not (and .cse5 (= ~a17~0 ~a7~0))) .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse6) (and .cse1 .cse13 .cse7 .cse2 .cse3) (and .cse10 (not .cse12) .cse11) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9)))) [2024-11-25 05:26:57,818 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,818 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,818 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-11-25 05:26:57,818 INFO L77 FloydHoareUtils]: At program point L485-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-11-25 05:26:57,818 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,818 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,819 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,819 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,819 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse5 (= ~a20~0 1))) (let ((.cse9 (= ~a16~0 4)) (.cse10 (= 14 ~a8~0)) (.cse7 (not .cse5)) (.cse1 (= ~a12~0 8)) (.cse2 (= 5 ~a16~0)) (.cse6 (= ~a8~0 15)) (.cse8 (not .cse4)) (.cse0 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (<= ~a8~0 13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (and .cse1 (= ~a16~0 6) .cse6))) (and .cse7 .cse1 .cse8 .cse3 .cse6 .cse9) (and .cse7 .cse1 .cse10 .cse8 .cse3 .cse9) (and .cse1 .cse10 .cse2 .cse8 .cse3) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse8 .cse0) (and .cse0 (not (and .cse3 .cse5)))))) [2024-11-25 05:26:57,820 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,820 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,820 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-25 05:26:57,820 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a16~0 4)) (.cse13 (= 14 ~a8~0)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a8~0 15)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse10 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse10 (not (and .cse5 (= ~a17~0 ~a7~0))) .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse6) (and .cse1 .cse13 .cse7 .cse2 .cse3) (and .cse10 (not .cse12) .cse11) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9)))) [2024-11-25 05:26:57,821 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-25 05:26:57,821 INFO L77 FloydHoareUtils]: At program point L488-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-11-25 05:26:57,821 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,821 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,821 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,822 INFO L75 FloydHoareUtils]: For program point L489(line 489) no Hoare annotation was computed. [2024-11-25 05:26:57,822 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a16~0 4)) (.cse13 (= 14 ~a8~0)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a8~0 15)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse10 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse10 (not (and .cse5 (= ~a17~0 ~a7~0))) .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse6) (and .cse1 .cse13 .cse7 .cse2 .cse3) (and .cse10 (not .cse12) .cse11) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9)))) [2024-11-25 05:26:57,823 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,823 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,823 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,823 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-25 05:26:57,824 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,824 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,824 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a16~0 4)) (.cse13 (= 14 ~a8~0)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a8~0 15)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse10 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse10 (not (and .cse5 (= ~a17~0 ~a7~0))) .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse6) (and .cse1 .cse13 .cse7 .cse2 .cse3) (and .cse10 (not .cse12) .cse11) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9)))) [2024-11-25 05:26:57,824 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,825 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,825 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse5 (= ~a20~0 1))) (let ((.cse9 (= ~a16~0 4)) (.cse10 (= 14 ~a8~0)) (.cse7 (not .cse5)) (.cse1 (= ~a12~0 8)) (.cse2 (= 5 ~a16~0)) (.cse6 (= ~a8~0 15)) (.cse8 (not .cse4)) (.cse0 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (<= ~a8~0 13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (and .cse1 (= ~a16~0 6) .cse6))) (and .cse7 .cse1 .cse8 .cse3 .cse6 .cse9) (and .cse7 .cse1 .cse10 .cse8 .cse3 .cse9) (and .cse1 .cse10 .cse2 .cse8 .cse3) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse8 .cse0) (and .cse0 (not (and .cse3 .cse5)))))) [2024-11-25 05:26:57,825 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,826 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,826 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-25 05:26:57,826 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 489) no Hoare annotation was computed. [2024-11-25 05:26:57,826 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,826 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,827 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,827 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,827 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-25 05:26:57,828 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse6 (= ~a16~0 4)) (.cse13 (= 14 ~a8~0)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse9)) (.cse7 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a8~0 15)) (.cse2 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse5) (and .cse10 (<= ~a16~0 5) (not .cse6)) (and (not (and (= ~a16~0 6) .cse9 .cse5)) .cse10 .cse8) (and .cse10 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse6) (and (not .cse3) .cse10) (and .cse10 (not (and .cse5 (= ~a17~0 ~a7~0))) .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse6) (and .cse1 .cse13 .cse7 .cse2 .cse3) (and .cse10 (not .cse12) .cse11) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5) (and .cse2 .cse10 (< 5 ~a16~0)) (and .cse10 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse10 .cse9)))) [2024-11-25 05:26:57,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 05:26:57 ImpRootNode [2024-11-25 05:26:57,852 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 05:26:57,852 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 05:26:57,852 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 05:26:57,852 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 05:26:57,853 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:23:03" (3/4) ... [2024-11-25 05:26:57,856 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-25 05:26:57,869 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 120 nodes and edges [2024-11-25 05:26:57,870 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-25 05:26:57,871 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-25 05:26:57,872 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-25 05:26:58,033 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0557641d-488f-4541-b961-4598ef5586c9/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 05:26:58,034 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0557641d-488f-4541-b961-4598ef5586c9/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 05:26:58,034 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 05:26:58,037 INFO L158 Benchmark]: Toolchain (without parser) took 237556.22ms. Allocated memory was 142.6MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 117.8MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 352.5MB. Max. memory is 16.1GB. [2024-11-25 05:26:58,038 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 142.6MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 05:26:58,038 INFO L158 Benchmark]: CACSL2BoogieTranslator took 651.25ms. Allocated memory is still 142.6MB. Free memory was 117.8MB in the beginning and 91.1MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-25 05:26:58,038 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.26ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 85.4MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 05:26:58,038 INFO L158 Benchmark]: Boogie Preprocessor took 96.55ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 81.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 05:26:58,039 INFO L158 Benchmark]: RCFGBuilder took 1794.06ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 81.1MB in the beginning and 341.9MB in the end (delta: -260.8MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. [2024-11-25 05:26:58,039 INFO L158 Benchmark]: CodeCheck took 234727.04ms. Allocated memory was 419.4MB in the beginning and 2.7GB in the end (delta: 2.2GB). Free memory was 341.9MB in the beginning and 2.3GB in the end (delta: -2.0GB). Peak memory consumption was 283.5MB. Max. memory is 16.1GB. [2024-11-25 05:26:58,039 INFO L158 Benchmark]: Witness Printer took 181.80ms. Allocated memory is still 2.7GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 05:26:58,042 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, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 190.2s, OverallIterations: 101, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 323727 SdHoareTripleChecker+Valid, 919.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 322834 mSDsluCounter, 42339 SdHoareTripleChecker+Invalid, 792.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35969 mSDsCounter, 67395 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 700924 IncrementalHoareTripleChecker+Invalid, 768319 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67395 mSolverCounterUnsat, 6370 mSDtfsCounter, 700924 mSolverCounterSat, 7.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137898 GetRequests, 129386 SyntacticMatches, 7480 SemanticMatches, 1032 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757626 ImplicationChecksByTransitivity, 133.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.7s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 32.3s InterpolantComputationTime, 20399 NumberOfCodeBlocks, 20399 NumberOfCodeBlocksAsserted, 100 NumberOfCheckSat, 20299 ConstructedInterpolants, 0 QuantifiedInterpolants, 163815 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 100 InterpolantComputations, 24 PerfectInterpolantSequences, 18772/23910 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - PositiveResult [Line: 489]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: !(((((!((((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && !((((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (13 < a8)) && (a7 == 1)) && !((((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !((((((!((((((a12 == 8) && (5 == a16)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1)) && (a8 == 15)) && !((((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15))) && !((((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (13 < a8)) && (a7 == 1)) && !((((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 142.6MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 651.25ms. Allocated memory is still 142.6MB. Free memory was 117.8MB in the beginning and 91.1MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.26ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 85.4MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.55ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 81.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1794.06ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 81.1MB in the beginning and 341.9MB in the end (delta: -260.8MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. * CodeCheck took 234727.04ms. Allocated memory was 419.4MB in the beginning and 2.7GB in the end (delta: 2.2GB). Free memory was 341.9MB in the beginning and 2.3GB in the end (delta: -2.0GB). Peak memory consumption was 283.5MB. Max. memory is 16.1GB. * Witness Printer took 181.80ms. Allocated memory is still 2.7GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-25 05:26:58,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0557641d-488f-4541-b961-4598ef5586c9/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE