./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label43.c --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version 38b53e6a
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_18031de4-673b-4249-afe2-ffc3627a8cbb/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18031de4-673b-4249-afe2-ffc3627a8cbb/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18031de4-673b-4249-afe2-ffc3627a8cbb/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18031de4-673b-4249-afe2-ffc3627a8cbb/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label43.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18031de4-673b-4249-afe2-ffc3627a8cbb/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18031de4-673b-4249-afe2-ffc3627a8cbb/bin/utaipan-ByfvJB40ur --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 34dbb4950b3457cf98a513c0428fa3aea09e3e6919478fbbfbf6cf9bb32ef81c
--- 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-38b53e6
[2022-11-26 00:14:39,479 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2022-11-26 00:14:39,481 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2022-11-26 00:14:39,507 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-11-26 00:14:39,507 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-11-26 00:14:39,509 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-11-26 00:14:39,511 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-11-26 00:14:39,513 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2022-11-26 00:14:39,515 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-11-26 00:14:39,516 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-11-26 00:14:39,518 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2022-11-26 00:14:39,519 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-11-26 00:14:39,520 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-11-26 00:14:39,522 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-11-26 00:14:39,523 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-11-26 00:14:39,525 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-11-26 00:14:39,526 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-11-26 00:14:39,527 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-11-26 00:14:39,530 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-11-26 00:14:39,532 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2022-11-26 00:14:39,534 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-11-26 00:14:39,536 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-11-26 00:14:39,538 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2022-11-26 00:14:39,539 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-11-26 00:14:39,545 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-11-26 00:14:39,545 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-11-26 00:14:39,546 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-11-26 00:14:39,547 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-11-26 00:14:39,548 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-11-26 00:14:39,549 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-11-26 00:14:39,550 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-11-26 00:14:39,551 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-11-26 00:14:39,552 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-11-26 00:14:39,554 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2022-11-26 00:14:39,555 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-11-26 00:14:39,555 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2022-11-26 00:14:39,556 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-11-26 00:14:39,557 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-11-26 00:14:39,557 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2022-11-26 00:14:39,558 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2022-11-26 00:14:39,559 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2022-11-26 00:14:39,561 INFO  L101        SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18031de4-673b-4249-afe2-ffc3627a8cbb/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf
[2022-11-26 00:14:39,590 INFO  L113        SettingsManager]: Loading preferences was successful
[2022-11-26 00:14:39,591 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2022-11-26 00:14:39,591 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-11-26 00:14:39,592 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-11-26 00:14:39,592 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-11-26 00:14:39,593 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-11-26 00:14:39,593 INFO  L138        SettingsManager]:  * User list type=DISABLED
[2022-11-26 00:14:39,594 INFO  L136        SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2022-11-26 00:14:39,594 INFO  L138        SettingsManager]:  * Explicit value domain=true
[2022-11-26 00:14:39,594 INFO  L138        SettingsManager]:  * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain
[2022-11-26 00:14:39,594 INFO  L138        SettingsManager]:  * Octagon Domain=false
[2022-11-26 00:14:39,595 INFO  L138        SettingsManager]:  * Abstract domain=CompoundDomain
[2022-11-26 00:14:39,595 INFO  L138        SettingsManager]:  * Check feasibility of abstract posts with an SMT solver=true
[2022-11-26 00:14:39,595 INFO  L138        SettingsManager]:  * Use the RCFG-of-the-future interface=true
[2022-11-26 00:14:39,596 INFO  L138        SettingsManager]:  * Interval Domain=false
[2022-11-26 00:14:39,596 INFO  L136        SettingsManager]: Preferences of Sifa differ from their defaults:
[2022-11-26 00:14:39,596 INFO  L138        SettingsManager]:  * Call Summarizer=TopInputCallSummarizer
[2022-11-26 00:14:39,597 INFO  L138        SettingsManager]:  * Simplification Technique=POLY_PAC
[2022-11-26 00:14:39,598 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-11-26 00:14:39,598 INFO  L138        SettingsManager]:  * sizeof long=4
[2022-11-26 00:14:39,598 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2022-11-26 00:14:39,599 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2022-11-26 00:14:39,599 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2022-11-26 00:14:39,599 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2022-11-26 00:14:39,600 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-11-26 00:14:39,600 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2022-11-26 00:14:39,600 INFO  L138        SettingsManager]:  * sizeof long double=12
[2022-11-26 00:14:39,601 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2022-11-26 00:14:39,601 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2022-11-26 00:14:39,601 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2022-11-26 00:14:39,602 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-11-26 00:14:39,602 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2022-11-26 00:14:39,602 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-26 00:14:39,603 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-11-26 00:14:39,603 INFO  L138        SettingsManager]:  * Abstract interpretation Mode=USE_PREDICATES
[2022-11-26 00:14:39,603 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2022-11-26 00:14:39,604 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-11-26 00:14:39,604 INFO  L138        SettingsManager]:  * Trace refinement strategy=SIFA_TAIPAN
[2022-11-26 00:14:39,604 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-11-26 00:14:39,605 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-11-26 00:14:39,605 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2022-11-26 00:14:39,605 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_18031de4-673b-4249-afe2-ffc3627a8cbb/bin/utaipan-ByfvJB40ur/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_18031de4-673b-4249-afe2-ffc3627a8cbb/bin/utaipan-ByfvJB40ur
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 -> Taipan
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 -> 34dbb4950b3457cf98a513c0428fa3aea09e3e6919478fbbfbf6cf9bb32ef81c
[2022-11-26 00:14:39,907 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2022-11-26 00:14:39,941 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-11-26 00:14:39,945 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-11-26 00:14:39,946 INFO  L271        PluginConnector]: Initializing CDTParser...
[2022-11-26 00:14:39,948 INFO  L275        PluginConnector]: CDTParser initialized
[2022-11-26 00:14:39,949 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18031de4-673b-4249-afe2-ffc3627a8cbb/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/eca-rers2012/Problem02_label43.c
[2022-11-26 00:14:43,562 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2022-11-26 00:14:43,926 INFO  L351              CDTParser]: Found 1 translation units.
[2022-11-26 00:14:43,926 INFO  L172              CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18031de4-673b-4249-afe2-ffc3627a8cbb/sv-benchmarks/c/eca-rers2012/Problem02_label43.c
[2022-11-26 00:14:43,951 INFO  L394              CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18031de4-673b-4249-afe2-ffc3627a8cbb/bin/utaipan-ByfvJB40ur/data/ad3403113/a826cc41159d41a58c4a9061c2ac3b99/FLAG9540c308e
[2022-11-26 00:14:43,968 INFO  L402              CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18031de4-673b-4249-afe2-ffc3627a8cbb/bin/utaipan-ByfvJB40ur/data/ad3403113/a826cc41159d41a58c4a9061c2ac3b99
[2022-11-26 00:14:43,971 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-11-26 00:14:43,972 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2022-11-26 00:14:43,974 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-11-26 00:14:43,974 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-11-26 00:14:43,986 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2022-11-26 00:14:43,987 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:14:43" (1/1) ...
[2022-11-26 00:14:43,989 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@280eb498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:14:43, skipping insertion in model container
[2022-11-26 00:14:43,990 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:14:43" (1/1) ...
[2022-11-26 00:14:43,999 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2022-11-26 00:14:44,071 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2022-11-26 00:14:44,546 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_18031de4-673b-4249-afe2-ffc3627a8cbb/sv-benchmarks/c/eca-rers2012/Problem02_label43.c[15084,15097]
[2022-11-26 00:14:44,591 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-11-26 00:14:44,603 INFO  L203         MainTranslator]: Completed pre-run
[2022-11-26 00:14:44,686 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_18031de4-673b-4249-afe2-ffc3627a8cbb/sv-benchmarks/c/eca-rers2012/Problem02_label43.c[15084,15097]
[2022-11-26 00:14:44,748 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-11-26 00:14:44,774 INFO  L208         MainTranslator]: Completed translation
[2022-11-26 00:14:44,780 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:14:44 WrapperNode
[2022-11-26 00:14:44,780 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-11-26 00:14:44,795 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-11-26 00:14:44,795 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-11-26 00:14:44,795 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2022-11-26 00:14:44,804 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:14:44" (1/1) ...
[2022-11-26 00:14:44,838 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:14:44" (1/1) ...
[2022-11-26 00:14:44,901 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668
[2022-11-26 00:14:44,902 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-11-26 00:14:44,903 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-11-26 00:14:44,903 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2022-11-26 00:14:44,903 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2022-11-26 00:14:44,915 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:14:44" (1/1) ...
[2022-11-26 00:14:44,916 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:14:44" (1/1) ...
[2022-11-26 00:14:44,920 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:14:44" (1/1) ...
[2022-11-26 00:14:44,920 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:14:44" (1/1) ...
[2022-11-26 00:14:44,941 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:14:44" (1/1) ...
[2022-11-26 00:14:44,950 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:14:44" (1/1) ...
[2022-11-26 00:14:44,955 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:14:44" (1/1) ...
[2022-11-26 00:14:44,959 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:14:44" (1/1) ...
[2022-11-26 00:14:44,966 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-11-26 00:14:44,967 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-11-26 00:14:44,968 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2022-11-26 00:14:44,968 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2022-11-26 00:14:44,969 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:14:44" (1/1) ...
[2022-11-26 00:14:44,985 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-26 00:14:44,998 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18031de4-673b-4249-afe2-ffc3627a8cbb/bin/utaipan-ByfvJB40ur/z3
[2022-11-26 00:14:45,015 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18031de4-673b-4249-afe2-ffc3627a8cbb/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-11-26 00:14:45,024 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18031de4-673b-4249-afe2-ffc3627a8cbb/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-11-26 00:14:45,072 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-11-26 00:14:45,072 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2022-11-26 00:14:45,072 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-11-26 00:14:45,072 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-11-26 00:14:45,165 INFO  L235             CfgBuilder]: Building ICFG
[2022-11-26 00:14:45,167 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2022-11-26 00:14:46,436 INFO  L276             CfgBuilder]: Performing block encoding
[2022-11-26 00:14:46,729 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-11-26 00:14:46,730 INFO  L300             CfgBuilder]: Removed 1 assume(true) statements.
[2022-11-26 00:14:46,733 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:14:46 BoogieIcfgContainer
[2022-11-26 00:14:46,733 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-11-26 00:14:46,736 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-11-26 00:14:46,736 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2022-11-26 00:14:46,740 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2022-11-26 00:14:46,740 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:14:43" (1/3) ...
[2022-11-26 00:14:46,742 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c75e3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:14:46, skipping insertion in model container
[2022-11-26 00:14:46,742 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:14:44" (2/3) ...
[2022-11-26 00:14:46,743 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c75e3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:14:46, skipping insertion in model container
[2022-11-26 00:14:46,743 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:14:46" (3/3) ...
[2022-11-26 00:14:46,745 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem02_label43.c
[2022-11-26 00:14:46,766 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-11-26 00:14:46,767 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-11-26 00:14:46,838 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-11-26 00:14:46,848 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@25b040f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2022-11-26 00:14:46,849 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-11-26 00:14:46,854 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 85 states, 83 states have (on average 1.9518072289156627) internal successors, (162), 84 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-26 00:14:46,863 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2022-11-26 00:14:46,864 INFO  L187           NwaCegarLoop]: Found error trace
[2022-11-26 00:14:46,865 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-26 00:14:46,865 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-26 00:14:46,872 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-11-26 00:14:46,873 INFO  L85        PathProgramCache]: Analyzing trace with hash 1814569684, now seen corresponding path program 1 times
[2022-11-26 00:14:46,883 INFO  L118   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-11-26 00:14:46,884 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24292946]
[2022-11-26 00:14:46,884 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-26 00:14:46,885 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-26 00:14:47,093 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-26 00:14:47,511 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-26 00:14:47,512 INFO  L136   FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-11-26 00:14:47,512 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24292946]
[2022-11-26 00:14:47,513 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24292946] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-26 00:14:47,513 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-26 00:14:47,514 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-26 00:14:47,516 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252797673]
[2022-11-26 00:14:47,517 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-26 00:14:47,522 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-26 00:14:47,522 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-11-26 00:14:47,555 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-26 00:14:47,556 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-26 00:14:47,559 INFO  L87              Difference]: Start difference. First operand  has 85 states, 83 states have (on average 1.9518072289156627) internal successors, (162), 84 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-26 00:14:48,195 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-26 00:14:48,196 INFO  L93              Difference]: Finished difference Result 251 states and 482 transitions.
[2022-11-26 00:14:48,197 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-11-26 00:14:48,199 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80
[2022-11-26 00:14:48,200 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-26 00:14:48,211 INFO  L225             Difference]: With dead ends: 251
[2022-11-26 00:14:48,212 INFO  L226             Difference]: Without dead ends: 163
[2022-11-26 00:14:48,215 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-26 00:14:48,219 INFO  L413           NwaCegarLoop]: 60 mSDtfsCounter, 5 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-11-26 00:14:48,220 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 65 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-11-26 00:14:48,240 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 163 states.
[2022-11-26 00:14:48,265 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163.
[2022-11-26 00:14:48,267 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 163 states, 162 states have (on average 1.5617283950617284) internal successors, (253), 162 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-26 00:14:48,268 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 253 transitions.
[2022-11-26 00:14:48,270 INFO  L78                 Accepts]: Start accepts. Automaton has 163 states and 253 transitions. Word has length 80
[2022-11-26 00:14:48,270 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-11-26 00:14:48,271 INFO  L495      AbstractCegarLoop]: Abstraction has 163 states and 253 transitions.
[2022-11-26 00:14:48,271 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-26 00:14:48,271 INFO  L276                IsEmpty]: Start isEmpty. Operand 163 states and 253 transitions.
[2022-11-26 00:14:48,274 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2022-11-26 00:14:48,274 INFO  L187           NwaCegarLoop]: Found error trace
[2022-11-26 00:14:48,275 INFO  L195           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-26 00:14:48,275 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-11-26 00:14:48,276 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-26 00:14:48,276 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-11-26 00:14:48,276 INFO  L85        PathProgramCache]: Analyzing trace with hash -483711241, now seen corresponding path program 1 times
[2022-11-26 00:14:48,277 INFO  L118   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-11-26 00:14:48,277 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959829632]
[2022-11-26 00:14:48,277 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-26 00:14:48,277 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-26 00:14:48,320 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-26 00:14:48,486 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-26 00:14:48,486 INFO  L136   FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-11-26 00:14:48,486 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959829632]
[2022-11-26 00:14:48,487 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959829632] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-26 00:14:48,487 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-26 00:14:48,487 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-26 00:14:48,487 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857555963]
[2022-11-26 00:14:48,488 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-26 00:14:48,489 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-26 00:14:48,490 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-11-26 00:14:48,490 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-26 00:14:48,491 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-26 00:14:48,491 INFO  L87              Difference]: Start difference. First operand 163 states and 253 transitions. Second operand  has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-26 00:14:49,022 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-26 00:14:49,022 INFO  L93              Difference]: Finished difference Result 405 states and 661 transitions.
[2022-11-26 00:14:49,022 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-11-26 00:14:49,023 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85
[2022-11-26 00:14:49,023 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-26 00:14:49,025 INFO  L225             Difference]: With dead ends: 405
[2022-11-26 00:14:49,025 INFO  L226             Difference]: Without dead ends: 243
[2022-11-26 00:14:49,026 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-26 00:14:49,028 INFO  L413           NwaCegarLoop]: 126 mSDtfsCounter, 11 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-11-26 00:14:49,029 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 130 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-11-26 00:14:49,030 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 243 states.
[2022-11-26 00:14:49,048 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243.
[2022-11-26 00:14:49,051 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 243 states, 242 states have (on average 1.4793388429752066) internal successors, (358), 242 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-26 00:14:49,055 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 358 transitions.
[2022-11-26 00:14:49,056 INFO  L78                 Accepts]: Start accepts. Automaton has 243 states and 358 transitions. Word has length 85
[2022-11-26 00:14:49,057 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-11-26 00:14:49,061 INFO  L495      AbstractCegarLoop]: Abstraction has 243 states and 358 transitions.
[2022-11-26 00:14:49,061 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-26 00:14:49,062 INFO  L276                IsEmpty]: Start isEmpty. Operand 243 states and 358 transitions.
[2022-11-26 00:14:49,065 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2022-11-26 00:14:49,065 INFO  L187           NwaCegarLoop]: Found error trace
[2022-11-26 00:14:49,066 INFO  L195           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-26 00:14:49,066 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-11-26 00:14:49,066 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-26 00:14:49,067 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-11-26 00:14:49,067 INFO  L85        PathProgramCache]: Analyzing trace with hash 1049106480, now seen corresponding path program 1 times
[2022-11-26 00:14:49,067 INFO  L118   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-11-26 00:14:49,068 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203827835]
[2022-11-26 00:14:49,068 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-26 00:14:49,068 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-26 00:14:49,096 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-26 00:14:49,156 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-26 00:14:49,156 INFO  L136   FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-11-26 00:14:49,156 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203827835]
[2022-11-26 00:14:49,157 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203827835] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-26 00:14:49,157 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-26 00:14:49,157 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-26 00:14:49,157 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856798862]
[2022-11-26 00:14:49,157 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-26 00:14:49,158 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-26 00:14:49,158 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-11-26 00:14:49,159 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-26 00:14:49,159 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-26 00:14:49,159 INFO  L87              Difference]: Start difference. First operand 243 states and 358 transitions. Second operand  has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-26 00:14:49,582 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-26 00:14:49,583 INFO  L93              Difference]: Finished difference Result 725 states and 1071 transitions.
[2022-11-26 00:14:49,583 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-11-26 00:14:49,583 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95
[2022-11-26 00:14:49,584 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-26 00:14:49,586 INFO  L225             Difference]: With dead ends: 725
[2022-11-26 00:14:49,586 INFO  L226             Difference]: Without dead ends: 483
[2022-11-26 00:14:49,587 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-26 00:14:49,589 INFO  L413           NwaCegarLoop]: 25 mSDtfsCounter, 106 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2022-11-26 00:14:49,590 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 28 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2022-11-26 00:14:49,591 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 483 states.
[2022-11-26 00:14:49,609 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483.
[2022-11-26 00:14:49,610 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 483 states, 482 states have (on average 1.3983402489626555) internal successors, (674), 482 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-26 00:14:49,611 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 674 transitions.
[2022-11-26 00:14:49,612 INFO  L78                 Accepts]: Start accepts. Automaton has 483 states and 674 transitions. Word has length 95
[2022-11-26 00:14:49,612 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-11-26 00:14:49,612 INFO  L495      AbstractCegarLoop]: Abstraction has 483 states and 674 transitions.
[2022-11-26 00:14:49,612 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-26 00:14:49,613 INFO  L276                IsEmpty]: Start isEmpty. Operand 483 states and 674 transitions.
[2022-11-26 00:14:49,616 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2022-11-26 00:14:49,616 INFO  L187           NwaCegarLoop]: Found error trace
[2022-11-26 00:14:49,616 INFO  L195           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-26 00:14:49,617 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-11-26 00:14:49,617 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-26 00:14:49,617 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-11-26 00:14:49,618 INFO  L85        PathProgramCache]: Analyzing trace with hash 1283755345, now seen corresponding path program 1 times
[2022-11-26 00:14:49,618 INFO  L118   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-11-26 00:14:49,618 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868612178]
[2022-11-26 00:14:49,618 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-26 00:14:49,619 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-26 00:14:49,656 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-26 00:14:49,766 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-26 00:14:49,766 INFO  L136   FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2022-11-26 00:14:49,766 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868612178]
[2022-11-26 00:14:49,767 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868612178] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-26 00:14:49,767 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-26 00:14:49,767 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-26 00:14:49,767 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608638229]
[2022-11-26 00:14:49,767 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-26 00:14:49,768 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-26 00:14:49,768 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2022-11-26 00:14:49,769 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-26 00:14:49,769 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-26 00:14:49,769 INFO  L87              Difference]: Start difference. First operand 483 states and 674 transitions. Second operand  has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-26 00:14:50,210 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-26 00:14:50,210 INFO  L93              Difference]: Finished difference Result 1445 states and 2019 transitions.
[2022-11-26 00:14:50,210 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-11-26 00:14:50,210 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110
[2022-11-26 00:14:50,211 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-11-26 00:14:50,214 INFO  L225             Difference]: With dead ends: 1445
[2022-11-26 00:14:50,214 INFO  L226             Difference]: Without dead ends: 963
[2022-11-26 00:14:50,216 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-26 00:14:50,217 INFO  L413           NwaCegarLoop]: 27 mSDtfsCounter, 34 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2022-11-26 00:14:50,217 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 31 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2022-11-26 00:14:50,219 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 963 states.
[2022-11-26 00:14:50,247 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 803.
[2022-11-26 00:14:50,248 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 803 states, 802 states have (on average 1.3765586034912718) internal successors, (1104), 802 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-26 00:14:50,251 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1104 transitions.
[2022-11-26 00:14:50,251 INFO  L78                 Accepts]: Start accepts. Automaton has 803 states and 1104 transitions. Word has length 110
[2022-11-26 00:14:50,252 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-11-26 00:14:50,253 INFO  L495      AbstractCegarLoop]: Abstraction has 803 states and 1104 transitions.
[2022-11-26 00:14:50,253 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-26 00:14:50,253 INFO  L276                IsEmpty]: Start isEmpty. Operand 803 states and 1104 transitions.
[2022-11-26 00:14:50,260 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 115
[2022-11-26 00:14:50,260 INFO  L187           NwaCegarLoop]: Found error trace
[2022-11-26 00:14:50,260 INFO  L195           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-26 00:14:50,260 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-11-26 00:14:50,261 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-11-26 00:14:50,261 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-11-26 00:14:50,261 INFO  L85        PathProgramCache]: Analyzing trace with hash 1413205574, now seen corresponding path program 1 times
[2022-11-26 00:14:50,261 INFO  L118   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2022-11-26 00:14:50,262 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577537823]
[2022-11-26 00:14:50,262 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-26 00:14:50,262 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-26 00:14:50,302 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-26 00:14:50,303 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-11-26 00:14:50,329 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-26 00:14:50,378 INFO  L130   FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace
[2022-11-26 00:14:50,379 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2022-11-26 00:14:50,380 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-11-26 00:14:50,383 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-11-26 00:14:50,387 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2022-11-26 00:14:50,391 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2022-11-26 00:14:50,540 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:14:50 BoogieIcfgContainer
[2022-11-26 00:14:50,541 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-11-26 00:14:50,542 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2022-11-26 00:14:50,542 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2022-11-26 00:14:50,543 INFO  L275        PluginConnector]: Witness Printer initialized
[2022-11-26 00:14:50,543 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:14:46" (3/4) ...
[2022-11-26 00:14:50,545 INFO  L131         WitnessPrinter]: Generating witness for reachability counterexample
[2022-11-26 00:14:50,685 INFO  L141         WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18031de4-673b-4249-afe2-ffc3627a8cbb/bin/utaipan-ByfvJB40ur/witness.graphml
[2022-11-26 00:14:50,686 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2022-11-26 00:14:50,686 INFO  L158              Benchmark]: Toolchain (without parser) took 6713.95ms. Allocated memory was 134.2MB in the beginning and 218.1MB in the end (delta: 83.9MB). Free memory was 90.0MB in the beginning and 87.7MB in the end (delta: 2.3MB). Peak memory consumption was 88.5MB. Max. memory is 16.1GB.
[2022-11-26 00:14:50,687 INFO  L158              Benchmark]: CDTParser took 0.35ms. Allocated memory is still 134.2MB. Free memory was 76.1MB in the beginning and 76.0MB in the end (delta: 113.2kB). There was no memory consumed. Max. memory is 16.1GB.
[2022-11-26 00:14:50,687 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 806.56ms. Allocated memory was 134.2MB in the beginning and 180.4MB in the end (delta: 46.1MB). Free memory was 90.0MB in the beginning and 147.9MB in the end (delta: -57.9MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB.
[2022-11-26 00:14:50,687 INFO  L158              Benchmark]: Boogie Procedure Inliner took 107.20ms. Allocated memory is still 180.4MB. Free memory was 149.4MB in the beginning and 144.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2022-11-26 00:14:50,688 INFO  L158              Benchmark]: Boogie Preprocessor took 63.56ms. Allocated memory is still 180.4MB. Free memory was 144.1MB in the beginning and 140.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2022-11-26 00:14:50,688 INFO  L158              Benchmark]: RCFGBuilder took 1766.01ms. Allocated memory is still 180.4MB. Free memory was 140.0MB in the beginning and 88.4MB in the end (delta: 51.6MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB.
[2022-11-26 00:14:50,689 INFO  L158              Benchmark]: TraceAbstraction took 3805.06ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 87.3MB in the beginning and 99.2MB in the end (delta: -11.9MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB.
[2022-11-26 00:14:50,689 INFO  L158              Benchmark]: Witness Printer took 143.90ms. Allocated memory is still 218.1MB. Free memory was 99.2MB in the beginning and 87.7MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2022-11-26 00:14:50,691 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.35ms. Allocated memory is still 134.2MB. Free memory was 76.1MB in the beginning and 76.0MB in the end (delta: 113.2kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 806.56ms. Allocated memory was 134.2MB in the beginning and 180.4MB in the end (delta: 46.1MB). Free memory was 90.0MB in the beginning and 147.9MB in the end (delta: -57.9MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 107.20ms. Allocated memory is still 180.4MB. Free memory was 149.4MB in the beginning and 144.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 63.56ms. Allocated memory is still 180.4MB. Free memory was 144.1MB in the beginning and 140.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1766.01ms. Allocated memory is still 180.4MB. Free memory was 140.0MB in the beginning and 88.4MB in the end (delta: 51.6MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB.
 * TraceAbstraction took 3805.06ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 87.3MB in the beginning and 99.2MB in the end (delta: -11.9MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB.
 * Witness Printer took 143.90ms. Allocated memory is still 218.1MB. Free memory was 99.2MB in the beginning and 87.7MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - CounterExampleResult [Line: 437]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L17]               int a= 1;
[L18]               int e= 5;
[L19]               int d= 4;
[L20]               int f= 6;
[L21]               int c= 3;
[L24]               int u = 21;
[L25]               int v = 22;
[L26]               int w = 23;
[L27]               int x = 24;
[L28]               int y = 25;
[L29]               int z = 26;
[L32]               int a25 = 0;
[L33]               int a11 = 0;
[L34]               int a28 = 7;
[L35]               int a19 = 1;
[L36]               int a21 = 1;
[L37]               int a17 = 8;
[L613]              int output = -1;
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26]
[L616]  COND TRUE   1
[L619]              int input;
[L620]              input = __VERIFIER_nondet_int()
[L621]  COND FALSE  !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L624]  CALL, EXPR  calculate_output(input)
[L40]   COND FALSE  !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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  !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L48]   COND FALSE  !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9)))))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L52]   COND FALSE  !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8))))))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L57]   COND FALSE  !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L60]   COND FALSE  !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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  !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1)))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L69]   COND FALSE  !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9))))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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  !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1))))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L79]   COND FALSE  !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8))))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L84]   COND FALSE  !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1))))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L92]   COND FALSE  !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8)))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L101]  COND FALSE  !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3))))))))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L105]  COND FALSE  !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1))))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L109]  COND FALSE  !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1)))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L116]  COND FALSE  !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1)))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L123]  COND FALSE  !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3)))))))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1)))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L133]  COND FALSE  !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1)))))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L140]  COND FALSE  !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9)))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L144]  COND FALSE  !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11))))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L149]  COND FALSE  !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9)))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L153]  COND FALSE  !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8)))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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  !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1)))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L164]  COND FALSE  !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8)))))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L169]  COND FALSE  !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1)))
        VAL         [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L175]  COND TRUE   (((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))
[L176]              a25 = 1
[L177]              a28 = 9
[L178]              return 26;
        VAL         [\old(input)=3, \result=26, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L624]  RET, EXPR   calculate_output(input)
[L624]              output = calculate_output(input)
[L616]  COND TRUE   1
[L619]              int input;
[L620]              input = __VERIFIER_nondet_int()
[L621]  COND FALSE  !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L624]  CALL, EXPR  calculate_output(input)
[L40]   COND TRUE   (((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))
[L41]               a28 = 9
[L42]               a11 = 1
[L43]               a25 = 1
[L44]               return -1;
        VAL         [\old(input)=4, \result=-1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L624]  RET, EXPR   calculate_output(input)
[L624]              output = calculate_output(input)
[L616]  COND TRUE   1
[L619]              int input;
[L620]              input = __VERIFIER_nondet_int()
[L621]  COND FALSE  !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L624]  CALL        calculate_output(input)
[L40]   COND FALSE  !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, 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  !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L48]   COND FALSE  !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9)))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L52]   COND FALSE  !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8))))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L57]   COND FALSE  !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L60]   COND FALSE  !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, 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  !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L69]   COND FALSE  !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, 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  !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L79]   COND FALSE  !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L84]   COND FALSE  !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L92]   COND FALSE  !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L101]  COND FALSE  !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3))))))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L105]  COND FALSE  !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L109]  COND FALSE  !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L116]  COND FALSE  !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L123]  COND FALSE  !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3)))))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L133]  COND FALSE  !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1)))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L140]  COND FALSE  !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L144]  COND FALSE  !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L149]  COND FALSE  !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L153]  COND FALSE  !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, 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  !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L164]  COND FALSE  !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8)))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L169]  COND FALSE  !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L179]  COND FALSE  !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L185]  COND FALSE  !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L189]  COND FALSE  !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L195]  COND FALSE  !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L197]  COND FALSE  !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, 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  !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L201]  COND FALSE  !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, 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  !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L208]  COND FALSE  !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1))))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L212]  COND FALSE  !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L222]  COND FALSE  !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L225]  COND FALSE  !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1))))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, 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  !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, 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  !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L235]  COND FALSE  !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L242]  COND FALSE  !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L244]  COND FALSE  !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L247]  COND FALSE  !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L258]  COND FALSE  !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L263]  COND FALSE  !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L269]  COND FALSE  !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1)))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, 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  !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1))))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L286]  COND FALSE  !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1))))))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L290]  COND FALSE  !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1)))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L293]  COND FALSE  !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, 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  !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L301]  COND FALSE  !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L303]  COND FALSE  !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L307]  COND FALSE  !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L319]  COND FALSE  !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L324]  COND FALSE  !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9)))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L338]  COND FALSE  !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L341]  COND FALSE  !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L347]  COND FALSE  !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L359]  COND FALSE  !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L364]  COND FALSE  !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L371]  COND FALSE  !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L378]  COND FALSE  !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L385]  COND FALSE  !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L388]  COND FALSE  !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L390]  COND FALSE  !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L399]  COND FALSE  !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L404]  COND FALSE  !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L408]  COND FALSE  !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L412]  COND FALSE  !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L414]  COND FALSE  !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L417]  COND FALSE  !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11)))))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L419]  COND FALSE  !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1)))))
[L424]  COND FALSE  !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8)))
[L427]  COND FALSE  !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8)))
[L430]  COND FALSE  !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8)))
[L433]  COND FALSE  !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7)))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L436]  COND TRUE   ((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L437]              reach_error()
        VAL         [\old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 156 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 254 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 317 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 958 IncrementalHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 317 mSolverCounterUnsat, 238 mSDtfsCounter, 958 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=803occurred in iteration=4, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 160 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 484 NumberOfCodeBlocks, 484 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 366 ConstructedInterpolants, 0 QuantifiedInterpolants, 945 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 47/47 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2022-11-26 00:14:50,709 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18031de4-673b-4249-afe2-ffc3627a8cbb/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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