./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label33.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_82e23eca-1696-415b-8c5d-f7e997d3f8f2/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e23eca-1696-415b-8c5d-f7e997d3f8f2/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_82e23eca-1696-415b-8c5d-f7e997d3f8f2/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e23eca-1696-415b-8c5d-f7e997d3f8f2/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label33.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e23eca-1696-415b-8c5d-f7e997d3f8f2/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_82e23eca-1696-415b-8c5d-f7e997d3f8f2/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 a90366a5085659577cb1c98c7b11041979a96aff31e8f044fed2c2fa31b4a389 --- 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-15 03:57:04,010 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-15 03:57:04,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-15 03:57:04,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-15 03:57:04,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-15 03:57:04,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-15 03:57:04,026 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-15 03:57:04,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-15 03:57:04,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-15 03:57:04,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-15 03:57:04,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-15 03:57:04,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-15 03:57:04,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-15 03:57:04,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-15 03:57:04,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-15 03:57:04,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-15 03:57:04,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-15 03:57:04,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-15 03:57:04,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-15 03:57:04,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-15 03:57:04,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-15 03:57:04,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-15 03:57:04,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-15 03:57:04,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-15 03:57:04,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-15 03:57:04,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-15 03:57:04,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-15 03:57:04,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-15 03:57:04,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-15 03:57:04,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-15 03:57:04,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-15 03:57:04,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-15 03:57:04,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-15 03:57:04,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-15 03:57:04,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-15 03:57:04,047 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-15 03:57:04,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-15 03:57:04,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-15 03:57:04,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-15 03:57:04,048 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-15 03:57:04,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-15 03:57:04,049 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e23eca-1696-415b-8c5d-f7e997d3f8f2/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-15 03:57:04,070 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-15 03:57:04,070 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-15 03:57:04,071 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-15 03:57:04,071 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-15 03:57:04,071 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-15 03:57:04,072 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-15 03:57:04,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-15 03:57:04,072 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-15 03:57:04,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-15 03:57:04,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-15 03:57:04,072 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-15 03:57:04,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-15 03:57:04,073 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-15 03:57:04,073 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-15 03:57:04,073 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-15 03:57:04,073 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-15 03:57:04,074 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-15 03:57:04,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-15 03:57:04,074 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-15 03:57:04,074 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-15 03:57:04,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-15 03:57:04,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-15 03:57:04,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-15 03:57:04,075 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-15 03:57:04,075 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-15 03:57:04,075 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-15 03:57:04,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-15 03:57:04,076 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-15 03:57:04,076 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_82e23eca-1696-415b-8c5d-f7e997d3f8f2/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_82e23eca-1696-415b-8c5d-f7e997d3f8f2/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 -> a90366a5085659577cb1c98c7b11041979a96aff31e8f044fed2c2fa31b4a389 [2022-12-15 03:57:04,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-15 03:57:04,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-15 03:57:04,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-15 03:57:04,281 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-15 03:57:04,281 INFO L275 PluginConnector]: CDTParser initialized [2022-12-15 03:57:04,282 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e23eca-1696-415b-8c5d-f7e997d3f8f2/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/eca-rers2012/Problem01_label33.c [2022-12-15 03:57:06,858 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-15 03:57:07,050 INFO L351 CDTParser]: Found 1 translation units. [2022-12-15 03:57:07,051 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e23eca-1696-415b-8c5d-f7e997d3f8f2/sv-benchmarks/c/eca-rers2012/Problem01_label33.c [2022-12-15 03:57:07,060 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e23eca-1696-415b-8c5d-f7e997d3f8f2/bin/ukojak-rkRKPMF4O4/data/0d77825fa/f1303759f698441cb275cb24f5dab2e8/FLAGda5a96c29 [2022-12-15 03:57:07,071 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e23eca-1696-415b-8c5d-f7e997d3f8f2/bin/ukojak-rkRKPMF4O4/data/0d77825fa/f1303759f698441cb275cb24f5dab2e8 [2022-12-15 03:57:07,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-15 03:57:07,074 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-15 03:57:07,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-15 03:57:07,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-15 03:57:07,077 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-15 03:57:07,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 03:57:07" (1/1) ... [2022-12-15 03:57:07,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eb58ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:57:07, skipping insertion in model container [2022-12-15 03:57:07,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 03:57:07" (1/1) ... [2022-12-15 03:57:07,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-15 03:57:07,108 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-15 03:57:07,300 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_82e23eca-1696-415b-8c5d-f7e997d3f8f2/sv-benchmarks/c/eca-rers2012/Problem01_label33.c[15127,15140] [2022-12-15 03:57:07,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-15 03:57:07,341 INFO L203 MainTranslator]: Completed pre-run [2022-12-15 03:57:07,396 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_82e23eca-1696-415b-8c5d-f7e997d3f8f2/sv-benchmarks/c/eca-rers2012/Problem01_label33.c[15127,15140] [2022-12-15 03:57:07,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-15 03:57:07,421 INFO L208 MainTranslator]: Completed translation [2022-12-15 03:57:07,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:57:07 WrapperNode [2022-12-15 03:57:07,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-15 03:57:07,423 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-15 03:57:07,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-15 03:57:07,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-15 03:57:07,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:57:07" (1/1) ... [2022-12-15 03:57:07,446 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:57:07" (1/1) ... [2022-12-15 03:57:07,491 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2022-12-15 03:57:07,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-15 03:57:07,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-15 03:57:07,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-15 03:57:07,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-15 03:57:07,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:57:07" (1/1) ... [2022-12-15 03:57:07,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:57:07" (1/1) ... [2022-12-15 03:57:07,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:57:07" (1/1) ... [2022-12-15 03:57:07,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:57:07" (1/1) ... [2022-12-15 03:57:07,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:57:07" (1/1) ... [2022-12-15 03:57:07,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:57:07" (1/1) ... [2022-12-15 03:57:07,542 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:57:07" (1/1) ... [2022-12-15 03:57:07,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:57:07" (1/1) ... [2022-12-15 03:57:07,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-15 03:57:07,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-15 03:57:07,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-15 03:57:07,555 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-15 03:57:07,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 03:57:07" (1/1) ... [2022-12-15 03:57:07,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-15 03:57:07,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e23eca-1696-415b-8c5d-f7e997d3f8f2/bin/ukojak-rkRKPMF4O4/z3 [2022-12-15 03:57:07,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e23eca-1696-415b-8c5d-f7e997d3f8f2/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-15 03:57:07,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e23eca-1696-415b-8c5d-f7e997d3f8f2/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-15 03:57:07,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-15 03:57:07,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-15 03:57:07,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-15 03:57:07,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-15 03:57:07,696 INFO L235 CfgBuilder]: Building ICFG [2022-12-15 03:57:07,698 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-15 03:57:08,463 INFO L276 CfgBuilder]: Performing block encoding [2022-12-15 03:57:08,634 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-15 03:57:08,634 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-15 03:57:08,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 03:57:08 BoogieIcfgContainer [2022-12-15 03:57:08,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-15 03:57:08,637 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-15 03:57:08,637 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-15 03:57:08,645 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-15 03:57:08,645 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 03:57:08" (1/1) ... [2022-12-15 03:57:08,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-15 03:57:08,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:08,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2022-12-15 03:57:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2022-12-15 03:57:08,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-15 03:57:08,700 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:08,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:08,986 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-15 03:57:09,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2022-12-15 03:57:09,329 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2022-12-15 03:57:09,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-15 03:57:09,337 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:09,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:09,435 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-15 03:57:09,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2022-12-15 03:57:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2022-12-15 03:57:09,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-15 03:57:09,582 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:09,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:09,652 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-15 03:57:09,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:09,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 150 states and 244 transitions. [2022-12-15 03:57:09,705 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 244 transitions. [2022-12-15 03:57:09,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-15 03:57:09,706 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:09,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:09,763 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-15 03:57:09,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2022-12-15 03:57:09,866 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2022-12-15 03:57:09,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-15 03:57:09,868 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:09,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:09,944 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-15 03:57:10,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 159 states and 258 transitions. [2022-12-15 03:57:10,058 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 258 transitions. [2022-12-15 03:57:10,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-15 03:57:10,060 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:10,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:10,119 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-15 03:57:10,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 160 states and 259 transitions. [2022-12-15 03:57:10,212 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 259 transitions. [2022-12-15 03:57:10,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-15 03:57:10,215 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:10,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:10,328 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-15 03:57:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:10,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 168 states and 268 transitions. [2022-12-15 03:57:10,414 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 268 transitions. [2022-12-15 03:57:10,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-15 03:57:10,415 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:10,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:10,537 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-15 03:57:10,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 182 states and 286 transitions. [2022-12-15 03:57:10,741 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 286 transitions. [2022-12-15 03:57:10,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-15 03:57:10,742 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:10,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:10,814 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-15 03:57:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:11,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 197 states and 306 transitions. [2022-12-15 03:57:11,092 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 306 transitions. [2022-12-15 03:57:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-15 03:57:11,092 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:11,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:11,203 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-15 03:57:11,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:11,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 212 states and 327 transitions. [2022-12-15 03:57:11,630 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 327 transitions. [2022-12-15 03:57:11,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-15 03:57:11,630 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:11,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:11,692 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-15 03:57:12,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:12,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 230 states and 356 transitions. [2022-12-15 03:57:12,117 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2022-12-15 03:57:12,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-15 03:57:12,118 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:12,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:12,192 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-15 03:57:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 246 states and 387 transitions. [2022-12-15 03:57:12,689 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 387 transitions. [2022-12-15 03:57:12,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-15 03:57:12,690 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:12,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:12,774 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-15 03:57:12,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:12,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 251 states and 393 transitions. [2022-12-15 03:57:12,861 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 393 transitions. [2022-12-15 03:57:12,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-15 03:57:12,862 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:12,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:12,967 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-15 03:57:13,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:13,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 252 states and 394 transitions. [2022-12-15 03:57:13,093 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 394 transitions. [2022-12-15 03:57:13,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-15 03:57:13,094 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:13,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:13,165 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-15 03:57:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 271 states and 424 transitions. [2022-12-15 03:57:13,760 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 424 transitions. [2022-12-15 03:57:13,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-15 03:57:13,761 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:13,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:13,796 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-15 03:57:13,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:13,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 272 states and 425 transitions. [2022-12-15 03:57:13,925 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 425 transitions. [2022-12-15 03:57:13,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-15 03:57:13,926 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:13,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:13,997 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-15 03:57:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 287 states and 444 transitions. [2022-12-15 03:57:14,487 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 444 transitions. [2022-12-15 03:57:14,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-12-15 03:57:14,488 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:14,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:14,530 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-15 03:57:15,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:15,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 305 states and 464 transitions. [2022-12-15 03:57:15,068 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 464 transitions. [2022-12-15 03:57:15,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-12-15 03:57:15,069 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:15,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:15,130 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-15 03:57:15,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:15,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 309 states and 468 transitions. [2022-12-15 03:57:15,156 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 468 transitions. [2022-12-15 03:57:15,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-15 03:57:15,157 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:15,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:15,214 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-15 03:57:15,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:15,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 313 states and 475 transitions. [2022-12-15 03:57:15,431 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 475 transitions. [2022-12-15 03:57:15,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-15 03:57:15,432 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:15,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:15,528 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-15 03:57:15,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 314 states and 477 transitions. [2022-12-15 03:57:15,611 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 477 transitions. [2022-12-15 03:57:15,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-15 03:57:15,611 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:15,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:15,647 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-15 03:57:16,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:16,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 322 states and 492 transitions. [2022-12-15 03:57:16,063 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 492 transitions. [2022-12-15 03:57:16,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-15 03:57:16,064 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:16,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:16,107 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-15 03:57:16,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:16,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 328 states and 501 transitions. [2022-12-15 03:57:16,261 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 501 transitions. [2022-12-15 03:57:16,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-15 03:57:16,261 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:16,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:16,291 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-15 03:57:16,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:16,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 331 states and 506 transitions. [2022-12-15 03:57:16,437 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 506 transitions. [2022-12-15 03:57:16,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-15 03:57:16,437 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:16,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:16,466 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-15 03:57:16,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:16,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 346 states and 527 transitions. [2022-12-15 03:57:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 527 transitions. [2022-12-15 03:57:16,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-12-15 03:57:16,756 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:16,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:16,813 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-15 03:57:16,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 360 states and 544 transitions. [2022-12-15 03:57:16,976 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 544 transitions. [2022-12-15 03:57:16,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-15 03:57:16,977 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:16,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:17,082 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-15 03:57:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 362 states and 546 transitions. [2022-12-15 03:57:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 546 transitions. [2022-12-15 03:57:17,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-15 03:57:17,236 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:17,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:17,288 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-15 03:57:17,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:17,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 368 states and 553 transitions. [2022-12-15 03:57:17,490 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 553 transitions. [2022-12-15 03:57:17,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-15 03:57:17,490 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:17,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:17,522 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-15 03:57:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:17,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 372 states and 556 transitions. [2022-12-15 03:57:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 556 transitions. [2022-12-15 03:57:17,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-15 03:57:17,556 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:17,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:17,624 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-15 03:57:17,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:17,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 374 states and 559 transitions. [2022-12-15 03:57:17,657 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 559 transitions. [2022-12-15 03:57:17,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-15 03:57:17,657 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:17,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:17,726 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-15 03:57:18,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:18,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 388 states and 577 transitions. [2022-12-15 03:57:18,060 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 577 transitions. [2022-12-15 03:57:18,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-15 03:57:18,061 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:18,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:18,128 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-15 03:57:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:18,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 392 states and 582 transitions. [2022-12-15 03:57:18,284 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 582 transitions. [2022-12-15 03:57:18,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-15 03:57:18,285 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:18,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:18,342 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-15 03:57:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:18,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 394 states and 585 transitions. [2022-12-15 03:57:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 585 transitions. [2022-12-15 03:57:18,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-15 03:57:18,473 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:18,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:18,543 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-15 03:57:18,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:18,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 397 states and 589 transitions. [2022-12-15 03:57:18,594 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 589 transitions. [2022-12-15 03:57:18,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-15 03:57:18,594 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:18,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:18,666 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-15 03:57:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:18,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 406 states and 599 transitions. [2022-12-15 03:57:18,888 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 599 transitions. [2022-12-15 03:57:18,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-15 03:57:18,889 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:18,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:18,963 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-15 03:57:19,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 410 states and 602 transitions. [2022-12-15 03:57:19,121 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 602 transitions. [2022-12-15 03:57:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-15 03:57:19,122 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:19,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:19,227 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-15 03:57:19,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:19,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 413 states and 605 transitions. [2022-12-15 03:57:19,410 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 605 transitions. [2022-12-15 03:57:19,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-12-15 03:57:19,410 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:19,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:19,501 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:57:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 483 states and 683 transitions. [2022-12-15 03:57:19,890 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 683 transitions. [2022-12-15 03:57:19,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-12-15 03:57:19,891 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:19,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:19,945 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-15 03:57:19,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 497 states and 700 transitions. [2022-12-15 03:57:19,999 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 700 transitions. [2022-12-15 03:57:19,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-15 03:57:19,999 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:20,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:20,033 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-15 03:57:20,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:20,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 508 states and 714 transitions. [2022-12-15 03:57:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 714 transitions. [2022-12-15 03:57:20,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-15 03:57:20,124 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:20,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:20,173 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-15 03:57:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:20,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 532 states and 747 transitions. [2022-12-15 03:57:20,469 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 747 transitions. [2022-12-15 03:57:20,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-15 03:57:20,469 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:20,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:20,518 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-15 03:57:20,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 536 states and 751 transitions. [2022-12-15 03:57:20,666 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 751 transitions. [2022-12-15 03:57:20,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-15 03:57:20,667 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:20,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:20,701 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-15 03:57:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:20,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 538 states and 753 transitions. [2022-12-15 03:57:20,786 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 753 transitions. [2022-12-15 03:57:20,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-15 03:57:20,786 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:20,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:20,820 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-15 03:57:20,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:20,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 545 states and 760 transitions. [2022-12-15 03:57:20,961 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 760 transitions. [2022-12-15 03:57:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-15 03:57:20,961 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:20,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:21,003 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-15 03:57:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:21,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 583 states and 804 transitions. [2022-12-15 03:57:21,494 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 804 transitions. [2022-12-15 03:57:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-15 03:57:21,494 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:21,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:21,546 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-15 03:57:21,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:21,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 586 states and 806 transitions. [2022-12-15 03:57:21,683 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 806 transitions. [2022-12-15 03:57:21,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-15 03:57:21,684 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:21,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:21,731 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-15 03:57:21,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:21,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 589 states and 808 transitions. [2022-12-15 03:57:21,880 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 808 transitions. [2022-12-15 03:57:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-15 03:57:21,880 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:21,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:21,954 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-15 03:57:22,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 603 states and 825 transitions. [2022-12-15 03:57:22,046 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 825 transitions. [2022-12-15 03:57:22,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-15 03:57:22,047 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:22,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:22,083 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-15 03:57:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 612 states and 834 transitions. [2022-12-15 03:57:22,261 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 834 transitions. [2022-12-15 03:57:22,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-15 03:57:22,262 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:22,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:22,326 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:57:22,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 620 states and 843 transitions. [2022-12-15 03:57:22,483 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 843 transitions. [2022-12-15 03:57:22,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-12-15 03:57:22,484 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:22,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:22,528 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-15 03:57:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:23,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 717 states and 950 transitions. [2022-12-15 03:57:23,294 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 950 transitions. [2022-12-15 03:57:23,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-12-15 03:57:23,295 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:23,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:23,367 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-15 03:57:23,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 739 states and 973 transitions. [2022-12-15 03:57:23,654 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 973 transitions. [2022-12-15 03:57:23,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-12-15 03:57:23,655 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:23,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:23,703 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-15 03:57:23,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:23,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 742 states and 975 transitions. [2022-12-15 03:57:23,811 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 975 transitions. [2022-12-15 03:57:23,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-15 03:57:23,813 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:23,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-15 03:57:24,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 753 states and 988 transitions. [2022-12-15 03:57:24,141 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 988 transitions. [2022-12-15 03:57:24,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-15 03:57:24,141 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:24,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-15 03:57:24,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 767 states and 1005 transitions. [2022-12-15 03:57:24,470 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1005 transitions. [2022-12-15 03:57:24,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-15 03:57:24,471 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:24,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:24,548 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-15 03:57:24,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:24,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 786 states and 1025 transitions. [2022-12-15 03:57:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1025 transitions. [2022-12-15 03:57:24,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-12-15 03:57:24,832 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:24,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:24,873 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-15 03:57:24,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 791 states and 1029 transitions. [2022-12-15 03:57:24,989 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1029 transitions. [2022-12-15 03:57:24,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-12-15 03:57:24,990 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:24,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:25,029 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-15 03:57:25,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:25,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 796 states and 1033 transitions. [2022-12-15 03:57:25,135 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1033 transitions. [2022-12-15 03:57:25,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-15 03:57:25,136 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:25,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:25,228 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-15 03:57:25,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 799 states and 1036 transitions. [2022-12-15 03:57:25,287 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1036 transitions. [2022-12-15 03:57:25,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-15 03:57:25,287 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:25,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:25,356 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-15 03:57:25,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 822 states and 1059 transitions. [2022-12-15 03:57:25,495 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1059 transitions. [2022-12-15 03:57:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-12-15 03:57:25,496 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:25,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:25,562 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-15 03:57:25,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:25,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 823 states and 1059 transitions. [2022-12-15 03:57:25,620 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1059 transitions. [2022-12-15 03:57:25,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-12-15 03:57:25,621 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:25,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:25,719 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-15 03:57:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 843 states and 1079 transitions. [2022-12-15 03:57:25,974 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1079 transitions. [2022-12-15 03:57:25,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-12-15 03:57:25,974 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:25,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:26,018 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-15 03:57:26,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:26,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 845 states and 1082 transitions. [2022-12-15 03:57:26,270 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1082 transitions. [2022-12-15 03:57:26,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-12-15 03:57:26,271 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:26,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:26,328 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-15 03:57:26,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 856 states and 1094 transitions. [2022-12-15 03:57:26,398 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1094 transitions. [2022-12-15 03:57:26,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-12-15 03:57:26,399 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:26,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:26,456 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-15 03:57:27,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:27,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 887 states and 1129 transitions. [2022-12-15 03:57:27,058 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1129 transitions. [2022-12-15 03:57:27,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-12-15 03:57:27,059 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:27,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-15 03:57:27,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:27,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 928 states and 1179 transitions. [2022-12-15 03:57:27,600 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1179 transitions. [2022-12-15 03:57:27,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-12-15 03:57:27,600 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:27,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:27,662 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-15 03:57:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:27,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 932 states and 1184 transitions. [2022-12-15 03:57:27,715 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1184 transitions. [2022-12-15 03:57:27,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-12-15 03:57:27,716 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:27,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:27,778 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-15 03:57:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:27,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 933 states and 1184 transitions. [2022-12-15 03:57:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1184 transitions. [2022-12-15 03:57:27,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-12-15 03:57:27,926 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:27,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:28,023 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-15 03:57:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:28,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 942 states and 1193 transitions. [2022-12-15 03:57:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1193 transitions. [2022-12-15 03:57:28,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-15 03:57:28,269 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:28,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:28,690 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 91 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:57:31,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:31,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1015 states and 1291 transitions. [2022-12-15 03:57:31,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1291 transitions. [2022-12-15 03:57:31,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-15 03:57:31,727 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:31,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:31,897 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 91 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:57:32,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1031 states and 1307 transitions. [2022-12-15 03:57:32,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1307 transitions. [2022-12-15 03:57:32,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-15 03:57:32,965 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:32,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:33,131 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 91 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:57:33,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:33,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1035 states and 1312 transitions. [2022-12-15 03:57:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1312 transitions. [2022-12-15 03:57:33,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-15 03:57:33,432 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:33,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:33,607 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 91 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:57:34,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:34,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1044 states and 1323 transitions. [2022-12-15 03:57:34,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1323 transitions. [2022-12-15 03:57:34,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-12-15 03:57:34,152 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:34,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:34,227 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-15 03:57:35,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:35,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1083 states and 1377 transitions. [2022-12-15 03:57:35,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1377 transitions. [2022-12-15 03:57:35,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-12-15 03:57:35,774 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:35,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:35,848 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-15 03:57:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1099 states and 1397 transitions. [2022-12-15 03:57:36,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1397 transitions. [2022-12-15 03:57:36,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-12-15 03:57:36,244 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:36,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-15 03:57:36,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1112 states and 1413 transitions. [2022-12-15 03:57:36,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1413 transitions. [2022-12-15 03:57:36,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-12-15 03:57:36,797 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:36,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:36,871 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-15 03:57:37,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:37,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1121 states and 1422 transitions. [2022-12-15 03:57:37,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1422 transitions. [2022-12-15 03:57:37,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-15 03:57:37,093 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:37,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:37,446 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 90 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 03:57:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1205 states and 1526 transitions. [2022-12-15 03:57:39,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1526 transitions. [2022-12-15 03:57:39,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-15 03:57:39,736 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:39,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:40,010 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-15 03:57:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1273 states and 1595 transitions. [2022-12-15 03:57:41,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1595 transitions. [2022-12-15 03:57:41,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-15 03:57:41,131 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:41,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:41,298 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-15 03:57:41,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:41,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1276 states and 1597 transitions. [2022-12-15 03:57:41,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1597 transitions. [2022-12-15 03:57:41,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-15 03:57:41,485 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:41,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:41,551 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-15 03:57:42,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:42,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1312 states and 1632 transitions. [2022-12-15 03:57:42,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1632 transitions. [2022-12-15 03:57:42,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-15 03:57:42,904 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:42,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-15 03:57:43,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1315 states and 1634 transitions. [2022-12-15 03:57:43,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1634 transitions. [2022-12-15 03:57:43,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-12-15 03:57:43,134 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:43,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:43,201 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-15 03:57:43,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:43,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1317 states and 1636 transitions. [2022-12-15 03:57:43,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1636 transitions. [2022-12-15 03:57:43,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-12-15 03:57:43,484 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:43,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:43,551 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-15 03:57:43,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:43,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1321 states and 1640 transitions. [2022-12-15 03:57:43,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1640 transitions. [2022-12-15 03:57:43,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-12-15 03:57:43,877 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:43,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:43,977 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-15 03:57:44,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1323 states and 1641 transitions. [2022-12-15 03:57:44,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1641 transitions. [2022-12-15 03:57:44,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-15 03:57:44,328 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:44,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:44,413 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 03:57:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1347 states and 1668 transitions. [2022-12-15 03:57:44,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1668 transitions. [2022-12-15 03:57:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-15 03:57:44,820 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:44,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:44,905 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-15 03:57:45,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:45,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1352 states and 1671 transitions. [2022-12-15 03:57:45,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1671 transitions. [2022-12-15 03:57:45,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-12-15 03:57:45,336 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:45,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-12-15 03:57:46,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1375 states and 1697 transitions. [2022-12-15 03:57:46,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1697 transitions. [2022-12-15 03:57:46,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-12-15 03:57:46,206 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:46,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-15 03:57:46,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:46,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1381 states and 1701 transitions. [2022-12-15 03:57:46,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1701 transitions. [2022-12-15 03:57:46,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-12-15 03:57:46,714 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:46,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:46,819 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-15 03:57:46,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:46,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1420 states and 1740 transitions. [2022-12-15 03:57:46,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1740 transitions. [2022-12-15 03:57:46,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-12-15 03:57:46,999 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:46,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:47,086 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-12-15 03:57:47,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1421 states and 1740 transitions. [2022-12-15 03:57:47,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1740 transitions. [2022-12-15 03:57:47,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-12-15 03:57:47,130 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:47,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:47,217 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-15 03:57:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1483 states and 1808 transitions. [2022-12-15 03:57:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1808 transitions. [2022-12-15 03:57:48,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-12-15 03:57:48,806 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:48,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-15 03:57:49,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:49,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1494 states and 1817 transitions. [2022-12-15 03:57:49,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1817 transitions. [2022-12-15 03:57:49,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-12-15 03:57:49,492 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:49,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:49,544 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-12-15 03:57:49,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:49,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1506 states and 1831 transitions. [2022-12-15 03:57:49,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1831 transitions. [2022-12-15 03:57:49,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-12-15 03:57:49,811 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:49,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:49,875 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-15 03:57:50,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1515 states and 1840 transitions. [2022-12-15 03:57:50,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1840 transitions. [2022-12-15 03:57:50,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-12-15 03:57:50,342 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:50,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:50,441 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-15 03:57:50,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:50,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1517 states and 1841 transitions. [2022-12-15 03:57:50,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1841 transitions. [2022-12-15 03:57:50,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-12-15 03:57:50,642 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:50,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:50,703 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-12-15 03:57:51,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1521 states and 1847 transitions. [2022-12-15 03:57:51,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1847 transitions. [2022-12-15 03:57:51,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-12-15 03:57:51,014 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:51,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:51,071 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-12-15 03:57:51,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:51,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1524 states and 1848 transitions. [2022-12-15 03:57:51,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1848 transitions. [2022-12-15 03:57:51,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-15 03:57:51,366 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:51,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 145 proven. 23 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-15 03:57:53,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:53,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1558 states and 1889 transitions. [2022-12-15 03:57:53,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 1889 transitions. [2022-12-15 03:57:53,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-12-15 03:57:53,370 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:53,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:53,430 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-15 03:57:53,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:53,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1560 states and 1890 transitions. [2022-12-15 03:57:53,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1890 transitions. [2022-12-15 03:57:53,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-12-15 03:57:53,584 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:53,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:53,644 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-15 03:57:53,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1562 states and 1891 transitions. [2022-12-15 03:57:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 1891 transitions. [2022-12-15 03:57:53,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-12-15 03:57:53,798 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:53,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-15 03:57:54,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:54,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1564 states and 1892 transitions. [2022-12-15 03:57:54,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1892 transitions. [2022-12-15 03:57:54,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-15 03:57:54,032 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:54,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:54,101 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-12-15 03:57:54,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:54,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1565 states and 1892 transitions. [2022-12-15 03:57:54,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1892 transitions. [2022-12-15 03:57:54,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-12-15 03:57:54,163 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:54,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 194 proven. 35 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-15 03:57:55,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1590 states and 1920 transitions. [2022-12-15 03:57:55,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 1920 transitions. [2022-12-15 03:57:55,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-12-15 03:57:55,208 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:55,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:55,338 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-15 03:57:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1980 states to 1650 states and 1980 transitions. [2022-12-15 03:57:55,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 1980 transitions. [2022-12-15 03:57:55,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-12-15 03:57:55,639 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:55,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 03:57:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-12-15 03:57:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 03:57:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1652 states and 1981 transitions. [2022-12-15 03:57:55,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 1981 transitions. [2022-12-15 03:57:55,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-12-15 03:57:55,758 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 03:57:55,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 03:57:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 03:57:55,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-15 03:57:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 03:57:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 03:57:55,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-15 03:57:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 03:57:56,029 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 107 iterations. [2022-12-15 03:57:56,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 15.12 03:57:56 ImpRootNode [2022-12-15 03:57:56,206 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-15 03:57:56,206 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-15 03:57:56,207 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-15 03:57:56,207 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-15 03:57:56,207 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 03:57:08" (3/4) ... [2022-12-15 03:57:56,209 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-15 03:57:56,297 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e23eca-1696-415b-8c5d-f7e997d3f8f2/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-15 03:57:56,297 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-15 03:57:56,297 INFO L158 Benchmark]: Toolchain (without parser) took 49223.67ms. Allocated memory was 146.8MB in the beginning and 1.0GB in the end (delta: 857.7MB). Free memory was 104.0MB in the beginning and 514.1MB in the end (delta: -410.2MB). Peak memory consumption was 449.1MB. Max. memory is 16.1GB. [2022-12-15 03:57:56,297 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory is still 90.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-15 03:57:56,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.69ms. Allocated memory is still 146.8MB. Free memory was 104.0MB in the beginning and 76.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-15 03:57:56,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.95ms. Allocated memory is still 146.8MB. Free memory was 76.7MB in the beginning and 71.1MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-15 03:57:56,298 INFO L158 Benchmark]: Boogie Preprocessor took 61.76ms. Allocated memory is still 146.8MB. Free memory was 71.1MB in the beginning and 66.7MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-15 03:57:56,298 INFO L158 Benchmark]: RCFGBuilder took 1081.93ms. Allocated memory was 146.8MB in the beginning and 190.8MB in the end (delta: 44.0MB). Free memory was 66.7MB in the beginning and 121.3MB in the end (delta: -54.6MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2022-12-15 03:57:56,298 INFO L158 Benchmark]: CodeCheck took 47568.93ms. Allocated memory was 190.8MB in the beginning and 1.0GB in the end (delta: 813.7MB). Free memory was 121.3MB in the beginning and 534.1MB in the end (delta: -412.8MB). Peak memory consumption was 403.0MB. Max. memory is 16.1GB. [2022-12-15 03:57:56,298 INFO L158 Benchmark]: Witness Printer took 90.28ms. Allocated memory is still 1.0GB. Free memory was 534.1MB in the beginning and 514.1MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-15 03:57:56,299 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: 47.4s, OverallIterations: 107, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171628 SdHoareTripleChecker+Valid, 307.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168265 mSDsluCounter, 26176 SdHoareTripleChecker+Invalid, 263.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22016 mSDsCounter, 55246 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 384543 IncrementalHoareTripleChecker+Invalid, 439789 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55246 mSolverCounterUnsat, 4160 mSDtfsCounter, 384543 mSolverCounterSat, 2.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101583 GetRequests, 99362 SyntacticMatches, 1517 SemanticMatches, 704 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304242 ImplicationChecksByTransitivity, 29.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 14438 NumberOfCodeBlocks, 14438 NumberOfCodeBlocksAsserted, 107 NumberOfCheckSat, 14119 ConstructedInterpolants, 0 QuantifiedInterpolants, 41726 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 106 InterpolantComputations, 99 PerfectInterpolantSequences, 8831/9041 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: 417]: 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 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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 FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(input)=3, 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, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(input)=3, 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, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(input)=3, 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, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(input)=3, 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, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(input)=3, 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, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [\old(input)=3, \result=21, a=1, a12=8, a16=4, a17=0, a20=1, 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] [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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [\old(input)=4, \result=21, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [\old(input)=4, \result=26, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=1, a=1, a12=8, a16=6, a17=0, 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] [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=6, a17=0, 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] [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=6, a17=0, 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] [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=6, a17=0, 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] [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=6, a17=0, 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] [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=6, a17=0, 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] [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=6, a17=0, 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] [L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [\old(input)=1, \result=26, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, 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] [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=1, a20=1, a21=0, a7=1, 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] [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=1, a20=1, a21=0, a7=1, 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] [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=1, a20=1, a21=0, a7=1, 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] [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=1, a20=1, a21=0, a7=1, 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] [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=1, a20=1, a21=0, a7=1, 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] [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=1, a20=1, a21=0, a7=1, 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] [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=1, a20=1, a21=0, a7=1, 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] [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=1, a20=1, a21=0, a7=1, 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] [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=1, a20=1, a21=0, a7=1, 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] [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=1, a20=1, a21=0, a7=1, 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] [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=1, a20=1, a21=0, a7=1, 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] [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=1, a20=1, a21=0, a7=1, 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] [L112] COND TRUE (((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1)) [L113] a20 = 0 [L114] a8 = 15 [L115] a17 = 0 [L116] a21 = 1 [L117] return -1; VAL [\old(input)=3, \result=-1, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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] [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)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND 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)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, 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))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L416] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L417] reach_error() VAL [\old(input)=6, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory is still 90.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.69ms. Allocated memory is still 146.8MB. Free memory was 104.0MB in the beginning and 76.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.95ms. Allocated memory is still 146.8MB. Free memory was 76.7MB in the beginning and 71.1MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.76ms. Allocated memory is still 146.8MB. Free memory was 71.1MB in the beginning and 66.7MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1081.93ms. Allocated memory was 146.8MB in the beginning and 190.8MB in the end (delta: 44.0MB). Free memory was 66.7MB in the beginning and 121.3MB in the end (delta: -54.6MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * CodeCheck took 47568.93ms. Allocated memory was 190.8MB in the beginning and 1.0GB in the end (delta: 813.7MB). Free memory was 121.3MB in the beginning and 534.1MB in the end (delta: -412.8MB). Peak memory consumption was 403.0MB. Max. memory is 16.1GB. * Witness Printer took 90.28ms. Allocated memory is still 1.0GB. Free memory was 534.1MB in the beginning and 514.1MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-15 03:57:56,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82e23eca-1696-415b-8c5d-f7e997d3f8f2/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