./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label15.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f834cf57-4577-4c17-ace3-70ed39f8eda2/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f834cf57-4577-4c17-ace3-70ed39f8eda2/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f834cf57-4577-4c17-ace3-70ed39f8eda2/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f834cf57-4577-4c17-ace3-70ed39f8eda2/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label15.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f834cf57-4577-4c17-ace3-70ed39f8eda2/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f834cf57-4577-4c17-ace3-70ed39f8eda2/bin/ukojak-verify-EEHR8qb7sm --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 ed249da04373d4759cadf5f52529e2266bc29efebb28f8cb64ff404bc3283b78 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 20:33:23,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 20:33:23,211 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f834cf57-4577-4c17-ace3-70ed39f8eda2/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 20:33:23,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 20:33:23,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 20:33:23,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 20:33:23,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 20:33:23,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 20:33:23,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 20:33:23,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 20:33:23,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 20:33:23,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 20:33:23,268 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 20:33:23,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 20:33:23,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 20:33:23,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 20:33:23,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 20:33:23,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 20:33:23,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 20:33:23,269 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 20:33:23,269 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 20:33:23,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 20:33:23,269 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 20:33:23,270 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 20:33:23,270 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 20:33:23,270 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 20:33:23,270 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 20:33:23,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:33:23,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 20:33:23,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 20:33:23,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 20:33:23,271 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 20:33:23,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 20:33:23,272 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_f834cf57-4577-4c17-ace3-70ed39f8eda2/bin/ukojak-verify-EEHR8qb7sm Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> ed249da04373d4759cadf5f52529e2266bc29efebb28f8cb64ff404bc3283b78 [2024-11-13 20:33:23,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 20:33:23,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 20:33:23,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 20:33:23,615 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 20:33:23,616 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 20:33:23,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f834cf57-4577-4c17-ace3-70ed39f8eda2/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem01_label15.c Unable to find full path for "g++" [2024-11-13 20:33:25,621 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 20:33:26,039 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 20:33:26,043 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f834cf57-4577-4c17-ace3-70ed39f8eda2/sv-benchmarks/c/eca-rers2012/Problem01_label15.c [2024-11-13 20:33:26,070 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f834cf57-4577-4c17-ace3-70ed39f8eda2/bin/ukojak-verify-EEHR8qb7sm/data/45ec7923e/ca7c749d4cc242da8318dc0c54454140/FLAG631044bdb [2024-11-13 20:33:26,092 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f834cf57-4577-4c17-ace3-70ed39f8eda2/bin/ukojak-verify-EEHR8qb7sm/data/45ec7923e/ca7c749d4cc242da8318dc0c54454140 [2024-11-13 20:33:26,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 20:33:26,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 20:33:26,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 20:33:26,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 20:33:26,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 20:33:26,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:33:26" (1/1) ... [2024-11-13 20:33:26,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a9aeb3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:33:26, skipping insertion in model container [2024-11-13 20:33:26,109 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:33:26" (1/1) ... [2024-11-13 20:33:26,159 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 20:33:26,551 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_f834cf57-4577-4c17-ace3-70ed39f8eda2/sv-benchmarks/c/eca-rers2012/Problem01_label15.c[15626,15639] [2024-11-13 20:33:26,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:33:26,606 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 20:33:26,687 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_f834cf57-4577-4c17-ace3-70ed39f8eda2/sv-benchmarks/c/eca-rers2012/Problem01_label15.c[15626,15639] [2024-11-13 20:33:26,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:33:26,730 INFO L204 MainTranslator]: Completed translation [2024-11-13 20:33:26,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:33:26 WrapperNode [2024-11-13 20:33:26,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 20:33:26,732 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 20:33:26,732 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 20:33:26,732 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 20:33:26,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:33:26" (1/1) ... [2024-11-13 20:33:26,752 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:33:26" (1/1) ... [2024-11-13 20:33:26,806 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-13 20:33:26,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 20:33:26,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 20:33:26,811 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 20:33:26,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 20:33:26,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:33:26" (1/1) ... [2024-11-13 20:33:26,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:33:26" (1/1) ... [2024-11-13 20:33:26,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:33:26" (1/1) ... [2024-11-13 20:33:26,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:33:26" (1/1) ... [2024-11-13 20:33:26,870 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:33:26" (1/1) ... [2024-11-13 20:33:26,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:33:26" (1/1) ... [2024-11-13 20:33:26,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:33:26" (1/1) ... [2024-11-13 20:33:26,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:33:26" (1/1) ... [2024-11-13 20:33:26,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 20:33:26,892 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 20:33:26,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 20:33:26,893 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 20:33:26,894 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:33:26" (1/1) ... [2024-11-13 20:33:26,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:33:26,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f834cf57-4577-4c17-ace3-70ed39f8eda2/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 20:33:26,933 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f834cf57-4577-4c17-ace3-70ed39f8eda2/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 20:33:26,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f834cf57-4577-4c17-ace3-70ed39f8eda2/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 20:33:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 20:33:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 20:33:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 20:33:26,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 20:33:27,059 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 20:33:27,062 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 20:33:28,520 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-13 20:33:28,521 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 20:33:28,942 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 20:33:28,942 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 20:33:28,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:33:28 BoogieIcfgContainer [2024-11-13 20:33:28,943 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 20:33:28,945 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 20:33:28,945 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 20:33:28,957 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 20:33:28,958 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:33:28" (1/1) ... [2024-11-13 20:33:28,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 20:33:29,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-13 20:33:29,041 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-13 20:33:29,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 20:33:29,045 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:29,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:33:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:30,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 145 states and 261 transitions. [2024-11-13 20:33:30,572 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 261 transitions. [2024-11-13 20:33:30,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 20:33:30,577 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:30,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:30,847 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-13 20:33:31,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:31,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 215 states and 339 transitions. [2024-11-13 20:33:31,877 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 339 transitions. [2024-11-13 20:33:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 20:33:31,879 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:31,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:32,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:33:32,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:32,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 220 states and 346 transitions. [2024-11-13 20:33:32,192 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 346 transitions. [2024-11-13 20:33:32,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 20:33:32,194 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:32,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:32,466 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-13 20:33:33,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:33,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 290 states and 430 transitions. [2024-11-13 20:33:33,204 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 430 transitions. [2024-11-13 20:33:33,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-13 20:33:33,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:33,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:33,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:33:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:33,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 300 states and 443 transitions. [2024-11-13 20:33:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 443 transitions. [2024-11-13 20:33:33,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 20:33:33,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:33,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:34,050 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-13 20:33:34,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:34,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 306 states and 452 transitions. [2024-11-13 20:33:34,586 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 452 transitions. [2024-11-13 20:33:34,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 20:33:34,587 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:34,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:34,822 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-13 20:33:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:35,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 316 states and 463 transitions. [2024-11-13 20:33:35,014 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 463 transitions. [2024-11-13 20:33:35,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 20:33:35,015 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:35,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:35,224 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-13 20:33:35,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:35,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 321 states and 468 transitions. [2024-11-13 20:33:35,382 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 468 transitions. [2024-11-13 20:33:35,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-13 20:33:35,386 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:35,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:35,520 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:33:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 332 states and 481 transitions. [2024-11-13 20:33:35,881 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 481 transitions. [2024-11-13 20:33:35,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 20:33:35,883 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:35,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:33:36,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:36,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 340 states and 494 transitions. [2024-11-13 20:33:36,331 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 494 transitions. [2024-11-13 20:33:36,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 20:33:36,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:36,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:36,416 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-13 20:33:36,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:36,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 349 states and 506 transitions. [2024-11-13 20:33:36,800 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 506 transitions. [2024-11-13 20:33:36,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 20:33:36,801 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:36,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:36,885 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-13 20:33:37,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:37,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 354 states and 512 transitions. [2024-11-13 20:33:37,067 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 512 transitions. [2024-11-13 20:33:37,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 20:33:37,068 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:37,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:37,249 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:33:37,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 356 states and 514 transitions. [2024-11-13 20:33:37,311 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 514 transitions. [2024-11-13 20:33:37,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 20:33:37,312 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:37,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:37,491 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:33:38,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:38,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 376 states and 537 transitions. [2024-11-13 20:33:38,146 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 537 transitions. [2024-11-13 20:33:38,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 20:33:38,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:38,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:38,295 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:33:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:38,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 384 states and 547 transitions. [2024-11-13 20:33:38,590 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 547 transitions. [2024-11-13 20:33:38,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 20:33:38,592 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:38,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:38,859 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-13 20:33:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 386 states and 549 transitions. [2024-11-13 20:33:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 549 transitions. [2024-11-13 20:33:38,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 20:33:38,946 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:38,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:39,122 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-13 20:33:39,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:39,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 388 states and 551 transitions. [2024-11-13 20:33:39,183 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 551 transitions. [2024-11-13 20:33:39,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 20:33:39,185 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:39,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:39,378 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:33:40,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 399 states and 565 transitions. [2024-11-13 20:33:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 565 transitions. [2024-11-13 20:33:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 20:33:40,153 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:40,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:40,318 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:33:40,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:40,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 409 states and 576 transitions. [2024-11-13 20:33:40,573 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 576 transitions. [2024-11-13 20:33:40,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 20:33:40,575 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:40,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:33:41,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 426 states and 595 transitions. [2024-11-13 20:33:41,102 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 595 transitions. [2024-11-13 20:33:41,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 20:33:41,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:41,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:41,220 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-13 20:33:42,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 456 states and 632 transitions. [2024-11-13 20:33:42,166 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 632 transitions. [2024-11-13 20:33:42,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 20:33:42,168 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:42,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:42,289 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-13 20:33:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:43,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 478 states and 655 transitions. [2024-11-13 20:33:43,006 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 655 transitions. [2024-11-13 20:33:43,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 20:33:43,010 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:43,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:43,151 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:33:43,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:43,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 497 states and 675 transitions. [2024-11-13 20:33:43,548 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 675 transitions. [2024-11-13 20:33:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 20:33:43,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:43,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:43,721 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:33:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 511 states and 689 transitions. [2024-11-13 20:33:43,928 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 689 transitions. [2024-11-13 20:33:43,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 20:33:43,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:43,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:44,201 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-13 20:33:45,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:45,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 540 states and 722 transitions. [2024-11-13 20:33:45,346 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 722 transitions. [2024-11-13 20:33:45,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 20:33:45,348 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:45,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:45,672 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:33:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 551 states and 736 transitions. [2024-11-13 20:33:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 736 transitions. [2024-11-13 20:33:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 20:33:46,383 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:46,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:46,561 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:33:47,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 561 states and 747 transitions. [2024-11-13 20:33:47,037 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 747 transitions. [2024-11-13 20:33:47,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 20:33:47,039 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:47,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:47,228 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 20:33:47,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:47,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 575 states and 762 transitions. [2024-11-13 20:33:47,745 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 762 transitions. [2024-11-13 20:33:47,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 20:33:47,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:47,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:47,816 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:33:47,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 591 states and 781 transitions. [2024-11-13 20:33:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 781 transitions. [2024-11-13 20:33:47,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-13 20:33:47,961 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:47,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:48,098 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 20:33:48,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:48,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 601 states and 792 transitions. [2024-11-13 20:33:48,387 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 792 transitions. [2024-11-13 20:33:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 20:33:48,390 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:48,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 20:33:48,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:48,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 602 states and 793 transitions. [2024-11-13 20:33:48,507 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 793 transitions. [2024-11-13 20:33:48,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 20:33:48,509 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:48,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:48,815 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:33:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 650 states and 851 transitions. [2024-11-13 20:33:50,594 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 851 transitions. [2024-11-13 20:33:50,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 20:33:50,596 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:50,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:33:51,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:51,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 697 states and 900 transitions. [2024-11-13 20:33:51,784 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 900 transitions. [2024-11-13 20:33:51,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 20:33:51,786 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:51,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:51,932 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 20:33:52,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 700 states and 904 transitions. [2024-11-13 20:33:52,027 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 904 transitions. [2024-11-13 20:33:52,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 20:33:52,028 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:52,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 91 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:33:53,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:53,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 719 states and 924 transitions. [2024-11-13 20:33:53,024 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 924 transitions. [2024-11-13 20:33:53,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 20:33:53,027 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:53,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:53,331 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 91 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:33:54,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:54,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 738 states and 946 transitions. [2024-11-13 20:33:54,039 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 946 transitions. [2024-11-13 20:33:54,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 20:33:54,041 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:54,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:54,379 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-13 20:33:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:55,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 757 states and 966 transitions. [2024-11-13 20:33:55,045 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 966 transitions. [2024-11-13 20:33:55,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 20:33:55,046 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:55,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:55,324 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-13 20:33:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 774 states and 984 transitions. [2024-11-13 20:33:55,859 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 984 transitions. [2024-11-13 20:33:55,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 20:33:55,861 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:55,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:55,997 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 20:33:56,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:56,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 803 states and 1014 transitions. [2024-11-13 20:33:56,442 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1014 transitions. [2024-11-13 20:33:56,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 20:33:56,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:56,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:56,664 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-13 20:33:57,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:57,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 822 states and 1032 transitions. [2024-11-13 20:33:57,468 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1032 transitions. [2024-11-13 20:33:57,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 20:33:57,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:57,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:57,699 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-13 20:33:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 841 states and 1052 transitions. [2024-11-13 20:33:58,521 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1052 transitions. [2024-11-13 20:33:58,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 20:33:58,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:58,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:58,593 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 20:33:58,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:58,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 856 states and 1069 transitions. [2024-11-13 20:33:58,790 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1069 transitions. [2024-11-13 20:33:58,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 20:33:58,791 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:58,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:58,935 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:33:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:33:59,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 895 states and 1111 transitions. [2024-11-13 20:33:59,616 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1111 transitions. [2024-11-13 20:33:59,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 20:33:59,618 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:33:59,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:33:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:33:59,705 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-13 20:34:00,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:00,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 912 states and 1132 transitions. [2024-11-13 20:34:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1132 transitions. [2024-11-13 20:34:00,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 20:34:00,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:00,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:00,531 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-13 20:34:00,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:00,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 928 states and 1149 transitions. [2024-11-13 20:34:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1149 transitions. [2024-11-13 20:34:00,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 20:34:00,883 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:00,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:02,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 998 states and 1227 transitions. [2024-11-13 20:34:02,424 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1227 transitions. [2024-11-13 20:34:02,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 20:34:02,426 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:02,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:03,011 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-13 20:34:05,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:05,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1067 states and 1319 transitions. [2024-11-13 20:34:05,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1319 transitions. [2024-11-13 20:34:05,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 20:34:05,814 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:05,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:06,126 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-13 20:34:08,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:08,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1135 states and 1395 transitions. [2024-11-13 20:34:08,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1395 transitions. [2024-11-13 20:34:08,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-13 20:34:08,228 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:08,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:08,332 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-13 20:34:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:08,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1136 states and 1395 transitions. [2024-11-13 20:34:08,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1395 transitions. [2024-11-13 20:34:08,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-13 20:34:08,674 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:08,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:08,880 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1164 states and 1424 transitions. [2024-11-13 20:34:09,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1424 transitions. [2024-11-13 20:34:09,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 20:34:09,576 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:09,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1235 states and 1495 transitions. [2024-11-13 20:34:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1495 transitions. [2024-11-13 20:34:11,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 20:34:11,220 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:11,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:11,415 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-13 20:34:12,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:12,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1254 states and 1513 transitions. [2024-11-13 20:34:12,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1513 transitions. [2024-11-13 20:34:12,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 20:34:12,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:12,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:12,421 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-13 20:34:13,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:13,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1271 states and 1530 transitions. [2024-11-13 20:34:13,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1530 transitions. [2024-11-13 20:34:13,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 20:34:13,091 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:13,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:13,251 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-13 20:34:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:13,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1273 states and 1531 transitions. [2024-11-13 20:34:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1531 transitions. [2024-11-13 20:34:13,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 20:34:13,547 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:13,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:13,937 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 80 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:14,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:14,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1279 states and 1538 transitions. [2024-11-13 20:34:14,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1538 transitions. [2024-11-13 20:34:14,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 20:34:14,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:14,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:15,029 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 80 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:15,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1289 states and 1549 transitions. [2024-11-13 20:34:15,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1549 transitions. [2024-11-13 20:34:15,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 20:34:15,648 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:15,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:15,888 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-13 20:34:17,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1328 states and 1592 transitions. [2024-11-13 20:34:17,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1592 transitions. [2024-11-13 20:34:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 20:34:17,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:17,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:17,386 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-13 20:34:18,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:18,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1352 states and 1616 transitions. [2024-11-13 20:34:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1616 transitions. [2024-11-13 20:34:18,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 20:34:18,340 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:18,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 20:34:18,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:18,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1353 states and 1619 transitions. [2024-11-13 20:34:18,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1619 transitions. [2024-11-13 20:34:18,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-13 20:34:18,988 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:18,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:19,212 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-13 20:34:19,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:19,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1378 states and 1645 transitions. [2024-11-13 20:34:19,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1645 transitions. [2024-11-13 20:34:19,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-13 20:34:19,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:19,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:19,908 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-13 20:34:20,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:20,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1402 states and 1669 transitions. [2024-11-13 20:34:20,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1669 transitions. [2024-11-13 20:34:20,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 20:34:20,315 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:20,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 20:34:21,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1415 states and 1684 transitions. [2024-11-13 20:34:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1684 transitions. [2024-11-13 20:34:21,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 20:34:21,366 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:21,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:21,520 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-13 20:34:22,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:22,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1458 states and 1737 transitions. [2024-11-13 20:34:22,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1737 transitions. [2024-11-13 20:34:22,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 20:34:22,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:22,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:23,243 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-13 20:34:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1470 states and 1754 transitions. [2024-11-13 20:34:24,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 1754 transitions. [2024-11-13 20:34:24,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 20:34:24,318 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:24,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:24,417 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-13 20:34:24,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:24,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1474 states and 1759 transitions. [2024-11-13 20:34:24,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 1759 transitions. [2024-11-13 20:34:24,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 20:34:24,738 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:24,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:24,953 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-13 20:34:25,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:25,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1494 states and 1782 transitions. [2024-11-13 20:34:25,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1782 transitions. [2024-11-13 20:34:25,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 20:34:25,615 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:25,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:25,712 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-13 20:34:26,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1509 states and 1796 transitions. [2024-11-13 20:34:26,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1796 transitions. [2024-11-13 20:34:26,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:34:26,092 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:26,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:26,680 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-13 20:34:30,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:30,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1593 states and 1893 transitions. [2024-11-13 20:34:30,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 1893 transitions. [2024-11-13 20:34:30,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:34:30,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:30,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:31,035 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-13 20:34:34,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1675 states and 1985 transitions. [2024-11-13 20:34:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 1985 transitions. [2024-11-13 20:34:34,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 20:34:34,938 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:34,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:35,591 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-13 20:34:38,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:38,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 1726 states and 2048 transitions. [2024-11-13 20:34:38,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2048 transitions. [2024-11-13 20:34:38,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 20:34:38,886 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:38,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:39,163 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-13 20:34:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 1772 states and 2099 transitions. [2024-11-13 20:34:40,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2099 transitions. [2024-11-13 20:34:40,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 20:34:40,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:40,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:40,611 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-13 20:34:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 1773 states and 2100 transitions. [2024-11-13 20:34:40,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2100 transitions. [2024-11-13 20:34:40,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-13 20:34:40,961 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:40,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:41,547 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-13 20:34:42,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 1803 states and 2132 transitions. [2024-11-13 20:34:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2132 transitions. [2024-11-13 20:34:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-13 20:34:42,781 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:42,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:43,144 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-13 20:34:44,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:44,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 1833 states and 2166 transitions. [2024-11-13 20:34:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2166 transitions. [2024-11-13 20:34:44,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 20:34:44,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:44,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:44,953 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-13 20:34:46,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:46,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 1881 states and 2221 transitions. [2024-11-13 20:34:46,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2221 transitions. [2024-11-13 20:34:46,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 20:34:46,850 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:46,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:47,157 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-13 20:34:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 1941 states and 2286 transitions. [2024-11-13 20:34:49,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2286 transitions. [2024-11-13 20:34:49,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 20:34:49,512 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:49,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 117 proven. 46 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:34:50,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:50,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 1965 states and 2312 transitions. [2024-11-13 20:34:50,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2312 transitions. [2024-11-13 20:34:50,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 20:34:50,995 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:50,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:51,272 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 117 proven. 46 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:34:51,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:51,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 1988 states and 2339 transitions. [2024-11-13 20:34:51,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1988 states and 2339 transitions. [2024-11-13 20:34:51,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 20:34:51,961 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:51,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:52,252 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-13 20:34:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 1989 states and 2340 transitions. [2024-11-13 20:34:52,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2340 transitions. [2024-11-13 20:34:52,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-13 20:34:52,465 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:52,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:52,717 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-13 20:34:53,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:53,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2059 states and 2412 transitions. [2024-11-13 20:34:53,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 2412 transitions. [2024-11-13 20:34:53,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 20:34:53,612 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:53,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:54,139 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-13 20:34:56,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:56,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2106 states and 2467 transitions. [2024-11-13 20:34:56,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 2467 transitions. [2024-11-13 20:34:56,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 20:34:56,921 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:56,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:57,157 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-13 20:34:58,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2147 states and 2514 transitions. [2024-11-13 20:34:58,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 2514 transitions. [2024-11-13 20:34:58,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 20:34:58,723 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:58,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:59,030 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-13 20:35:00,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:00,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2165 states and 2535 transitions. [2024-11-13 20:35:00,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 2535 transitions. [2024-11-13 20:35:00,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 20:35:00,257 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:00,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:00,467 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-13 20:35:00,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:00,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2166 states and 2537 transitions. [2024-11-13 20:35:00,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 2537 transitions. [2024-11-13 20:35:00,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 20:35:00,890 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:00,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:01,340 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-13 20:35:03,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2574 states to 2198 states and 2574 transitions. [2024-11-13 20:35:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 2574 transitions. [2024-11-13 20:35:03,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 20:35:03,871 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:03,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:04,156 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-13 20:35:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2212 states and 2590 transitions. [2024-11-13 20:35:05,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 2590 transitions. [2024-11-13 20:35:05,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 20:35:05,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:05,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:05,510 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-13 20:35:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2216 states and 2594 transitions. [2024-11-13 20:35:06,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2594 transitions. [2024-11-13 20:35:06,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 20:35:06,093 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:06,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:06,471 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-13 20:35:08,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:08,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2247 states and 2630 transitions. [2024-11-13 20:35:08,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 2630 transitions. [2024-11-13 20:35:08,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 20:35:08,798 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:08,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:09,231 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-13 20:35:10,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2261 states and 2643 transitions. [2024-11-13 20:35:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 2643 transitions. [2024-11-13 20:35:10,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-13 20:35:10,568 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:10,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:11,040 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-13 20:35:12,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:12,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2285 states and 2669 transitions. [2024-11-13 20:35:12,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 2669 transitions. [2024-11-13 20:35:12,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-13 20:35:12,729 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:12,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:12,852 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-13 20:35:14,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:14,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2311 states and 2699 transitions. [2024-11-13 20:35:14,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 2699 transitions. [2024-11-13 20:35:14,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 20:35:14,382 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:14,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:14,859 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-13 20:35:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:19,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2363 states and 2757 transitions. [2024-11-13 20:35:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 2757 transitions. [2024-11-13 20:35:19,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 20:35:19,811 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:19,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:20,091 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-13 20:35:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:22,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2394 states and 2791 transitions. [2024-11-13 20:35:22,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 2791 transitions. [2024-11-13 20:35:22,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 20:35:22,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:22,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:22,829 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-13 20:35:24,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:24,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2409 states and 2806 transitions. [2024-11-13 20:35:24,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2409 states and 2806 transitions. [2024-11-13 20:35:24,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 20:35:24,039 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:24,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:24,503 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-13 20:35:26,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:26,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2833 states to 2432 states and 2833 transitions. [2024-11-13 20:35:26,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 2833 transitions. [2024-11-13 20:35:26,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 20:35:26,807 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:26,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:27,073 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-13 20:35:29,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:29,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2466 states and 2871 transitions. [2024-11-13 20:35:29,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 2871 transitions. [2024-11-13 20:35:29,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 20:35:29,926 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:29,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:30,227 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-13 20:35:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:31,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2482 states and 2887 transitions. [2024-11-13 20:35:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 2887 transitions. [2024-11-13 20:35:31,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-13 20:35:31,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:31,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:31,820 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-13 20:35:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:32,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2483 states and 2887 transitions. [2024-11-13 20:35:32,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 2887 transitions. [2024-11-13 20:35:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 20:35:32,450 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:32,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:33,369 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-13 20:35:38,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2532 states and 2945 transitions. [2024-11-13 20:35:38,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 2945 transitions. [2024-11-13 20:35:38,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 20:35:38,493 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:38,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:38,742 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-13 20:35:41,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:41,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3000 states to 2580 states and 3000 transitions. [2024-11-13 20:35:41,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 3000 transitions. [2024-11-13 20:35:41,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 20:35:41,809 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:41,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:42,124 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-13 20:35:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:43,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 2595 states and 3014 transitions. [2024-11-13 20:35:43,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 3014 transitions. [2024-11-13 20:35:43,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 20:35:43,770 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:43,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:44,077 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-13 20:35:44,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 2597 states and 3016 transitions. [2024-11-13 20:35:44,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 3016 transitions. [2024-11-13 20:35:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 20:35:44,810 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:44,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:45,320 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-13 20:35:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:47,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 2612 states and 3030 transitions. [2024-11-13 20:35:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 3030 transitions. [2024-11-13 20:35:47,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-13 20:35:47,024 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:47,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:48,159 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-13 20:35:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:54,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 2746 states and 3188 transitions. [2024-11-13 20:35:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2746 states and 3188 transitions. [2024-11-13 20:35:54,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 20:35:54,325 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:54,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:54,701 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-13 20:35:56,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 2771 states and 3214 transitions. [2024-11-13 20:35:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2771 states and 3214 transitions. [2024-11-13 20:35:56,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-13 20:35:56,083 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:56,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:56,369 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-13 20:35:56,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:56,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3215 states to 2773 states and 3215 transitions. [2024-11-13 20:35:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 3215 transitions. [2024-11-13 20:35:56,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 20:35:56,820 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:56,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:35:56,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 20:35:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:35:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:35:57,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 20:35:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:35:57,305 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 107 iterations. [2024-11-13 20:35:57,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 08:35:57 ImpRootNode [2024-11-13 20:35:57,462 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 20:35:57,463 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 20:35:57,463 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 20:35:57,463 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 20:35:57,467 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:33:28" (3/4) ... [2024-11-13 20:35:57,468 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 20:35:57,643 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f834cf57-4577-4c17-ace3-70ed39f8eda2/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 20:35:57,647 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 20:35:57,649 INFO L158 Benchmark]: Toolchain (without parser) took 151551.55ms. Allocated memory was 142.6MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 117.6MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 900.7MB. Max. memory is 16.1GB. [2024-11-13 20:35:57,649 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 142.6MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:35:57,649 INFO L158 Benchmark]: CACSL2BoogieTranslator took 631.68ms. Allocated memory is still 142.6MB. Free memory was 117.4MB in the beginning and 90.6MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 20:35:57,650 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.22ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 85.3MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 20:35:57,650 INFO L158 Benchmark]: Boogie Preprocessor took 80.48ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 81.1MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:35:57,650 INFO L158 Benchmark]: RCFGBuilder took 2050.38ms. 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 340.1MB in the end (delta: -259.0MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2024-11-13 20:35:57,651 INFO L158 Benchmark]: CodeCheck took 148516.78ms. Allocated memory was 419.4MB in the beginning and 2.2GB in the end (delta: 1.8GB). Free memory was 340.1MB in the beginning and 1.3GB in the end (delta: -973.6MB). Peak memory consumption was 824.3MB. Max. memory is 16.1GB. [2024-11-13 20:35:57,655 INFO L158 Benchmark]: Witness Printer took 184.96ms. Allocated memory is still 2.2GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 20:35:57,657 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: 148.3s, OverallIterations: 107, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 281238 SdHoareTripleChecker+Valid, 908.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 279667 mSDsluCounter, 41539 SdHoareTripleChecker+Invalid, 769.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35301 mSDsCounter, 84022 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 626850 IncrementalHoareTripleChecker+Invalid, 710872 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84022 mSolverCounterUnsat, 6238 mSDtfsCounter, 626850 mSolverCounterSat, 9.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114226 GetRequests, 108896 SyntacticMatches, 4394 SemanticMatches, 936 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678665 ImplicationChecksByTransitivity, 98.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.7s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 25.6s InterpolantComputationTime, 16520 NumberOfCodeBlocks, 16520 NumberOfCodeBlocksAsserted, 107 NumberOfCheckSat, 16198 ConstructedInterpolants, 0 QuantifiedInterpolants, 96826 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 106 InterpolantComputations, 43 PerfectInterpolantSequences, 11006/13103 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 - CounterExampleResult [Line: 429]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [\result=21, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [\result=21, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [\result=26, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND TRUE ((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8)) [L189] a17 = 0 [L190] a16 = 5 [L191] a21 = 1 [L192] a8 = 14 [L193] a7 = 1 [L194] a20 = 1 [L195] return -1; VAL [\result=-1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L422] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L425] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L428] COND TRUE ((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L429] reach_error() VAL [a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 142.6MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 631.68ms. Allocated memory is still 142.6MB. Free memory was 117.4MB in the beginning and 90.6MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.22ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 85.3MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.48ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 81.1MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2050.38ms. 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 340.1MB in the end (delta: -259.0MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. * CodeCheck took 148516.78ms. Allocated memory was 419.4MB in the beginning and 2.2GB in the end (delta: 1.8GB). Free memory was 340.1MB in the beginning and 1.3GB in the end (delta: -973.6MB). Peak memory consumption was 824.3MB. Max. memory is 16.1GB. * Witness Printer took 184.96ms. Allocated memory is still 2.2GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 20:35:57,708 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f834cf57-4577-4c17-ace3-70ed39f8eda2/bin/ukojak-verify-EEHR8qb7sm/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE