./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label38.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_7a68912a-9b9d-46a4-a546-7077e5e191a6/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a68912a-9b9d-46a4-a546-7077e5e191a6/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_7a68912a-9b9d-46a4-a546-7077e5e191a6/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a68912a-9b9d-46a4-a546-7077e5e191a6/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label38.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a68912a-9b9d-46a4-a546-7077e5e191a6/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_7a68912a-9b9d-46a4-a546-7077e5e191a6/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 af706eff0638e64b28329aeb8e4500504f7e95c7ca075a2e2f010d6212db9f23 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 02:39:27,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 02:39:27,876 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a68912a-9b9d-46a4-a546-7077e5e191a6/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 02:39:27,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 02:39:27,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 02:39:27,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 02:39:27,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 02:39:27,900 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 02:39:27,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 02:39:27,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 02:39:27,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 02:39:27,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 02:39:27,901 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 02:39:27,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 02:39:27,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 02:39:27,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 02:39:27,902 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 02:39:27,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 02:39:27,902 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 02:39:27,902 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 02:39:27,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 02:39:27,902 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 02:39:27,902 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 02:39:27,902 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 02:39:27,902 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 02:39:27,902 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 02:39:27,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 02:39:27,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 02:39:27,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 02:39:27,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 02:39:27,903 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 02:39:27,903 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 02:39:27,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 02:39:27,903 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_7a68912a-9b9d-46a4-a546-7077e5e191a6/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 -> af706eff0638e64b28329aeb8e4500504f7e95c7ca075a2e2f010d6212db9f23 [2024-12-06 02:39:28,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 02:39:28,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 02:39:28,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 02:39:28,145 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 02:39:28,145 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 02:39:28,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a68912a-9b9d-46a4-a546-7077e5e191a6/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem01_label38.c [2024-12-06 02:39:30,734 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a68912a-9b9d-46a4-a546-7077e5e191a6/bin/ukojak-verify-CZk0znPC7b/data/0bf045f1b/ae821c3b9f05467a99c47c4bb6e7a3fc/FLAGe10d70d82 [2024-12-06 02:39:30,998 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 02:39:30,998 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a68912a-9b9d-46a4-a546-7077e5e191a6/sv-benchmarks/c/eca-rers2012/Problem01_label38.c [2024-12-06 02:39:31,010 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a68912a-9b9d-46a4-a546-7077e5e191a6/bin/ukojak-verify-CZk0znPC7b/data/0bf045f1b/ae821c3b9f05467a99c47c4bb6e7a3fc/FLAGe10d70d82 [2024-12-06 02:39:31,321 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a68912a-9b9d-46a4-a546-7077e5e191a6/bin/ukojak-verify-CZk0znPC7b/data/0bf045f1b/ae821c3b9f05467a99c47c4bb6e7a3fc [2024-12-06 02:39:31,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 02:39:31,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 02:39:31,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 02:39:31,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 02:39:31,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 02:39:31,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:39:31" (1/1) ... [2024-12-06 02:39:31,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c4268c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:39:31, skipping insertion in model container [2024-12-06 02:39:31,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:39:31" (1/1) ... [2024-12-06 02:39:31,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 02:39:31,600 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_7a68912a-9b9d-46a4-a546-7077e5e191a6/sv-benchmarks/c/eca-rers2012/Problem01_label38.c[15751,15764] [2024-12-06 02:39:31,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 02:39:31,641 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 02:39:31,704 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_7a68912a-9b9d-46a4-a546-7077e5e191a6/sv-benchmarks/c/eca-rers2012/Problem01_label38.c[15751,15764] [2024-12-06 02:39:31,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 02:39:31,738 INFO L204 MainTranslator]: Completed translation [2024-12-06 02:39:31,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:39:31 WrapperNode [2024-12-06 02:39:31,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 02:39:31,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 02:39:31,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 02:39:31,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 02:39:31,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:39:31" (1/1) ... [2024-12-06 02:39:31,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:39:31" (1/1) ... [2024-12-06 02:39:31,795 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-12-06 02:39:31,795 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 02:39:31,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 02:39:31,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 02:39:31,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 02:39:31,803 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:39:31" (1/1) ... [2024-12-06 02:39:31,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:39:31" (1/1) ... [2024-12-06 02:39:31,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:39:31" (1/1) ... [2024-12-06 02:39:31,807 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:39:31" (1/1) ... [2024-12-06 02:39:31,822 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:39:31" (1/1) ... [2024-12-06 02:39:31,824 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:39:31" (1/1) ... [2024-12-06 02:39:31,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:39:31" (1/1) ... [2024-12-06 02:39:31,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:39:31" (1/1) ... [2024-12-06 02:39:31,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:39:31" (1/1) ... [2024-12-06 02:39:31,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 02:39:31,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 02:39:31,843 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 02:39:31,843 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 02:39:31,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:39:31" (1/1) ... [2024-12-06 02:39:31,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 02:39:31,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a68912a-9b9d-46a4-a546-7077e5e191a6/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 02:39:31,872 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a68912a-9b9d-46a4-a546-7077e5e191a6/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 02:39:31,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a68912a-9b9d-46a4-a546-7077e5e191a6/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 02:39:31,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 02:39:31,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 02:39:31,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 02:39:31,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 02:39:31,963 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 02:39:31,965 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 02:39:32,810 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-06 02:39:32,810 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 02:39:33,043 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 02:39:33,043 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 02:39:33,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:39:33 BoogieIcfgContainer [2024-12-06 02:39:33,044 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 02:39:33,044 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 02:39:33,045 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 02:39:33,054 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 02:39:33,054 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:39:33" (1/1) ... [2024-12-06 02:39:33,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 02:39:33,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:33,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-12-06 02:39:33,113 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-12-06 02:39:33,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-06 02:39:33,117 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:33,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:39:34,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:34,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2024-12-06 02:39:34,090 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2024-12-06 02:39:34,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-06 02:39:34,092 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:34,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:34,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 02:39:34,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:34,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 146 states and 220 transitions. [2024-12-06 02:39:34,481 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2024-12-06 02:39:34,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-06 02:39:34,483 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:34,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:34,567 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-06 02:39:34,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 151 states and 227 transitions. [2024-12-06 02:39:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 227 transitions. [2024-12-06 02:39:34,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-06 02:39:34,639 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:34,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:34,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:39:35,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:35,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 221 states and 299 transitions. [2024-12-06 02:39:35,262 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 299 transitions. [2024-12-06 02:39:35,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-12-06 02:39:35,264 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:35,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:35,418 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:39:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:35,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 228 states and 308 transitions. [2024-12-06 02:39:35,561 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 308 transitions. [2024-12-06 02:39:35,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-12-06 02:39:35,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:35,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:35,680 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 02:39:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 239 states and 323 transitions. [2024-12-06 02:39:36,076 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 323 transitions. [2024-12-06 02:39:36,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-06 02:39:36,079 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:36,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:36,204 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:39:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:36,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 248 states and 332 transitions. [2024-12-06 02:39:36,273 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 332 transitions. [2024-12-06 02:39:36,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 02:39:36,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:36,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:36,411 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 02:39:36,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 256 states and 342 transitions. [2024-12-06 02:39:36,587 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 342 transitions. [2024-12-06 02:39:36,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-12-06 02:39:36,588 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:36,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:36,684 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 02:39:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 264 states and 355 transitions. [2024-12-06 02:39:36,918 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 355 transitions. [2024-12-06 02:39:36,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-12-06 02:39:36,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:36,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:37,037 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 02:39:37,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:37,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 277 states and 371 transitions. [2024-12-06 02:39:37,329 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 371 transitions. [2024-12-06 02:39:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-12-06 02:39:37,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:37,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:37,399 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 02:39:37,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:37,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 285 states and 380 transitions. [2024-12-06 02:39:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 380 transitions. [2024-12-06 02:39:37,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-06 02:39:37,557 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:37,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:37,729 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 02:39:37,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:37,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 292 states and 389 transitions. [2024-12-06 02:39:37,955 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 389 transitions. [2024-12-06 02:39:37,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-12-06 02:39:37,957 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:37,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:38,087 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 02:39:38,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:38,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 295 states and 393 transitions. [2024-12-06 02:39:38,275 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 393 transitions. [2024-12-06 02:39:38,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-12-06 02:39:38,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:38,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 02:39:38,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:38,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 296 states and 395 transitions. [2024-12-06 02:39:38,454 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 395 transitions. [2024-12-06 02:39:38,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-12-06 02:39:38,455 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:38,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:38,560 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 02:39:39,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 312 states and 416 transitions. [2024-12-06 02:39:39,092 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 416 transitions. [2024-12-06 02:39:39,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-06 02:39:39,093 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:39,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:39,290 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 02:39:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 327 states and 434 transitions. [2024-12-06 02:39:39,886 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 434 transitions. [2024-12-06 02:39:39,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-06 02:39:39,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:39,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:39,992 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 02:39:40,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:40,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 338 states and 447 transitions. [2024-12-06 02:39:40,368 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 447 transitions. [2024-12-06 02:39:40,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-06 02:39:40,369 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:40,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 02:39:40,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:40,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 345 states and 456 transitions. [2024-12-06 02:39:40,577 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 456 transitions. [2024-12-06 02:39:40,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 02:39:40,578 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:40,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:40,634 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 02:39:40,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:40,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 354 states and 467 transitions. [2024-12-06 02:39:40,714 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 467 transitions. [2024-12-06 02:39:40,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 02:39:40,715 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:40,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:40,824 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 02:39:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 368 states and 481 transitions. [2024-12-06 02:39:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 481 transitions. [2024-12-06 02:39:40,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-06 02:39:40,962 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:40,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:41,012 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 02:39:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 372 states and 485 transitions. [2024-12-06 02:39:41,044 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 485 transitions. [2024-12-06 02:39:41,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-06 02:39:41,045 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:41,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 02:39:41,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 381 states and 496 transitions. [2024-12-06 02:39:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 496 transitions. [2024-12-06 02:39:41,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-06 02:39:41,303 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:41,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:41,450 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 02:39:41,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 403 states and 522 transitions. [2024-12-06 02:39:41,915 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 522 transitions. [2024-12-06 02:39:41,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-06 02:39:41,924 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:41,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 02:39:41,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:41,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 405 states and 524 transitions. [2024-12-06 02:39:41,987 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 524 transitions. [2024-12-06 02:39:41,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-06 02:39:41,988 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:41,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 02:39:42,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:42,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 406 states and 525 transitions. [2024-12-06 02:39:42,068 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 525 transitions. [2024-12-06 02:39:42,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-06 02:39:42,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:42,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:42,132 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 02:39:42,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:42,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 423 states and 543 transitions. [2024-12-06 02:39:42,280 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 543 transitions. [2024-12-06 02:39:42,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-06 02:39:42,281 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:42,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:42,401 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 02:39:42,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:42,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 426 states and 547 transitions. [2024-12-06 02:39:42,460 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 547 transitions. [2024-12-06 02:39:42,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-06 02:39:42,461 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:42,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:42,588 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 02:39:42,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 440 states and 561 transitions. [2024-12-06 02:39:42,895 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 561 transitions. [2024-12-06 02:39:42,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-06 02:39:42,896 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:42,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:42,949 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:39:43,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:43,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 463 states and 586 transitions. [2024-12-06 02:39:43,072 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 586 transitions. [2024-12-06 02:39:43,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-06 02:39:43,073 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:43,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:43,140 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 02:39:43,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:43,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 464 states and 588 transitions. [2024-12-06 02:39:43,193 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 588 transitions. [2024-12-06 02:39:43,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-06 02:39:43,193 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:43,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:43,243 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 02:39:43,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:43,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 476 states and 601 transitions. [2024-12-06 02:39:43,367 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 601 transitions. [2024-12-06 02:39:43,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-06 02:39:43,367 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:43,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:43,544 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:39:43,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:43,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 484 states and 615 transitions. [2024-12-06 02:39:43,877 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 615 transitions. [2024-12-06 02:39:43,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-06 02:39:43,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:43,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:39:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 503 states and 636 transitions. [2024-12-06 02:39:44,189 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 636 transitions. [2024-12-06 02:39:44,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-12-06 02:39:44,189 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:44,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 02:39:44,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:44,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 505 states and 638 transitions. [2024-12-06 02:39:44,401 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 638 transitions. [2024-12-06 02:39:44,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-12-06 02:39:44,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:44,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:44,453 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 02:39:44,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:44,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 519 states and 652 transitions. [2024-12-06 02:39:44,543 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 652 transitions. [2024-12-06 02:39:44,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-12-06 02:39:44,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:44,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:44,592 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:39:44,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:44,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 527 states and 663 transitions. [2024-12-06 02:39:44,646 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 663 transitions. [2024-12-06 02:39:44,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-12-06 02:39:44,647 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:44,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 02:39:44,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:44,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 528 states and 664 transitions. [2024-12-06 02:39:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 664 transitions. [2024-12-06 02:39:44,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-12-06 02:39:44,729 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:44,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 02:39:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 558 states and 696 transitions. [2024-12-06 02:39:45,073 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 696 transitions. [2024-12-06 02:39:45,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-06 02:39:45,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:45,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:45,199 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 02:39:45,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:45,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 598 states and 738 transitions. [2024-12-06 02:39:45,882 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 738 transitions. [2024-12-06 02:39:45,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-06 02:39:45,882 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:45,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 02:39:46,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:46,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 603 states and 743 transitions. [2024-12-06 02:39:46,189 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 743 transitions. [2024-12-06 02:39:46,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-06 02:39:46,190 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:46,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:46,252 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 02:39:46,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:46,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 608 states and 749 transitions. [2024-12-06 02:39:46,378 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 749 transitions. [2024-12-06 02:39:46,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-06 02:39:46,378 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:46,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 02:39:46,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:46,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 614 states and 757 transitions. [2024-12-06 02:39:46,886 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 757 transitions. [2024-12-06 02:39:46,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 02:39:46,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:46,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:47,114 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-06 02:39:48,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:48,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 754 states and 906 transitions. [2024-12-06 02:39:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 906 transitions. [2024-12-06 02:39:48,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-06 02:39:48,236 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:48,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:48,506 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:39:50,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 825 states and 992 transitions. [2024-12-06 02:39:50,157 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 992 transitions. [2024-12-06 02:39:50,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-06 02:39:50,157 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:50,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:39:50,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:50,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 854 states and 1024 transitions. [2024-12-06 02:39:50,366 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1024 transitions. [2024-12-06 02:39:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-06 02:39:50,368 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:50,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:50,423 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 02:39:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 866 states and 1037 transitions. [2024-12-06 02:39:50,489 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1037 transitions. [2024-12-06 02:39:50,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 02:39:50,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:50,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:50,718 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-06 02:39:51,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:51,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 937 states and 1108 transitions. [2024-12-06 02:39:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1108 transitions. [2024-12-06 02:39:51,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-12-06 02:39:51,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:51,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:51,930 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 102 proven. 29 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-12-06 02:39:52,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 978 states and 1151 transitions. [2024-12-06 02:39:52,393 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1151 transitions. [2024-12-06 02:39:52,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-12-06 02:39:52,393 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:52,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:52,521 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 102 proven. 29 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-12-06 02:39:52,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 985 states and 1158 transitions. [2024-12-06 02:39:52,755 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1158 transitions. [2024-12-06 02:39:52,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-12-06 02:39:52,756 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:52,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:39:53,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1034 states and 1217 transitions. [2024-12-06 02:39:53,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1217 transitions. [2024-12-06 02:39:53,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-12-06 02:39:53,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:53,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-06 02:39:54,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:54,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1067 states and 1248 transitions. [2024-12-06 02:39:54,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1248 transitions. [2024-12-06 02:39:54,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-12-06 02:39:54,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:54,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-06 02:39:54,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1076 states and 1256 transitions. [2024-12-06 02:39:54,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1256 transitions. [2024-12-06 02:39:54,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-12-06 02:39:54,968 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:54,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:55,143 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 9 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-06 02:39:55,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:55,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1079 states and 1260 transitions. [2024-12-06 02:39:55,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1260 transitions. [2024-12-06 02:39:55,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-12-06 02:39:55,356 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:55,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:39:57,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:57,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1172 states and 1375 transitions. [2024-12-06 02:39:57,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1375 transitions. [2024-12-06 02:39:57,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-12-06 02:39:57,733 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:57,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:39:58,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:58,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1174 states and 1378 transitions. [2024-12-06 02:39:58,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1378 transitions. [2024-12-06 02:39:58,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-06 02:39:58,361 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:58,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-06 02:39:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1204 states and 1412 transitions. [2024-12-06 02:39:58,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1412 transitions. [2024-12-06 02:39:58,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 02:39:58,983 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:58,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:39:59,096 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-12-06 02:39:59,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:39:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1290 states and 1500 transitions. [2024-12-06 02:39:59,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1500 transitions. [2024-12-06 02:39:59,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-12-06 02:39:59,756 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:39:59,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:39:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:40:00,091 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:40:02,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:40:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1361 states and 1588 transitions. [2024-12-06 02:40:02,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1588 transitions. [2024-12-06 02:40:02,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-12-06 02:40:02,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:40:02,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:40:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:40:02,294 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-12-06 02:40:02,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:40:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1366 states and 1592 transitions. [2024-12-06 02:40:02,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1592 transitions. [2024-12-06 02:40:02,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-12-06 02:40:02,469 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:40:02,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:40:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:40:02,592 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 02:40:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:40:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1389 states and 1618 transitions. [2024-12-06 02:40:03,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1618 transitions. [2024-12-06 02:40:03,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-12-06 02:40:03,556 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:40:03,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:40:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:40:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 02:40:04,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:40:04,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1402 states and 1628 transitions. [2024-12-06 02:40:04,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1628 transitions. [2024-12-06 02:40:04,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-12-06 02:40:04,321 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:40:04,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:40:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:40:04,443 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 02:40:04,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:40:04,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1407 states and 1632 transitions. [2024-12-06 02:40:04,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1632 transitions. [2024-12-06 02:40:04,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-06 02:40:04,664 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:40:04,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:40:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:40:05,130 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:40:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:40:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1440 states and 1670 transitions. [2024-12-06 02:40:06,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1670 transitions. [2024-12-06 02:40:06,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-06 02:40:06,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:40:06,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:40:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:40:06,788 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:40:07,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:40:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1445 states and 1676 transitions. [2024-12-06 02:40:07,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1676 transitions. [2024-12-06 02:40:07,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-12-06 02:40:07,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:40:07,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:40:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:40:07,445 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 02:40:07,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:40:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1460 states and 1695 transitions. [2024-12-06 02:40:07,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 1695 transitions. [2024-12-06 02:40:07,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-12-06 02:40:07,832 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:40:07,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:40:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:40:08,314 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 64 proven. 119 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-06 02:40:10,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:40:10,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1615 states and 1871 transitions. [2024-12-06 02:40:10,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 1871 transitions. [2024-12-06 02:40:10,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-12-06 02:40:10,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:40:10,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:40:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:40:10,865 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:40:13,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:40:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1667 states and 1934 transitions. [2024-12-06 02:40:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 1934 transitions. [2024-12-06 02:40:13,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-12-06 02:40:13,228 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:40:13,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:40:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:40:13,523 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 159 proven. 98 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 02:40:13,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:40:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1676 states and 1943 transitions. [2024-12-06 02:40:13,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 1943 transitions. [2024-12-06 02:40:13,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-06 02:40:13,710 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:40:13,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:40:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:40:14,517 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 197 proven. 67 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 02:40:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:40:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1717 states and 1996 transitions. [2024-12-06 02:40:17,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 1996 transitions. [2024-12-06 02:40:17,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-06 02:40:17,308 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:40:17,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:40:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:40:17,709 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 197 proven. 67 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 02:40:18,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:40:18,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 1735 states and 2016 transitions. [2024-12-06 02:40:18,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2016 transitions. [2024-12-06 02:40:18,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-06 02:40:18,857 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:40:18,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:40:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:40:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 197 proven. 67 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 02:40:19,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:40:19,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 1744 states and 2024 transitions. [2024-12-06 02:40:19,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2024 transitions. [2024-12-06 02:40:19,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-12-06 02:40:19,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:40:19,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:40:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 02:40:19,701 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 02:40:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 02:40:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 02:40:19,949 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 02:40:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 02:40:20,045 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 72 iterations. [2024-12-06 02:40:20,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 02:40:20 ImpRootNode [2024-12-06 02:40:20,155 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 02:40:20,155 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 02:40:20,155 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 02:40:20,156 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 02:40:20,156 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:39:33" (3/4) ... [2024-12-06 02:40:20,157 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-06 02:40:20,308 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 244. [2024-12-06 02:40:20,428 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a68912a-9b9d-46a4-a546-7077e5e191a6/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 02:40:20,428 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a68912a-9b9d-46a4-a546-7077e5e191a6/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 02:40:20,428 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 02:40:20,429 INFO L158 Benchmark]: Toolchain (without parser) took 49105.52ms. Allocated memory was 117.4MB in the beginning and 838.9MB in the end (delta: 721.4MB). Free memory was 90.6MB in the beginning and 344.4MB in the end (delta: -253.8MB). Peak memory consumption was 469.7MB. Max. memory is 16.1GB. [2024-12-06 02:40:20,429 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 117.4MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 02:40:20,430 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.73ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 63.9MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 02:40:20,430 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.37ms. Allocated memory is still 117.4MB. Free memory was 63.6MB in the beginning and 58.3MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 02:40:20,430 INFO L158 Benchmark]: Boogie Preprocessor took 46.87ms. Allocated memory is still 117.4MB. Free memory was 58.3MB in the beginning and 54.2MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 02:40:20,430 INFO L158 Benchmark]: RCFGBuilder took 1200.65ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 54.2MB in the beginning and 171.8MB in the end (delta: -117.6MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2024-12-06 02:40:20,431 INFO L158 Benchmark]: CodeCheck took 47110.30ms. Allocated memory was 218.1MB in the beginning and 838.9MB in the end (delta: 620.8MB). Free memory was 171.8MB in the beginning and 386.5MB in the end (delta: -214.6MB). Peak memory consumption was 408.2MB. Max. memory is 16.1GB. [2024-12-06 02:40:20,431 INFO L158 Benchmark]: Witness Printer took 273.17ms. Allocated memory is still 838.9MB. Free memory was 386.5MB in the beginning and 344.4MB in the end (delta: 42.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-12-06 02:40:20,433 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: 47.0s, OverallIterations: 72, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 101492 SdHoareTripleChecker+Valid, 231.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100509 mSDsluCounter, 16291 SdHoareTripleChecker+Invalid, 195.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13654 mSDsCounter, 31001 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 222360 IncrementalHoareTripleChecker+Invalid, 253361 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31001 mSolverCounterUnsat, 2637 mSDtfsCounter, 222360 mSolverCounterSat, 2.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65247 GetRequests, 62413 SyntacticMatches, 2352 SemanticMatches, 482 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179518 ImplicationChecksByTransitivity, 26.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.4s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 9897 NumberOfCodeBlocks, 9897 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 9591 ConstructedInterpolants, 0 QuantifiedInterpolants, 49361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 71 InterpolantComputations, 51 PerfectInterpolantSequences, 5290/6875 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: 432]: 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=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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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 FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=6, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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] [L288] COND TRUE (((((((!(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)) [L289] a20 = 1 [L290] a8 = 13 [L291] a16 = 4 [L292] a7 = 0 [L293] a21 = 1 [L294] a17 = 0 [L295] return -1; VAL [\result=-1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, 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 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=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L422] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L425] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L428] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, 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] [L431] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, 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] [L432] reach_error() VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, 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] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 117.4MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 414.73ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 63.9MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.37ms. Allocated memory is still 117.4MB. Free memory was 63.6MB in the beginning and 58.3MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.87ms. Allocated memory is still 117.4MB. Free memory was 58.3MB in the beginning and 54.2MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1200.65ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 54.2MB in the beginning and 171.8MB in the end (delta: -117.6MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. * CodeCheck took 47110.30ms. Allocated memory was 218.1MB in the beginning and 838.9MB in the end (delta: 620.8MB). Free memory was 171.8MB in the beginning and 386.5MB in the end (delta: -214.6MB). Peak memory consumption was 408.2MB. Max. memory is 16.1GB. * Witness Printer took 273.17ms. Allocated memory is still 838.9MB. Free memory was 386.5MB in the beginning and 344.4MB in the end (delta: 42.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-12-06 02:40:20,451 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a68912a-9b9d-46a4-a546-7077e5e191a6/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