./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63bbe19-5b43-4097-bfa8-08f1d90f79f7/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63bbe19-5b43-4097-bfa8-08f1d90f79f7/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63bbe19-5b43-4097-bfa8-08f1d90f79f7/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63bbe19-5b43-4097-bfa8-08f1d90f79f7/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label20.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63bbe19-5b43-4097-bfa8-08f1d90f79f7/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63bbe19-5b43-4097-bfa8-08f1d90f79f7/bin/ukojak-verify-CZk0znPC7b --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 6d0713a1238e02d0284b255e77b84c086e26fd99d5533d6977fb0509f2ece092 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-05 23:46:22,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-05 23:46:23,022 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63bbe19-5b43-4097-bfa8-08f1d90f79f7/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-05 23:46:23,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-05 23:46:23,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-05 23:46:23,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-05 23:46:23,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-05 23:46:23,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-05 23:46:23,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-05 23:46:23,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-05 23:46:23,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-05 23:46:23,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-05 23:46:23,047 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-05 23:46:23,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-05 23:46:23,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-05 23:46:23,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-05 23:46:23,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-05 23:46:23,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-05 23:46:23,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-05 23:46:23,047 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-05 23:46:23,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-05 23:46:23,047 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-05 23:46:23,047 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-05 23:46:23,047 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-05 23:46:23,048 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-05 23:46:23,048 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-05 23:46:23,048 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-05 23:46:23,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 23:46:23,048 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-05 23:46:23,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-05 23:46:23,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-05 23:46:23,048 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-05 23:46:23,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-05 23:46:23,048 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_f63bbe19-5b43-4097-bfa8-08f1d90f79f7/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 6d0713a1238e02d0284b255e77b84c086e26fd99d5533d6977fb0509f2ece092 [2024-12-05 23:46:23,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-05 23:46:23,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-05 23:46:23,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-05 23:46:23,294 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-05 23:46:23,294 INFO L274 PluginConnector]: CDTParser initialized [2024-12-05 23:46:23,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63bbe19-5b43-4097-bfa8-08f1d90f79f7/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem01_label20.c [2024-12-05 23:46:25,916 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63bbe19-5b43-4097-bfa8-08f1d90f79f7/bin/ukojak-verify-CZk0znPC7b/data/a33a3a18d/52a0bec9b04748d8b64a8700768e2248/FLAG58048eddc [2024-12-05 23:46:26,182 INFO L384 CDTParser]: Found 1 translation units. [2024-12-05 23:46:26,182 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63bbe19-5b43-4097-bfa8-08f1d90f79f7/sv-benchmarks/c/eca-rers2012/Problem01_label20.c [2024-12-05 23:46:26,192 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63bbe19-5b43-4097-bfa8-08f1d90f79f7/bin/ukojak-verify-CZk0znPC7b/data/a33a3a18d/52a0bec9b04748d8b64a8700768e2248/FLAG58048eddc [2024-12-05 23:46:26,496 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63bbe19-5b43-4097-bfa8-08f1d90f79f7/bin/ukojak-verify-CZk0znPC7b/data/a33a3a18d/52a0bec9b04748d8b64a8700768e2248 [2024-12-05 23:46:26,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-05 23:46:26,499 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-05 23:46:26,500 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-05 23:46:26,500 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-05 23:46:26,504 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-05 23:46:26,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:46:26" (1/1) ... [2024-12-05 23:46:26,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5beb0427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:46:26, skipping insertion in model container [2024-12-05 23:46:26,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:46:26" (1/1) ... [2024-12-05 23:46:26,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-05 23:46:26,751 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_f63bbe19-5b43-4097-bfa8-08f1d90f79f7/sv-benchmarks/c/eca-rers2012/Problem01_label20.c[14503,14516] [2024-12-05 23:46:26,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 23:46:26,793 INFO L200 MainTranslator]: Completed pre-run [2024-12-05 23:46:26,857 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_f63bbe19-5b43-4097-bfa8-08f1d90f79f7/sv-benchmarks/c/eca-rers2012/Problem01_label20.c[14503,14516] [2024-12-05 23:46:26,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 23:46:26,889 INFO L204 MainTranslator]: Completed translation [2024-12-05 23:46:26,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:46:26 WrapperNode [2024-12-05 23:46:26,890 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-05 23:46:26,891 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-05 23:46:26,891 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-05 23:46:26,891 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-05 23:46:26,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:46:26" (1/1) ... [2024-12-05 23:46:26,908 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:46:26" (1/1) ... [2024-12-05 23:46:26,941 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-12-05 23:46:26,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-05 23:46:26,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-05 23:46:26,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-05 23:46:26,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-05 23:46:26,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:46:26" (1/1) ... [2024-12-05 23:46:26,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:46:26" (1/1) ... [2024-12-05 23:46:26,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:46:26" (1/1) ... [2024-12-05 23:46:26,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:46:26" (1/1) ... [2024-12-05 23:46:26,970 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:46:26" (1/1) ... [2024-12-05 23:46:26,972 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:46:26" (1/1) ... [2024-12-05 23:46:26,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:46:26" (1/1) ... [2024-12-05 23:46:26,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:46:26" (1/1) ... [2024-12-05 23:46:26,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:46:26" (1/1) ... [2024-12-05 23:46:26,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-05 23:46:26,994 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-05 23:46:26,994 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-05 23:46:26,994 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-05 23:46:26,995 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:46:26" (1/1) ... [2024-12-05 23:46:27,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 23:46:27,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63bbe19-5b43-4097-bfa8-08f1d90f79f7/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-05 23:46:27,022 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63bbe19-5b43-4097-bfa8-08f1d90f79f7/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-05 23:46:27,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63bbe19-5b43-4097-bfa8-08f1d90f79f7/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-05 23:46:27,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-05 23:46:27,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-05 23:46:27,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-05 23:46:27,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-05 23:46:27,111 INFO L234 CfgBuilder]: Building ICFG [2024-12-05 23:46:27,113 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-05 23:46:27,897 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-05 23:46:27,897 INFO L283 CfgBuilder]: Performing block encoding [2024-12-05 23:46:28,131 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-05 23:46:28,132 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-05 23:46:28,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:46:28 BoogieIcfgContainer [2024-12-05 23:46:28,132 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-05 23:46:28,133 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-05 23:46:28,133 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-05 23:46:28,142 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-05 23:46:28,142 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:46:28" (1/1) ... [2024-12-05 23:46:28,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 23:46:28,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:28,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-12-05 23:46:28,198 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-12-05 23:46:28,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-05 23:46:28,201 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:28,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:28,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:46:29,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:29,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 145 states and 261 transitions. [2024-12-05 23:46:29,138 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 261 transitions. [2024-12-05 23:46:29,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-05 23:46:29,140 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:29,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:46:30,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:30,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 215 states and 339 transitions. [2024-12-05 23:46:30,015 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 339 transitions. [2024-12-05 23:46:30,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-05 23:46:30,017 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:30,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:30,121 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:46:30,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:30,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 220 states and 346 transitions. [2024-12-05 23:46:30,198 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 346 transitions. [2024-12-05 23:46:30,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-05 23:46:30,201 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:30,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 23:46:30,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:30,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 291 states and 425 transitions. [2024-12-05 23:46:30,837 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 425 transitions. [2024-12-05 23:46:30,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-05 23:46:30,839 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:30,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:46:31,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:31,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 307 states and 444 transitions. [2024-12-05 23:46:31,197 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 444 transitions. [2024-12-05 23:46:31,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-12-05 23:46:31,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:31,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:46:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 317 states and 457 transitions. [2024-12-05 23:46:31,522 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 457 transitions. [2024-12-05 23:46:31,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-05 23:46:31,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:31,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:31,649 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 23:46:31,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:31,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 338 states and 481 transitions. [2024-12-05 23:46:31,987 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 481 transitions. [2024-12-05 23:46:31,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-12-05 23:46:31,988 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:31,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:32,159 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:46:32,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:32,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 349 states and 495 transitions. [2024-12-05 23:46:32,661 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 495 transitions. [2024-12-05 23:46:32,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-12-05 23:46:32,663 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:32,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:32,818 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:46:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:32,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 359 states and 506 transitions. [2024-12-05 23:46:32,969 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 506 transitions. [2024-12-05 23:46:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-05 23:46:32,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:32,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:33,034 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 23:46:33,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:33,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 365 states and 512 transitions. [2024-12-05 23:46:33,084 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 512 transitions. [2024-12-05 23:46:33,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-05 23:46:33,085 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:33,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-05 23:46:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 373 states and 525 transitions. [2024-12-05 23:46:33,446 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 525 transitions. [2024-12-05 23:46:33,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-05 23:46:33,447 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:33,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:33,528 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-05 23:46:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:33,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 380 states and 535 transitions. [2024-12-05 23:46:33,808 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 535 transitions. [2024-12-05 23:46:33,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-05 23:46:33,809 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:33,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-05 23:46:34,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:34,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 388 states and 544 transitions. [2024-12-05 23:46:34,051 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 544 transitions. [2024-12-05 23:46:34,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-05 23:46:34,052 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:34,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:34,150 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-05 23:46:34,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:34,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 390 states and 546 transitions. [2024-12-05 23:46:34,191 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 546 transitions. [2024-12-05 23:46:34,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-05 23:46:34,193 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:34,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:34,339 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-05 23:46:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:34,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 398 states and 556 transitions. [2024-12-05 23:46:34,653 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 556 transitions. [2024-12-05 23:46:34,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-05 23:46:34,654 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:34,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:34,858 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-05 23:46:34,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:34,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 400 states and 558 transitions. [2024-12-05 23:46:34,905 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 558 transitions. [2024-12-05 23:46:34,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-05 23:46:34,906 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:34,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-05 23:46:35,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 402 states and 560 transitions. [2024-12-05 23:46:35,096 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 560 transitions. [2024-12-05 23:46:35,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-05 23:46:35,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:35,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:46:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:35,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 413 states and 574 transitions. [2024-12-05 23:46:35,690 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 574 transitions. [2024-12-05 23:46:35,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-05 23:46:35,691 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:35,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:35,845 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:46:36,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:36,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 423 states and 585 transitions. [2024-12-05 23:46:36,088 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 585 transitions. [2024-12-05 23:46:36,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-05 23:46:36,089 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:36,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:36,227 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:46:36,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:36,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 440 states and 604 transitions. [2024-12-05 23:46:36,435 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 604 transitions. [2024-12-05 23:46:36,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-12-05 23:46:36,436 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:36,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:36,498 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 23:46:36,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:36,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 454 states and 618 transitions. [2024-12-05 23:46:36,580 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 618 transitions. [2024-12-05 23:46:36,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-05 23:46:36,581 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:36,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:36,705 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-05 23:46:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 478 states and 645 transitions. [2024-12-05 23:46:37,325 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 645 transitions. [2024-12-05 23:46:37,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-05 23:46:37,326 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:37,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-05 23:46:37,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:37,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 507 states and 679 transitions. [2024-12-05 23:46:37,945 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 679 transitions. [2024-12-05 23:46:37,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-12-05 23:46:37,946 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:37,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:38,047 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:46:38,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:38,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 536 states and 709 transitions. [2024-12-05 23:46:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 709 transitions. [2024-12-05 23:46:38,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-12-05 23:46:38,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:38,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:38,270 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 23:46:38,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:38,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 584 states and 761 transitions. [2024-12-05 23:46:38,863 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 761 transitions. [2024-12-05 23:46:38,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-12-05 23:46:38,864 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:38,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-05 23:46:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:39,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 598 states and 775 transitions. [2024-12-05 23:46:39,100 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 775 transitions. [2024-12-05 23:46:39,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-05 23:46:39,101 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:39,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-05 23:46:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:40,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 627 states and 807 transitions. [2024-12-05 23:46:40,029 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 807 transitions. [2024-12-05 23:46:40,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-05 23:46:40,030 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:40,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:40,211 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:46:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:40,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 632 states and 815 transitions. [2024-12-05 23:46:40,614 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 815 transitions. [2024-12-05 23:46:40,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-05 23:46:40,615 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:40,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:46:40,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:40,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 638 states and 821 transitions. [2024-12-05 23:46:40,817 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 821 transitions. [2024-12-05 23:46:40,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-05 23:46:40,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:40,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:46:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 648 states and 832 transitions. [2024-12-05 23:46:41,135 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 832 transitions. [2024-12-05 23:46:41,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-12-05 23:46:41,136 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:41,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:41,217 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-12-05 23:46:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 662 states and 848 transitions. [2024-12-05 23:46:41,694 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 848 transitions. [2024-12-05 23:46:41,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-05 23:46:41,695 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:41,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:41,778 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:46:41,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 701 states and 891 transitions. [2024-12-05 23:46:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 891 transitions. [2024-12-05 23:46:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-05 23:46:41,980 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:41,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:42,154 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:46:42,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:42,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 771 states and 969 transitions. [2024-12-05 23:46:42,862 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 969 transitions. [2024-12-05 23:46:42,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-05 23:46:42,862 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:42,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:46:44,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:44,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 840 states and 1059 transitions. [2024-12-05 23:46:44,813 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1059 transitions. [2024-12-05 23:46:44,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-05 23:46:44,814 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:44,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:46:46,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:46,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 908 states and 1131 transitions. [2024-12-05 23:46:46,261 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1131 transitions. [2024-12-05 23:46:46,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-05 23:46:46,262 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:46,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-05 23:46:46,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:46,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 909 states and 1131 transitions. [2024-12-05 23:46:46,566 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1131 transitions. [2024-12-05 23:46:46,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-05 23:46:46,567 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:46,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:46:47,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:47,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 937 states and 1161 transitions. [2024-12-05 23:46:47,193 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1161 transitions. [2024-12-05 23:46:47,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-05 23:46:47,194 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:47,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:47,401 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:46:48,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:48,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 977 states and 1210 transitions. [2024-12-05 23:46:48,496 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1210 transitions. [2024-12-05 23:46:48,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-05 23:46:48,497 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:48,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:48,656 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:46:49,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:49,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1016 states and 1252 transitions. [2024-12-05 23:46:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1252 transitions. [2024-12-05 23:46:49,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-05 23:46:49,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:49,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:49,911 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:46:50,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:50,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1087 states and 1323 transitions. [2024-12-05 23:46:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1323 transitions. [2024-12-05 23:46:50,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-05 23:46:50,908 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:50,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:51,022 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 126 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:46:51,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:51,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1104 states and 1343 transitions. [2024-12-05 23:46:51,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1343 transitions. [2024-12-05 23:46:51,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-05 23:46:51,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:51,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:51,683 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 126 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:46:52,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1123 states and 1364 transitions. [2024-12-05 23:46:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1364 transitions. [2024-12-05 23:46:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-05 23:46:52,285 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:52,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 126 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:46:52,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1125 states and 1366 transitions. [2024-12-05 23:46:52,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1366 transitions. [2024-12-05 23:46:52,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-05 23:46:52,583 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:52,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:52,755 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 87 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-12-05 23:46:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1128 states and 1370 transitions. [2024-12-05 23:46:53,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1370 transitions. [2024-12-05 23:46:53,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-05 23:46:53,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:53,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:53,323 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 87 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-12-05 23:46:53,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1143 states and 1387 transitions. [2024-12-05 23:46:53,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1387 transitions. [2024-12-05 23:46:53,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-12-05 23:46:53,806 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:53,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 97 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:46:54,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:54,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1162 states and 1408 transitions. [2024-12-05 23:46:54,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1408 transitions. [2024-12-05 23:46:54,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-12-05 23:46:54,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:54,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:54,647 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 97 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:46:55,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1181 states and 1429 transitions. [2024-12-05 23:46:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1429 transitions. [2024-12-05 23:46:55,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-12-05 23:46:55,270 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:55,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:55,341 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-05 23:46:56,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1198 states and 1450 transitions. [2024-12-05 23:46:56,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1450 transitions. [2024-12-05 23:46:56,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-12-05 23:46:56,085 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:56,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 127 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-05 23:46:56,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1214 states and 1470 transitions. [2024-12-05 23:46:56,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1470 transitions. [2024-12-05 23:46:56,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-12-05 23:46:56,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:56,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:56,638 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 106 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:46:57,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:57,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1219 states and 1476 transitions. [2024-12-05 23:46:57,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1476 transitions. [2024-12-05 23:46:57,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-12-05 23:46:57,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:57,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 106 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-05 23:46:57,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:57,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1229 states and 1487 transitions. [2024-12-05 23:46:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1487 transitions. [2024-12-05 23:46:57,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-05 23:46:57,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:57,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:57,702 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-05 23:46:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:58,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1250 states and 1513 transitions. [2024-12-05 23:46:58,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1513 transitions. [2024-12-05 23:46:58,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-12-05 23:46:58,190 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:58,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:58,316 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 114 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-12-05 23:46:59,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:46:59,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1291 states and 1558 transitions. [2024-12-05 23:46:59,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1558 transitions. [2024-12-05 23:46:59,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-12-05 23:46:59,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:46:59,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:46:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:46:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 114 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-12-05 23:47:00,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:00,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1329 states and 1599 transitions. [2024-12-05 23:47:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1599 transitions. [2024-12-05 23:47:00,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-05 23:47:00,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:00,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:00,749 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:01,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:01,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1340 states and 1617 transitions. [2024-12-05 23:47:01,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1617 transitions. [2024-12-05 23:47:01,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-05 23:47:01,479 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:01,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:01,695 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:02,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:02,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1372 states and 1651 transitions. [2024-12-05 23:47:02,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1651 transitions. [2024-12-05 23:47:02,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-05 23:47:02,380 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:02,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:02,631 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:02,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:02,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1376 states and 1656 transitions. [2024-12-05 23:47:02,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1656 transitions. [2024-12-05 23:47:02,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-05 23:47:02,924 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:02,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:03,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1395 states and 1677 transitions. [2024-12-05 23:47:03,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1677 transitions. [2024-12-05 23:47:03,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-12-05 23:47:03,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:03,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:03,906 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-05 23:47:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:04,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1411 states and 1694 transitions. [2024-12-05 23:47:04,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1694 transitions. [2024-12-05 23:47:04,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-12-05 23:47:04,177 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:04,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:04,266 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 23:47:04,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:04,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1412 states and 1697 transitions. [2024-12-05 23:47:04,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1697 transitions. [2024-12-05 23:47:04,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-12-05 23:47:04,580 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:04,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:04,716 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-05 23:47:04,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:04,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1415 states and 1700 transitions. [2024-12-05 23:47:04,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1700 transitions. [2024-12-05 23:47:04,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-12-05 23:47:04,881 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:04,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:05,014 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-05 23:47:05,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1418 states and 1703 transitions. [2024-12-05 23:47:05,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1703 transitions. [2024-12-05 23:47:05,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-12-05 23:47:05,178 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:05,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-12-05 23:47:05,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:05,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1443 states and 1729 transitions. [2024-12-05 23:47:05,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1729 transitions. [2024-12-05 23:47:05,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-12-05 23:47:05,569 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:05,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:05,649 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-12-05 23:47:05,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:05,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1467 states and 1753 transitions. [2024-12-05 23:47:05,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1753 transitions. [2024-12-05 23:47:05,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-05 23:47:05,888 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:05,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:06,408 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:08,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1498 states and 1796 transitions. [2024-12-05 23:47:08,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1796 transitions. [2024-12-05 23:47:08,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-05 23:47:08,359 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:08,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:08,591 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1861 states to 1556 states and 1861 transitions. [2024-12-05 23:47:10,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1861 transitions. [2024-12-05 23:47:10,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-05 23:47:10,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:10,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:11,014 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1558 states and 1862 transitions. [2024-12-05 23:47:11,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 1862 transitions. [2024-12-05 23:47:11,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-05 23:47:11,268 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:11,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1562 states and 1867 transitions. [2024-12-05 23:47:12,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 1867 transitions. [2024-12-05 23:47:12,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-05 23:47:12,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:12,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:12,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:12,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1564 states and 1869 transitions. [2024-12-05 23:47:12,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1869 transitions. [2024-12-05 23:47:12,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-12-05 23:47:12,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:12,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-12-05 23:47:13,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:13,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1596 states and 1906 transitions. [2024-12-05 23:47:13,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 1906 transitions. [2024-12-05 23:47:13,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-12-05 23:47:13,621 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:13,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-12-05 23:47:14,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:14,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1613 states and 1928 transitions. [2024-12-05 23:47:14,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 1928 transitions. [2024-12-05 23:47:14,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-05 23:47:14,348 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:14,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-05 23:47:14,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1614 states and 1929 transitions. [2024-12-05 23:47:14,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 1929 transitions. [2024-12-05 23:47:14,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-12-05 23:47:14,725 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:14,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-05 23:47:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:15,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1643 states and 1962 transitions. [2024-12-05 23:47:15,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 1962 transitions. [2024-12-05 23:47:15,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-05 23:47:15,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:15,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-12-05 23:47:16,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1980 states to 1662 states and 1980 transitions. [2024-12-05 23:47:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 1980 transitions. [2024-12-05 23:47:16,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-05 23:47:16,529 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:16,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-12-05 23:47:17,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:17,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1679 states and 1997 transitions. [2024-12-05 23:47:17,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 1997 transitions. [2024-12-05 23:47:17,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-05 23:47:17,646 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:17,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-12-05 23:47:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:18,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1681 states and 1998 transitions. [2024-12-05 23:47:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 1998 transitions. [2024-12-05 23:47:18,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-05 23:47:18,164 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:18,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:18,444 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 127 proven. 44 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-05 23:47:19,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:19,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 1690 states and 2007 transitions. [2024-12-05 23:47:19,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2007 transitions. [2024-12-05 23:47:19,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-05 23:47:19,033 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:19,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:20,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 1720 states and 2041 transitions. [2024-12-05 23:47:20,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2041 transitions. [2024-12-05 23:47:20,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-05 23:47:20,778 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:20,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:21,012 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:21,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:21,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 1742 states and 2064 transitions. [2024-12-05 23:47:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2064 transitions. [2024-12-05 23:47:21,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-05 23:47:21,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:21,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 1758 states and 2080 transitions. [2024-12-05 23:47:22,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 2080 transitions. [2024-12-05 23:47:22,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-12-05 23:47:22,705 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:22,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:23,291 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 191 proven. 38 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-12-05 23:47:24,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:24,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 1773 states and 2096 transitions. [2024-12-05 23:47:24,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2096 transitions. [2024-12-05 23:47:24,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-05 23:47:24,191 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:24,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:24,449 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 134 proven. 51 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-05 23:47:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 1780 states and 2103 transitions. [2024-12-05 23:47:24,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2103 transitions. [2024-12-05 23:47:24,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-05 23:47:24,949 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:24,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-05 23:47:27,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 1830 states and 2159 transitions. [2024-12-05 23:47:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2159 transitions. [2024-12-05 23:47:27,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-05 23:47:27,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:27,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:27,888 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-05 23:47:29,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2197 states to 1865 states and 2197 transitions. [2024-12-05 23:47:29,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2197 transitions. [2024-12-05 23:47:29,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-05 23:47:29,781 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:29,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:30,018 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 159 proven. 46 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-12-05 23:47:31,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 1907 states and 2242 transitions. [2024-12-05 23:47:31,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2242 transitions. [2024-12-05 23:47:31,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-05 23:47:31,331 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:31,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:31,541 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 137 proven. 54 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-05 23:47:31,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:31,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 1910 states and 2246 transitions. [2024-12-05 23:47:31,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2246 transitions. [2024-12-05 23:47:31,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-05 23:47:31,773 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:31,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:32,102 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-05 23:47:35,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 1965 states and 2307 transitions. [2024-12-05 23:47:35,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2307 transitions. [2024-12-05 23:47:35,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-05 23:47:35,341 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:35,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:35,569 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-05 23:47:36,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:36,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 1979 states and 2323 transitions. [2024-12-05 23:47:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 2323 transitions. [2024-12-05 23:47:36,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-05 23:47:36,479 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:36,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:37,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 1980 states and 2324 transitions. [2024-12-05 23:47:37,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2324 transitions. [2024-12-05 23:47:37,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-05 23:47:37,466 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:37,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:38,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:38,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 1992 states and 2339 transitions. [2024-12-05 23:47:38,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2339 transitions. [2024-12-05 23:47:38,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-05 23:47:38,694 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:38,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:38,943 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:47:39,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 1999 states and 2345 transitions. [2024-12-05 23:47:39,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2345 transitions. [2024-12-05 23:47:39,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-05 23:47:39,900 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:39,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-05 23:47:43,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:43,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2063 states and 2418 transitions. [2024-12-05 23:47:43,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 2418 transitions. [2024-12-05 23:47:43,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-05 23:47:43,435 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:43,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-05 23:47:47,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:47,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2126 states and 2484 transitions. [2024-12-05 23:47:47,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 2484 transitions. [2024-12-05 23:47:47,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-12-05 23:47:47,454 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:47,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:47,767 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 58 proven. 202 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-05 23:47:48,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:48,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2207 states and 2567 transitions. [2024-12-05 23:47:48,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 2567 transitions. [2024-12-05 23:47:48,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-12-05 23:47:48,808 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:48,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:49,029 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-12-05 23:47:49,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:49,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2277 states and 2639 transitions. [2024-12-05 23:47:49,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 2639 transitions. [2024-12-05 23:47:49,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-12-05 23:47:49,680 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:49,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:49,790 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-12-05 23:47:50,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:50,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2279 states and 2641 transitions. [2024-12-05 23:47:50,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 2641 transitions. [2024-12-05 23:47:50,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-12-05 23:47:50,339 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:50,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:51,078 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 184 proven. 36 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-12-05 23:47:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:54,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2688 states to 2315 states and 2688 transitions. [2024-12-05 23:47:54,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 2688 transitions. [2024-12-05 23:47:54,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-12-05 23:47:54,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:54,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 172 proven. 137 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-05 23:47:56,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:56,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2326 states and 2702 transitions. [2024-12-05 23:47:56,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 2702 transitions. [2024-12-05 23:47:56,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-12-05 23:47:56,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:56,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:56,337 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 172 proven. 137 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-05 23:47:58,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:58,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2363 states and 2744 transitions. [2024-12-05 23:47:58,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 2744 transitions. [2024-12-05 23:47:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-05 23:47:58,013 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:58,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-12-05 23:47:58,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:58,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2377 states and 2761 transitions. [2024-12-05 23:47:58,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 2761 transitions. [2024-12-05 23:47:58,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-05 23:47:58,436 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:58,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:47:58,566 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-12-05 23:47:59,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:47:59,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2476 states and 2861 transitions. [2024-12-05 23:47:59,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 2861 transitions. [2024-12-05 23:47:59,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-05 23:47:59,849 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:47:59,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:47:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:01,055 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 23:48:07,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:07,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2575 states and 2989 transitions. [2024-12-05 23:48:07,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2575 states and 2989 transitions. [2024-12-05 23:48:07,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-12-05 23:48:07,376 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:07,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:48:07,504 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-12-05 23:48:07,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:48:07,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2576 states and 2989 transitions. [2024-12-05 23:48:07,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 2989 transitions. [2024-12-05 23:48:07,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-12-05 23:48:07,910 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:48:07,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:48:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 23:48:07,947 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 23:48:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 23:48:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 23:48:08,215 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 23:48:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 23:48:08,335 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 104 iterations. [2024-12-05 23:48:08,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 05.12 11:48:08 ImpRootNode [2024-12-05 23:48:08,456 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-05 23:48:08,456 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-05 23:48:08,456 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-05 23:48:08,457 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-05 23:48:08,457 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:46:28" (3/4) ... [2024-12-05 23:48:08,458 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-05 23:48:08,592 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 282. [2024-12-05 23:48:08,726 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63bbe19-5b43-4097-bfa8-08f1d90f79f7/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-05 23:48:08,726 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63bbe19-5b43-4097-bfa8-08f1d90f79f7/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-05 23:48:08,726 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-05 23:48:08,727 INFO L158 Benchmark]: Toolchain (without parser) took 102228.22ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 115.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 377.5MB. Max. memory is 16.1GB. [2024-12-05 23:48:08,728 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 142.6MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 23:48:08,728 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.47ms. Allocated memory is still 142.6MB. Free memory was 115.1MB in the beginning and 88.0MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-05 23:48:08,728 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.42ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 82.4MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 23:48:08,729 INFO L158 Benchmark]: Boogie Preprocessor took 51.63ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 78.4MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 23:48:08,729 INFO L158 Benchmark]: RCFGBuilder took 1138.55ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 64.1MB in the end (delta: 14.3MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2024-12-05 23:48:08,729 INFO L158 Benchmark]: CodeCheck took 100323.21ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 64.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 284.1MB. Max. memory is 16.1GB. [2024-12-05 23:48:08,729 INFO L158 Benchmark]: Witness Printer took 270.06ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-12-05 23:48:08,731 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: 100.2s, OverallIterations: 104, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 254352 SdHoareTripleChecker+Valid, 586.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252826 mSDsluCounter, 41140 SdHoareTripleChecker+Invalid, 497.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34901 mSDsCounter, 86437 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 576164 IncrementalHoareTripleChecker+Invalid, 662601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86437 mSolverCounterUnsat, 6239 mSDtfsCounter, 576164 mSolverCounterSat, 4.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115033 GetRequests, 110277 SyntacticMatches, 3882 SemanticMatches, 874 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558604 ImplicationChecksByTransitivity, 65.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.6s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 17213 NumberOfCodeBlocks, 17213 NumberOfCodeBlocksAsserted, 104 NumberOfCheckSat, 16827 ConstructedInterpolants, 0 QuantifiedInterpolants, 88027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 103 InterpolantComputations, 40 PerfectInterpolantSequences, 13737/16012 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - CounterExampleResult [Line: 402]: 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] [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) [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) [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) [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=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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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 TRUE ((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)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [\result=26, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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) [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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND TRUE ((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5)) [L272] a16 = 4 [L273] a20 = 0 [L274] return 25; VAL [\result=25, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, 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) [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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND TRUE ((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1))))))))) [L249] a20 = 0 [L250] a21 = 1 [L251] a17 = 0 [L252] a8 = 14 [L253] a16 = 4 [L254] return -1; VAL [\result=-1, a12=8, a16=4, a17=0, a20=0, 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) [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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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=4, a17=0, a20=0, 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)))))))) VAL [a12=8, a16=4, a17=0, a20=0, 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] [L401] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a12=8, a16=4, a17=0, a20=0, 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] [L402] reach_error() VAL [a12=8, a16=4, a17=0, a20=0, 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.32ms. Allocated memory is still 142.6MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 390.47ms. Allocated memory is still 142.6MB. Free memory was 115.1MB in the beginning and 88.0MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.42ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 82.4MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.63ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 78.4MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1138.55ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 64.1MB in the end (delta: 14.3MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. * CodeCheck took 100323.21ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 64.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 284.1MB. Max. memory is 16.1GB. * Witness Printer took 270.06ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-12-05 23:48:08,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63bbe19-5b43-4097-bfa8-08f1d90f79f7/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE