./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label47.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 63182f13
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label47.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 963f44e67d66478e2f09b1d76f69d50cb14e9cad52cbcb2ea23267dbf5fe671d
--- Real Ultimate output ---
This is Ultimate 0.2.1-dev-63182f1
[2021-11-13 17:40:29,523 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-11-13 17:40:29,525 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-11-13 17:40:29,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-11-13 17:40:29,572 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-11-13 17:40:29,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-11-13 17:40:29,579 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-11-13 17:40:29,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-11-13 17:40:29,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-11-13 17:40:29,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-11-13 17:40:29,595 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-11-13 17:40:29,597 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-11-13 17:40:29,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-11-13 17:40:29,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-11-13 17:40:29,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-11-13 17:40:29,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-11-13 17:40:29,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-11-13 17:40:29,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-11-13 17:40:29,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-11-13 17:40:29,622 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-11-13 17:40:29,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-11-13 17:40:29,626 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-11-13 17:40:29,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-11-13 17:40:29,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-11-13 17:40:29,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-11-13 17:40:29,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-11-13 17:40:29,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-11-13 17:40:29,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-11-13 17:40:29,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-11-13 17:40:29,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-11-13 17:40:29,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-11-13 17:40:29,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-11-13 17:40:29,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-11-13 17:40:29,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-11-13 17:40:29,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-11-13 17:40:29,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-11-13 17:40:29,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-11-13 17:40:29,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-11-13 17:40:29,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-11-13 17:40:29,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-11-13 17:40:29,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-11-13 17:40:29,652 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/config/svcomp-Reach-32bit-Automizer_Default.epf
[2021-11-13 17:40:29,700 INFO L113 SettingsManager]: Loading preferences was successful
[2021-11-13 17:40:29,701 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-11-13 17:40:29,701 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-11-13 17:40:29,702 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-11-13 17:40:29,709 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2021-11-13 17:40:29,710 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2021-11-13 17:40:29,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-11-13 17:40:29,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-11-13 17:40:29,711 INFO L138 SettingsManager]: * Use SBE=true
[2021-11-13 17:40:29,711 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-11-13 17:40:29,712 INFO L138 SettingsManager]: * sizeof long=4
[2021-11-13 17:40:29,713 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-11-13 17:40:29,713 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-11-13 17:40:29,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-11-13 17:40:29,718 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2021-11-13 17:40:29,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-11-13 17:40:29,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2021-11-13 17:40:29,718 INFO L138 SettingsManager]: * sizeof long double=12
[2021-11-13 17:40:29,719 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-11-13 17:40:29,719 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-11-13 17:40:29,719 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2021-11-13 17:40:29,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-11-13 17:40:29,720 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-11-13 17:40:29,720 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-11-13 17:40:29,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-11-13 17:40:29,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-11-13 17:40:29,721 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-11-13 17:40:29,721 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-11-13 17:40:29,721 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-11-13 17:40:29,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-11-13 17:40:29,722 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF
[2021-11-13 17:40:29,722 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2021-11-13 17:40:29,722 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-11-13 17:40:29,723 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2021-11-13 17:40:29,723 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_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/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_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y
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 -> Automizer
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 -> 963f44e67d66478e2f09b1d76f69d50cb14e9cad52cbcb2ea23267dbf5fe671d
[2021-11-13 17:40:29,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-11-13 17:40:30,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-11-13 17:40:30,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-11-13 17:40:30,005 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-11-13 17:40:30,006 INFO L275 PluginConnector]: CDTParser initialized
[2021-11-13 17:40:30,007 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/../../sv-benchmarks/c/eca-rers2012/Problem01_label47.c
[2021-11-13 17:40:30,077 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/data/5356cd8a4/3e9d02ba108e41028f00710ad5a4912c/FLAG32f1f6748
[2021-11-13 17:40:30,711 INFO L306 CDTParser]: Found 1 translation units.
[2021-11-13 17:40:30,712 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/sv-benchmarks/c/eca-rers2012/Problem01_label47.c
[2021-11-13 17:40:30,730 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/data/5356cd8a4/3e9d02ba108e41028f00710ad5a4912c/FLAG32f1f6748
[2021-11-13 17:40:30,929 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/data/5356cd8a4/3e9d02ba108e41028f00710ad5a4912c
[2021-11-13 17:40:30,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-11-13 17:40:30,933 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2021-11-13 17:40:30,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-11-13 17:40:30,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-11-13 17:40:30,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-11-13 17:40:30,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 05:40:30" (1/1) ...
[2021-11-13 17:40:30,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e4e326c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:30, skipping insertion in model container
[2021-11-13 17:40:30,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 05:40:30" (1/1) ...
[2021-11-13 17:40:30,954 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-11-13 17:40:30,996 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-11-13 17:40:31,310 WARN L228 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_3fb4561e-e055-4e9a-833a-03fd5b1089e2/sv-benchmarks/c/eca-rers2012/Problem01_label47.c[14627,14640]
[2021-11-13 17:40:31,376 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-11-13 17:40:31,398 INFO L203 MainTranslator]: Completed pre-run
[2021-11-13 17:40:31,509 WARN L228 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_3fb4561e-e055-4e9a-833a-03fd5b1089e2/sv-benchmarks/c/eca-rers2012/Problem01_label47.c[14627,14640]
[2021-11-13 17:40:31,540 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-11-13 17:40:31,557 INFO L208 MainTranslator]: Completed translation
[2021-11-13 17:40:31,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:31 WrapperNode
[2021-11-13 17:40:31,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-11-13 17:40:31,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-11-13 17:40:31,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-11-13 17:40:31,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-11-13 17:40:31,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:31" (1/1) ...
[2021-11-13 17:40:31,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:31" (1/1) ...
[2021-11-13 17:40:31,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-11-13 17:40:31,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-11-13 17:40:31,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-11-13 17:40:31,659 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-11-13 17:40:31,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:31" (1/1) ...
[2021-11-13 17:40:31,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:31" (1/1) ...
[2021-11-13 17:40:31,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:31" (1/1) ...
[2021-11-13 17:40:31,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:31" (1/1) ...
[2021-11-13 17:40:31,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:31" (1/1) ...
[2021-11-13 17:40:31,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:31" (1/1) ...
[2021-11-13 17:40:31,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:31" (1/1) ...
[2021-11-13 17:40:31,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-11-13 17:40:31,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-11-13 17:40:31,736 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-11-13 17:40:31,737 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-11-13 17:40:31,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:31" (1/1) ...
[2021-11-13 17:40:31,746 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-11-13 17:40:31,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/z3
[2021-11-13 17:40:31,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2021-11-13 17:40:31,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2021-11-13 17:40:31,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-11-13 17:40:31,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-11-13 17:40:31,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-11-13 17:40:31,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-11-13 17:40:32,944 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-11-13 17:40:32,945 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2021-11-13 17:40:32,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:40:32 BoogieIcfgContainer
[2021-11-13 17:40:32,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-11-13 17:40:32,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-11-13 17:40:32,954 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-11-13 17:40:32,957 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-11-13 17:40:32,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 05:40:30" (1/3) ...
[2021-11-13 17:40:32,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209664fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 05:40:32, skipping insertion in model container
[2021-11-13 17:40:32,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:31" (2/3) ...
[2021-11-13 17:40:32,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209664fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 05:40:32, skipping insertion in model container
[2021-11-13 17:40:32,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:40:32" (3/3) ...
[2021-11-13 17:40:32,961 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem01_label47.c
[2021-11-13 17:40:32,970 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-11-13 17:40:32,970 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2021-11-13 17:40:33,036 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2021-11-13 17:40:33,042 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR
[2021-11-13 17:40:33,042 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-11-13 17:40:33,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 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)
[2021-11-13 17:40:33,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2021-11-13 17:40:33,072 INFO L506 BasicCegarLoop]: Found error trace
[2021-11-13 17:40:33,072 INFO L514 BasicCegarLoop]: 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]
[2021-11-13 17:40:33,073 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-11-13 17:40:33,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-11-13 17:40:33,079 INFO L85 PathProgramCache]: Analyzing trace with hash 689922294, now seen corresponding path program 1 times
[2021-11-13 17:40:33,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-11-13 17:40:33,088 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634251448]
[2021-11-13 17:40:33,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-11-13 17:40:33,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-11-13 17:40:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-11-13 17:40:33,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-11-13 17:40:33,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-11-13 17:40:33,463 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634251448]
[2021-11-13 17:40:33,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634251448] provided 1 perfect and 0 imperfect interpolant sequences
[2021-11-13 17:40:33,464 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-11-13 17:40:33,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-11-13 17:40:33,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190861659]
[2021-11-13 17:40:33,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-11-13 17:40:33,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-11-13 17:40:33,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-11-13 17:40:33,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-11-13 17:40:33,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-11-13 17:40:33,505 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 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 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 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)
[2021-11-13 17:40:34,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-11-13 17:40:34,294 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions.
[2021-11-13 17:40:34,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-11-13 17:40:34,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 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 73
[2021-11-13 17:40:34,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-11-13 17:40:34,322 INFO L225 Difference]: With dead ends: 528
[2021-11-13 17:40:34,322 INFO L226 Difference]: Without dead ends: 266
[2021-11-13 17:40:34,330 INFO L932 BasicCegarLoop]: 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
[2021-11-13 17:40:34,336 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 115 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 520.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.89ms SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 666.77ms IncrementalHoareTripleChecker+Time
[2021-11-13 17:40:34,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 51 Invalid, 521 Unknown, 0 Unchecked, 14.89ms Time], IncrementalHoareTripleChecker [115 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 666.77ms Time]
[2021-11-13 17:40:34,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states.
[2021-11-13 17:40:34,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266.
[2021-11-13 17:40:34,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4566037735849056) internal successors, (386), 265 states have internal predecessors, (386), 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)
[2021-11-13 17:40:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 386 transitions.
[2021-11-13 17:40:34,428 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 386 transitions. Word has length 73
[2021-11-13 17:40:34,430 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-11-13 17:40:34,430 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 386 transitions.
[2021-11-13 17:40:34,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 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)
[2021-11-13 17:40:34,431 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 386 transitions.
[2021-11-13 17:40:34,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2021-11-13 17:40:34,439 INFO L506 BasicCegarLoop]: Found error trace
[2021-11-13 17:40:34,440 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1]
[2021-11-13 17:40:34,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-11-13 17:40:34,441 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-11-13 17:40:34,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-11-13 17:40:34,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1040799939, now seen corresponding path program 1 times
[2021-11-13 17:40:34,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-11-13 17:40:34,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125521386]
[2021-11-13 17:40:34,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-11-13 17:40:34,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-11-13 17:40:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-11-13 17:40:34,552 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-11-13 17:40:34,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-11-13 17:40:34,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125521386]
[2021-11-13 17:40:34,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125521386] provided 1 perfect and 0 imperfect interpolant sequences
[2021-11-13 17:40:34,554 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-11-13 17:40:34,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-11-13 17:40:34,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293578102]
[2021-11-13 17:40:34,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-11-13 17:40:34,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-11-13 17:40:34,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-11-13 17:40:34,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-11-13 17:40:34,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-11-13 17:40:34,558 INFO L87 Difference]: Start difference. First operand 266 states and 386 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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)
[2021-11-13 17:40:35,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-11-13 17:40:35,025 INFO L93 Difference]: Finished difference Result 792 states and 1153 transitions.
[2021-11-13 17:40:35,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-11-13 17:40:35,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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 79
[2021-11-13 17:40:35,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-11-13 17:40:35,029 INFO L225 Difference]: With dead ends: 792
[2021-11-13 17:40:35,029 INFO L226 Difference]: Without dead ends: 528
[2021-11-13 17:40:35,030 INFO L932 BasicCegarLoop]: 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
[2021-11-13 17:40:35,031 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 350.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.53ms SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 439.32ms IncrementalHoareTripleChecker+Time
[2021-11-13 17:40:35,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 36 Invalid, 398 Unknown, 0 Unchecked, 5.53ms Time], IncrementalHoareTripleChecker [71 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 439.32ms Time]
[2021-11-13 17:40:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states.
[2021-11-13 17:40:35,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528.
[2021-11-13 17:40:35,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.3795066413662238) internal successors, (727), 527 states have internal predecessors, (727), 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)
[2021-11-13 17:40:35,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 727 transitions.
[2021-11-13 17:40:35,083 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 727 transitions. Word has length 79
[2021-11-13 17:40:35,084 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-11-13 17:40:35,084 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 727 transitions.
[2021-11-13 17:40:35,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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)
[2021-11-13 17:40:35,084 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 727 transitions.
[2021-11-13 17:40:35,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2021-11-13 17:40:35,087 INFO L506 BasicCegarLoop]: Found error trace
[2021-11-13 17:40:35,088 INFO L514 BasicCegarLoop]: trace histogram [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, 1]
[2021-11-13 17:40:35,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-11-13 17:40:35,088 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-11-13 17:40:35,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-11-13 17:40:35,089 INFO L85 PathProgramCache]: Analyzing trace with hash -398426685, now seen corresponding path program 1 times
[2021-11-13 17:40:35,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-11-13 17:40:35,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034746901]
[2021-11-13 17:40:35,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-11-13 17:40:35,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-11-13 17:40:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-11-13 17:40:35,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-11-13 17:40:35,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-11-13 17:40:35,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034746901]
[2021-11-13 17:40:35,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034746901] provided 1 perfect and 0 imperfect interpolant sequences
[2021-11-13 17:40:35,245 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-11-13 17:40:35,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-11-13 17:40:35,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999173026]
[2021-11-13 17:40:35,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-11-13 17:40:35,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-11-13 17:40:35,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-11-13 17:40:35,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-11-13 17:40:35,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-11-13 17:40:35,248 INFO L87 Difference]: Start difference. First operand 528 states and 727 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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)
[2021-11-13 17:40:35,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-11-13 17:40:35,738 INFO L93 Difference]: Finished difference Result 1578 states and 2176 transitions.
[2021-11-13 17:40:35,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-11-13 17:40:35,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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
[2021-11-13 17:40:35,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-11-13 17:40:35,749 INFO L225 Difference]: With dead ends: 1578
[2021-11-13 17:40:35,750 INFO L226 Difference]: Without dead ends: 1052
[2021-11-13 17:40:35,751 INFO L932 BasicCegarLoop]: 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
[2021-11-13 17:40:35,760 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 61 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 366.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.86ms SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 448.77ms IncrementalHoareTripleChecker+Time
[2021-11-13 17:40:35,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 211 Invalid, 399 Unknown, 0 Unchecked, 4.86ms Time], IncrementalHoareTripleChecker [73 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 448.77ms Time]
[2021-11-13 17:40:35,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states.
[2021-11-13 17:40:35,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 659.
[2021-11-13 17:40:35,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.3404255319148937) internal successors, (882), 658 states have internal predecessors, (882), 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)
[2021-11-13 17:40:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 882 transitions.
[2021-11-13 17:40:35,801 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 882 transitions. Word has length 80
[2021-11-13 17:40:35,802 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-11-13 17:40:35,803 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 882 transitions.
[2021-11-13 17:40:35,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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)
[2021-11-13 17:40:35,805 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 882 transitions.
[2021-11-13 17:40:35,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2021-11-13 17:40:35,815 INFO L506 BasicCegarLoop]: Found error trace
[2021-11-13 17:40:35,815 INFO L514 BasicCegarLoop]: trace histogram [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]
[2021-11-13 17:40:35,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-11-13 17:40:35,816 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-11-13 17:40:35,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-11-13 17:40:35,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1747549128, now seen corresponding path program 1 times
[2021-11-13 17:40:35,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-11-13 17:40:35,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360856901]
[2021-11-13 17:40:35,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-11-13 17:40:35,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-11-13 17:40:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-11-13 17:40:35,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-11-13 17:40:35,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-11-13 17:40:35,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360856901]
[2021-11-13 17:40:35,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360856901] provided 1 perfect and 0 imperfect interpolant sequences
[2021-11-13 17:40:35,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-11-13 17:40:35,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-11-13 17:40:35,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491856629]
[2021-11-13 17:40:35,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-11-13 17:40:35,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-11-13 17:40:35,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-11-13 17:40:35,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-11-13 17:40:35,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-11-13 17:40:35,958 INFO L87 Difference]: Start difference. First operand 659 states and 882 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 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)
[2021-11-13 17:40:36,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-11-13 17:40:36,437 INFO L93 Difference]: Finished difference Result 1447 states and 1917 transitions.
[2021-11-13 17:40:36,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-11-13 17:40:36,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 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 81
[2021-11-13 17:40:36,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-11-13 17:40:36,445 INFO L225 Difference]: With dead ends: 1447
[2021-11-13 17:40:36,445 INFO L226 Difference]: Without dead ends: 659
[2021-11-13 17:40:36,447 INFO L932 BasicCegarLoop]: 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
[2021-11-13 17:40:36,448 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 137 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 342.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.57ms SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 438.44ms IncrementalHoareTripleChecker+Time
[2021-11-13 17:40:36,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 60 Invalid, 367 Unknown, 0 Unchecked, 4.57ms Time], IncrementalHoareTripleChecker [60 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 438.44ms Time]
[2021-11-13 17:40:36,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states.
[2021-11-13 17:40:36,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659.
[2021-11-13 17:40:36,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.1899696048632218) internal successors, (783), 658 states have internal predecessors, (783), 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)
[2021-11-13 17:40:36,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 783 transitions.
[2021-11-13 17:40:36,470 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 783 transitions. Word has length 81
[2021-11-13 17:40:36,471 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-11-13 17:40:36,471 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 783 transitions.
[2021-11-13 17:40:36,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 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)
[2021-11-13 17:40:36,471 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 783 transitions.
[2021-11-13 17:40:36,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2021-11-13 17:40:36,473 INFO L506 BasicCegarLoop]: Found error trace
[2021-11-13 17:40:36,473 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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]
[2021-11-13 17:40:36,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-11-13 17:40:36,474 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-11-13 17:40:36,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-11-13 17:40:36,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1537532784, now seen corresponding path program 1 times
[2021-11-13 17:40:36,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-11-13 17:40:36,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538056689]
[2021-11-13 17:40:36,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-11-13 17:40:36,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-11-13 17:40:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-11-13 17:40:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2021-11-13 17:40:36,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-11-13 17:40:36,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538056689]
[2021-11-13 17:40:36,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538056689] provided 1 perfect and 0 imperfect interpolant sequences
[2021-11-13 17:40:36,537 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-11-13 17:40:36,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-11-13 17:40:36,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718536391]
[2021-11-13 17:40:36,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-11-13 17:40:36,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-11-13 17:40:36,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-11-13 17:40:36,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-11-13 17:40:36,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-11-13 17:40:36,542 INFO L87 Difference]: Start difference. First operand 659 states and 783 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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)
[2021-11-13 17:40:37,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-11-13 17:40:37,022 INFO L93 Difference]: Finished difference Result 1840 states and 2190 transitions.
[2021-11-13 17:40:37,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-11-13 17:40:37,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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
[2021-11-13 17:40:37,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-11-13 17:40:37,035 INFO L225 Difference]: With dead ends: 1840
[2021-11-13 17:40:37,035 INFO L226 Difference]: Without dead ends: 1183
[2021-11-13 17:40:37,036 INFO L932 BasicCegarLoop]: 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
[2021-11-13 17:40:37,040 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 346.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.93ms SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 439.26ms IncrementalHoareTripleChecker+Time
[2021-11-13 17:40:37,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 44 Invalid, 346 Unknown, 0 Unchecked, 3.93ms Time], IncrementalHoareTripleChecker [50 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 439.26ms Time]
[2021-11-13 17:40:37,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states.
[2021-11-13 17:40:37,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1052.
[2021-11-13 17:40:37,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.1503330161750713) internal successors, (1209), 1051 states have internal predecessors, (1209), 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)
[2021-11-13 17:40:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1209 transitions.
[2021-11-13 17:40:37,084 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1209 transitions. Word has length 85
[2021-11-13 17:40:37,085 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-11-13 17:40:37,085 INFO L470 AbstractCegarLoop]: Abstraction has 1052 states and 1209 transitions.
[2021-11-13 17:40:37,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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)
[2021-11-13 17:40:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1209 transitions.
[2021-11-13 17:40:37,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2021-11-13 17:40:37,088 INFO L506 BasicCegarLoop]: Found error trace
[2021-11-13 17:40:37,089 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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]
[2021-11-13 17:40:37,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-11-13 17:40:37,094 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-11-13 17:40:37,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-11-13 17:40:37,095 INFO L85 PathProgramCache]: Analyzing trace with hash 650250866, now seen corresponding path program 1 times
[2021-11-13 17:40:37,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-11-13 17:40:37,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130595264]
[2021-11-13 17:40:37,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-11-13 17:40:37,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-11-13 17:40:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-11-13 17:40:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2021-11-13 17:40:37,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-11-13 17:40:37,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130595264]
[2021-11-13 17:40:37,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130595264] provided 1 perfect and 0 imperfect interpolant sequences
[2021-11-13 17:40:37,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-11-13 17:40:37,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-11-13 17:40:37,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123760695]
[2021-11-13 17:40:37,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-11-13 17:40:37,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-11-13 17:40:37,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-11-13 17:40:37,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-11-13 17:40:37,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-11-13 17:40:37,185 INFO L87 Difference]: Start difference. First operand 1052 states and 1209 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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)
[2021-11-13 17:40:37,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-11-13 17:40:37,596 INFO L93 Difference]: Finished difference Result 2626 states and 3022 transitions.
[2021-11-13 17:40:37,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-11-13 17:40:37,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 94
[2021-11-13 17:40:37,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-11-13 17:40:37,605 INFO L225 Difference]: With dead ends: 2626
[2021-11-13 17:40:37,605 INFO L226 Difference]: Without dead ends: 1576
[2021-11-13 17:40:37,608 INFO L932 BasicCegarLoop]: 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
[2021-11-13 17:40:37,611 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 291.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.98ms SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 358.32ms IncrementalHoareTripleChecker+Time
[2021-11-13 17:40:37,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 12 Invalid, 364 Unknown, 0 Unchecked, 2.98ms Time], IncrementalHoareTripleChecker [52 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 358.32ms Time]
[2021-11-13 17:40:37,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states.
[2021-11-13 17:40:37,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1314.
[2021-11-13 17:40:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1313 states have (on average 1.1568926123381569) internal successors, (1519), 1313 states have internal predecessors, (1519), 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)
[2021-11-13 17:40:37,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1519 transitions.
[2021-11-13 17:40:37,658 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1519 transitions. Word has length 94
[2021-11-13 17:40:37,658 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-11-13 17:40:37,658 INFO L470 AbstractCegarLoop]: Abstraction has 1314 states and 1519 transitions.
[2021-11-13 17:40:37,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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)
[2021-11-13 17:40:37,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1519 transitions.
[2021-11-13 17:40:37,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2021-11-13 17:40:37,661 INFO L506 BasicCegarLoop]: Found error trace
[2021-11-13 17:40:37,661 INFO L514 BasicCegarLoop]: 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, 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]
[2021-11-13 17:40:37,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-11-13 17:40:37,662 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-11-13 17:40:37,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-11-13 17:40:37,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1329686054, now seen corresponding path program 1 times
[2021-11-13 17:40:37,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-11-13 17:40:37,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350413259]
[2021-11-13 17:40:37,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-11-13 17:40:37,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-11-13 17:40:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-11-13 17:40:37,749 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-11-13 17:40:37,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-11-13 17:40:37,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350413259]
[2021-11-13 17:40:37,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350413259] provided 1 perfect and 0 imperfect interpolant sequences
[2021-11-13 17:40:37,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-11-13 17:40:37,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-11-13 17:40:37,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738796970]
[2021-11-13 17:40:37,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-11-13 17:40:37,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-11-13 17:40:37,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-11-13 17:40:37,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-11-13 17:40:37,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-11-13 17:40:37,752 INFO L87 Difference]: Start difference. First operand 1314 states and 1519 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 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)
[2021-11-13 17:40:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-11-13 17:40:38,119 INFO L93 Difference]: Finished difference Result 2888 states and 3328 transitions.
[2021-11-13 17:40:38,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-11-13 17:40:38,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 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 102
[2021-11-13 17:40:38,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-11-13 17:40:38,129 INFO L225 Difference]: With dead ends: 2888
[2021-11-13 17:40:38,129 INFO L226 Difference]: Without dead ends: 1576
[2021-11-13 17:40:38,135 INFO L932 BasicCegarLoop]: 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
[2021-11-13 17:40:38,137 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 105 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 268.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.88ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 330.00ms IncrementalHoareTripleChecker+Time
[2021-11-13 17:40:38,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 55 Invalid, 343 Unknown, 0 Unchecked, 2.88ms Time], IncrementalHoareTripleChecker [15 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 330.00ms Time]
[2021-11-13 17:40:38,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states.
[2021-11-13 17:40:38,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576.
[2021-11-13 17:40:38,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.140952380952381) internal successors, (1797), 1575 states have internal predecessors, (1797), 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)
[2021-11-13 17:40:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1797 transitions.
[2021-11-13 17:40:38,185 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1797 transitions. Word has length 102
[2021-11-13 17:40:38,186 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-11-13 17:40:38,186 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 1797 transitions.
[2021-11-13 17:40:38,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 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)
[2021-11-13 17:40:38,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1797 transitions.
[2021-11-13 17:40:38,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107
[2021-11-13 17:40:38,189 INFO L506 BasicCegarLoop]: Found error trace
[2021-11-13 17:40:38,189 INFO L514 BasicCegarLoop]: 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, 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]
[2021-11-13 17:40:38,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-11-13 17:40:38,190 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-11-13 17:40:38,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-11-13 17:40:38,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1514849810, now seen corresponding path program 1 times
[2021-11-13 17:40:38,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-11-13 17:40:38,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531513663]
[2021-11-13 17:40:38,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-11-13 17:40:38,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-11-13 17:40:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-11-13 17:40:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-11-13 17:40:38,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-11-13 17:40:38,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531513663]
[2021-11-13 17:40:38,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531513663] provided 1 perfect and 0 imperfect interpolant sequences
[2021-11-13 17:40:38,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-11-13 17:40:38,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-11-13 17:40:38,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646754476]
[2021-11-13 17:40:38,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-11-13 17:40:38,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2021-11-13 17:40:38,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-11-13 17:40:38,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-11-13 17:40:38,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-11-13 17:40:38,302 INFO L87 Difference]: Start difference. First operand 1576 states and 1797 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 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)
[2021-11-13 17:40:38,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-11-13 17:40:38,863 INFO L93 Difference]: Finished difference Result 3412 states and 3894 transitions.
[2021-11-13 17:40:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2021-11-13 17:40:38,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 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 106
[2021-11-13 17:40:38,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-11-13 17:40:38,873 INFO L225 Difference]: With dead ends: 3412
[2021-11-13 17:40:38,874 INFO L226 Difference]: Without dead ends: 1838
[2021-11-13 17:40:38,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-11-13 17:40:38,876 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 370 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 422.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.21ms SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 513.61ms IncrementalHoareTripleChecker+Time
[2021-11-13 17:40:38,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 54 Invalid, 519 Unknown, 0 Unchecked, 4.21ms Time], IncrementalHoareTripleChecker [45 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 513.61ms Time]
[2021-11-13 17:40:38,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states.
[2021-11-13 17:40:38,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707.
[2021-11-13 17:40:38,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.1324736225087926) internal successors, (1932), 1706 states have internal predecessors, (1932), 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)
[2021-11-13 17:40:38,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1932 transitions.
[2021-11-13 17:40:38,925 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1932 transitions. Word has length 106
[2021-11-13 17:40:38,926 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-11-13 17:40:38,927 INFO L470 AbstractCegarLoop]: Abstraction has 1707 states and 1932 transitions.
[2021-11-13 17:40:38,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 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)
[2021-11-13 17:40:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1932 transitions.
[2021-11-13 17:40:38,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2021-11-13 17:40:38,932 INFO L506 BasicCegarLoop]: Found error trace
[2021-11-13 17:40:38,933 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 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]
[2021-11-13 17:40:38,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-11-13 17:40:38,933 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-11-13 17:40:38,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-11-13 17:40:38,934 INFO L85 PathProgramCache]: Analyzing trace with hash 984467905, now seen corresponding path program 1 times
[2021-11-13 17:40:38,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-11-13 17:40:38,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574779620]
[2021-11-13 17:40:38,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-11-13 17:40:38,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-11-13 17:40:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-11-13 17:40:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2021-11-13 17:40:39,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-11-13 17:40:39,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574779620]
[2021-11-13 17:40:39,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574779620] provided 1 perfect and 0 imperfect interpolant sequences
[2021-11-13 17:40:39,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-11-13 17:40:39,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-11-13 17:40:39,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53982976]
[2021-11-13 17:40:39,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-11-13 17:40:39,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2021-11-13 17:40:39,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-11-13 17:40:39,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-11-13 17:40:39,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-11-13 17:40:39,042 INFO L87 Difference]: Start difference. First operand 1707 states and 1932 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 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)
[2021-11-13 17:40:39,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-11-13 17:40:39,612 INFO L93 Difference]: Finished difference Result 3805 states and 4288 transitions.
[2021-11-13 17:40:39,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2021-11-13 17:40:39,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 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 131
[2021-11-13 17:40:39,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-11-13 17:40:39,623 INFO L225 Difference]: With dead ends: 3805
[2021-11-13 17:40:39,623 INFO L226 Difference]: Without dead ends: 1969
[2021-11-13 17:40:39,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-11-13 17:40:39,627 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 379 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 416.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.51ms SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 517.75ms IncrementalHoareTripleChecker+Time
[2021-11-13 17:40:39,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 33 Invalid, 536 Unknown, 0 Unchecked, 4.51ms Time], IncrementalHoareTripleChecker [103 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 517.75ms Time]
[2021-11-13 17:40:39,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states.
[2021-11-13 17:40:39,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707.
[2021-11-13 17:40:39,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.0890973036342322) internal successors, (1858), 1706 states have internal predecessors, (1858), 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)
[2021-11-13 17:40:39,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1858 transitions.
[2021-11-13 17:40:39,694 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1858 transitions. Word has length 131
[2021-11-13 17:40:39,695 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-11-13 17:40:39,695 INFO L470 AbstractCegarLoop]: Abstraction has 1707 states and 1858 transitions.
[2021-11-13 17:40:39,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 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)
[2021-11-13 17:40:39,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1858 transitions.
[2021-11-13 17:40:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133
[2021-11-13 17:40:39,698 INFO L506 BasicCegarLoop]: Found error trace
[2021-11-13 17:40:39,698 INFO L514 BasicCegarLoop]: 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-11-13 17:40:39,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-11-13 17:40:39,699 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-11-13 17:40:39,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-11-13 17:40:39,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1762887547, now seen corresponding path program 1 times
[2021-11-13 17:40:39,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-11-13 17:40:39,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602168303]
[2021-11-13 17:40:39,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-11-13 17:40:39,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-11-13 17:40:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-11-13 17:40:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-11-13 17:40:39,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-11-13 17:40:39,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602168303]
[2021-11-13 17:40:39,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602168303] provided 0 perfect and 1 imperfect interpolant sequences
[2021-11-13 17:40:39,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766692245]
[2021-11-13 17:40:39,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-11-13 17:40:39,809 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-11-13 17:40:39,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/z3
[2021-11-13 17:40:39,813 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2021-11-13 17:40:39,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2021-11-13 17:40:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-11-13 17:40:39,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 2 conjunts are in the unsatisfiable core
[2021-11-13 17:40:39,927 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-11-13 17:40:40,377 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked.
[2021-11-13 17:40:40,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2021-11-13 17:40:40,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766692245] provided 1 perfect and 0 imperfect interpolant sequences
[2021-11-13 17:40:40,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2021-11-13 17:40:40,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2021-11-13 17:40:40,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293339492]
[2021-11-13 17:40:40,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-11-13 17:40:40,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-11-13 17:40:40,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-11-13 17:40:40,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-11-13 17:40:40,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2021-11-13 17:40:40,379 INFO L87 Difference]: Start difference. First operand 1707 states and 1858 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 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)
[2021-11-13 17:40:40,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-11-13 17:40:40,733 INFO L93 Difference]: Finished difference Result 2233 states and 2433 transitions.
[2021-11-13 17:40:40,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-11-13 17:40:40,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 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 132
[2021-11-13 17:40:40,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-11-13 17:40:40,746 INFO L225 Difference]: With dead ends: 2233
[2021-11-13 17:40:40,746 INFO L226 Difference]: Without dead ends: 2231
[2021-11-13 17:40:40,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2021-11-13 17:40:40,748 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 81 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 271.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.87ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 329.37ms IncrementalHoareTripleChecker+Time
[2021-11-13 17:40:40,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 28 Invalid, 321 Unknown, 0 Unchecked, 1.87ms Time], IncrementalHoareTripleChecker [25 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 329.37ms Time]
[2021-11-13 17:40:40,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states.
[2021-11-13 17:40:40,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1969.
[2021-11-13 17:40:40,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.0914634146341464) internal successors, (2148), 1968 states have internal predecessors, (2148), 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)
[2021-11-13 17:40:40,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2148 transitions.
[2021-11-13 17:40:40,830 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2148 transitions. Word has length 132
[2021-11-13 17:40:40,831 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-11-13 17:40:40,831 INFO L470 AbstractCegarLoop]: Abstraction has 1969 states and 2148 transitions.
[2021-11-13 17:40:40,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 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)
[2021-11-13 17:40:40,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2148 transitions.
[2021-11-13 17:40:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178
[2021-11-13 17:40:40,836 INFO L506 BasicCegarLoop]: Found error trace
[2021-11-13 17:40:40,837 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2021-11-13 17:40:40,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2021-11-13 17:40:41,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2021-11-13 17:40:41,059 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-11-13 17:40:41,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-11-13 17:40:41,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1899950964, now seen corresponding path program 1 times
[2021-11-13 17:40:41,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-11-13 17:40:41,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580254552]
[2021-11-13 17:40:41,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-11-13 17:40:41,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-11-13 17:40:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-11-13 17:40:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked.
[2021-11-13 17:40:41,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-11-13 17:40:41,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580254552]
[2021-11-13 17:40:41,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580254552] provided 0 perfect and 1 imperfect interpolant sequences
[2021-11-13 17:40:41,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961702036]
[2021-11-13 17:40:41,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-11-13 17:40:41,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-11-13 17:40:41,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/z3
[2021-11-13 17:40:41,205 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2021-11-13 17:40:41,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2021-11-13 17:40:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-11-13 17:40:41,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 2 conjunts are in the unsatisfiable core
[2021-11-13 17:40:41,331 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-11-13 17:40:41,785 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked.
[2021-11-13 17:40:41,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2021-11-13 17:40:41,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961702036] provided 1 perfect and 0 imperfect interpolant sequences
[2021-11-13 17:40:41,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2021-11-13 17:40:41,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2021-11-13 17:40:41,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805582386]
[2021-11-13 17:40:41,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-11-13 17:40:41,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-11-13 17:40:41,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-11-13 17:40:41,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-11-13 17:40:41,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-11-13 17:40:41,789 INFO L87 Difference]: Start difference. First operand 1969 states and 2148 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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)
[2021-11-13 17:40:42,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-11-13 17:40:42,178 INFO L93 Difference]: Finished difference Result 4067 states and 4444 transitions.
[2021-11-13 17:40:42,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-11-13 17:40:42,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 177
[2021-11-13 17:40:42,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-11-13 17:40:42,190 INFO L225 Difference]: With dead ends: 4067
[2021-11-13 17:40:42,190 INFO L226 Difference]: Without dead ends: 2100
[2021-11-13 17:40:42,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-11-13 17:40:42,193 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 71 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 273.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.60ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 339.12ms IncrementalHoareTripleChecker+Time
[2021-11-13 17:40:42,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 167 Invalid, 329 Unknown, 0 Unchecked, 2.60ms Time], IncrementalHoareTripleChecker [27 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 339.12ms Time]
[2021-11-13 17:40:42,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states.
[2021-11-13 17:40:42,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969.
[2021-11-13 17:40:42,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.0752032520325203) internal successors, (2116), 1968 states have internal predecessors, (2116), 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)
[2021-11-13 17:40:42,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2116 transitions.
[2021-11-13 17:40:42,247 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2116 transitions. Word has length 177
[2021-11-13 17:40:42,247 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-11-13 17:40:42,247 INFO L470 AbstractCegarLoop]: Abstraction has 1969 states and 2116 transitions.
[2021-11-13 17:40:42,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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)
[2021-11-13 17:40:42,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2116 transitions.
[2021-11-13 17:40:42,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197
[2021-11-13 17:40:42,252 INFO L506 BasicCegarLoop]: Found error trace
[2021-11-13 17:40:42,252 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2021-11-13 17:40:42,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2021-11-13 17:40:42,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-11-13 17:40:42,478 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-11-13 17:40:42,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-11-13 17:40:42,478 INFO L85 PathProgramCache]: Analyzing trace with hash 483841080, now seen corresponding path program 1 times
[2021-11-13 17:40:42,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-11-13 17:40:42,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331447674]
[2021-11-13 17:40:42,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-11-13 17:40:42,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-11-13 17:40:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-11-13 17:40:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked.
[2021-11-13 17:40:42,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-11-13 17:40:42,598 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331447674]
[2021-11-13 17:40:42,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331447674] provided 1 perfect and 0 imperfect interpolant sequences
[2021-11-13 17:40:42,599 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-11-13 17:40:42,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-11-13 17:40:42,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062775504]
[2021-11-13 17:40:42,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-11-13 17:40:42,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-11-13 17:40:42,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-11-13 17:40:42,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-11-13 17:40:42,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-11-13 17:40:42,601 INFO L87 Difference]: Start difference. First operand 1969 states and 2116 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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)
[2021-11-13 17:40:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-11-13 17:40:42,939 INFO L93 Difference]: Finished difference Result 4460 states and 4787 transitions.
[2021-11-13 17:40:42,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-11-13 17:40:42,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 196
[2021-11-13 17:40:42,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-11-13 17:40:42,951 INFO L225 Difference]: With dead ends: 4460
[2021-11-13 17:40:42,952 INFO L226 Difference]: Without dead ends: 1969
[2021-11-13 17:40:42,954 INFO L932 BasicCegarLoop]: 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
[2021-11-13 17:40:42,955 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 68 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 252.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.28ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 308.61ms IncrementalHoareTripleChecker+Time
[2021-11-13 17:40:42,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 171 Invalid, 330 Unknown, 0 Unchecked, 2.28ms Time], IncrementalHoareTripleChecker [24 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 308.61ms Time]
[2021-11-13 17:40:42,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states.
[2021-11-13 17:40:42,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969.
[2021-11-13 17:40:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.068089430894309) internal successors, (2102), 1968 states have internal predecessors, (2102), 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)
[2021-11-13 17:40:43,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2102 transitions.
[2021-11-13 17:40:43,002 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2102 transitions. Word has length 196
[2021-11-13 17:40:43,002 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-11-13 17:40:43,002 INFO L470 AbstractCegarLoop]: Abstraction has 1969 states and 2102 transitions.
[2021-11-13 17:40:43,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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)
[2021-11-13 17:40:43,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2102 transitions.
[2021-11-13 17:40:43,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202
[2021-11-13 17:40:43,007 INFO L506 BasicCegarLoop]: Found error trace
[2021-11-13 17:40:43,008 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2021-11-13 17:40:43,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-11-13 17:40:43,008 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-11-13 17:40:43,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-11-13 17:40:43,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1137375810, now seen corresponding path program 1 times
[2021-11-13 17:40:43,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-11-13 17:40:43,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164654188]
[2021-11-13 17:40:43,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-11-13 17:40:43,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-11-13 17:40:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-11-13 17:40:43,130 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 69 proven. 124 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2021-11-13 17:40:43,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-11-13 17:40:43,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164654188]
[2021-11-13 17:40:43,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164654188] provided 0 perfect and 1 imperfect interpolant sequences
[2021-11-13 17:40:43,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32041827]
[2021-11-13 17:40:43,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-11-13 17:40:43,131 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-11-13 17:40:43,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/z3
[2021-11-13 17:40:43,133 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2021-11-13 17:40:43,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2021-11-13 17:40:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-11-13 17:40:43,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core
[2021-11-13 17:40:43,254 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-11-13 17:40:43,598 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked.
[2021-11-13 17:40:43,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2021-11-13 17:40:43,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32041827] provided 1 perfect and 0 imperfect interpolant sequences
[2021-11-13 17:40:43,598 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2021-11-13 17:40:43,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2021-11-13 17:40:43,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100303687]
[2021-11-13 17:40:43,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-11-13 17:40:43,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-11-13 17:40:43,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-11-13 17:40:43,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-11-13 17:40:43,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-11-13 17:40:43,601 INFO L87 Difference]: Start difference. First operand 1969 states and 2102 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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)
[2021-11-13 17:40:43,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-11-13 17:40:43,964 INFO L93 Difference]: Finished difference Result 3805 states and 4068 transitions.
[2021-11-13 17:40:43,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-11-13 17:40:43,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 201
[2021-11-13 17:40:43,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-11-13 17:40:43,972 INFO L225 Difference]: With dead ends: 3805
[2021-11-13 17:40:43,972 INFO L226 Difference]: Without dead ends: 1314
[2021-11-13 17:40:43,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-11-13 17:40:43,977 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 64 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 262.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.49ms SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 328.74ms IncrementalHoareTripleChecker+Time
[2021-11-13 17:40:43,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 162 Invalid, 334 Unknown, 0 Unchecked, 2.49ms Time], IncrementalHoareTripleChecker [31 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 328.74ms Time]
[2021-11-13 17:40:43,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states.
[2021-11-13 17:40:44,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183.
[2021-11-13 17:40:44,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.0355329949238579) internal successors, (1224), 1182 states have internal predecessors, (1224), 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)
[2021-11-13 17:40:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1224 transitions.
[2021-11-13 17:40:44,009 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1224 transitions. Word has length 201
[2021-11-13 17:40:44,009 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-11-13 17:40:44,010 INFO L470 AbstractCegarLoop]: Abstraction has 1183 states and 1224 transitions.
[2021-11-13 17:40:44,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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)
[2021-11-13 17:40:44,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1224 transitions.
[2021-11-13 17:40:44,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240
[2021-11-13 17:40:44,014 INFO L506 BasicCegarLoop]: Found error trace
[2021-11-13 17:40:44,015 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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]
[2021-11-13 17:40:44,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2021-11-13 17:40:44,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-11-13 17:40:44,242 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-11-13 17:40:44,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-11-13 17:40:44,242 INFO L85 PathProgramCache]: Analyzing trace with hash -26084673, now seen corresponding path program 1 times
[2021-11-13 17:40:44,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-11-13 17:40:44,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766690071]
[2021-11-13 17:40:44,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-11-13 17:40:44,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-11-13 17:40:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-11-13 17:40:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2021-11-13 17:40:44,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-11-13 17:40:44,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766690071]
[2021-11-13 17:40:44,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766690071] provided 0 perfect and 1 imperfect interpolant sequences
[2021-11-13 17:40:44,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194122903]
[2021-11-13 17:40:44,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-11-13 17:40:44,424 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-11-13 17:40:44,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/z3
[2021-11-13 17:40:44,425 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2021-11-13 17:40:44,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2021-11-13 17:40:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-11-13 17:40:44,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 16 conjunts are in the unsatisfiable core
[2021-11-13 17:40:44,554 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-11-13 17:40:45,335 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 216 proven. 48 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked.
[2021-11-13 17:40:45,336 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2021-11-13 17:40:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 216 proven. 48 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked.
[2021-11-13 17:40:46,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194122903] provided 0 perfect and 2 imperfect interpolant sequences
[2021-11-13 17:40:46,118 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2021-11-13 17:40:46,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7
[2021-11-13 17:40:46,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140072972]
[2021-11-13 17:40:46,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2021-11-13 17:40:46,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-11-13 17:40:46,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-11-13 17:40:46,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-11-13 17:40:46,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2021-11-13 17:40:46,121 INFO L87 Difference]: Start difference. First operand 1183 states and 1224 transitions. Second operand has 8 states, 8 states have (on average 34.625) internal successors, (277), 7 states have internal predecessors, (277), 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)
[2021-11-13 17:40:46,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-11-13 17:40:46,718 INFO L93 Difference]: Finished difference Result 2256 states and 2337 transitions.
[2021-11-13 17:40:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-11-13 17:40:46,719 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.625) internal successors, (277), 7 states have internal predecessors, (277), 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 239
[2021-11-13 17:40:46,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-11-13 17:40:46,725 INFO L225 Difference]: With dead ends: 2256
[2021-11-13 17:40:46,725 INFO L226 Difference]: Without dead ends: 1206
[2021-11-13 17:40:46,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 475 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132
[2021-11-13 17:40:46,727 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 494 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 434.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.61ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 525.53ms IncrementalHoareTripleChecker+Time
[2021-11-13 17:40:46,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [494 Valid, 36 Invalid, 877 Unknown, 0 Unchecked, 4.61ms Time], IncrementalHoareTripleChecker [37 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 525.53ms Time]
[2021-11-13 17:40:46,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states.
[2021-11-13 17:40:46,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1183.
[2021-11-13 17:40:46,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.0313028764805414) internal successors, (1219), 1182 states have internal predecessors, (1219), 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)
[2021-11-13 17:40:46,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1219 transitions.
[2021-11-13 17:40:46,754 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1219 transitions. Word has length 239
[2021-11-13 17:40:46,754 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-11-13 17:40:46,754 INFO L470 AbstractCegarLoop]: Abstraction has 1183 states and 1219 transitions.
[2021-11-13 17:40:46,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.625) internal successors, (277), 7 states have internal predecessors, (277), 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)
[2021-11-13 17:40:46,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1219 transitions.
[2021-11-13 17:40:46,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265
[2021-11-13 17:40:46,760 INFO L506 BasicCegarLoop]: Found error trace
[2021-11-13 17:40:46,760 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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]
[2021-11-13 17:40:46,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2021-11-13 17:40:46,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2021-11-13 17:40:46,986 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-11-13 17:40:46,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-11-13 17:40:46,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1178983701, now seen corresponding path program 1 times
[2021-11-13 17:40:46,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-11-13 17:40:46,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299229317]
[2021-11-13 17:40:46,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-11-13 17:40:46,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-11-13 17:40:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-11-13 17:40:47,060 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-11-13 17:40:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-11-13 17:40:47,244 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-11-13 17:40:47,244 INFO L628 BasicCegarLoop]: Counterexample is feasible
[2021-11-13 17:40:47,245 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2021-11-13 17:40:47,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-11-13 17:40:47,251 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-11-13 17:40:47,254 INFO L179 ceAbstractionStarter]: Computing trace abstraction results
[2021-11-13 17:40:47,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 05:40:47 BoogieIcfgContainer
[2021-11-13 17:40:47,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-11-13 17:40:47,454 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2021-11-13 17:40:47,454 INFO L271 PluginConnector]: Initializing Witness Printer...
[2021-11-13 17:40:47,454 INFO L275 PluginConnector]: Witness Printer initialized
[2021-11-13 17:40:47,454 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:40:32" (3/4) ...
[2021-11-13 17:40:47,456 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2021-11-13 17:40:47,645 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/witness.graphml
[2021-11-13 17:40:47,645 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-11-13 17:40:47,646 INFO L158 Benchmark]: Toolchain (without parser) took 16713.04ms. Allocated memory was 107.0MB in the beginning and 251.7MB in the end (delta: 144.7MB). Free memory was 69.2MB in the beginning and 116.5MB in the end (delta: -47.3MB). Peak memory consumption was 96.1MB. Max. memory is 16.1GB.
[2021-11-13 17:40:47,646 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 107.0MB. Free memory was 79.8MB in the beginning and 79.7MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB.
[2021-11-13 17:40:47,646 INFO L158 Benchmark]: CACSL2BoogieTranslator took 616.98ms. Allocated memory was 107.0MB in the beginning and 134.2MB in the end (delta: 27.3MB). Free memory was 69.2MB in the beginning and 91.8MB in the end (delta: -22.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2021-11-13 17:40:47,647 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.93ms. Allocated memory is still 134.2MB. Free memory was 91.8MB in the beginning and 85.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2021-11-13 17:40:47,647 INFO L158 Benchmark]: Boogie Preprocessor took 77.31ms. Allocated memory is still 134.2MB. Free memory was 85.5MB in the beginning and 81.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2021-11-13 17:40:47,648 INFO L158 Benchmark]: RCFGBuilder took 1215.36ms. Allocated memory is still 134.2MB. Free memory was 81.3MB in the beginning and 85.0MB in the end (delta: -3.7MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB.
[2021-11-13 17:40:47,648 INFO L158 Benchmark]: TraceAbstraction took 14499.95ms. Allocated memory was 134.2MB in the beginning and 251.7MB in the end (delta: 117.4MB). Free memory was 84.4MB in the beginning and 160.6MB in the end (delta: -76.2MB). Peak memory consumption was 123.1MB. Max. memory is 16.1GB.
[2021-11-13 17:40:47,648 INFO L158 Benchmark]: Witness Printer took 191.37ms. Allocated memory is still 251.7MB. Free memory was 160.6MB in the beginning and 116.5MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB.
[2021-11-13 17:40:47,651 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.30ms. Allocated memory is still 107.0MB. Free memory was 79.8MB in the beginning and 79.7MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 616.98ms. Allocated memory was 107.0MB in the beginning and 134.2MB in the end (delta: 27.3MB). Free memory was 69.2MB in the beginning and 91.8MB in the end (delta: -22.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 98.93ms. Allocated memory is still 134.2MB. Free memory was 91.8MB in the beginning and 85.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 77.31ms. Allocated memory is still 134.2MB. Free memory was 85.5MB in the beginning and 81.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* RCFGBuilder took 1215.36ms. Allocated memory is still 134.2MB. Free memory was 81.3MB in the beginning and 85.0MB in the end (delta: -3.7MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB.
* TraceAbstraction took 14499.95ms. Allocated memory was 134.2MB in the beginning and 251.7MB in the end (delta: 117.4MB). Free memory was 84.4MB in the beginning and 160.6MB in the end (delta: -76.2MB). Peak memory consumption was 123.1MB. Max. memory is 16.1GB.
* Witness Printer took 191.37ms. Allocated memory is still 251.7MB. Free memory was 160.6MB in the beginning and 116.5MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. 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: 405]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L17] int a= 1;
[L18] int d= 4;
[L19] int e= 5;
[L20] int f= 6;
[L21] int c= 3;
[L22] int b= 2;
[L25] int u = 21;
[L26] int v = 22;
[L27] int w = 23;
[L28] int x = 24;
[L29] int y = 25;
[L30] int z = 26;
[L32] int a17 = 1;
[L33] int a7 = 0;
[L34] int a20 = 1;
[L35] int a8 = 15;
[L36] int a12 = 8;
[L37] int a16 = 5;
[L38] int a21 = 1;
VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L590] int output = -1;
VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26]
[L593] COND TRUE 1
[L596] int input;
[L597] input = __VERIFIER_nondet_int()
[L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L601] CALL, EXPR calculate_output(input)
[L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1)))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15)))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1)))))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8)))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8))))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1))))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1))))))))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1)))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4)))))))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15)))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1)))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1))))
VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))
[L344] a17 = 0
[L345] a16 = 4
[L346] return 21;
VAL [\old(input)=3, \result=21, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L601] RET, EXPR calculate_output(input)
[L601] output = calculate_output(input)
[L593] COND TRUE 1
[L596] int input;
[L597] input = __VERIFIER_nondet_int()
[L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L601] CALL, EXPR calculate_output(input)
[L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13)))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8)))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8))))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8)))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1)))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4)))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8)))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1)))))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15)))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1)))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5))))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4))))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1)))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15)))))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1)))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1)))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1)))))))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15)))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1)))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8)))))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13)))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15)))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8)))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5))))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1)))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15))))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6))))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1)))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8))))))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1))))))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1))))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1))))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1))))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1))))))))))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1)))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6))))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1)))))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5)))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15))))
VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))
[L279] a20 = 0
[L280] a17 = 1
[L281] a16 = 6
[L282] return 21;
VAL [\old(input)=4, \result=21, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L601] RET, EXPR calculate_output(input)
[L601] output = calculate_output(input)
[L593] COND TRUE 1
[L596] int input;
[L597] input = __VERIFIER_nondet_int()
[L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L601] CALL, EXPR calculate_output(input)
[L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)))
VAL [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13)))
VAL [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8)))
VAL [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8))))
VAL [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8)))
VAL [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))
[L73] a17 = 0
[L74] return 26;
VAL [\old(input)=4, \result=26, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L601] RET, EXPR calculate_output(input)
[L601] output = calculate_output(input)
[L593] COND TRUE 1
[L596] int input;
[L597] input = __VERIFIER_nondet_int()
[L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L601] CALL, EXPR calculate_output(input)
[L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)))
VAL [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13)))
VAL [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8)))
VAL [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8))))
VAL [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8)))
VAL [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)))
VAL [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1)))
VAL [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))
[L83] a7 = 1
[L84] a17 = 1
[L85] a21 = 0
[L86] a20 = 1
[L87] a8 = 13
[L88] a16 = 5
[L89] return 26;
VAL [\old(input)=1, \result=26, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L601] RET, EXPR calculate_output(input)
[L601] output = calculate_output(input)
[L593] COND TRUE 1
[L596] int input;
[L597] input = __VERIFIER_nondet_int()
[L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L601] CALL, EXPR calculate_output(input)
[L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)))
VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13)))
VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8)))
VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8))))
VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8)))
VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)))
VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1)))
VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))))
VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4)))
VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8)))
VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1)))))
VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15)))
VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1)))
VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5))))
VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4))))
VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1)))
VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15)))))
VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1)))
VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1)))
VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1)))))))
VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15)))
VAL [\old(input)=4, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L158] COND TRUE ((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))
[L159] a16 = 4
[L160] a17 = 0
[L161] return 25;
VAL [\old(input)=4, \result=25, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L601] RET, EXPR calculate_output(input)
[L601] output = calculate_output(input)
[L593] COND TRUE 1
[L596] int input;
[L597] input = __VERIFIER_nondet_int()
[L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L601] CALL, EXPR calculate_output(input)
[L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13)))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8)))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8))))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8)))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1)))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4)))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8)))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1)))))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15)))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1)))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5))))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4))))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1)))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15)))))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1)))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1)))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1)))))))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15)))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1)))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8)))))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13)))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15)))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8)))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5))))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1)))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15))))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6))))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1)))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8))))))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1))))))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1))))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1))))
VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L241] COND TRUE ((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))
[L242] a8 = 14
[L243] a7 = 0
[L244] a17 = 1
[L245] a21 = 1
[L246] a16 = 4
[L247] return -1;
VAL [\old(input)=3, \result=-1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L601] RET, EXPR calculate_output(input)
[L601] output = calculate_output(input)
[L593] COND TRUE 1
[L596] int input;
[L597] input = __VERIFIER_nondet_int()
[L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L601] CALL calculate_output(input)
[L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1)))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15)))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1)))))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8)))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8))))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1))))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1))))))))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1)))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4)))))))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15)))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1)))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1)))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13))))))))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L404] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L405] reach_error()
VAL [\old(input)=1, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.2s, OverallIterations: 15, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2351 SdHoareTripleChecker+Valid, 5983.59ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2351 mSDsluCounter, 1120 SdHoareTripleChecker+Invalid, 4820.23ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 728 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5256 IncrementalHoareTripleChecker+Invalid, 5984 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 728 mSolverCounterUnsat, 1024 mSDtfsCounter, 5256 mSolverCounterSat, 62.22ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1027 GetRequests, 996 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=10, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 1726 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2789 NumberOfCodeBlocks, 2789 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2745 ConstructedInterpolants, 0 QuantifiedInterpolants, 8264 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1477 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 1939/2353 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!
[2021-11-13 17:40:47,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fb4561e-e055-4e9a-833a-03fd5b1089e2/bin/uautomizer-YU5uOKAj3y/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