/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/eca-rers2012/Problem01_label15.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:45:44,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:45:44,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:45:44,654 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:45:44,655 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:45:44,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:45:44,663 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:45:44,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:45:44,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:45:44,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:45:44,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:45:44,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:45:44,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:45:44,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:45:44,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:45:44,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:45:44,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:45:44,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:45:44,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:45:44,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:45:44,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:45:44,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:45:44,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:45:44,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:45:44,726 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:45:44,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:45:44,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:45:44,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:45:44,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:45:44,730 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:45:44,730 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:45:44,731 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:45:44,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:45:44,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:45:44,734 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:45:44,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:45:44,735 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:45:44,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:45:44,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:45:44,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:45:44,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:45:44,739 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 11:45:44,767 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:45:44,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:45:44,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:45:44,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:45:44,770 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:45:44,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:45:44,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:45:44,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:45:44,771 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:45:44,771 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:45:44,771 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:45:44,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:45:44,771 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:45:44,772 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:45:44,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:45:44,772 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:45:44,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:45:44,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:45:44,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:45:44,773 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:45:44,773 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:45:44,773 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:45:44,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:45:44,774 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:45:44,774 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:45:44,774 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:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/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 [2021-01-06 11:45:45,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:45:45,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:45:45,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:45:45,180 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:45:45,181 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:45:45,182 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label15.c [2021-01-06 11:45:45,257 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/360c0723e/684ac1317b944c3ba0cd8a5462960e14/FLAG49616614a [2021-01-06 11:45:46,032 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:45:46,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label15.c [2021-01-06 11:45:46,052 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/360c0723e/684ac1317b944c3ba0cd8a5462960e14/FLAG49616614a [2021-01-06 11:45:46,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/360c0723e/684ac1317b944c3ba0cd8a5462960e14 [2021-01-06 11:45:46,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:45:46,280 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:45:46,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:45:46,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:45:46,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:45:46,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:45:46" (1/1) ... [2021-01-06 11:45:46,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5af3f296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:45:46, skipping insertion in model container [2021-01-06 11:45:46,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:45:46" (1/1) ... [2021-01-06 11:45:46,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:45:46,389 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] [2021-01-06 11:45:46,839 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label15.c[15626,15639] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2021-01-06 11:45:46,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:45:46,917 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a7~0,GLOBAL] [2021-01-06 11:45:46,994 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label15.c[15626,15639] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2021-01-06 11:45:47,051 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:45:47,069 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:45:47,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:45:47 WrapperNode [2021-01-06 11:45:47,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:45:47,071 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:45:47,071 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:45:47,071 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:45:47,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:45:47" (1/1) ... [2021-01-06 11:45:47,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:45:47" (1/1) ... [2021-01-06 11:45:47,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:45:47,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:45:47,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:45:47,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:45:47,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:45:47" (1/1) ... [2021-01-06 11:45:47,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:45:47" (1/1) ... [2021-01-06 11:45:47,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:45:47" (1/1) ... [2021-01-06 11:45:47,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:45:47" (1/1) ... [2021-01-06 11:45:47,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:45:47" (1/1) ... [2021-01-06 11:45:47,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:45:47" (1/1) ... [2021-01-06 11:45:47,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:45:47" (1/1) ... [2021-01-06 11:45:47,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:45:47,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:45:47,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:45:47,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:45:47,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:45:47" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:45:47,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:45:47,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:45:47,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:45:47,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:45:48,698 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:45:48,699 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:45:48,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:45:48 BoogieIcfgContainer [2021-01-06 11:45:48,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:45:48,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:45:48,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:45:48,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:45:48,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:45:46" (1/3) ... [2021-01-06 11:45:48,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6748a35a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:45:48, skipping insertion in model container [2021-01-06 11:45:48,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:45:47" (2/3) ... [2021-01-06 11:45:48,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6748a35a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:45:48, skipping insertion in model container [2021-01-06 11:45:48,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:45:48" (3/3) ... [2021-01-06 11:45:48,710 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem01_label15.c [2021-01-06 11:45:48,717 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:45:48,722 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:45:48,748 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:45:48,777 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:45:48,777 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:45:48,777 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:45:48,778 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:45:48,778 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:45:48,778 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:45:48,778 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:45:48,778 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:45:48,798 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2021-01-06 11:45:48,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 11:45:48,807 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:48,808 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:48,808 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:48,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:48,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1750994538, now seen corresponding path program 1 times [2021-01-06 11:45:48,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:48,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539520758] [2021-01-06 11:45:48,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:49,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:45:49,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539520758] [2021-01-06 11:45:49,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:49,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:45:49,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120432234] [2021-01-06 11:45:49,287 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:45:49,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:49,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:45:49,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:45:49,304 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2021-01-06 11:45:50,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:50,161 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2021-01-06 11:45:50,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:45:50,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2021-01-06 11:45:50,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:50,179 INFO L225 Difference]: With dead ends: 528 [2021-01-06 11:45:50,179 INFO L226 Difference]: Without dead ends: 266 [2021-01-06 11:45:50,184 INFO L677 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-01-06 11:45:50,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-01-06 11:45:50,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-01-06 11:45:50,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2021-01-06 11:45:50,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2021-01-06 11:45:50,251 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 81 [2021-01-06 11:45:50,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:50,252 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2021-01-06 11:45:50,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:45:50,253 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2021-01-06 11:45:50,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:45:50,256 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:50,257 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:50,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:45:50,257 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:50,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:50,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1970392163, now seen corresponding path program 1 times [2021-01-06 11:45:50,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:50,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716540942] [2021-01-06 11:45:50,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:45:50,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716540942] [2021-01-06 11:45:50,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:50,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:45:50,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32326773] [2021-01-06 11:45:50,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:45:50,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:50,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:45:50,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:45:50,401 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 3 states. [2021-01-06 11:45:50,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:50,902 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2021-01-06 11:45:50,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:45:50,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2021-01-06 11:45:50,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:50,908 INFO L225 Difference]: With dead ends: 792 [2021-01-06 11:45:50,908 INFO L226 Difference]: Without dead ends: 528 [2021-01-06 11:45:50,910 INFO L677 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-01-06 11:45:50,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-01-06 11:45:50,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2021-01-06 11:45:50,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2021-01-06 11:45:50,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 709 transitions. [2021-01-06 11:45:50,941 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 709 transitions. Word has length 87 [2021-01-06 11:45:50,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:50,942 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 709 transitions. [2021-01-06 11:45:50,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:45:50,942 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 709 transitions. [2021-01-06 11:45:50,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:45:50,946 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:50,946 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:50,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:45:50,947 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:50,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:50,948 INFO L82 PathProgramCache]: Analyzing trace with hash -592187037, now seen corresponding path program 1 times [2021-01-06 11:45:50,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:50,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216556363] [2021-01-06 11:45:50,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:45:51,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216556363] [2021-01-06 11:45:51,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:51,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:45:51,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523261787] [2021-01-06 11:45:51,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:45:51,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:51,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:45:51,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:45:51,096 INFO L87 Difference]: Start difference. First operand 528 states and 709 transitions. Second operand 3 states. [2021-01-06 11:45:51,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:51,680 INFO L93 Difference]: Finished difference Result 1578 states and 2122 transitions. [2021-01-06 11:45:51,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:45:51,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2021-01-06 11:45:51,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:51,687 INFO L225 Difference]: With dead ends: 1578 [2021-01-06 11:45:51,687 INFO L226 Difference]: Without dead ends: 1052 [2021-01-06 11:45:51,689 INFO L677 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-01-06 11:45:51,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2021-01-06 11:45:51,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2021-01-06 11:45:51,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2021-01-06 11:45:51,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1341 transitions. [2021-01-06 11:45:51,731 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1341 transitions. Word has length 88 [2021-01-06 11:45:51,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:51,732 INFO L481 AbstractCegarLoop]: Abstraction has 1052 states and 1341 transitions. [2021-01-06 11:45:51,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:45:51,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1341 transitions. [2021-01-06 11:45:51,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 11:45:51,743 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:51,743 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:51,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:45:51,744 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:51,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:51,745 INFO L82 PathProgramCache]: Analyzing trace with hash 2142108333, now seen corresponding path program 1 times [2021-01-06 11:45:51,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:51,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252154010] [2021-01-06 11:45:51,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:45:51,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252154010] [2021-01-06 11:45:51,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:51,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:45:51,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295838542] [2021-01-06 11:45:51,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:45:51,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:51,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:45:51,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:45:51,881 INFO L87 Difference]: Start difference. First operand 1052 states and 1341 transitions. Second operand 3 states. [2021-01-06 11:45:52,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:52,532 INFO L93 Difference]: Finished difference Result 2364 states and 3015 transitions. [2021-01-06 11:45:52,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:45:52,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2021-01-06 11:45:52,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:52,542 INFO L225 Difference]: With dead ends: 2364 [2021-01-06 11:45:52,542 INFO L226 Difference]: Without dead ends: 1314 [2021-01-06 11:45:52,544 INFO L677 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-01-06 11:45:52,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2021-01-06 11:45:52,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2021-01-06 11:45:52,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2021-01-06 11:45:52,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1479 transitions. [2021-01-06 11:45:52,582 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1479 transitions. Word has length 92 [2021-01-06 11:45:52,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:52,583 INFO L481 AbstractCegarLoop]: Abstraction has 1183 states and 1479 transitions. [2021-01-06 11:45:52,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:45:52,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1479 transitions. [2021-01-06 11:45:52,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:45:52,587 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:52,587 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-06 11:45:52,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:45:52,588 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:52,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:52,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1963035877, now seen corresponding path program 1 times [2021-01-06 11:45:52,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:52,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782020670] [2021-01-06 11:45:52,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 11:45:52,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782020670] [2021-01-06 11:45:52,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:52,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:45:52,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457982432] [2021-01-06 11:45:52,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:45:52,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:52,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:45:52,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:45:52,655 INFO L87 Difference]: Start difference. First operand 1183 states and 1479 transitions. Second operand 3 states. [2021-01-06 11:45:53,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:53,249 INFO L93 Difference]: Finished difference Result 3019 states and 3732 transitions. [2021-01-06 11:45:53,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:45:53,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2021-01-06 11:45:53,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:53,259 INFO L225 Difference]: With dead ends: 3019 [2021-01-06 11:45:53,260 INFO L226 Difference]: Without dead ends: 1838 [2021-01-06 11:45:53,262 INFO L677 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-01-06 11:45:53,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2021-01-06 11:45:53,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1576. [2021-01-06 11:45:53,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2021-01-06 11:45:53,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1914 transitions. [2021-01-06 11:45:53,309 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1914 transitions. Word has length 96 [2021-01-06 11:45:53,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:53,310 INFO L481 AbstractCegarLoop]: Abstraction has 1576 states and 1914 transitions. [2021-01-06 11:45:53,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:45:53,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1914 transitions. [2021-01-06 11:45:53,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 11:45:53,314 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:53,314 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:53,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:45:53,315 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:53,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:53,316 INFO L82 PathProgramCache]: Analyzing trace with hash -674726461, now seen corresponding path program 1 times [2021-01-06 11:45:53,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:53,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956700469] [2021-01-06 11:45:53,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:45:53,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956700469] [2021-01-06 11:45:53,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:53,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:45:53,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418190946] [2021-01-06 11:45:53,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:45:53,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:53,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:45:53,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:45:53,425 INFO L87 Difference]: Start difference. First operand 1576 states and 1914 transitions. Second operand 3 states. [2021-01-06 11:45:54,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:54,046 INFO L93 Difference]: Finished difference Result 3805 states and 4626 transitions. [2021-01-06 11:45:54,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:45:54,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 11:45:54,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:54,057 INFO L225 Difference]: With dead ends: 3805 [2021-01-06 11:45:54,057 INFO L226 Difference]: Without dead ends: 2231 [2021-01-06 11:45:54,060 INFO L677 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-01-06 11:45:54,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2021-01-06 11:45:54,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1838. [2021-01-06 11:45:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2021-01-06 11:45:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2230 transitions. [2021-01-06 11:45:54,107 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2230 transitions. Word has length 105 [2021-01-06 11:45:54,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:54,107 INFO L481 AbstractCegarLoop]: Abstraction has 1838 states and 2230 transitions. [2021-01-06 11:45:54,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:45:54,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2230 transitions. [2021-01-06 11:45:54,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 11:45:54,111 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:54,111 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:45:54,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:45:54,112 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:54,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:54,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1891020617, now seen corresponding path program 1 times [2021-01-06 11:45:54,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:54,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926317700] [2021-01-06 11:45:54,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:45:54,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926317700] [2021-01-06 11:45:54,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:54,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:45:54,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626814091] [2021-01-06 11:45:54,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:45:54,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:54,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:45:54,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:45:54,191 INFO L87 Difference]: Start difference. First operand 1838 states and 2230 transitions. Second operand 3 states. [2021-01-06 11:45:54,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:54,756 INFO L93 Difference]: Finished difference Result 4067 states and 4930 transitions. [2021-01-06 11:45:54,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:45:54,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2021-01-06 11:45:54,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:54,767 INFO L225 Difference]: With dead ends: 4067 [2021-01-06 11:45:54,767 INFO L226 Difference]: Without dead ends: 2100 [2021-01-06 11:45:54,771 INFO L677 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-01-06 11:45:54,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2021-01-06 11:45:54,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2100. [2021-01-06 11:45:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2021-01-06 11:45:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2368 transitions. [2021-01-06 11:45:54,819 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2368 transitions. Word has length 121 [2021-01-06 11:45:54,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:54,819 INFO L481 AbstractCegarLoop]: Abstraction has 2100 states and 2368 transitions. [2021-01-06 11:45:54,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:45:54,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2368 transitions. [2021-01-06 11:45:54,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-01-06 11:45:54,826 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:54,826 INFO L422 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, 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] [2021-01-06 11:45:54,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:45:54,827 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:54,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:54,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1795509435, now seen corresponding path program 1 times [2021-01-06 11:45:54,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:54,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921540064] [2021-01-06 11:45:54,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 64 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-01-06 11:45:54,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921540064] [2021-01-06 11:45:54,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11660470] [2021-01-06 11:45:54,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:45:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:55,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:45:55,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:45:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:45:55,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:45:55,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2021-01-06 11:45:55,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115865149] [2021-01-06 11:45:55,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:55,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:55,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:55,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 11:45:55,420 INFO L87 Difference]: Start difference. First operand 2100 states and 2368 transitions. Second operand 4 states. [2021-01-06 11:45:56,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:56,384 INFO L93 Difference]: Finished difference Result 4722 states and 5367 transitions. [2021-01-06 11:45:56,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:56,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2021-01-06 11:45:56,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:56,403 INFO L225 Difference]: With dead ends: 4722 [2021-01-06 11:45:56,403 INFO L226 Difference]: Without dead ends: 2624 [2021-01-06 11:45:56,407 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 11:45:56,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2021-01-06 11:45:56,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2231. [2021-01-06 11:45:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2021-01-06 11:45:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2508 transitions. [2021-01-06 11:45:56,461 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2508 transitions. Word has length 144 [2021-01-06 11:45:56,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:56,461 INFO L481 AbstractCegarLoop]: Abstraction has 2231 states and 2508 transitions. [2021-01-06 11:45:56,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:56,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2508 transitions. [2021-01-06 11:45:56,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-01-06 11:45:56,466 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:56,466 INFO L422 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, 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] [2021-01-06 11:45:56,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-01-06 11:45:56,682 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:56,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:56,683 INFO L82 PathProgramCache]: Analyzing trace with hash 43839704, now seen corresponding path program 1 times [2021-01-06 11:45:56,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:56,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224013329] [2021-01-06 11:45:56,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-01-06 11:45:56,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224013329] [2021-01-06 11:45:56,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:45:56,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:45:56,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975783514] [2021-01-06 11:45:56,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:45:56,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:56,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:45:56,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:45:56,847 INFO L87 Difference]: Start difference. First operand 2231 states and 2508 transitions. Second operand 4 states. [2021-01-06 11:45:57,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:57,592 INFO L93 Difference]: Finished difference Result 4853 states and 5443 transitions. [2021-01-06 11:45:57,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:45:57,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2021-01-06 11:45:57,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:57,606 INFO L225 Difference]: With dead ends: 4853 [2021-01-06 11:45:57,606 INFO L226 Difference]: Without dead ends: 2624 [2021-01-06 11:45:57,610 INFO L677 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-01-06 11:45:57,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2021-01-06 11:45:57,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2100. [2021-01-06 11:45:57,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2021-01-06 11:45:57,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2336 transitions. [2021-01-06 11:45:57,691 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2336 transitions. Word has length 161 [2021-01-06 11:45:57,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:57,692 INFO L481 AbstractCegarLoop]: Abstraction has 2100 states and 2336 transitions. [2021-01-06 11:45:57,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:45:57,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2336 transitions. [2021-01-06 11:45:57,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-01-06 11:45:57,698 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:57,699 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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] [2021-01-06 11:45:57,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:45:57,699 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:57,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:57,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1413505639, now seen corresponding path program 1 times [2021-01-06 11:45:57,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:57,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934067556] [2021-01-06 11:45:57,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:57,829 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 66 proven. 3 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2021-01-06 11:45:57,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934067556] [2021-01-06 11:45:57,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522409222] [2021-01-06 11:45:57,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:45:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:57,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 11:45:57,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:45:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-01-06 11:45:58,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:45:58,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-01-06 11:45:58,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318604386] [2021-01-06 11:45:58,163 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:45:58,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:58,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:45:58,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:45:58,165 INFO L87 Difference]: Start difference. First operand 2100 states and 2336 transitions. Second operand 3 states. [2021-01-06 11:45:58,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:58,676 INFO L93 Difference]: Finished difference Result 4460 states and 4943 transitions. [2021-01-06 11:45:58,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:45:58,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2021-01-06 11:45:58,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:58,687 INFO L225 Difference]: With dead ends: 4460 [2021-01-06 11:45:58,688 INFO L226 Difference]: Without dead ends: 2362 [2021-01-06 11:45:58,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 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-01-06 11:45:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2021-01-06 11:45:58,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2231. [2021-01-06 11:45:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2021-01-06 11:45:58,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2448 transitions. [2021-01-06 11:45:58,745 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2448 transitions. Word has length 186 [2021-01-06 11:45:58,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:45:58,746 INFO L481 AbstractCegarLoop]: Abstraction has 2231 states and 2448 transitions. [2021-01-06 11:45:58,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:45:58,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2448 transitions. [2021-01-06 11:45:58,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-01-06 11:45:58,752 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:45:58,752 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2021-01-06 11:45:58,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-06 11:45:58,966 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:45:58,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:45:58,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1309638180, now seen corresponding path program 1 times [2021-01-06 11:45:58,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:45:58,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924564329] [2021-01-06 11:45:58,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:45:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:59,086 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 108 proven. 3 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2021-01-06 11:45:59,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924564329] [2021-01-06 11:45:59,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884319507] [2021-01-06 11:45:59,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:45:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:45:59,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 11:45:59,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:45:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-01-06 11:45:59,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:45:59,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-01-06 11:45:59,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139087848] [2021-01-06 11:45:59,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:45:59,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:45:59,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:45:59,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:45:59,433 INFO L87 Difference]: Start difference. First operand 2231 states and 2448 transitions. Second operand 3 states. [2021-01-06 11:45:59,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:45:59,903 INFO L93 Difference]: Finished difference Result 4460 states and 4894 transitions. [2021-01-06 11:45:59,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:45:59,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2021-01-06 11:45:59,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:45:59,915 INFO L225 Difference]: With dead ends: 4460 [2021-01-06 11:45:59,915 INFO L226 Difference]: Without dead ends: 2231 [2021-01-06 11:45:59,920 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 199 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-01-06 11:45:59,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2021-01-06 11:46:00,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2100. [2021-01-06 11:46:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2021-01-06 11:46:00,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2275 transitions. [2021-01-06 11:46:00,014 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2275 transitions. Word has length 200 [2021-01-06 11:46:00,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:00,015 INFO L481 AbstractCegarLoop]: Abstraction has 2100 states and 2275 transitions. [2021-01-06 11:46:00,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:00,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2275 transitions. [2021-01-06 11:46:00,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2021-01-06 11:46:00,020 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:00,020 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2021-01-06 11:46:00,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-01-06 11:46:00,231 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:00,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:00,233 INFO L82 PathProgramCache]: Analyzing trace with hash 260041494, now seen corresponding path program 1 times [2021-01-06 11:46:00,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:00,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570099668] [2021-01-06 11:46:00,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 115 proven. 3 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2021-01-06 11:46:00,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570099668] [2021-01-06 11:46:00,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623137393] [2021-01-06 11:46:00,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:46:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:46:00,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 11:46:00,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:46:00,715 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-01-06 11:46:00,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:46:00,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-01-06 11:46:00,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016123212] [2021-01-06 11:46:00,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:46:00,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:46:00,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:46:00,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:46:00,718 INFO L87 Difference]: Start difference. First operand 2100 states and 2275 transitions. Second operand 3 states. [2021-01-06 11:46:01,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:46:01,286 INFO L93 Difference]: Finished difference Result 4198 states and 4548 transitions. [2021-01-06 11:46:01,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:46:01,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2021-01-06 11:46:01,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:46:01,296 INFO L225 Difference]: With dead ends: 4198 [2021-01-06 11:46:01,296 INFO L226 Difference]: Without dead ends: 2100 [2021-01-06 11:46:01,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 202 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-01-06 11:46:01,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2021-01-06 11:46:01,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2021-01-06 11:46:01,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2021-01-06 11:46:01,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2131 transitions. [2021-01-06 11:46:01,339 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2131 transitions. Word has length 203 [2021-01-06 11:46:01,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:46:01,339 INFO L481 AbstractCegarLoop]: Abstraction has 1969 states and 2131 transitions. [2021-01-06 11:46:01,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:46:01,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2131 transitions. [2021-01-06 11:46:01,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2021-01-06 11:46:01,345 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:46:01,345 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:46:01,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:46:01,560 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:46:01,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:46:01,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1192071439, now seen corresponding path program 1 times [2021-01-06 11:46:01,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:46:01,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912266548] [2021-01-06 11:46:01,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:46:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:46:01,625 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:46:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:46:01,686 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:46:01,766 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 11:46:01,767 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 11:46:01,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:46:01,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:46:01 BoogieIcfgContainer [2021-01-06 11:46:01,976 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:46:01,977 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:46:01,978 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:46:01,978 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:46:01,979 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:45:48" (3/4) ... [2021-01-06 11:46:01,981 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 11:46:02,199 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/eca-rers2012/Problem01_label15.c-witness.graphml [2021-01-06 11:46:02,199 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:46:02,201 INFO L168 Benchmark]: Toolchain (without parser) took 15921.12 ms. Allocated memory was 155.2 MB in the beginning and 398.5 MB in the end (delta: 243.3 MB). Free memory was 128.1 MB in the beginning and 175.1 MB in the end (delta: -47.1 MB). Peak memory consumption was 197.7 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:02,202 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 155.2 MB. Free memory is still 127.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:46:02,202 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.45 ms. Allocated memory is still 155.2 MB. Free memory was 127.8 MB in the beginning and 133.1 MB in the end (delta: -5.2 MB). Peak memory consumption was 29.0 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:02,205 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.92 ms. Allocated memory is still 155.2 MB. Free memory was 133.1 MB in the beginning and 127.3 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:02,206 INFO L168 Benchmark]: Boogie Preprocessor took 134.97 ms. Allocated memory is still 155.2 MB. Free memory was 127.3 MB in the beginning and 123.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:02,207 INFO L168 Benchmark]: RCFGBuilder took 1377.05 ms. Allocated memory is still 155.2 MB. Free memory was 122.6 MB in the beginning and 101.2 MB in the end (delta: 21.3 MB). Peak memory consumption was 79.7 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:02,208 INFO L168 Benchmark]: TraceAbstraction took 13273.34 ms. Allocated memory was 155.2 MB in the beginning and 398.5 MB in the end (delta: 243.3 MB). Free memory was 101.2 MB in the beginning and 211.3 MB in the end (delta: -110.1 MB). Peak memory consumption was 133.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:02,213 INFO L168 Benchmark]: Witness Printer took 222.19 ms. Allocated memory is still 398.5 MB. Free memory was 211.3 MB in the beginning and 175.1 MB in the end (delta: 36.2 MB). Peak memory consumption was 36.7 MB. Max. memory is 8.0 GB. [2021-01-06 11:46:02,220 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.19 ms. Allocated memory is still 155.2 MB. Free memory is still 127.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 782.45 ms. Allocated memory is still 155.2 MB. Free memory was 127.8 MB in the beginning and 133.1 MB in the end (delta: -5.2 MB). Peak memory consumption was 29.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 116.92 ms. Allocated memory is still 155.2 MB. Free memory was 133.1 MB in the beginning and 127.3 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 134.97 ms. Allocated memory is still 155.2 MB. Free memory was 127.3 MB in the beginning and 123.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1377.05 ms. Allocated memory is still 155.2 MB. Free memory was 122.6 MB in the beginning and 101.2 MB in the end (delta: 21.3 MB). Peak memory consumption was 79.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 13273.34 ms. Allocated memory was 155.2 MB in the beginning and 398.5 MB in the end (delta: 243.3 MB). Free memory was 101.2 MB in the beginning and 211.3 MB in the end (delta: -110.1 MB). Peak memory consumption was 133.2 MB. Max. memory is 8.0 GB. * Witness Printer took 222.19 ms. Allocated memory is still 398.5 MB. Free memory was 211.3 MB in the beginning and 175.1 MB in the end (delta: 36.2 MB). Peak memory consumption was 36.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 429]: 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, 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)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) 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] [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 [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] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) 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] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) 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] [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 [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] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) 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] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==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] [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 [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] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) 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] [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 [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] [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 [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] [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 [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] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==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] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) 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] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) 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] [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 [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] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) 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] [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 [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] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==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] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==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] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) 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] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==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] [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 [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] [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 [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] [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 [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] [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 [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] [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 [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] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) 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] [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 [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] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) 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] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) 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] [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 [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] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) 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] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==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] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==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] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==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] [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 [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] [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 [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] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==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] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) 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] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==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] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) 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] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) 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] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) 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] [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 [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] [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 [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] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==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] [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 [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] [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 [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] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) 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] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) 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] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) 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] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) 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] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==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] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(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] [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 [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, u=21, v=22, w=23, x=24, y=25, z=26] [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)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, u=21, v=22, w=23, x=24, y=25, z=26] [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)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, u=21, v=22, w=23, x=24, y=25, z=26] [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)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND TRUE ((((((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)) [L189] a17 = 0 [L190] a16 = 5 [L191] a21 = 1 [L192] a8 = 14 [L193] a7 = 1 [L194] a20 = 1 [L195] return -1; VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L422] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L425] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L428] COND TRUE ((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L429] reach_error() VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, 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. VerificationResult: UNSAFE, OverallTime: 12.9s, OverallIterations: 13, TraceHistogramMax: 6, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 897 SDtfs, 1687 SDslu, 70 SDs, 0 SdLazy, 4274 SolverSat, 788 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 760 GetRequests, 738 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2231occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 2096 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2523 NumberOfCodeBlocks, 2523 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2281 ConstructedInterpolants, 0 QuantifiedInterpolants, 736097 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1595 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 1822/1834 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! Received shutdown request...