./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label44.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f7e838-551f-402f-84d0-f14c831c15b3/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f7e838-551f-402f-84d0-f14c831c15b3/bin/ukojak-rkRKPMF4O4/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f7e838-551f-402f-84d0-f14c831c15b3/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f7e838-551f-402f-84d0-f14c831c15b3/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label44.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f7e838-551f-402f-84d0-f14c831c15b3/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f7e838-551f-402f-84d0-f14c831c15b3/bin/ukojak-rkRKPMF4O4 --witnessprinter.witness.filename witness.graphml --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 19f6a4e9c4337065cd35355f350ba61e20d7c158a393782dbdfa17548177e415 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 19:55:00,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 19:55:00,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 19:55:00,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 19:55:00,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 19:55:00,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 19:55:00,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 19:55:00,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 19:55:00,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 19:55:00,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 19:55:00,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 19:55:00,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 19:55:00,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 19:55:00,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 19:55:00,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 19:55:00,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 19:55:00,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 19:55:00,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 19:55:00,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 19:55:00,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 19:55:00,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 19:55:00,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 19:55:00,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 19:55:00,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 19:55:00,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 19:55:00,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 19:55:00,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 19:55:00,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 19:55:00,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 19:55:00,078 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 19:55:00,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 19:55:00,079 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 19:55:00,079 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 19:55:00,080 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 19:55:00,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 19:55:00,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 19:55:00,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 19:55:00,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 19:55:00,082 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 19:55:00,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 19:55:00,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 19:55:00,084 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f7e838-551f-402f-84d0-f14c831c15b3/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 19:55:00,104 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 19:55:00,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 19:55:00,105 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 19:55:00,106 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 19:55:00,106 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 19:55:00,106 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 19:55:00,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 19:55:00,112 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 19:55:00,113 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 19:55:00,113 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 19:55:00,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 19:55:00,113 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 19:55:00,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 19:55:00,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 19:55:00,114 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 19:55:00,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 19:55:00,114 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 19:55:00,114 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 19:55:00,114 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 19:55:00,115 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 19:55:00,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 19:55:00,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 19:55:00,115 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 19:55:00,115 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 19:55:00,115 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 19:55:00,116 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 19:55:00,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 19:55:00,116 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 19:55:00,116 INFO L138 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_22f7e838-551f-402f-84d0-f14c831c15b3/bin/ukojak-rkRKPMF4O4/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_22f7e838-551f-402f-84d0-f14c831c15b3/bin/ukojak-rkRKPMF4O4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 19f6a4e9c4337065cd35355f350ba61e20d7c158a393782dbdfa17548177e415 [2022-12-14 19:55:00,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 19:55:00,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 19:55:00,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 19:55:00,332 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 19:55:00,333 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 19:55:00,334 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f7e838-551f-402f-84d0-f14c831c15b3/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/eca-rers2012/Problem01_label44.c [2022-12-14 19:55:02,944 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 19:55:03,150 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 19:55:03,150 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f7e838-551f-402f-84d0-f14c831c15b3/sv-benchmarks/c/eca-rers2012/Problem01_label44.c [2022-12-14 19:55:03,160 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f7e838-551f-402f-84d0-f14c831c15b3/bin/ukojak-rkRKPMF4O4/data/242f35a0c/b6a66a4513ba4ff08c4f7309d29e87e2/FLAG49991c31b [2022-12-14 19:55:03,172 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f7e838-551f-402f-84d0-f14c831c15b3/bin/ukojak-rkRKPMF4O4/data/242f35a0c/b6a66a4513ba4ff08c4f7309d29e87e2 [2022-12-14 19:55:03,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 19:55:03,174 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 19:55:03,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 19:55:03,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 19:55:03,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 19:55:03,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:55:03" (1/1) ... [2022-12-14 19:55:03,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@789084aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:55:03, skipping insertion in model container [2022-12-14 19:55:03,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:55:03" (1/1) ... [2022-12-14 19:55:03,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 19:55:03,220 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 19:55:03,414 WARN L237 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_22f7e838-551f-402f-84d0-f14c831c15b3/sv-benchmarks/c/eca-rers2012/Problem01_label44.c[16002,16015] [2022-12-14 19:55:03,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 19:55:03,446 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 19:55:03,499 WARN L237 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_22f7e838-551f-402f-84d0-f14c831c15b3/sv-benchmarks/c/eca-rers2012/Problem01_label44.c[16002,16015] [2022-12-14 19:55:03,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 19:55:03,522 INFO L208 MainTranslator]: Completed translation [2022-12-14 19:55:03,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:55:03 WrapperNode [2022-12-14 19:55:03,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 19:55:03,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 19:55:03,523 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 19:55:03,523 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 19:55:03,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:55:03" (1/1) ... [2022-12-14 19:55:03,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:55:03" (1/1) ... [2022-12-14 19:55:03,571 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2022-12-14 19:55:03,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 19:55:03,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 19:55:03,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 19:55:03,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 19:55:03,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:55:03" (1/1) ... [2022-12-14 19:55:03,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:55:03" (1/1) ... [2022-12-14 19:55:03,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:55:03" (1/1) ... [2022-12-14 19:55:03,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:55:03" (1/1) ... [2022-12-14 19:55:03,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:55:03" (1/1) ... [2022-12-14 19:55:03,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:55:03" (1/1) ... [2022-12-14 19:55:03,602 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:55:03" (1/1) ... [2022-12-14 19:55:03,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:55:03" (1/1) ... [2022-12-14 19:55:03,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 19:55:03,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 19:55:03,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 19:55:03,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 19:55:03,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:55:03" (1/1) ... [2022-12-14 19:55:03,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 19:55:03,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f7e838-551f-402f-84d0-f14c831c15b3/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 19:55:03,634 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f7e838-551f-402f-84d0-f14c831c15b3/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 19:55:03,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f7e838-551f-402f-84d0-f14c831c15b3/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 19:55:03,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 19:55:03,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 19:55:03,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 19:55:03,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 19:55:03,724 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 19:55:03,725 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 19:55:04,486 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 19:55:04,640 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 19:55:04,641 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 19:55:04,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:55:04 BoogieIcfgContainer [2022-12-14 19:55:04,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 19:55:04,643 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 19:55:04,643 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 19:55:04,651 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 19:55:04,651 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:55:04" (1/1) ... [2022-12-14 19:55:04,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 19:55:04,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2022-12-14 19:55:04,695 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2022-12-14 19:55:04,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-14 19:55:04,698 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:04,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:05,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2022-12-14 19:55:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2022-12-14 19:55:05,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 19:55:05,295 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:05,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 19:55:05,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:05,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2022-12-14 19:55:05,501 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2022-12-14 19:55:05,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-14 19:55:05,502 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:05,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:05,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:05,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 150 states and 244 transitions. [2022-12-14 19:55:05,612 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 244 transitions. [2022-12-14 19:55:05,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-14 19:55:05,613 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:05,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:05,662 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 19:55:05,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:05,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2022-12-14 19:55:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2022-12-14 19:55:05,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-14 19:55:05,757 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:05,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 159 states and 258 transitions. [2022-12-14 19:55:05,932 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 258 transitions. [2022-12-14 19:55:05,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-14 19:55:05,934 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:05,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:06,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:06,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:06,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 160 states and 259 transitions. [2022-12-14 19:55:06,136 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 259 transitions. [2022-12-14 19:55:06,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-14 19:55:06,139 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:06,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:06,247 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:06,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:06,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 168 states and 268 transitions. [2022-12-14 19:55:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 268 transitions. [2022-12-14 19:55:06,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-14 19:55:06,332 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:06,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:06,488 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:06,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 182 states and 286 transitions. [2022-12-14 19:55:06,670 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 286 transitions. [2022-12-14 19:55:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-14 19:55:06,671 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:06,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:06,746 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:07,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 197 states and 306 transitions. [2022-12-14 19:55:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 306 transitions. [2022-12-14 19:55:07,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-14 19:55:07,049 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:07,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:07,148 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:07,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:07,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 212 states and 327 transitions. [2022-12-14 19:55:07,588 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 327 transitions. [2022-12-14 19:55:07,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-14 19:55:07,589 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:07,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:08,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:08,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 230 states and 356 transitions. [2022-12-14 19:55:08,094 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2022-12-14 19:55:08,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-14 19:55:08,095 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:08,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:08,189 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:08,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 232 states and 369 transitions. [2022-12-14 19:55:08,443 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 369 transitions. [2022-12-14 19:55:08,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-14 19:55:08,443 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:08,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:08,504 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:08,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:08,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 246 states and 387 transitions. [2022-12-14 19:55:08,867 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 387 transitions. [2022-12-14 19:55:08,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-14 19:55:08,868 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:08,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:08,925 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:09,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 251 states and 393 transitions. [2022-12-14 19:55:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 393 transitions. [2022-12-14 19:55:09,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-14 19:55:09,005 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:09,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:09,094 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 19:55:09,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 252 states and 394 transitions. [2022-12-14 19:55:09,209 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 394 transitions. [2022-12-14 19:55:09,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-14 19:55:09,210 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:09,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:09,269 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:09,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:09,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 271 states and 424 transitions. [2022-12-14 19:55:09,826 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 424 transitions. [2022-12-14 19:55:09,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-14 19:55:09,827 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:09,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:09,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:09,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 272 states and 425 transitions. [2022-12-14 19:55:09,990 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 425 transitions. [2022-12-14 19:55:09,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-14 19:55:09,991 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:09,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:10,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 287 states and 444 transitions. [2022-12-14 19:55:10,512 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 444 transitions. [2022-12-14 19:55:10,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-12-14 19:55:10,512 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:10,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:10,558 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 19:55:10,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 305 states and 464 transitions. [2022-12-14 19:55:10,981 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 464 transitions. [2022-12-14 19:55:10,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-12-14 19:55:10,981 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:10,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:11,043 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:11,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:11,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 309 states and 468 transitions. [2022-12-14 19:55:11,071 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 468 transitions. [2022-12-14 19:55:11,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-14 19:55:11,072 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:11,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:11,163 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 19:55:11,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:11,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 313 states and 475 transitions. [2022-12-14 19:55:11,362 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 475 transitions. [2022-12-14 19:55:11,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-14 19:55:11,363 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:11,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 19:55:11,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:11,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 314 states and 477 transitions. [2022-12-14 19:55:11,523 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 477 transitions. [2022-12-14 19:55:11,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-14 19:55:11,524 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:11,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:11,558 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 19:55:11,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 322 states and 492 transitions. [2022-12-14 19:55:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 492 transitions. [2022-12-14 19:55:11,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-14 19:55:11,929 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:11,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:11,967 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 19:55:12,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:12,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 328 states and 501 transitions. [2022-12-14 19:55:12,183 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 501 transitions. [2022-12-14 19:55:12,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-14 19:55:12,184 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:12,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 19:55:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:12,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 331 states and 506 transitions. [2022-12-14 19:55:12,345 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 506 transitions. [2022-12-14 19:55:12,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-14 19:55:12,346 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:12,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:12,376 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:12,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:12,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 346 states and 527 transitions. [2022-12-14 19:55:12,694 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 527 transitions. [2022-12-14 19:55:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-12-14 19:55:12,695 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:12,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:12,753 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:12,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:12,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 360 states and 544 transitions. [2022-12-14 19:55:12,923 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 544 transitions. [2022-12-14 19:55:12,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-14 19:55:12,924 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:12,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:13,002 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 362 states and 546 transitions. [2022-12-14 19:55:13,171 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 546 transitions. [2022-12-14 19:55:13,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-14 19:55:13,171 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:13,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:13,203 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 19:55:13,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:13,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 368 states and 553 transitions. [2022-12-14 19:55:13,421 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 553 transitions. [2022-12-14 19:55:13,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-14 19:55:13,421 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:13,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:13,453 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 19:55:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 372 states and 556 transitions. [2022-12-14 19:55:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 556 transitions. [2022-12-14 19:55:13,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-14 19:55:13,483 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:13,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:13,544 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:13,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:13,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 374 states and 559 transitions. [2022-12-14 19:55:13,582 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 559 transitions. [2022-12-14 19:55:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-14 19:55:13,582 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:13,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:13,661 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:13,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:13,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 388 states and 577 transitions. [2022-12-14 19:55:13,945 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 577 transitions. [2022-12-14 19:55:13,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-14 19:55:13,946 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:13,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:14,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 392 states and 582 transitions. [2022-12-14 19:55:14,174 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 582 transitions. [2022-12-14 19:55:14,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-14 19:55:14,174 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:14,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 19:55:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:14,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 394 states and 585 transitions. [2022-12-14 19:55:14,348 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 585 transitions. [2022-12-14 19:55:14,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-14 19:55:14,349 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:14,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:14,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 397 states and 589 transitions. [2022-12-14 19:55:14,464 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 589 transitions. [2022-12-14 19:55:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-14 19:55:14,465 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:14,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 19:55:14,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:14,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 406 states and 599 transitions. [2022-12-14 19:55:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 599 transitions. [2022-12-14 19:55:14,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-14 19:55:14,752 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:14,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:14,820 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 19:55:15,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:15,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 410 states and 602 transitions. [2022-12-14 19:55:15,020 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 602 transitions. [2022-12-14 19:55:15,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-14 19:55:15,021 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:15,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:15,082 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 19:55:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 413 states and 605 transitions. [2022-12-14 19:55:15,221 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 605 transitions. [2022-12-14 19:55:15,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-12-14 19:55:15,222 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:15,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 19:55:15,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:15,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 488 states and 682 transitions. [2022-12-14 19:55:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 682 transitions. [2022-12-14 19:55:15,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-12-14 19:55:15,650 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:15,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:15,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 502 states and 698 transitions. [2022-12-14 19:55:15,806 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 698 transitions. [2022-12-14 19:55:15,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-14 19:55:15,807 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:15,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:15,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:15,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 513 states and 711 transitions. [2022-12-14 19:55:15,973 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 711 transitions. [2022-12-14 19:55:15,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-14 19:55:15,973 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:15,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 19:55:16,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 518 states and 718 transitions. [2022-12-14 19:55:16,139 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 718 transitions. [2022-12-14 19:55:16,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-14 19:55:16,140 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:16,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:16,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 542 states and 753 transitions. [2022-12-14 19:55:16,674 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 753 transitions. [2022-12-14 19:55:16,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-14 19:55:16,674 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:16,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:16,723 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:16,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:16,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 546 states and 757 transitions. [2022-12-14 19:55:16,940 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 757 transitions. [2022-12-14 19:55:16,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-14 19:55:16,940 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:16,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:16,984 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 19:55:17,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:17,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 553 states and 765 transitions. [2022-12-14 19:55:17,187 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 765 transitions. [2022-12-14 19:55:17,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-14 19:55:17,188 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:17,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:17,224 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 19:55:17,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 555 states and 766 transitions. [2022-12-14 19:55:17,355 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 766 transitions. [2022-12-14 19:55:17,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-14 19:55:17,356 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:17,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:18,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:18,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 593 states and 811 transitions. [2022-12-14 19:55:18,059 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 811 transitions. [2022-12-14 19:55:18,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-14 19:55:18,059 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:18,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:18,103 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:18,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 596 states and 813 transitions. [2022-12-14 19:55:18,268 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 813 transitions. [2022-12-14 19:55:18,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-14 19:55:18,269 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:18,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:18,333 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:18,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 599 states and 815 transitions. [2022-12-14 19:55:18,542 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 815 transitions. [2022-12-14 19:55:18,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-14 19:55:18,543 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:18,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:18,588 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 608 states and 827 transitions. [2022-12-14 19:55:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 827 transitions. [2022-12-14 19:55:18,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-14 19:55:18,633 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:18,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:18,670 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 19:55:18,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 617 states and 836 transitions. [2022-12-14 19:55:18,827 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 836 transitions. [2022-12-14 19:55:18,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-12-14 19:55:18,828 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:18,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:18,890 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-12-14 19:55:19,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 706 states and 928 transitions. [2022-12-14 19:55:19,526 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 928 transitions. [2022-12-14 19:55:19,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-14 19:55:19,527 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:19,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:19,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 733 states and 956 transitions. [2022-12-14 19:55:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 956 transitions. [2022-12-14 19:55:19,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-14 19:55:19,696 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:19,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:19,775 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:20,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 761 states and 985 transitions. [2022-12-14 19:55:20,057 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 985 transitions. [2022-12-14 19:55:20,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-12-14 19:55:20,058 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:20,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:20,110 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 19:55:20,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 762 states and 985 transitions. [2022-12-14 19:55:20,143 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 985 transitions. [2022-12-14 19:55:20,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-12-14 19:55:20,143 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:20,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 19:55:20,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 790 states and 1014 transitions. [2022-12-14 19:55:20,990 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1014 transitions. [2022-12-14 19:55:20,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-12-14 19:55:20,991 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:20,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:21,046 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:21,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:21,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 817 states and 1046 transitions. [2022-12-14 19:55:21,680 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1046 transitions. [2022-12-14 19:55:21,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-12-14 19:55:21,680 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:21,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:21,735 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:21,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 824 states and 1053 transitions. [2022-12-14 19:55:21,780 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1053 transitions. [2022-12-14 19:55:21,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-14 19:55:21,781 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:21,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 887 states and 1123 transitions. [2022-12-14 19:55:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1123 transitions. [2022-12-14 19:55:23,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-14 19:55:23,038 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:23,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:23,113 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 19:55:23,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:23,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 908 states and 1143 transitions. [2022-12-14 19:55:23,620 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1143 transitions. [2022-12-14 19:55:23,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-12-14 19:55:23,621 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:23,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:23,709 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-14 19:55:23,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:23,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 911 states and 1146 transitions. [2022-12-14 19:55:23,835 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1146 transitions. [2022-12-14 19:55:23,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-12-14 19:55:23,835 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:23,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:23,883 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 19:55:24,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:24,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 947 states and 1182 transitions. [2022-12-14 19:55:24,025 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1182 transitions. [2022-12-14 19:55:24,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-12-14 19:55:24,026 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:24,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:24,088 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 19:55:24,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:24,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 954 states and 1188 transitions. [2022-12-14 19:55:24,481 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1188 transitions. [2022-12-14 19:55:24,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-12-14 19:55:24,482 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:24,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:24,533 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 19:55:24,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 955 states and 1188 transitions. [2022-12-14 19:55:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1188 transitions. [2022-12-14 19:55:24,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-12-14 19:55:24,646 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:24,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:24,696 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 19:55:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 968 states and 1202 transitions. [2022-12-14 19:55:24,838 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1202 transitions. [2022-12-14 19:55:24,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-12-14 19:55:24,839 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:24,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:24,890 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 19:55:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:25,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 974 states and 1209 transitions. [2022-12-14 19:55:25,118 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1209 transitions. [2022-12-14 19:55:25,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-12-14 19:55:25,119 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:25,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:25,170 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 19:55:25,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 975 states and 1211 transitions. [2022-12-14 19:55:25,225 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1211 transitions. [2022-12-14 19:55:25,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-12-14 19:55:25,226 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:25,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:25,278 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 19:55:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 978 states and 1213 transitions. [2022-12-14 19:55:25,519 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1213 transitions. [2022-12-14 19:55:25,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-12-14 19:55:25,520 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:25,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:25,571 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 19:55:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 981 states and 1215 transitions. [2022-12-14 19:55:25,753 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1215 transitions. [2022-12-14 19:55:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-12-14 19:55:25,753 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:25,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:25,804 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 19:55:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 985 states and 1218 transitions. [2022-12-14 19:55:26,005 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1218 transitions. [2022-12-14 19:55:26,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-12-14 19:55:26,006 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:26,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:26,255 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 119 proven. 11 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-14 19:55:27,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1033 states and 1272 transitions. [2022-12-14 19:55:27,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1272 transitions. [2022-12-14 19:55:27,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-12-14 19:55:27,666 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:27,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-14 19:55:27,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:27,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1035 states and 1275 transitions. [2022-12-14 19:55:27,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1275 transitions. [2022-12-14 19:55:27,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-12-14 19:55:27,850 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:27,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:27,903 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-14 19:55:28,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:28,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1042 states and 1283 transitions. [2022-12-14 19:55:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1283 transitions. [2022-12-14 19:55:28,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-12-14 19:55:28,185 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:28,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:28,251 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-14 19:55:28,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:28,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1044 states and 1284 transitions. [2022-12-14 19:55:28,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1284 transitions. [2022-12-14 19:55:28,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-12-14 19:55:28,524 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:28,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-14 19:55:29,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1051 states and 1293 transitions. [2022-12-14 19:55:29,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1293 transitions. [2022-12-14 19:55:29,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-12-14 19:55:29,087 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:29,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:55:29,173 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-14 19:55:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:55:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1052 states and 1293 transitions. [2022-12-14 19:55:29,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1293 transitions. [2022-12-14 19:55:29,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-12-14 19:55:29,231 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:55:29,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:55:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 19:55:29,266 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 19:55:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 19:55:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 19:55:29,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 19:55:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 19:55:29,523 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 77 iterations. [2022-12-14 19:55:29,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 07:55:29 ImpRootNode [2022-12-14 19:55:29,666 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 19:55:29,667 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 19:55:29,667 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 19:55:29,667 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 19:55:29,668 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:55:04" (3/4) ... [2022-12-14 19:55:29,669 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 19:55:29,771 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f7e838-551f-402f-84d0-f14c831c15b3/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 19:55:29,771 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 19:55:29,772 INFO L158 Benchmark]: Toolchain (without parser) took 26597.39ms. Allocated memory was 155.2MB in the beginning and 553.6MB in the end (delta: 398.5MB). Free memory was 120.5MB in the beginning and 356.1MB in the end (delta: -235.6MB). Peak memory consumption was 165.2MB. Max. memory is 16.1GB. [2022-12-14 19:55:29,772 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 19:55:29,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.19ms. Allocated memory is still 155.2MB. Free memory was 120.2MB in the beginning and 93.1MB in the end (delta: 27.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-14 19:55:29,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.14ms. Allocated memory is still 155.2MB. Free memory was 92.9MB in the beginning and 87.2MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-14 19:55:29,773 INFO L158 Benchmark]: Boogie Preprocessor took 37.26ms. Allocated memory is still 155.2MB. Free memory was 87.2MB in the beginning and 82.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 19:55:29,773 INFO L158 Benchmark]: RCFGBuilder took 1033.48ms. Allocated memory was 155.2MB in the beginning and 220.2MB in the end (delta: 65.0MB). Free memory was 82.5MB in the beginning and 179.1MB in the end (delta: -96.6MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. [2022-12-14 19:55:29,773 INFO L158 Benchmark]: CodeCheck took 25023.00ms. Allocated memory was 220.2MB in the beginning and 553.6MB in the end (delta: 333.4MB). Free memory was 179.1MB in the beginning and 373.3MB in the end (delta: -194.2MB). Peak memory consumption was 139.3MB. Max. memory is 16.1GB. [2022-12-14 19:55:29,773 INFO L158 Benchmark]: Witness Printer took 104.64ms. Allocated memory is still 553.6MB. Free memory was 373.3MB in the beginning and 356.1MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 19:55:29,774 INFO L339 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: 24.9s, OverallIterations: 77, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79174 SdHoareTripleChecker+Valid, 154.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76771 mSDsluCounter, 13049 SdHoareTripleChecker+Invalid, 131.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10863 mSDsCounter, 32444 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 185554 IncrementalHoareTripleChecker+Invalid, 217998 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32444 mSolverCounterUnsat, 2186 mSDtfsCounter, 185554 mSolverCounterSat, 1.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65143 GetRequests, 64111 SyntacticMatches, 588 SemanticMatches, 444 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124118 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 9192 NumberOfCodeBlocks, 9192 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 8941 ConstructedInterpolants, 0 QuantifiedInterpolants, 19080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 76 InterpolantComputations, 75 PerfectInterpolantSequences, 4451/4462 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: 438]: 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 [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [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 TRUE (((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)) [L42] a16 = 5 [L43] a20 = 0 [L44] return 24; VAL [\old(input)=1, \result=24, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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 FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, 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 [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND TRUE ((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15))) [L276] a17 = 0 [L277] return 24; VAL [\old(input)=2, \result=24, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, 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 TRUE ((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5)) [L323] a8 = 13 [L324] a16 = 4 [L325] return -1; VAL [\old(input)=3, \result=-1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, 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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L422] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L425] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L428] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L431] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L434] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L437] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L438] reach_error() VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, 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.15ms. Allocated memory is still 155.2MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.19ms. Allocated memory is still 155.2MB. Free memory was 120.2MB in the beginning and 93.1MB in the end (delta: 27.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.14ms. Allocated memory is still 155.2MB. Free memory was 92.9MB in the beginning and 87.2MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.26ms. Allocated memory is still 155.2MB. Free memory was 87.2MB in the beginning and 82.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1033.48ms. Allocated memory was 155.2MB in the beginning and 220.2MB in the end (delta: 65.0MB). Free memory was 82.5MB in the beginning and 179.1MB in the end (delta: -96.6MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. * CodeCheck took 25023.00ms. Allocated memory was 220.2MB in the beginning and 553.6MB in the end (delta: 333.4MB). Free memory was 179.1MB in the beginning and 373.3MB in the end (delta: -194.2MB). Peak memory consumption was 139.3MB. Max. memory is 16.1GB. * Witness Printer took 104.64ms. Allocated memory is still 553.6MB. Free memory was 373.3MB in the beginning and 356.1MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 19:55:29,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f7e838-551f-402f-84d0-f14c831c15b3/bin/ukojak-rkRKPMF4O4/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