/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/Problem02_label43.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:48:17,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:48:17,675 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:48:17,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:48:17,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:48:17,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:48:17,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:48:17,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:48:17,755 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:48:17,761 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:48:17,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:48:17,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:48:17,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:48:17,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:48:17,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:48:17,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:48:17,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:48:17,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:48:17,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:48:17,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:48:17,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:48:17,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:48:17,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:48:17,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:48:17,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:48:17,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:48:17,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:48:17,876 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:48:17,876 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:48:17,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:48:17,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:48:17,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:48:17,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:48:17,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:48:17,883 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:48:17,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:48:17,885 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:48:17,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:48:17,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:48:17,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:48:17,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:48:17,896 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:48:17,944 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:48:17,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:48:17,950 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:48:17,950 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:48:17,950 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:48:17,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:48:17,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:48:17,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:48:17,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:48:17,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:48:17,953 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:48:17,953 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:48:17,954 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:48:17,954 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:48:17,954 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:48:17,954 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:48:17,955 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:48:17,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:48:17,955 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:48:17,955 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:48:17,955 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:48:17,956 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:48:17,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:48:17,956 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:48:17,956 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:48:17,956 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:48:18,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:48:18,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:48:18,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:48:18,456 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:48:18,457 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:48:18,458 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label43.c [2021-01-06 11:48:18,554 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b3d6ad698/949fd7eaeceb4072a9b1685d9778b6f1/FLAG5dfd377f2 [2021-01-06 11:48:19,274 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:48:19,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label43.c [2021-01-06 11:48:19,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b3d6ad698/949fd7eaeceb4072a9b1685d9778b6f1/FLAG5dfd377f2 [2021-01-06 11:48:19,536 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b3d6ad698/949fd7eaeceb4072a9b1685d9778b6f1 [2021-01-06 11:48:19,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:48:19,544 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:48:19,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:48:19,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:48:19,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:48:19,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:48:19" (1/1) ... [2021-01-06 11:48:19,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27cd7cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:19, skipping insertion in model container [2021-01-06 11:48:19,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:48:19" (1/1) ... [2021-01-06 11:48:19,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:48:19,649 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~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[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~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[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] [2021-01-06 11:48:20,087 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/Problem02_label43.c[15084,15097] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2021-01-06 11:48:20,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:48:20,147 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~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[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~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[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a28~0,GLOBAL] [2021-01-06 11:48:20,280 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/Problem02_label43.c[15084,15097] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2021-01-06 11:48:20,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:48:20,359 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:48:20,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:20 WrapperNode [2021-01-06 11:48:20,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:48:20,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:48:20,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:48:20,363 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:48:20,385 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:48:20" (1/1) ... [2021-01-06 11:48:20,437 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:48:20" (1/1) ... [2021-01-06 11:48:20,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:48:20,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:48:20,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:48:20,527 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:48:20,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:20" (1/1) ... [2021-01-06 11:48:20,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:20" (1/1) ... [2021-01-06 11:48:20,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:20" (1/1) ... [2021-01-06 11:48:20,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:20" (1/1) ... [2021-01-06 11:48:20,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:20" (1/1) ... [2021-01-06 11:48:20,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:20" (1/1) ... [2021-01-06 11:48:20,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:20" (1/1) ... [2021-01-06 11:48:20,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:48:20,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:48:20,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:48:20,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:48:20,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:20" (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:48:20,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:48:20,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:48:20,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:48:20,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:48:22,020 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:48:22,020 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:48:22,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:48:22 BoogieIcfgContainer [2021-01-06 11:48:22,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:48:22,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:48:22,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:48:22,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:48:22,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:48:19" (1/3) ... [2021-01-06 11:48:22,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c711a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:48:22, skipping insertion in model container [2021-01-06 11:48:22,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:20" (2/3) ... [2021-01-06 11:48:22,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c711a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:48:22, skipping insertion in model container [2021-01-06 11:48:22,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:48:22" (3/3) ... [2021-01-06 11:48:22,032 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem02_label43.c [2021-01-06 11:48:22,040 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:48:22,046 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:48:22,088 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:48:22,162 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:48:22,163 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:48:22,163 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:48:22,163 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:48:22,163 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:48:22,164 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:48:22,164 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:48:22,164 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:48:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2021-01-06 11:48:22,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 11:48:22,233 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:48:22,234 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, 1, 1, 1, 1] [2021-01-06 11:48:22,234 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:48:22,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:48:22,240 INFO L82 PathProgramCache]: Analyzing trace with hash -505929285, now seen corresponding path program 1 times [2021-01-06 11:48:22,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:48:22,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969960269] [2021-01-06 11:48:22,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:48:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:22,741 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:48:22,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969960269] [2021-01-06 11:48:22,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:48:22,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:48:22,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720488204] [2021-01-06 11:48:22,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:48:22,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:48:22,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:48:22,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:48:22,771 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2021-01-06 11:48:23,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:48:23,814 INFO L93 Difference]: Finished difference Result 630 states and 1070 transitions. [2021-01-06 11:48:23,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:48:23,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 11:48:23,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:48:23,834 INFO L225 Difference]: With dead ends: 630 [2021-01-06 11:48:23,834 INFO L226 Difference]: Without dead ends: 318 [2021-01-06 11:48:23,839 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:48:23,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-01-06 11:48:23,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2021-01-06 11:48:23,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2021-01-06 11:48:23,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 467 transitions. [2021-01-06 11:48:23,908 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 467 transitions. Word has length 85 [2021-01-06 11:48:23,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:48:23,909 INFO L481 AbstractCegarLoop]: Abstraction has 318 states and 467 transitions. [2021-01-06 11:48:23,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:48:23,909 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 467 transitions. [2021-01-06 11:48:23,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 11:48:23,914 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:48:23,914 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2021-01-06 11:48:23,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:48:23,915 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:48:23,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:48:23,916 INFO L82 PathProgramCache]: Analyzing trace with hash -822901968, now seen corresponding path program 1 times [2021-01-06 11:48:23,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:48:23,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756851157] [2021-01-06 11:48:23,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:48:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:48:24,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756851157] [2021-01-06 11:48:24,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:48:24,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:48:24,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352874677] [2021-01-06 11:48:24,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:48:24,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:48:24,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:48:24,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:48:24,080 INFO L87 Difference]: Start difference. First operand 318 states and 467 transitions. Second operand 3 states. [2021-01-06 11:48:24,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:48:24,742 INFO L93 Difference]: Finished difference Result 919 states and 1357 transitions. [2021-01-06 11:48:24,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:48:24,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2021-01-06 11:48:24,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:48:24,747 INFO L225 Difference]: With dead ends: 919 [2021-01-06 11:48:24,747 INFO L226 Difference]: Without dead ends: 603 [2021-01-06 11:48:24,749 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:48:24,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2021-01-06 11:48:24,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2021-01-06 11:48:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2021-01-06 11:48:24,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 775 transitions. [2021-01-06 11:48:24,780 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 775 transitions. Word has length 89 [2021-01-06 11:48:24,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:48:24,781 INFO L481 AbstractCegarLoop]: Abstraction has 601 states and 775 transitions. [2021-01-06 11:48:24,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:48:24,781 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 775 transitions. [2021-01-06 11:48:24,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 11:48:24,786 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:48:24,787 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:48:24,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:48:24,787 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:48:24,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:48:24,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1278296443, now seen corresponding path program 1 times [2021-01-06 11:48:24,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:48:24,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138149522] [2021-01-06 11:48:24,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:48:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:48:24,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138149522] [2021-01-06 11:48:24,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600999290] [2021-01-06 11:48:24,932 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:48:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:25,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:48:25,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:48:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:48:25,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:48:25,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2021-01-06 11:48:25,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637723841] [2021-01-06 11:48:25,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:48:25,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:48:25,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:48:25,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:48:25,147 INFO L87 Difference]: Start difference. First operand 601 states and 775 transitions. Second operand 3 states. [2021-01-06 11:48:25,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:48:25,932 INFO L93 Difference]: Finished difference Result 1486 states and 1974 transitions. [2021-01-06 11:48:25,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:48:25,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2021-01-06 11:48:25,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:48:25,942 INFO L225 Difference]: With dead ends: 1486 [2021-01-06 11:48:25,942 INFO L226 Difference]: Without dead ends: 887 [2021-01-06 11:48:25,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:48:25,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2021-01-06 11:48:25,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2021-01-06 11:48:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2021-01-06 11:48:25,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1089 transitions. [2021-01-06 11:48:25,991 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1089 transitions. Word has length 94 [2021-01-06 11:48:25,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:48:25,991 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 1089 transitions. [2021-01-06 11:48:25,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:48:25,992 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1089 transitions. [2021-01-06 11:48:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 11:48:26,005 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:48:26,006 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2021-01-06 11:48:26,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-06 11:48:26,222 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:48:26,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:48:26,224 INFO L82 PathProgramCache]: Analyzing trace with hash -902378049, now seen corresponding path program 1 times [2021-01-06 11:48:26,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:48:26,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546273900] [2021-01-06 11:48:26,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:48:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:48:26,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546273900] [2021-01-06 11:48:26,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:48:26,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:48:26,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001397163] [2021-01-06 11:48:26,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:48:26,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:48:26,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:48:26,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:48:26,308 INFO L87 Difference]: Start difference. First operand 885 states and 1089 transitions. Second operand 3 states. [2021-01-06 11:48:26,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:48:26,971 INFO L93 Difference]: Finished difference Result 2469 states and 3053 transitions. [2021-01-06 11:48:26,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:48:26,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2021-01-06 11:48:26,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:48:26,980 INFO L225 Difference]: With dead ends: 2469 [2021-01-06 11:48:26,980 INFO L226 Difference]: Without dead ends: 1586 [2021-01-06 11:48:26,982 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:48:26,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2021-01-06 11:48:27,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1586. [2021-01-06 11:48:27,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2021-01-06 11:48:27,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 1895 transitions. [2021-01-06 11:48:27,049 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 1895 transitions. Word has length 95 [2021-01-06 11:48:27,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:48:27,052 INFO L481 AbstractCegarLoop]: Abstraction has 1586 states and 1895 transitions. [2021-01-06 11:48:27,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:48:27,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 1895 transitions. [2021-01-06 11:48:27,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:48:27,060 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:48:27,060 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1] [2021-01-06 11:48:27,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:48:27,061 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:48:27,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:48:27,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1002437169, now seen corresponding path program 1 times [2021-01-06 11:48:27,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:48:27,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325424767] [2021-01-06 11:48:27,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:48:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:27,173 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:48:27,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325424767] [2021-01-06 11:48:27,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:48:27,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:48:27,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407685436] [2021-01-06 11:48:27,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:48:27,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:48:27,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:48:27,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:48:27,180 INFO L87 Difference]: Start difference. First operand 1586 states and 1895 transitions. Second operand 3 states. [2021-01-06 11:48:27,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:48:27,807 INFO L93 Difference]: Finished difference Result 3731 states and 4456 transitions. [2021-01-06 11:48:27,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:48:27,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2021-01-06 11:48:27,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:48:27,819 INFO L225 Difference]: With dead ends: 3731 [2021-01-06 11:48:27,820 INFO L226 Difference]: Without dead ends: 2147 [2021-01-06 11:48:27,822 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:48:27,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2021-01-06 11:48:27,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2146. [2021-01-06 11:48:27,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2021-01-06 11:48:27,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 2480 transitions. [2021-01-06 11:48:27,872 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 2480 transitions. Word has length 98 [2021-01-06 11:48:27,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:48:27,872 INFO L481 AbstractCegarLoop]: Abstraction has 2146 states and 2480 transitions. [2021-01-06 11:48:27,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:48:27,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2480 transitions. [2021-01-06 11:48:27,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-01-06 11:48:27,876 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:48:27,876 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:48:27,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:48:27,877 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:48:27,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:48:27,877 INFO L82 PathProgramCache]: Analyzing trace with hash 829926334, now seen corresponding path program 1 times [2021-01-06 11:48:27,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:48:27,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504617642] [2021-01-06 11:48:27,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:48:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:48:27,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504617642] [2021-01-06 11:48:27,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:48:27,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:48:27,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153673666] [2021-01-06 11:48:27,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:48:27,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:48:27,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:48:27,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:48:27,944 INFO L87 Difference]: Start difference. First operand 2146 states and 2480 transitions. Second operand 3 states. [2021-01-06 11:48:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:48:28,683 INFO L93 Difference]: Finished difference Result 4291 states and 4960 transitions. [2021-01-06 11:48:28,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:48:28,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2021-01-06 11:48:28,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:48:28,695 INFO L225 Difference]: With dead ends: 4291 [2021-01-06 11:48:28,695 INFO L226 Difference]: Without dead ends: 2147 [2021-01-06 11:48:28,699 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:48:28,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2021-01-06 11:48:28,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2146. [2021-01-06 11:48:28,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2021-01-06 11:48:28,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 2425 transitions. [2021-01-06 11:48:28,767 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 2425 transitions. Word has length 114 [2021-01-06 11:48:28,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:48:28,772 INFO L481 AbstractCegarLoop]: Abstraction has 2146 states and 2425 transitions. [2021-01-06 11:48:28,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:48:28,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2425 transitions. [2021-01-06 11:48:28,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 11:48:28,776 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:48:28,777 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 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:48:28,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:48:28,779 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:48:28,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:48:28,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1346999800, now seen corresponding path program 1 times [2021-01-06 11:48:28,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:48:28,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810029246] [2021-01-06 11:48:28,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:48:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:28,852 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:48:28,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810029246] [2021-01-06 11:48:28,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:48:28,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:48:28,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443216143] [2021-01-06 11:48:28,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:48:28,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:48:28,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:48:28,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:48:28,855 INFO L87 Difference]: Start difference. First operand 2146 states and 2425 transitions. Second operand 3 states. [2021-01-06 11:48:29,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:48:29,462 INFO L93 Difference]: Finished difference Result 4863 states and 5612 transitions. [2021-01-06 11:48:29,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:48:29,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2021-01-06 11:48:29,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:48:29,478 INFO L225 Difference]: With dead ends: 4863 [2021-01-06 11:48:29,478 INFO L226 Difference]: Without dead ends: 2719 [2021-01-06 11:48:29,483 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:48:29,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2021-01-06 11:48:29,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 2710. [2021-01-06 11:48:29,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2021-01-06 11:48:29,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3096 transitions. [2021-01-06 11:48:29,545 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3096 transitions. Word has length 118 [2021-01-06 11:48:29,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:48:29,545 INFO L481 AbstractCegarLoop]: Abstraction has 2710 states and 3096 transitions. [2021-01-06 11:48:29,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:48:29,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3096 transitions. [2021-01-06 11:48:29,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-01-06 11:48:29,549 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:48:29,549 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 11:48:29,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:48:29,550 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:48:29,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:48:29,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1135632787, now seen corresponding path program 1 times [2021-01-06 11:48:29,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:48:29,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472835163] [2021-01-06 11:48:29,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:48:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:48:29,612 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:48:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:48:29,672 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:48:29,731 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 11:48:29,732 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 11:48:29,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:48:29,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:48:29 BoogieIcfgContainer [2021-01-06 11:48:29,903 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:48:29,904 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:48:29,904 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:48:29,905 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:48:29,905 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:48:22" (3/4) ... [2021-01-06 11:48:29,908 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 11:48:30,117 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/eca-rers2012/Problem02_label43.c-witness.graphml [2021-01-06 11:48:30,118 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:48:30,120 INFO L168 Benchmark]: Toolchain (without parser) took 10576.65 ms. Allocated memory was 160.4 MB in the beginning and 274.7 MB in the end (delta: 114.3 MB). Free memory was 141.4 MB in the beginning and 122.1 MB in the end (delta: 19.3 MB). Peak memory consumption was 133.9 MB. Max. memory is 8.0 GB. [2021-01-06 11:48:30,121 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 160.4 MB. Free memory is still 133.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:48:30,121 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.85 ms. Allocated memory is still 160.4 MB. Free memory was 141.2 MB in the beginning and 115.2 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:48:30,122 INFO L168 Benchmark]: Boogie Procedure Inliner took 164.14 ms. Allocated memory is still 160.4 MB. Free memory was 115.2 MB in the beginning and 136.6 MB in the end (delta: -21.4 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:48:30,122 INFO L168 Benchmark]: Boogie Preprocessor took 118.99 ms. Allocated memory is still 160.4 MB. Free memory was 136.6 MB in the beginning and 132.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:48:30,123 INFO L168 Benchmark]: RCFGBuilder took 1375.82 ms. Allocated memory was 160.4 MB in the beginning and 199.2 MB in the end (delta: 38.8 MB). Free memory was 132.4 MB in the beginning and 116.8 MB in the end (delta: 15.5 MB). Peak memory consumption was 53.8 MB. Max. memory is 8.0 GB. [2021-01-06 11:48:30,123 INFO L168 Benchmark]: TraceAbstraction took 7878.18 ms. Allocated memory was 199.2 MB in the beginning and 274.7 MB in the end (delta: 75.5 MB). Free memory was 116.3 MB in the beginning and 141.1 MB in the end (delta: -24.7 MB). Peak memory consumption was 51.8 MB. Max. memory is 8.0 GB. [2021-01-06 11:48:30,123 INFO L168 Benchmark]: Witness Printer took 213.56 ms. Allocated memory is still 274.7 MB. Free memory was 141.1 MB in the beginning and 122.1 MB in the end (delta: 19.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. [2021-01-06 11:48:30,126 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.20 ms. Allocated memory is still 160.4 MB. Free memory is still 133.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 814.85 ms. Allocated memory is still 160.4 MB. Free memory was 141.2 MB in the beginning and 115.2 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 164.14 ms. Allocated memory is still 160.4 MB. Free memory was 115.2 MB in the beginning and 136.6 MB in the end (delta: -21.4 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 118.99 ms. Allocated memory is still 160.4 MB. Free memory was 136.6 MB in the beginning and 132.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1375.82 ms. Allocated memory was 160.4 MB in the beginning and 199.2 MB in the end (delta: 38.8 MB). Free memory was 132.4 MB in the beginning and 116.8 MB in the end (delta: 15.5 MB). Peak memory consumption was 53.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7878.18 ms. Allocated memory was 199.2 MB in the beginning and 274.7 MB in the end (delta: 75.5 MB). Free memory was 116.3 MB in the beginning and 141.1 MB in the end (delta: -24.7 MB). Peak memory consumption was 51.8 MB. Max. memory is 8.0 GB. * Witness Printer took 213.56 ms. Allocated memory is still 274.7 MB. Free memory was 141.1 MB in the beginning and 122.1 MB in the end (delta: 19.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 437]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int e= 5; [L19] int d= 4; [L20] int f= 6; [L21] int c= 3; [L24] int u = 21; [L25] int v = 22; [L26] int w = 23; [L27] int x = 24; [L28] int y = 25; [L29] int z = 26; [L32] int a25 = 0; [L33] int a11 = 0; [L34] int a28 = 7; [L35] int a19 = 1; [L36] int a21 = 1; [L37] int a17 = 8; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L613] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND TRUE (((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1)) [L176] a25 = 1 [L177] a28 = 9 [L178] return 26; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L40] COND TRUE (((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)) [L41] a28 = 9 [L42] a11 = 1 [L43] a25 = 1 [L44] return -1; VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L408] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L424] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L427] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L430] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L433] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L436] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L437] reach_error() VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, 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, 227 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.5s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1030 SDtfs, 1072 SDslu, 123 SDs, 0 SdLazy, 2669 SolverSat, 501 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2710occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 906 NumberOfCodeBlocks, 906 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 779 ConstructedInterpolants, 0 QuantifiedInterpolants, 112691 SizeOfPredicates, 0 NumberOfNonLiveVariables, 229 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 118/121 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...