./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label56.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_7351e844-cce0-41f6-b8d6-3ef277aed90d/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7351e844-cce0-41f6-b8d6-3ef277aed90d/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_7351e844-cce0-41f6-b8d6-3ef277aed90d/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7351e844-cce0-41f6-b8d6-3ef277aed90d/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label56.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7351e844-cce0-41f6-b8d6-3ef277aed90d/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_7351e844-cce0-41f6-b8d6-3ef277aed90d/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 7b93c3f7fecac47558d01f2a0c93696ea48f2ebbd5c30f43df88a8759c531651 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 02:24:29,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 02:24:29,965 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7351e844-cce0-41f6-b8d6-3ef277aed90d/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 02:24:29,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 02:24:29,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 02:24:29,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 02:24:29,994 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 02:24:29,994 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 02:24:29,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 02:24:29,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 02:24:29,994 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 02:24:29,994 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 02:24:29,995 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 02:24:29,995 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 02:24:29,995 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 02:24:29,995 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 02:24:29,995 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 02:24:29,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 02:24:29,995 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 02:24:29,995 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 02:24:29,995 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 02:24:29,995 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 02:24:29,996 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 02:24:29,996 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 02:24:29,996 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 02:24:29,996 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 02:24:29,996 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 02:24:29,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 02:24:29,996 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 02:24:29,996 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 02:24:29,996 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 02:24:29,997 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 02:24:29,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 02:24:29,997 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_7351e844-cce0-41f6-b8d6-3ef277aed90d/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 -> 7b93c3f7fecac47558d01f2a0c93696ea48f2ebbd5c30f43df88a8759c531651 [2024-11-25 02:24:30,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 02:24:30,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 02:24:30,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 02:24:30,360 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 02:24:30,363 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 02:24:30,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7351e844-cce0-41f6-b8d6-3ef277aed90d/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/eca-rers2012/Problem01_label56.c [2024-11-25 02:24:34,268 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7351e844-cce0-41f6-b8d6-3ef277aed90d/bin/ukojak-verify-ENZ3QT5qd3/data/04ad51a53/eed50ac10350490ab28b70ba9f533203/FLAG3bf380780 [2024-11-25 02:24:34,855 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 02:24:34,855 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7351e844-cce0-41f6-b8d6-3ef277aed90d/sv-benchmarks/c/eca-rers2012/Problem01_label56.c [2024-11-25 02:24:34,884 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7351e844-cce0-41f6-b8d6-3ef277aed90d/bin/ukojak-verify-ENZ3QT5qd3/data/04ad51a53/eed50ac10350490ab28b70ba9f533203/FLAG3bf380780 [2024-11-25 02:24:34,915 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7351e844-cce0-41f6-b8d6-3ef277aed90d/bin/ukojak-verify-ENZ3QT5qd3/data/04ad51a53/eed50ac10350490ab28b70ba9f533203 [2024-11-25 02:24:34,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 02:24:34,921 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 02:24:34,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 02:24:34,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 02:24:34,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 02:24:34,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 02:24:34" (1/1) ... [2024-11-25 02:24:34,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7137a030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:24:34, skipping insertion in model container [2024-11-25 02:24:34,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 02:24:34" (1/1) ... [2024-11-25 02:24:34,994 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 02:24:35,412 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_7351e844-cce0-41f6-b8d6-3ef277aed90d/sv-benchmarks/c/eca-rers2012/Problem01_label56.c[15002,15015] [2024-11-25 02:24:35,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 02:24:35,487 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 02:24:35,602 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_7351e844-cce0-41f6-b8d6-3ef277aed90d/sv-benchmarks/c/eca-rers2012/Problem01_label56.c[15002,15015] [2024-11-25 02:24:35,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 02:24:35,662 INFO L204 MainTranslator]: Completed translation [2024-11-25 02:24:35,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:24:35 WrapperNode [2024-11-25 02:24:35,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 02:24:35,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 02:24:35,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 02:24:35,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 02:24:35,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:24:35" (1/1) ... [2024-11-25 02:24:35,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:24:35" (1/1) ... [2024-11-25 02:24:35,758 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-25 02:24:35,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 02:24:35,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 02:24:35,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 02:24:35,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 02:24:35,769 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:24:35" (1/1) ... [2024-11-25 02:24:35,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:24:35" (1/1) ... [2024-11-25 02:24:35,779 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:24:35" (1/1) ... [2024-11-25 02:24:35,779 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:24:35" (1/1) ... [2024-11-25 02:24:35,821 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:24:35" (1/1) ... [2024-11-25 02:24:35,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:24:35" (1/1) ... [2024-11-25 02:24:35,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:24:35" (1/1) ... [2024-11-25 02:24:35,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:24:35" (1/1) ... [2024-11-25 02:24:35,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:24:35" (1/1) ... [2024-11-25 02:24:35,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 02:24:35,878 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 02:24:35,878 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 02:24:35,878 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 02:24:35,887 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:24:35" (1/1) ... [2024-11-25 02:24:35,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 02:24:35,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7351e844-cce0-41f6-b8d6-3ef277aed90d/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 02:24:35,955 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7351e844-cce0-41f6-b8d6-3ef277aed90d/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 02:24:35,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7351e844-cce0-41f6-b8d6-3ef277aed90d/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 02:24:35,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 02:24:35,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 02:24:35,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 02:24:35,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 02:24:36,110 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 02:24:36,114 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 02:24:37,697 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-25 02:24:37,697 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 02:24:38,168 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 02:24:38,169 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 02:24:38,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:24:38 BoogieIcfgContainer [2024-11-25 02:24:38,172 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 02:24:38,173 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 02:24:38,173 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 02:24:38,191 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 02:24:38,191 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:24:38" (1/1) ... [2024-11-25 02:24:38,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 02:24:38,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:38,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-25 02:24:38,285 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-25 02:24:38,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-25 02:24:38,291 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:38,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:39,054 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 02:24:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2024-11-25 02:24:39,966 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2024-11-25 02:24:39,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-25 02:24:39,969 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:39,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:40,215 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 02:24:40,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2024-11-25 02:24:40,476 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2024-11-25 02:24:40,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-25 02:24:40,478 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:40,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:40,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:24:40,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:40,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 150 states and 244 transitions. [2024-11-25 02:24:40,794 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 244 transitions. [2024-11-25 02:24:40,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-25 02:24:40,797 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:40,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:40,967 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 02:24:41,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:41,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2024-11-25 02:24:41,168 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2024-11-25 02:24:41,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-25 02:24:41,170 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:41,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:41,413 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:24:41,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:41,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 159 states and 258 transitions. [2024-11-25 02:24:41,631 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 258 transitions. [2024-11-25 02:24:41,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-25 02:24:41,634 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:41,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:41,784 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:24:41,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:41,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 160 states and 259 transitions. [2024-11-25 02:24:41,943 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 259 transitions. [2024-11-25 02:24:41,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-25 02:24:41,946 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:41,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:42,133 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 02:24:42,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:42,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 168 states and 268 transitions. [2024-11-25 02:24:42,301 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 268 transitions. [2024-11-25 02:24:42,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-25 02:24:42,301 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:42,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:42,564 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:24:42,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:42,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 182 states and 286 transitions. [2024-11-25 02:24:42,927 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 286 transitions. [2024-11-25 02:24:42,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-25 02:24:42,928 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:42,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:43,106 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:24:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 197 states and 306 transitions. [2024-11-25 02:24:43,630 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 306 transitions. [2024-11-25 02:24:43,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-25 02:24:43,630 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:43,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:24:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 212 states and 327 transitions. [2024-11-25 02:24:44,616 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 327 transitions. [2024-11-25 02:24:44,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-25 02:24:44,618 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:44,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:24:45,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:45,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 230 states and 356 transitions. [2024-11-25 02:24:45,654 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2024-11-25 02:24:45,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-25 02:24:45,655 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:45,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:45,830 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:24:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 232 states and 359 transitions. [2024-11-25 02:24:46,068 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2024-11-25 02:24:46,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-25 02:24:46,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:46,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:46,169 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:24:46,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:46,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 237 states and 365 transitions. [2024-11-25 02:24:46,309 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 365 transitions. [2024-11-25 02:24:46,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-25 02:24:46,310 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:46,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 02:24:46,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 238 states and 366 transitions. [2024-11-25 02:24:46,633 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 366 transitions. [2024-11-25 02:24:46,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-25 02:24:46,634 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:46,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:46,767 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:24:47,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:47,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 257 states and 395 transitions. [2024-11-25 02:24:47,942 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 395 transitions. [2024-11-25 02:24:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-25 02:24:47,944 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:47,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:48,041 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:24:48,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:48,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 258 states and 396 transitions. [2024-11-25 02:24:48,291 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 396 transitions. [2024-11-25 02:24:48,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-25 02:24:48,293 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:48,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:24:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:49,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 273 states and 415 transitions. [2024-11-25 02:24:49,136 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 415 transitions. [2024-11-25 02:24:49,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-25 02:24:49,138 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:49,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:49,338 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 02:24:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 291 states and 435 transitions. [2024-11-25 02:24:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 435 transitions. [2024-11-25 02:24:50,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-25 02:24:50,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:50,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:24:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 295 states and 439 transitions. [2024-11-25 02:24:50,644 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 439 transitions. [2024-11-25 02:24:50,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-25 02:24:50,646 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:50,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:50,795 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 02:24:51,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:51,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 299 states and 444 transitions. [2024-11-25 02:24:51,306 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 444 transitions. [2024-11-25 02:24:51,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-25 02:24:51,308 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:51,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:51,383 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 02:24:52,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:52,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 307 states and 459 transitions. [2024-11-25 02:24:52,095 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 459 transitions. [2024-11-25 02:24:52,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-25 02:24:52,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:52,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:52,192 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 02:24:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 313 states and 467 transitions. [2024-11-25 02:24:52,798 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 467 transitions. [2024-11-25 02:24:52,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-25 02:24:52,799 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:52,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:52,875 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 02:24:53,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 316 states and 471 transitions. [2024-11-25 02:24:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 471 transitions. [2024-11-25 02:24:53,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-25 02:24:53,181 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:53,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:24:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:53,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 331 states and 491 transitions. [2024-11-25 02:24:53,985 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 491 transitions. [2024-11-25 02:24:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-25 02:24:53,987 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:53,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:54,142 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:24:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 345 states and 508 transitions. [2024-11-25 02:24:54,605 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 508 transitions. [2024-11-25 02:24:54,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-25 02:24:54,607 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:54,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:24:55,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:55,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 347 states and 510 transitions. [2024-11-25 02:24:55,195 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 510 transitions. [2024-11-25 02:24:55,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-25 02:24:55,197 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:55,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:55,280 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 02:24:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 353 states and 516 transitions. [2024-11-25 02:24:55,736 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 516 transitions. [2024-11-25 02:24:55,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-25 02:24:55,738 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:55,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:55,819 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 02:24:55,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 357 states and 519 transitions. [2024-11-25 02:24:55,882 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 519 transitions. [2024-11-25 02:24:55,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-25 02:24:55,884 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:55,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:56,034 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:24:56,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:56,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 359 states and 522 transitions. [2024-11-25 02:24:56,144 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 522 transitions. [2024-11-25 02:24:56,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-25 02:24:56,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:56,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:24:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:56,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 373 states and 540 transitions. [2024-11-25 02:24:56,965 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 540 transitions. [2024-11-25 02:24:56,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-25 02:24:56,967 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:56,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:57,107 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:24:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 377 states and 545 transitions. [2024-11-25 02:24:57,472 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 545 transitions. [2024-11-25 02:24:57,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-25 02:24:57,478 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:57,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:57,651 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 02:24:57,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:57,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 379 states and 548 transitions. [2024-11-25 02:24:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 548 transitions. [2024-11-25 02:24:57,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-25 02:24:57,882 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:57,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:58,197 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:24:58,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:58,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 386 states and 555 transitions. [2024-11-25 02:24:58,654 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 555 transitions. [2024-11-25 02:24:58,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-25 02:24:58,655 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:58,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:58,790 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 02:24:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 395 states and 564 transitions. [2024-11-25 02:24:59,206 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 564 transitions. [2024-11-25 02:24:59,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-25 02:24:59,207 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:59,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:59,358 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 02:24:59,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:24:59,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 399 states and 567 transitions. [2024-11-25 02:24:59,654 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 567 transitions. [2024-11-25 02:24:59,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-25 02:24:59,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:24:59,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:24:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:24:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 02:25:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 402 states and 569 transitions. [2024-11-25 02:25:00,032 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 569 transitions. [2024-11-25 02:25:00,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-25 02:25:00,033 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:00,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:00,131 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-25 02:25:00,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:00,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 484 states and 656 transitions. [2024-11-25 02:25:00,853 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 656 transitions. [2024-11-25 02:25:00,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-25 02:25:00,854 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:00,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:25:00,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:00,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 486 states and 658 transitions. [2024-11-25 02:25:00,984 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 658 transitions. [2024-11-25 02:25:00,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-25 02:25:00,985 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:00,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:25:01,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:01,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 497 states and 672 transitions. [2024-11-25 02:25:01,280 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 672 transitions. [2024-11-25 02:25:01,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-25 02:25:01,282 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:01,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:01,389 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:25:01,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:01,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 504 states and 680 transitions. [2024-11-25 02:25:01,451 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 680 transitions. [2024-11-25 02:25:01,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-25 02:25:01,452 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:01,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:01,516 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 02:25:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:01,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 506 states and 682 transitions. [2024-11-25 02:25:01,556 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 682 transitions. [2024-11-25 02:25:01,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-25 02:25:01,557 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:01,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:01,624 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 02:25:01,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:01,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 513 states and 689 transitions. [2024-11-25 02:25:01,789 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 689 transitions. [2024-11-25 02:25:01,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-25 02:25:01,790 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:01,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:01,871 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 02:25:02,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:02,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 551 states and 733 transitions. [2024-11-25 02:25:02,758 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 733 transitions. [2024-11-25 02:25:02,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-25 02:25:02,759 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:02,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:02,846 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 02:25:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:03,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 554 states and 735 transitions. [2024-11-25 02:25:03,086 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 735 transitions. [2024-11-25 02:25:03,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-25 02:25:03,087 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:03,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:03,165 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 02:25:03,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 557 states and 737 transitions. [2024-11-25 02:25:03,468 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 737 transitions. [2024-11-25 02:25:03,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-25 02:25:03,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:03,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:03,533 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 02:25:03,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:03,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 566 states and 745 transitions. [2024-11-25 02:25:03,608 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 745 transitions. [2024-11-25 02:25:03,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-25 02:25:03,609 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:03,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:03,714 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 02:25:03,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:03,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 574 states and 753 transitions. [2024-11-25 02:25:03,892 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 753 transitions. [2024-11-25 02:25:03,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-25 02:25:03,894 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:03,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:04,389 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:25:05,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 605 states and 788 transitions. [2024-11-25 02:25:05,495 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 788 transitions. [2024-11-25 02:25:05,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-25 02:25:05,496 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:05,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:05,623 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-25 02:25:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:06,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 636 states and 825 transitions. [2024-11-25 02:25:06,746 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 825 transitions. [2024-11-25 02:25:06,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-25 02:25:06,750 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:06,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:06,835 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 02:25:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 645 states and 835 transitions. [2024-11-25 02:25:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 835 transitions. [2024-11-25 02:25:06,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-25 02:25:06,937 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:06,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:07,340 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 02:25:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 695 states and 893 transitions. [2024-11-25 02:25:09,109 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 893 transitions. [2024-11-25 02:25:09,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-25 02:25:09,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:09,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:09,365 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 66 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-25 02:25:09,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:09,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 698 states and 896 transitions. [2024-11-25 02:25:09,737 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 896 transitions. [2024-11-25 02:25:09,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-25 02:25:09,738 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:09,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:25:10,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:10,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 725 states and 926 transitions. [2024-11-25 02:25:10,173 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 926 transitions. [2024-11-25 02:25:10,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-25 02:25:10,175 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:10,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:10,397 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-25 02:25:11,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 744 states and 949 transitions. [2024-11-25 02:25:11,911 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 949 transitions. [2024-11-25 02:25:11,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-25 02:25:11,913 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:11,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:12,113 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:25:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:12,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 761 states and 966 transitions. [2024-11-25 02:25:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 966 transitions. [2024-11-25 02:25:12,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-25 02:25:12,296 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:12,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:12,463 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:25:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:12,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 784 states and 990 transitions. [2024-11-25 02:25:12,911 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 990 transitions. [2024-11-25 02:25:12,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-25 02:25:12,912 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:12,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:13,614 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 69 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:25:17,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 853 states and 1086 transitions. [2024-11-25 02:25:17,130 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1086 transitions. [2024-11-25 02:25:17,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-25 02:25:17,132 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:17,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:17,370 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 69 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:25:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 884 states and 1124 transitions. [2024-11-25 02:25:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1124 transitions. [2024-11-25 02:25:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-25 02:25:19,277 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:19,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:19,478 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 69 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:25:20,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:20,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 891 states and 1133 transitions. [2024-11-25 02:25:20,514 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1133 transitions. [2024-11-25 02:25:20,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-25 02:25:20,515 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:20,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 02:25:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 892 states and 1133 transitions. [2024-11-25 02:25:20,666 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1133 transitions. [2024-11-25 02:25:20,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-25 02:25:20,667 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:20,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:20,937 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:25:22,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:22,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 915 states and 1157 transitions. [2024-11-25 02:25:22,095 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1157 transitions. [2024-11-25 02:25:22,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-25 02:25:22,096 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:22,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:25:23,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 942 states and 1188 transitions. [2024-11-25 02:25:23,141 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1188 transitions. [2024-11-25 02:25:23,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-25 02:25:23,143 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:23,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:23,385 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:25:26,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:26,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1008 states and 1260 transitions. [2024-11-25 02:25:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1260 transitions. [2024-11-25 02:25:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-25 02:25:26,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:26,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:26,330 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 02:25:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1019 states and 1271 transitions. [2024-11-25 02:25:26,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1271 transitions. [2024-11-25 02:25:26,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-25 02:25:26,606 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:26,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 80 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 02:25:28,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1036 states and 1290 transitions. [2024-11-25 02:25:28,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1290 transitions. [2024-11-25 02:25:28,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-25 02:25:28,018 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:28,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:28,326 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:25:28,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:28,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1053 states and 1307 transitions. [2024-11-25 02:25:28,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1307 transitions. [2024-11-25 02:25:28,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-25 02:25:28,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:28,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:28,956 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-25 02:25:29,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:29,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1054 states and 1308 transitions. [2024-11-25 02:25:29,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1308 transitions. [2024-11-25 02:25:29,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-25 02:25:29,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:29,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:29,734 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:25:33,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:33,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1137 states and 1404 transitions. [2024-11-25 02:25:33,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1404 transitions. [2024-11-25 02:25:33,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-25 02:25:33,698 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:33,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 02:25:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1173 states and 1445 transitions. [2024-11-25 02:25:36,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1445 transitions. [2024-11-25 02:25:36,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-25 02:25:36,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:36,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:36,072 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 02:25:37,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:37,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1204 states and 1480 transitions. [2024-11-25 02:25:37,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1480 transitions. [2024-11-25 02:25:37,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-25 02:25:37,803 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:37,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:37,884 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 02:25:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1211 states and 1487 transitions. [2024-11-25 02:25:38,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1487 transitions. [2024-11-25 02:25:38,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-25 02:25:38,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:38,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:38,398 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 02:25:39,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1260 states and 1538 transitions. [2024-11-25 02:25:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1538 transitions. [2024-11-25 02:25:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-25 02:25:39,099 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:39,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:39,294 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 02:25:41,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:41,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1295 states and 1581 transitions. [2024-11-25 02:25:41,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1581 transitions. [2024-11-25 02:25:41,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-25 02:25:41,636 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:41,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 02:25:42,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:42,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1309 states and 1597 transitions. [2024-11-25 02:25:42,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1597 transitions. [2024-11-25 02:25:42,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-25 02:25:42,711 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:42,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 02:25:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1314 states and 1602 transitions. [2024-11-25 02:25:43,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1602 transitions. [2024-11-25 02:25:43,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-25 02:25:43,172 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:43,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:43,252 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 02:25:44,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:44,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1336 states and 1630 transitions. [2024-11-25 02:25:44,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1630 transitions. [2024-11-25 02:25:44,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-25 02:25:44,437 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:44,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:45,027 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 02:25:47,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:47,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1407 states and 1703 transitions. [2024-11-25 02:25:47,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1703 transitions. [2024-11-25 02:25:47,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-25 02:25:47,792 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:47,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:48,056 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 02:25:48,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:48,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1422 states and 1718 transitions. [2024-11-25 02:25:48,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1718 transitions. [2024-11-25 02:25:48,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-25 02:25:48,804 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:48,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:49,025 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 02:25:49,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:49,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1427 states and 1722 transitions. [2024-11-25 02:25:49,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1722 transitions. [2024-11-25 02:25:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-25 02:25:49,489 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:49,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-25 02:25:49,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:49,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1432 states and 1728 transitions. [2024-11-25 02:25:49,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1728 transitions. [2024-11-25 02:25:49,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-25 02:25:49,703 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:49,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-25 02:25:50,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:50,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1435 states and 1732 transitions. [2024-11-25 02:25:50,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1732 transitions. [2024-11-25 02:25:50,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-25 02:25:50,485 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:50,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:50,563 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-25 02:25:51,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1439 states and 1736 transitions. [2024-11-25 02:25:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1736 transitions. [2024-11-25 02:25:51,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-25 02:25:51,065 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:51,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-25 02:25:51,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1444 states and 1741 transitions. [2024-11-25 02:25:51,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1741 transitions. [2024-11-25 02:25:51,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-25 02:25:51,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:51,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:51,614 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 02:25:51,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1445 states and 1742 transitions. [2024-11-25 02:25:51,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1742 transitions. [2024-11-25 02:25:51,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-25 02:25:51,962 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:51,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-25 02:25:53,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:53,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1474 states and 1771 transitions. [2024-11-25 02:25:53,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 1771 transitions. [2024-11-25 02:25:53,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-25 02:25:53,792 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:53,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:53,949 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 02:25:56,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:56,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1501 states and 1801 transitions. [2024-11-25 02:25:56,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1801 transitions. [2024-11-25 02:25:56,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-25 02:25:56,029 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:56,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:56,118 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 02:25:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:25:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1513 states and 1812 transitions. [2024-11-25 02:25:56,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1812 transitions. [2024-11-25 02:25:56,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-25 02:25:56,776 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:25:56,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:25:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:25:57,923 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 02:26:02,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1604 states and 1924 transitions. [2024-11-25 02:26:02,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 1924 transitions. [2024-11-25 02:26:02,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-25 02:26:02,485 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:02,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:02,751 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 02:26:03,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1606 states and 1925 transitions. [2024-11-25 02:26:03,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1925 transitions. [2024-11-25 02:26:03,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-25 02:26:03,283 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:03,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:26:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:09,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1656 states and 1993 transitions. [2024-11-25 02:26:09,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 1993 transitions. [2024-11-25 02:26:09,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-25 02:26:09,389 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:09,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:26:10,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:10,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1659 states and 1997 transitions. [2024-11-25 02:26:10,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 1997 transitions. [2024-11-25 02:26:10,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-25 02:26:10,174 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:10,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:10,427 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 02:26:11,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1662 states and 1998 transitions. [2024-11-25 02:26:11,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 1998 transitions. [2024-11-25 02:26:11,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-25 02:26:11,123 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:11,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:11,198 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-25 02:26:11,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:11,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 1732 states and 2070 transitions. [2024-11-25 02:26:11,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2070 transitions. [2024-11-25 02:26:11,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-25 02:26:11,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:11,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:26:13,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:13,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 1737 states and 2082 transitions. [2024-11-25 02:26:13,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2082 transitions. [2024-11-25 02:26:13,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-25 02:26:13,526 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:13,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:13,789 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:26:14,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 1738 states and 2082 transitions. [2024-11-25 02:26:14,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2082 transitions. [2024-11-25 02:26:14,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-25 02:26:14,461 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:14,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:14,872 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:26:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 1739 states and 2082 transitions. [2024-11-25 02:26:15,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2082 transitions. [2024-11-25 02:26:15,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-25 02:26:15,746 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:15,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 02:26:16,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:16,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2135 states to 1786 states and 2135 transitions. [2024-11-25 02:26:16,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2135 transitions. [2024-11-25 02:26:16,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-25 02:26:16,610 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:16,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:17,400 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:26:19,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:19,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 1855 states and 2220 transitions. [2024-11-25 02:26:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 2220 transitions. [2024-11-25 02:26:19,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-25 02:26:19,383 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:19,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:20,132 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 02:26:22,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:22,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 1874 states and 2244 transitions. [2024-11-25 02:26:22,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2244 transitions. [2024-11-25 02:26:22,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-25 02:26:22,070 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:22,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:22,179 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-25 02:26:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:22,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 1877 states and 2246 transitions. [2024-11-25 02:26:22,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2246 transitions. [2024-11-25 02:26:22,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-25 02:26:22,491 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:22,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:22,566 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-25 02:26:22,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:22,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 1879 states and 2247 transitions. [2024-11-25 02:26:22,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2247 transitions. [2024-11-25 02:26:22,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-25 02:26:22,621 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:22,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-25 02:26:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:24,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 1892 states and 2260 transitions. [2024-11-25 02:26:24,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2260 transitions. [2024-11-25 02:26:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-25 02:26:24,086 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:24,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:24,184 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-25 02:26:24,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 1895 states and 2262 transitions. [2024-11-25 02:26:24,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2262 transitions. [2024-11-25 02:26:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-25 02:26:24,853 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:24,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:24,930 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-25 02:26:25,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 1898 states and 2265 transitions. [2024-11-25 02:26:25,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2265 transitions. [2024-11-25 02:26:25,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 02:26:25,936 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:25,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:26:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:28,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 1919 states and 2287 transitions. [2024-11-25 02:26:28,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 2287 transitions. [2024-11-25 02:26:28,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 02:26:28,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:28,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:26:29,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:29,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 1922 states and 2290 transitions. [2024-11-25 02:26:29,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2290 transitions. [2024-11-25 02:26:29,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-25 02:26:29,124 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:29,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:30,076 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 02:26:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:34,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 1960 states and 2335 transitions. [2024-11-25 02:26:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2335 transitions. [2024-11-25 02:26:34,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-25 02:26:34,040 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:34,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 02:26:35,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:35,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 1975 states and 2354 transitions. [2024-11-25 02:26:35,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2354 transitions. [2024-11-25 02:26:35,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-25 02:26:35,037 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:35,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:35,098 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-25 02:26:35,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:35,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 1980 states and 2361 transitions. [2024-11-25 02:26:35,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2361 transitions. [2024-11-25 02:26:35,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 02:26:35,510 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:35,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 02:26:36,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:36,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2050 states and 2433 transitions. [2024-11-25 02:26:36,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2433 transitions. [2024-11-25 02:26:36,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 02:26:36,317 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:36,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:36,689 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:26:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:38,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2121 states and 2511 transitions. [2024-11-25 02:26:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2511 transitions. [2024-11-25 02:26:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-25 02:26:38,638 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:38,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:39,033 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 02:26:43,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:43,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2574 states to 2174 states and 2574 transitions. [2024-11-25 02:26:43,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 2574 transitions. [2024-11-25 02:26:43,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-25 02:26:43,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:43,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:44,539 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 02:26:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2224 states and 2638 transitions. [2024-11-25 02:26:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 2638 transitions. [2024-11-25 02:26:46,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-25 02:26:46,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:46,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:47,046 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 02:26:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:50,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2257 states and 2675 transitions. [2024-11-25 02:26:50,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 2675 transitions. [2024-11-25 02:26:50,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-25 02:26:50,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:50,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 135 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:26:54,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:54,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2292 states and 2715 transitions. [2024-11-25 02:26:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 2715 transitions. [2024-11-25 02:26:54,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-25 02:26:54,223 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:54,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:54,454 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 135 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:26:55,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:55,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2295 states and 2718 transitions. [2024-11-25 02:26:55,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2718 transitions. [2024-11-25 02:26:55,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 02:26:55,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:55,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:55,931 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 205 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 02:26:58,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:26:58,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2334 states and 2773 transitions. [2024-11-25 02:26:58,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 2773 transitions. [2024-11-25 02:26:58,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 02:26:58,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:26:58,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:26:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:26:59,104 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 205 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 02:27:00,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2341 states and 2779 transitions. [2024-11-25 02:27:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 2779 transitions. [2024-11-25 02:27:00,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 02:27:00,619 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:00,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:01,045 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 205 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 02:27:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2345 states and 2782 transitions. [2024-11-25 02:27:01,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 2782 transitions. [2024-11-25 02:27:01,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 02:27:01,894 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:01,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 137 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-25 02:27:02,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:02,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2351 states and 2789 transitions. [2024-11-25 02:27:02,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 2789 transitions. [2024-11-25 02:27:02,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 02:27:02,406 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:02,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 02:27:05,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:05,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2403 states and 2850 transitions. [2024-11-25 02:27:05,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 2850 transitions. [2024-11-25 02:27:05,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 02:27:05,061 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:05,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 02:27:06,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2409 states and 2856 transitions. [2024-11-25 02:27:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2409 states and 2856 transitions. [2024-11-25 02:27:06,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 02:27:06,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:06,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:06,474 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 02:27:07,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:07,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2434 states and 2882 transitions. [2024-11-25 02:27:07,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 2882 transitions. [2024-11-25 02:27:07,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 02:27:07,913 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:07,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:27:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:08,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2447 states and 2894 transitions. [2024-11-25 02:27:08,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 2894 transitions. [2024-11-25 02:27:08,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 02:27:08,708 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:08,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:08,777 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-25 02:27:08,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:08,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2483 states and 2930 transitions. [2024-11-25 02:27:08,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 2930 transitions. [2024-11-25 02:27:08,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 02:27:08,996 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:08,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:09,249 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:27:12,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:12,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2512 states and 2974 transitions. [2024-11-25 02:27:12,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 2974 transitions. [2024-11-25 02:27:12,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 02:27:12,004 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:12,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:27:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 2541 states and 3018 transitions. [2024-11-25 02:27:16,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 3018 transitions. [2024-11-25 02:27:16,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 02:27:16,598 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:16,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:27:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 2542 states and 3019 transitions. [2024-11-25 02:27:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 3019 transitions. [2024-11-25 02:27:17,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 02:27:17,275 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:17,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:17,372 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:27:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:19,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3049 states to 2561 states and 3049 transitions. [2024-11-25 02:27:19,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 3049 transitions. [2024-11-25 02:27:19,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 02:27:19,427 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:19,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:27:20,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:20,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 2565 states and 3060 transitions. [2024-11-25 02:27:20,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3060 transitions. [2024-11-25 02:27:20,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 02:27:20,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:20,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:20,300 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:27:20,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:20,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 2568 states and 3062 transitions. [2024-11-25 02:27:20,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3062 transitions. [2024-11-25 02:27:20,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 02:27:20,950 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:20,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:21,040 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:27:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:21,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 2569 states and 3062 transitions. [2024-11-25 02:27:21,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 3062 transitions. [2024-11-25 02:27:21,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 02:27:21,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:21,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:21,747 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:27:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:23,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3079 states to 2579 states and 3079 transitions. [2024-11-25 02:27:23,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 3079 transitions. [2024-11-25 02:27:23,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 02:27:23,500 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:23,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:23,595 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:27:25,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:25,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 2596 states and 3106 transitions. [2024-11-25 02:27:25,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2596 states and 3106 transitions. [2024-11-25 02:27:25,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 02:27:25,568 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:25,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:25,732 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:27:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:26,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 2599 states and 3108 transitions. [2024-11-25 02:27:26,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2599 states and 3108 transitions. [2024-11-25 02:27:26,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 02:27:26,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:26,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:27:27,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 2601 states and 3109 transitions. [2024-11-25 02:27:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2601 states and 3109 transitions. [2024-11-25 02:27:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 02:27:27,029 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:27,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:27:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:27,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 2604 states and 3114 transitions. [2024-11-25 02:27:27,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2604 states and 3114 transitions. [2024-11-25 02:27:27,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 02:27:27,741 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:27,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:27:28,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:28,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 2610 states and 3122 transitions. [2024-11-25 02:27:28,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 3122 transitions. [2024-11-25 02:27:28,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 02:27:28,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:28,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:28,606 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:27:29,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 2613 states and 3124 transitions. [2024-11-25 02:27:29,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2613 states and 3124 transitions. [2024-11-25 02:27:29,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 02:27:29,259 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:29,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:29,353 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:27:30,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 2616 states and 3127 transitions. [2024-11-25 02:27:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 3127 transitions. [2024-11-25 02:27:30,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 02:27:30,677 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:30,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:27:31,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:31,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 2619 states and 3130 transitions. [2024-11-25 02:27:31,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 3130 transitions. [2024-11-25 02:27:31,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 02:27:31,610 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:31,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:27:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:32,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 2622 states and 3132 transitions. [2024-11-25 02:27:32,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2622 states and 3132 transitions. [2024-11-25 02:27:32,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-25 02:27:32,431 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:32,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:32,502 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-25 02:27:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:33,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 2629 states and 3137 transitions. [2024-11-25 02:27:33,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 3137 transitions. [2024-11-25 02:27:33,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-25 02:27:33,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:33,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:33,458 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-25 02:27:34,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:34,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3154 states to 2644 states and 3154 transitions. [2024-11-25 02:27:34,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3154 transitions. [2024-11-25 02:27:34,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-25 02:27:34,270 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:34,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:27:34,531 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-25 02:27:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:27:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3198 states to 2681 states and 3198 transitions. [2024-11-25 02:27:37,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 3198 transitions. [2024-11-25 02:27:37,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-25 02:27:37,327 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:27:37,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:27:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 02:27:37,361 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 02:27:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 02:27:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 02:27:37,673 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 02:27:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 02:27:37,871 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 146 iterations. [2024-11-25 02:27:38,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 02:27:38 ImpRootNode [2024-11-25 02:27:38,065 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 02:27:38,065 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 02:27:38,066 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 02:27:38,066 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 02:27:38,067 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:24:38" (3/4) ... [2024-11-25 02:27:38,068 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-25 02:27:38,290 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 239. [2024-11-25 02:27:38,494 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7351e844-cce0-41f6-b8d6-3ef277aed90d/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 02:27:38,494 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7351e844-cce0-41f6-b8d6-3ef277aed90d/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 02:27:38,494 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 02:27:38,496 INFO L158 Benchmark]: Toolchain (without parser) took 183574.43ms. Allocated memory was 142.6MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 116.1MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 518.9MB. Max. memory is 16.1GB. [2024-11-25 02:27:38,500 INFO L158 Benchmark]: CDTParser took 0.80ms. Allocated memory is still 142.6MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 02:27:38,500 INFO L158 Benchmark]: CACSL2BoogieTranslator took 738.32ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 88.3MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-25 02:27:38,500 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.28ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 82.8MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 02:27:38,501 INFO L158 Benchmark]: Boogie Preprocessor took 117.12ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 78.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 02:27:38,501 INFO L158 Benchmark]: RCFGBuilder took 2294.08ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 78.7MB in the beginning and 341.7MB in the end (delta: -263.0MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. [2024-11-25 02:27:38,501 INFO L158 Benchmark]: CodeCheck took 179892.12ms. Allocated memory was 419.4MB in the beginning and 2.7GB in the end (delta: 2.3GB). Free memory was 341.7MB in the beginning and 2.2GB in the end (delta: -1.8GB). Peak memory consumption was 434.2MB. Max. memory is 16.1GB. [2024-11-25 02:27:38,502 INFO L158 Benchmark]: Witness Printer took 429.11ms. Allocated memory is still 2.7GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-25 02:27:38,504 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: 179.6s, OverallIterations: 146, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 392729 SdHoareTripleChecker+Valid, 1206.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 388118 mSDsluCounter, 50465 SdHoareTripleChecker+Invalid, 1030.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42690 mSDsCounter, 96035 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 854981 IncrementalHoareTripleChecker+Invalid, 951016 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96035 mSolverCounterUnsat, 7775 mSDtfsCounter, 854981 mSolverCounterSat, 11.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 151946 GetRequests, 145685 SyntacticMatches, 5117 SemanticMatches, 1144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873229 ImplicationChecksByTransitivity, 127.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.0s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 27.7s InterpolantComputationTime, 22568 NumberOfCodeBlocks, 22568 NumberOfCodeBlocksAsserted, 146 NumberOfCheckSat, 22187 ConstructedInterpolants, 0 QuantifiedInterpolants, 102645 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 145 InterpolantComputations, 97 PerfectInterpolantSequences, 15914/17909 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: 414]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [\result=21, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [\result=21, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [\result=26, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [\result=26, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND TRUE ((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1))) [L234] a21 = 1 [L235] a8 = 14 [L236] a16 = 4 [L237] a20 = 0 [L238] a7 = 0 [L239] a17 = 0 [L240] return -1; VAL [\result=-1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L413] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L414] reach_error() VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.80ms. Allocated memory is still 142.6MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 738.32ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 88.3MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.28ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 82.8MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 117.12ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 78.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2294.08ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 78.7MB in the beginning and 341.7MB in the end (delta: -263.0MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. * CodeCheck took 179892.12ms. Allocated memory was 419.4MB in the beginning and 2.7GB in the end (delta: 2.3GB). Free memory was 341.7MB in the beginning and 2.2GB in the end (delta: -1.8GB). Peak memory consumption was 434.2MB. Max. memory is 16.1GB. * Witness Printer took 429.11ms. Allocated memory is still 2.7GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-25 02:27:38,535 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7351e844-cce0-41f6-b8d6-3ef277aed90d/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE