./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_0f624463-5baf-4350-acad-53339de81147/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f624463-5baf-4350-acad-53339de81147/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f624463-5baf-4350-acad-53339de81147/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f624463-5baf-4350-acad-53339de81147/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label38.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f624463-5baf-4350-acad-53339de81147/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f624463-5baf-4350-acad-53339de81147/bin/ukojak-verify-ENZ3QT5qd3 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af706eff0638e64b28329aeb8e4500504f7e95c7ca075a2e2f010d6212db9f23 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 01:57:43,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 01:57:43,632 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f624463-5baf-4350-acad-53339de81147/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 01:57:43,637 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 01:57:43,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 01:57:43,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 01:57:43,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 01:57:43,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 01:57:43,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 01:57:43,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 01:57:43,660 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 01:57:43,660 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 01:57:43,661 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 01:57:43,661 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 01:57:43,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 01:57:43,661 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 01:57:43,661 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 01:57:43,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 01:57:43,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 01:57:43,662 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 01:57:43,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 01:57:43,662 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 01:57:43,662 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 01:57:43,662 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 01:57:43,662 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 01:57:43,662 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 01:57:43,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 01:57:43,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 01:57:43,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 01:57:43,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 01:57:43,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 01:57:43,663 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 01:57:43,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 01:57:43,664 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_0f624463-5baf-4350-acad-53339de81147/bin/ukojak-verify-ENZ3QT5qd3 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af706eff0638e64b28329aeb8e4500504f7e95c7ca075a2e2f010d6212db9f23 [2024-11-25 01:57:43,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 01:57:43,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 01:57:44,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 01:57:44,001 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 01:57:44,004 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 01:57:44,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f624463-5baf-4350-acad-53339de81147/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/eca-rers2012/Problem01_label38.c [2024-11-25 01:57:46,979 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f624463-5baf-4350-acad-53339de81147/bin/ukojak-verify-ENZ3QT5qd3/data/83e99308c/7ac74da7c6e64f9e9f228fb51df3d786/FLAG6be80c0d3 [2024-11-25 01:57:47,314 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 01:57:47,315 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f624463-5baf-4350-acad-53339de81147/sv-benchmarks/c/eca-rers2012/Problem01_label38.c [2024-11-25 01:57:47,332 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f624463-5baf-4350-acad-53339de81147/bin/ukojak-verify-ENZ3QT5qd3/data/83e99308c/7ac74da7c6e64f9e9f228fb51df3d786/FLAG6be80c0d3 [2024-11-25 01:57:47,351 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f624463-5baf-4350-acad-53339de81147/bin/ukojak-verify-ENZ3QT5qd3/data/83e99308c/7ac74da7c6e64f9e9f228fb51df3d786 [2024-11-25 01:57:47,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 01:57:47,355 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 01:57:47,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 01:57:47,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 01:57:47,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 01:57:47,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:57:47" (1/1) ... [2024-11-25 01:57:47,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7068a58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:57:47, skipping insertion in model container [2024-11-25 01:57:47,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:57:47" (1/1) ... [2024-11-25 01:57:47,409 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 01:57:47,799 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_0f624463-5baf-4350-acad-53339de81147/sv-benchmarks/c/eca-rers2012/Problem01_label38.c[15751,15764] [2024-11-25 01:57:47,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 01:57:47,874 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 01:57:47,950 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_0f624463-5baf-4350-acad-53339de81147/sv-benchmarks/c/eca-rers2012/Problem01_label38.c[15751,15764] [2024-11-25 01:57:47,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 01:57:47,995 INFO L204 MainTranslator]: Completed translation [2024-11-25 01:57:47,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:57:47 WrapperNode [2024-11-25 01:57:47,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 01:57:47,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 01:57:47,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 01:57:47,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 01:57:48,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:57:47" (1/1) ... [2024-11-25 01:57:48,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:57:47" (1/1) ... [2024-11-25 01:57:48,069 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-25 01:57:48,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 01:57:48,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 01:57:48,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 01:57:48,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 01:57:48,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:57:47" (1/1) ... [2024-11-25 01:57:48,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:57:47" (1/1) ... [2024-11-25 01:57:48,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:57:47" (1/1) ... [2024-11-25 01:57:48,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:57:47" (1/1) ... [2024-11-25 01:57:48,111 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:57:47" (1/1) ... [2024-11-25 01:57:48,113 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:57:47" (1/1) ... [2024-11-25 01:57:48,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:57:47" (1/1) ... [2024-11-25 01:57:48,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:57:47" (1/1) ... [2024-11-25 01:57:48,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:57:47" (1/1) ... [2024-11-25 01:57:48,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 01:57:48,152 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 01:57:48,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 01:57:48,154 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 01:57:48,155 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:57:47" (1/1) ... [2024-11-25 01:57:48,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 01:57:48,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f624463-5baf-4350-acad-53339de81147/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 01:57:48,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f624463-5baf-4350-acad-53339de81147/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 01:57:48,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f624463-5baf-4350-acad-53339de81147/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 01:57:48,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 01:57:48,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 01:57:48,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 01:57:48,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 01:57:48,304 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 01:57:48,306 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 01:57:49,817 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-25 01:57:49,818 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 01:57:50,178 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 01:57:50,180 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 01:57:50,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:57:50 BoogieIcfgContainer [2024-11-25 01:57:50,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 01:57:50,181 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 01:57:50,182 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 01:57:50,192 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 01:57:50,192 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:57:50" (1/1) ... [2024-11-25 01:57:50,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 01:57:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:57:50,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-25 01:57:50,271 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-25 01:57:50,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-25 01:57:50,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:57:50,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:57:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:57:50,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:57:51,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:57:51,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2024-11-25 01:57:51,748 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2024-11-25 01:57:51,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-25 01:57:51,753 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:57:51,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:57:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:57:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 01:57:52,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:57:52,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 146 states and 220 transitions. [2024-11-25 01:57:52,416 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2024-11-25 01:57:52,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-25 01:57:52,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:57:52,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:57:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:57:52,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:57:52,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:57:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 151 states and 227 transitions. [2024-11-25 01:57:52,649 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 227 transitions. [2024-11-25 01:57:52,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-25 01:57:52,653 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:57:52,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:57:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:57:52,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:57:53,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:57:53,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 221 states and 299 transitions. [2024-11-25 01:57:53,596 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 299 transitions. [2024-11-25 01:57:53,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-25 01:57:53,598 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:57:53,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:57:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:57:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:57:54,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:57:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 228 states and 308 transitions. [2024-11-25 01:57:54,044 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 308 transitions. [2024-11-25 01:57:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-25 01:57:54,045 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:57:54,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:57:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:57:54,287 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 01:57:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:57:54,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 239 states and 323 transitions. [2024-11-25 01:57:54,917 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 323 transitions. [2024-11-25 01:57:54,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-25 01:57:54,923 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:57:54,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:57:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:57:55,168 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:57:55,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:57:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 248 states and 332 transitions. [2024-11-25 01:57:55,281 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 332 transitions. [2024-11-25 01:57:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-25 01:57:55,282 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:57:55,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:57:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:57:55,456 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 01:57:55,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:57:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 256 states and 342 transitions. [2024-11-25 01:57:55,741 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 342 transitions. [2024-11-25 01:57:55,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-25 01:57:55,742 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:57:55,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:57:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:57:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 01:57:56,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:57:56,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 264 states and 355 transitions. [2024-11-25 01:57:56,242 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 355 transitions. [2024-11-25 01:57:56,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-25 01:57:56,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:57:56,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:57:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:57:56,434 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 01:57:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:57:56,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 277 states and 371 transitions. [2024-11-25 01:57:56,941 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 371 transitions. [2024-11-25 01:57:56,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-25 01:57:56,943 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:57:56,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:57:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:57:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 01:57:57,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:57:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 285 states and 380 transitions. [2024-11-25 01:57:57,342 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 380 transitions. [2024-11-25 01:57:57,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-25 01:57:57,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:57:57,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:57:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:57:57,595 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 01:57:57,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:57:57,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 292 states and 389 transitions. [2024-11-25 01:57:57,967 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 389 transitions. [2024-11-25 01:57:57,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-25 01:57:57,968 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:57:57,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:57:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:57:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 01:57:58,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:57:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 295 states and 393 transitions. [2024-11-25 01:57:58,636 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 393 transitions. [2024-11-25 01:57:58,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-25 01:57:58,638 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:57:58,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:57:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:57:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 01:57:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:57:58,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 296 states and 395 transitions. [2024-11-25 01:57:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 395 transitions. [2024-11-25 01:57:58,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-25 01:57:58,948 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:57:58,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:57:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:57:59,101 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 01:58:00,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:00,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 312 states and 416 transitions. [2024-11-25 01:58:00,032 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 416 transitions. [2024-11-25 01:58:00,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-25 01:58:00,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:00,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:00,298 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 01:58:01,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 327 states and 434 transitions. [2024-11-25 01:58:01,309 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 434 transitions. [2024-11-25 01:58:01,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-25 01:58:01,311 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:01,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:01,467 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 01:58:02,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:02,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 338 states and 447 transitions. [2024-11-25 01:58:02,208 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 447 transitions. [2024-11-25 01:58:02,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-25 01:58:02,211 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:02,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:02,292 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 01:58:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 345 states and 456 transitions. [2024-11-25 01:58:02,597 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 456 transitions. [2024-11-25 01:58:02,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-25 01:58:02,599 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:02,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:02,696 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 01:58:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:02,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 354 states and 467 transitions. [2024-11-25 01:58:02,818 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 467 transitions. [2024-11-25 01:58:02,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-25 01:58:02,820 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:02,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:03,020 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 01:58:03,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 368 states and 481 transitions. [2024-11-25 01:58:03,238 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 481 transitions. [2024-11-25 01:58:03,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-25 01:58:03,240 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:03,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 01:58:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:03,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 372 states and 485 transitions. [2024-11-25 01:58:03,388 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 485 transitions. [2024-11-25 01:58:03,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-25 01:58:03,390 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:03,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:03,547 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 01:58:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 381 states and 496 transitions. [2024-11-25 01:58:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 496 transitions. [2024-11-25 01:58:03,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-25 01:58:03,816 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:03,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:04,075 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 01:58:04,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:04,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 403 states and 522 transitions. [2024-11-25 01:58:04,922 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 522 transitions. [2024-11-25 01:58:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-25 01:58:04,924 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:04,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:05,007 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 01:58:05,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:05,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 405 states and 524 transitions. [2024-11-25 01:58:05,057 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 524 transitions. [2024-11-25 01:58:05,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-25 01:58:05,059 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:05,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:05,145 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 01:58:05,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 406 states and 525 transitions. [2024-11-25 01:58:05,196 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 525 transitions. [2024-11-25 01:58:05,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-25 01:58:05,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:05,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:05,330 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 01:58:05,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:05,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 423 states and 543 transitions. [2024-11-25 01:58:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 543 transitions. [2024-11-25 01:58:05,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-25 01:58:05,545 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:05,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:05,723 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 01:58:05,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:05,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 426 states and 547 transitions. [2024-11-25 01:58:05,806 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 547 transitions. [2024-11-25 01:58:05,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-25 01:58:05,808 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:05,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:05,985 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 01:58:06,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:06,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 440 states and 561 transitions. [2024-11-25 01:58:06,556 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 561 transitions. [2024-11-25 01:58:06,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-25 01:58:06,559 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:06,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:06,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:06,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 463 states and 586 transitions. [2024-11-25 01:58:06,929 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 586 transitions. [2024-11-25 01:58:06,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-25 01:58:06,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:06,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 01:58:07,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 464 states and 588 transitions. [2024-11-25 01:58:07,148 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 588 transitions. [2024-11-25 01:58:07,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-25 01:58:07,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:07,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 01:58:07,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:07,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 476 states and 601 transitions. [2024-11-25 01:58:07,455 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 601 transitions. [2024-11-25 01:58:07,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-25 01:58:07,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:07,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:08,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 484 states and 615 transitions. [2024-11-25 01:58:08,355 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 615 transitions. [2024-11-25 01:58:08,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-25 01:58:08,357 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:08,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:08,496 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 503 states and 636 transitions. [2024-11-25 01:58:08,722 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 636 transitions. [2024-11-25 01:58:08,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-25 01:58:08,724 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:08,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 01:58:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:09,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 505 states and 638 transitions. [2024-11-25 01:58:09,074 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 638 transitions. [2024-11-25 01:58:09,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-25 01:58:09,078 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:09,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 01:58:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:09,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 519 states and 652 transitions. [2024-11-25 01:58:09,288 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 652 transitions. [2024-11-25 01:58:09,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-25 01:58:09,290 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:09,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:09,375 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:09,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:09,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 527 states and 663 transitions. [2024-11-25 01:58:09,470 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 663 transitions. [2024-11-25 01:58:09,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-25 01:58:09,472 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:09,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:09,543 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 01:58:09,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:09,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 528 states and 664 transitions. [2024-11-25 01:58:09,585 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 664 transitions. [2024-11-25 01:58:09,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-25 01:58:09,587 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:09,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 01:58:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:10,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 558 states and 696 transitions. [2024-11-25 01:58:10,135 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 696 transitions. [2024-11-25 01:58:10,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-25 01:58:10,137 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:10,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 01:58:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:11,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 598 states and 738 transitions. [2024-11-25 01:58:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 738 transitions. [2024-11-25 01:58:11,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-25 01:58:11,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:11,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 01:58:11,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 603 states and 743 transitions. [2024-11-25 01:58:11,995 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 743 transitions. [2024-11-25 01:58:11,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-25 01:58:11,998 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:11,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:12,080 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 01:58:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:12,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 608 states and 749 transitions. [2024-11-25 01:58:12,282 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 749 transitions. [2024-11-25 01:58:12,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-25 01:58:12,285 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:12,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 01:58:13,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:13,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 614 states and 757 transitions. [2024-11-25 01:58:13,087 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 757 transitions. [2024-11-25 01:58:13,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-25 01:58:13,089 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:13,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:13,505 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:15,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:15,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 754 states and 906 transitions. [2024-11-25 01:58:15,145 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 906 transitions. [2024-11-25 01:58:15,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-25 01:58:15,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:15,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:15,612 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:17,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:18,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 825 states and 992 transitions. [2024-11-25 01:58:18,001 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 992 transitions. [2024-11-25 01:58:18,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-25 01:58:18,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:18,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:18,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 854 states and 1024 transitions. [2024-11-25 01:58:18,345 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1024 transitions. [2024-11-25 01:58:18,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-25 01:58:18,346 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:18,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:18,452 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 01:58:18,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:18,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 866 states and 1037 transitions. [2024-11-25 01:58:18,713 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1037 transitions. [2024-11-25 01:58:18,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-25 01:58:18,715 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:18,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:19,141 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:20,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:20,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 937 states and 1108 transitions. [2024-11-25 01:58:20,772 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1108 transitions. [2024-11-25 01:58:20,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-25 01:58:20,774 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:20,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:21,074 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 102 proven. 29 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-25 01:58:21,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:21,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 978 states and 1151 transitions. [2024-11-25 01:58:21,752 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1151 transitions. [2024-11-25 01:58:21,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-25 01:58:21,753 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:21,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-25 01:58:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1009 states and 1181 transitions. [2024-11-25 01:58:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1181 transitions. [2024-11-25 01:58:22,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-25 01:58:22,708 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:22,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:22,975 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:24,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:24,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1058 states and 1236 transitions. [2024-11-25 01:58:24,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1236 transitions. [2024-11-25 01:58:24,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-25 01:58:24,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:24,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 9 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-25 01:58:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:24,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1061 states and 1240 transitions. [2024-11-25 01:58:24,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1240 transitions. [2024-11-25 01:58:24,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-25 01:58:24,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:24,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:25,485 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:28,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:28,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1154 states and 1355 transitions. [2024-11-25 01:58:28,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1355 transitions. [2024-11-25 01:58:28,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-25 01:58:28,248 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:28,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:28,640 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:29,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:29,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1156 states and 1358 transitions. [2024-11-25 01:58:29,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1358 transitions. [2024-11-25 01:58:29,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-25 01:58:29,112 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:29,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-25 01:58:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1179 states and 1384 transitions. [2024-11-25 01:58:29,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1384 transitions. [2024-11-25 01:58:29,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-25 01:58:29,977 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:29,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-25 01:58:31,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1265 states and 1472 transitions. [2024-11-25 01:58:31,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1472 transitions. [2024-11-25 01:58:31,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-25 01:58:31,088 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:31,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1311 states and 1533 transitions. [2024-11-25 01:58:33,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1533 transitions. [2024-11-25 01:58:33,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-25 01:58:33,733 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:33,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:34,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:34,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1336 states and 1560 transitions. [2024-11-25 01:58:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1560 transitions. [2024-11-25 01:58:34,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-25 01:58:34,605 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:34,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:34,788 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-25 01:58:35,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:35,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1345 states and 1568 transitions. [2024-11-25 01:58:35,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1568 transitions. [2024-11-25 01:58:35,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-25 01:58:35,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:35,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:35,708 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 114 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 01:58:38,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:38,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1405 states and 1652 transitions. [2024-11-25 01:58:38,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1652 transitions. [2024-11-25 01:58:38,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-25 01:58:38,498 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:38,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:38,634 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 01:58:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:41,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1432 states and 1681 transitions. [2024-11-25 01:58:41,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1681 transitions. [2024-11-25 01:58:41,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-25 01:58:41,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:41,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:41,714 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 114 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 01:58:42,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:42,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1439 states and 1688 transitions. [2024-11-25 01:58:42,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1688 transitions. [2024-11-25 01:58:42,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-25 01:58:42,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:42,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:42,424 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 01:58:42,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:42,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1450 states and 1700 transitions. [2024-11-25 01:58:42,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 1700 transitions. [2024-11-25 01:58:42,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-25 01:58:42,987 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:42,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:43,098 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 01:58:43,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:43,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1455 states and 1704 transitions. [2024-11-25 01:58:43,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 1704 transitions. [2024-11-25 01:58:43,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-25 01:58:43,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:43,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:44,220 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:46,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1488 states and 1742 transitions. [2024-11-25 01:58:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1742 transitions. [2024-11-25 01:58:46,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-25 01:58:46,324 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:46,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:46,671 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:47,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:47,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1493 states and 1748 transitions. [2024-11-25 01:58:47,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1748 transitions. [2024-11-25 01:58:47,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-25 01:58:47,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:47,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:47,782 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 64 proven. 119 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-25 01:58:50,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:50,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1648 states and 1919 transitions. [2024-11-25 01:58:50,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 1919 transitions. [2024-11-25 01:58:50,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-25 01:58:50,608 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:50,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 01:58:54,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:54,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 1719 states and 2003 transitions. [2024-11-25 01:58:54,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2003 transitions. [2024-11-25 01:58:54,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 01:58:54,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:54,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:54,778 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 188 proven. 57 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-25 01:58:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 1724 states and 2011 transitions. [2024-11-25 01:58:55,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2011 transitions. [2024-11-25 01:58:55,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-25 01:58:55,779 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:55,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 146 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-25 01:58:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:58:57,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 1758 states and 2052 transitions. [2024-11-25 01:58:57,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 2052 transitions. [2024-11-25 01:58:57,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-25 01:58:57,360 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:58:57,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:58:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:58:58,293 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 187 proven. 122 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 01:59:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 1804 states and 2105 transitions. [2024-11-25 01:59:02,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2105 transitions. [2024-11-25 01:59:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-25 01:59:02,639 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:02,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 01:59:03,115 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 187 proven. 122 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 01:59:04,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 01:59:04,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2118 states to 1817 states and 2118 transitions. [2024-11-25 01:59:04,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2118 transitions. [2024-11-25 01:59:04,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-25 01:59:04,131 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 01:59:04,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 01:59:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 01:59:04,181 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 01:59:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 01:59:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 01:59:04,496 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 01:59:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 01:59:04,713 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 72 iterations. [2024-11-25 01:59:04,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 01:59:04 ImpRootNode [2024-11-25 01:59:04,891 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 01:59:04,891 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 01:59:04,891 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 01:59:04,893 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 01:59:04,893 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:57:50" (3/4) ... [2024-11-25 01:59:04,894 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-25 01:59:05,144 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 244. [2024-11-25 01:59:05,335 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f624463-5baf-4350-acad-53339de81147/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 01:59:05,336 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f624463-5baf-4350-acad-53339de81147/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 01:59:05,336 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 01:59:05,337 INFO L158 Benchmark]: Toolchain (without parser) took 77982.15ms. Allocated memory was 117.4MB in the beginning and 1.0GB in the end (delta: 889.2MB). Free memory was 90.9MB in the beginning and 509.2MB in the end (delta: -418.4MB). Peak memory consumption was 472.3MB. Max. memory is 16.1GB. [2024-11-25 01:59:05,337 INFO L158 Benchmark]: CDTParser took 1.58ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 01:59:05,338 INFO L158 Benchmark]: CACSL2BoogieTranslator took 639.21ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 64.0MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-25 01:59:05,338 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.14ms. Allocated memory is still 117.4MB. Free memory was 64.0MB in the beginning and 58.4MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 01:59:05,338 INFO L158 Benchmark]: Boogie Preprocessor took 82.14ms. Allocated memory is still 117.4MB. Free memory was 58.4MB in the beginning and 54.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 01:59:05,339 INFO L158 Benchmark]: RCFGBuilder took 2028.25ms. Allocated memory is still 117.4MB. Free memory was 54.3MB in the beginning and 67.6MB in the end (delta: -13.3MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2024-11-25 01:59:05,339 INFO L158 Benchmark]: CodeCheck took 74709.41ms. Allocated memory was 117.4MB in the beginning and 1.0GB in the end (delta: 889.2MB). Free memory was 67.6MB in the beginning and 551.3MB in the end (delta: -483.7MB). Peak memory consumption was 402.1MB. Max. memory is 16.1GB. [2024-11-25 01:59:05,339 INFO L158 Benchmark]: Witness Printer took 444.99ms. Allocated memory is still 1.0GB. Free memory was 551.3MB in the beginning and 509.2MB in the end (delta: 42.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-25 01:59:05,341 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: 74.5s, OverallIterations: 72, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 103634 SdHoareTripleChecker+Valid, 363.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102651 mSDsluCounter, 16519 SdHoareTripleChecker+Invalid, 306.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13850 mSDsCounter, 31254 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 227269 IncrementalHoareTripleChecker+Invalid, 258523 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31254 mSolverCounterUnsat, 2669 mSDtfsCounter, 227269 mSolverCounterSat, 4.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65612 GetRequests, 62900 SyntacticMatches, 2202 SemanticMatches, 510 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200525 ImplicationChecksByTransitivity, 42.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.5s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 9906 NumberOfCodeBlocks, 9906 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 9600 ConstructedInterpolants, 0 QuantifiedInterpolants, 48886 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 71 InterpolantComputations, 50 PerfectInterpolantSequences, 5317/7072 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 1.58ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 639.21ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 64.0MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.14ms. Allocated memory is still 117.4MB. Free memory was 64.0MB in the beginning and 58.4MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.14ms. Allocated memory is still 117.4MB. Free memory was 58.4MB in the beginning and 54.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2028.25ms. Allocated memory is still 117.4MB. Free memory was 54.3MB in the beginning and 67.6MB in the end (delta: -13.3MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. * CodeCheck took 74709.41ms. Allocated memory was 117.4MB in the beginning and 1.0GB in the end (delta: 889.2MB). Free memory was 67.6MB in the beginning and 551.3MB in the end (delta: -483.7MB). Peak memory consumption was 402.1MB. Max. memory is 16.1GB. * Witness Printer took 444.99ms. Allocated memory is still 1.0GB. Free memory was 551.3MB in the beginning and 509.2MB 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-11-25 01:59:05,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f624463-5baf-4350-acad-53339de81147/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE