./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label16.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83a7dacb-9780-4ad2-acde-bafed4e917f4/bin/ukojak-verify-G8NBE6pJGL/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83a7dacb-9780-4ad2-acde-bafed4e917f4/bin/ukojak-verify-G8NBE6pJGL/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83a7dacb-9780-4ad2-acde-bafed4e917f4/bin/ukojak-verify-G8NBE6pJGL/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83a7dacb-9780-4ad2-acde-bafed4e917f4/bin/ukojak-verify-G8NBE6pJGL/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label16.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83a7dacb-9780-4ad2-acde-bafed4e917f4/bin/ukojak-verify-G8NBE6pJGL/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83a7dacb-9780-4ad2-acde-bafed4e917f4/bin/ukojak-verify-G8NBE6pJGL --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 f8ead2a6759acdf787a08f1ff38320ba759d869365709db6ba95cb561ffe0161 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 03:07:14,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 03:07:14,436 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83a7dacb-9780-4ad2-acde-bafed4e917f4/bin/ukojak-verify-G8NBE6pJGL/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-11-19 03:07:14,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 03:07:14,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-11-19 03:07:14,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 03:07:14,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 03:07:14,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-11-19 03:07:14,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 03:07:14,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 03:07:14,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 03:07:14,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 03:07:14,471 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 03:07:14,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 03:07:14,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 03:07:14,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 03:07:14,473 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 03:07:14,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 03:07:14,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 03:07:14,475 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 03:07:14,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 03:07:14,476 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 03:07:14,477 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-11-19 03:07:14,477 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-11-19 03:07:14,478 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-11-19 03:07:14,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 03:07:14,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-11-19 03:07:14,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 03:07:14,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 03:07:14,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 03:07:14,481 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-11-19 03:07:14,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 03:07:14,482 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 03:07:14,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83a7dacb-9780-4ad2-acde-bafed4e917f4/bin/ukojak-verify-G8NBE6pJGL/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_83a7dacb-9780-4ad2-acde-bafed4e917f4/bin/ukojak-verify-G8NBE6pJGL 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 -> f8ead2a6759acdf787a08f1ff38320ba759d869365709db6ba95cb561ffe0161 [2023-11-19 03:07:14,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 03:07:14,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 03:07:14,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 03:07:14,777 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 03:07:14,781 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 03:07:14,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83a7dacb-9780-4ad2-acde-bafed4e917f4/bin/ukojak-verify-G8NBE6pJGL/../../sv-benchmarks/c/eca-rers2012/Problem02_label16.c [2023-11-19 03:07:17,934 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 03:07:18,307 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 03:07:18,307 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83a7dacb-9780-4ad2-acde-bafed4e917f4/sv-benchmarks/c/eca-rers2012/Problem02_label16.c [2023-11-19 03:07:18,321 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83a7dacb-9780-4ad2-acde-bafed4e917f4/bin/ukojak-verify-G8NBE6pJGL/data/572b276f2/4a6151dd6a6b4dfa9d1167d287166806/FLAG3c52b1c93 [2023-11-19 03:07:18,336 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83a7dacb-9780-4ad2-acde-bafed4e917f4/bin/ukojak-verify-G8NBE6pJGL/data/572b276f2/4a6151dd6a6b4dfa9d1167d287166806 [2023-11-19 03:07:18,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 03:07:18,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 03:07:18,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 03:07:18,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 03:07:18,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 03:07:18,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:07:18" (1/1) ... [2023-11-19 03:07:18,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d5e0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:07:18, skipping insertion in model container [2023-11-19 03:07:18,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:07:18" (1/1) ... [2023-11-19 03:07:18,397 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 03:07:18,772 WARN L240 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_83a7dacb-9780-4ad2-acde-bafed4e917f4/sv-benchmarks/c/eca-rers2012/Problem02_label16.c[15312,15325] [2023-11-19 03:07:18,856 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 03:07:18,890 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 03:07:18,982 WARN L240 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_83a7dacb-9780-4ad2-acde-bafed4e917f4/sv-benchmarks/c/eca-rers2012/Problem02_label16.c[15312,15325] [2023-11-19 03:07:19,009 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 03:07:19,032 INFO L206 MainTranslator]: Completed translation [2023-11-19 03:07:19,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:07:19 WrapperNode [2023-11-19 03:07:19,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 03:07:19,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 03:07:19,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 03:07:19,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 03:07:19,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:07:19" (1/1) ... [2023-11-19 03:07:19,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:07:19" (1/1) ... [2023-11-19 03:07:19,141 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2023-11-19 03:07:19,141 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 03:07:19,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 03:07:19,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 03:07:19,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 03:07:19,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:07:19" (1/1) ... [2023-11-19 03:07:19,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:07:19" (1/1) ... [2023-11-19 03:07:19,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:07:19" (1/1) ... [2023-11-19 03:07:19,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:07:19" (1/1) ... [2023-11-19 03:07:19,182 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:07:19" (1/1) ... [2023-11-19 03:07:19,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:07:19" (1/1) ... [2023-11-19 03:07:19,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:07:19" (1/1) ... [2023-11-19 03:07:19,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:07:19" (1/1) ... [2023-11-19 03:07:19,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 03:07:19,214 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 03:07:19,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 03:07:19,214 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 03:07:19,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:07:19" (1/1) ... [2023-11-19 03:07:19,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-11-19 03:07:19,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83a7dacb-9780-4ad2-acde-bafed4e917f4/bin/ukojak-verify-G8NBE6pJGL/z3 [2023-11-19 03:07:19,249 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83a7dacb-9780-4ad2-acde-bafed4e917f4/bin/ukojak-verify-G8NBE6pJGL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-11-19 03:07:19,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83a7dacb-9780-4ad2-acde-bafed4e917f4/bin/ukojak-verify-G8NBE6pJGL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-11-19 03:07:19,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 03:07:19,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 03:07:19,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 03:07:19,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 03:07:19,421 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 03:07:19,425 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 03:07:20,475 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 03:07:20,851 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 03:07:20,852 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 03:07:20,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:07:20 BoogieIcfgContainer [2023-11-19 03:07:20,864 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 03:07:20,864 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-11-19 03:07:20,865 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-11-19 03:07:20,874 INFO L274 PluginConnector]: CodeCheck initialized [2023-11-19 03:07:20,875 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:07:20" (1/1) ... [2023-11-19 03:07:20,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 03:07:20,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:20,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2023-11-19 03:07:20,963 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2023-11-19 03:07:20,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-19 03:07:20,970 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:20,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 03:07:22,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:22,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 163 states and 240 transitions. [2023-11-19 03:07:22,086 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2023-11-19 03:07:22,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-19 03:07:22,093 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:22,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 03:07:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:22,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 166 states and 245 transitions. [2023-11-19 03:07:22,570 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 245 transitions. [2023-11-19 03:07:22,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-19 03:07:22,577 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:22,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:22,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 03:07:23,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:23,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 167 states and 246 transitions. [2023-11-19 03:07:23,142 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 246 transitions. [2023-11-19 03:07:23,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-19 03:07:23,144 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:23,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 03:07:23,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:23,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 177 states and 264 transitions. [2023-11-19 03:07:23,510 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 264 transitions. [2023-11-19 03:07:23,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-19 03:07:23,511 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:23,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 03:07:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 189 states and 283 transitions. [2023-11-19 03:07:24,315 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 283 transitions. [2023-11-19 03:07:24,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-19 03:07:24,318 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:24,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 03:07:24,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:24,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 192 states and 286 transitions. [2023-11-19 03:07:24,588 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 286 transitions. [2023-11-19 03:07:24,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-19 03:07:24,589 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:24,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:24,691 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-19 03:07:24,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 195 states and 290 transitions. [2023-11-19 03:07:24,868 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 290 transitions. [2023-11-19 03:07:24,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-19 03:07:24,870 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:24,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:24,999 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 03:07:25,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 208 states and 313 transitions. [2023-11-19 03:07:25,348 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 313 transitions. [2023-11-19 03:07:25,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-19 03:07:25,349 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:25,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-19 03:07:25,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:25,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 212 states and 321 transitions. [2023-11-19 03:07:25,965 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 321 transitions. [2023-11-19 03:07:25,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-19 03:07:25,966 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:25,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:26,068 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-19 03:07:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:26,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 221 states and 333 transitions. [2023-11-19 03:07:26,378 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 333 transitions. [2023-11-19 03:07:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-19 03:07:26,380 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:26,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:26,470 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 03:07:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:26,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 233 states and 348 transitions. [2023-11-19 03:07:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 348 transitions. [2023-11-19 03:07:26,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-19 03:07:26,791 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:26,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:26,940 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-19 03:07:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 236 states and 355 transitions. [2023-11-19 03:07:27,291 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 355 transitions. [2023-11-19 03:07:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-19 03:07:27,292 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:27,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:27,415 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-19 03:07:27,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 239 states and 359 transitions. [2023-11-19 03:07:27,629 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 359 transitions. [2023-11-19 03:07:27,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-19 03:07:27,630 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:27,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 03:07:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:28,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 252 states and 383 transitions. [2023-11-19 03:07:28,316 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 383 transitions. [2023-11-19 03:07:28,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-19 03:07:28,317 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:28,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 03:07:28,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 253 states and 383 transitions. [2023-11-19 03:07:28,534 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 383 transitions. [2023-11-19 03:07:28,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-19 03:07:28,535 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:28,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 03:07:28,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:28,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 260 states and 392 transitions. [2023-11-19 03:07:28,988 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2023-11-19 03:07:28,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-19 03:07:28,989 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:28,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-19 03:07:29,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:29,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 261 states and 392 transitions. [2023-11-19 03:07:29,260 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 392 transitions. [2023-11-19 03:07:29,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-19 03:07:29,262 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:29,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-19 03:07:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:30,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 265 states and 399 transitions. [2023-11-19 03:07:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 399 transitions. [2023-11-19 03:07:30,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-19 03:07:30,068 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:30,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-19 03:07:30,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:30,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 272 states and 411 transitions. [2023-11-19 03:07:30,746 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 411 transitions. [2023-11-19 03:07:30,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-19 03:07:30,749 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:30,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:30,848 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-19 03:07:31,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:31,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 278 states and 418 transitions. [2023-11-19 03:07:31,260 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 418 transitions. [2023-11-19 03:07:31,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-19 03:07:31,262 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:31,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:31,335 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-19 03:07:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:31,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 282 states and 423 transitions. [2023-11-19 03:07:31,704 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 423 transitions. [2023-11-19 03:07:31,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-19 03:07:31,706 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:31,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:31,802 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 03:07:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:32,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 301 states and 448 transitions. [2023-11-19 03:07:32,601 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 448 transitions. [2023-11-19 03:07:32,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-19 03:07:32,602 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:32,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:32,673 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 03:07:32,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:32,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 309 states and 457 transitions. [2023-11-19 03:07:32,949 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 457 transitions. [2023-11-19 03:07:32,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-19 03:07:32,951 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:32,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 03:07:33,019 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 03:07:33,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:07:33,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 310 states and 457 transitions. [2023-11-19 03:07:33,054 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 457 transitions. [2023-11-19 03:07:33,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-19 03:07:33,058 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:07:33,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:07:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 03:07:33,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 03:07:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 03:07:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 03:07:33,274 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 03:07:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 03:07:33,374 WARN L476 CodeCheckObserver]: This program is UNSAFE, Check terminated with 25 iterations. [2023-11-19 03:07:33,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 19.11 03:07:33 ImpRootNode [2023-11-19 03:07:33,485 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2023-11-19 03:07:33,485 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 03:07:33,486 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 03:07:33,486 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 03:07:33,486 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:07:20" (3/4) ... [2023-11-19 03:07:33,487 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 03:07:33,592 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83a7dacb-9780-4ad2-acde-bafed4e917f4/bin/ukojak-verify-G8NBE6pJGL/witness.graphml [2023-11-19 03:07:33,593 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 03:07:33,593 INFO L158 Benchmark]: Toolchain (without parser) took 15252.55ms. Allocated memory was 155.2MB in the beginning and 335.5MB in the end (delta: 180.4MB). Free memory was 114.1MB in the beginning and 263.5MB in the end (delta: -149.5MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2023-11-19 03:07:33,594 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 121.6MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 03:07:33,594 INFO L158 Benchmark]: CACSL2BoogieTranslator took 691.15ms. Allocated memory is still 155.2MB. Free memory was 114.1MB in the beginning and 102.4MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-19 03:07:33,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.07ms. Allocated memory is still 155.2MB. Free memory was 102.4MB in the beginning and 96.9MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-19 03:07:33,595 INFO L158 Benchmark]: Boogie Preprocessor took 71.01ms. Allocated memory is still 155.2MB. Free memory was 96.9MB in the beginning and 92.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 03:07:33,596 INFO L158 Benchmark]: RCFGBuilder took 1649.77ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 92.7MB in the beginning and 115.8MB in the end (delta: -23.1MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2023-11-19 03:07:33,596 INFO L158 Benchmark]: CodeCheck took 12620.51ms. Allocated memory was 186.6MB in the beginning and 335.5MB in the end (delta: 148.9MB). Free memory was 115.8MB in the beginning and 273.0MB in the end (delta: -157.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 03:07:33,596 INFO L158 Benchmark]: Witness Printer took 107.45ms. Allocated memory is still 335.5MB. Free memory was 273.0MB in the beginning and 263.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-19 03:07:33,598 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, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 25, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10548 SdHoareTripleChecker+Valid, 30.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8566 mSDsluCounter, 2113 SdHoareTripleChecker+Invalid, 25.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1691 mSDsCounter, 5603 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21267 IncrementalHoareTripleChecker+Invalid, 26870 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5603 mSolverCounterUnsat, 422 mSDtfsCounter, 21267 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16007 GetRequests, 15695 SyntacticMatches, 134 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15654 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2498 NumberOfCodeBlocks, 2498 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2367 ConstructedInterpolants, 0 QuantifiedInterpolants, 3393 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 22 PerfectInterpolantSequences, 608/616 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 443]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int e= 5; [L19] int d= 4; [L20] int f= 6; [L21] int c= 3; [L24] int u = 21; [L25] int v = 22; [L26] int w = 23; [L27] int x = 24; [L28] int y = 25; [L29] int z = 26; [L32] int a25 = 0; [L33] int a11 = 0; [L34] int a28 = 7; [L35] int a19 = 1; [L36] int a21 = 1; [L37] int a17 = 8; [L613] int output = -1; VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] EXPR input = __VERIFIER_nondet_int() [L621] COND FALSE, EXPR !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, 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 !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L61] a28 = 11 [L62] a25 = 1 [L63] return 26; VAL [\old(input)=1, \result=26, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] EXPR output = calculate_output(input) [L617-L626] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] EXPR input = __VERIFIER_nondet_int() [L621] COND FALSE, EXPR !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, 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 !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, 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 !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, 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 !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND TRUE ((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1)) [L110] a17 = 7 [L111] a25 = 0 [L112] a11 = 1 [L113] a28 = 10 [L114] a19 = 0 [L115] return -1; VAL [\old(input)=1, \result=-1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] EXPR output = calculate_output(input) [L617-L626] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, 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 !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, 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 !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, 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 !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, 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 !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, 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 !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, 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 !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, 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 !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, 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 !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, 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 !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L408] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L424] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L427] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L430] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L433] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L436] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) [L439] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L442] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7)) VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L443] reach_error() VAL [\old(input)=4, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, 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.34ms. Allocated memory is still 121.6MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 691.15ms. Allocated memory is still 155.2MB. Free memory was 114.1MB in the beginning and 102.4MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.07ms. Allocated memory is still 155.2MB. Free memory was 102.4MB in the beginning and 96.9MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.01ms. Allocated memory is still 155.2MB. Free memory was 96.9MB in the beginning and 92.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1649.77ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 92.7MB in the beginning and 115.8MB in the end (delta: -23.1MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. * CodeCheck took 12620.51ms. Allocated memory was 186.6MB in the beginning and 335.5MB in the end (delta: 148.9MB). Free memory was 115.8MB in the beginning and 273.0MB in the end (delta: -157.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 107.45ms. Allocated memory is still 335.5MB. Free memory was 273.0MB in the beginning and 263.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2023-11-19 03:07:33,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83a7dacb-9780-4ad2-acde-bafed4e917f4/bin/ukojak-verify-G8NBE6pJGL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE