/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_label59.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:48:41,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:48:41,066 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:48:41,127 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:48:41,128 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:48:41,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:48:41,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:48:41,141 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:48:41,144 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:48:41,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:48:41,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:48:41,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:48:41,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:48:41,159 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:48:41,162 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:48:41,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:48:41,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:48:41,179 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:48:41,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:48:41,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:48:41,195 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:48:41,196 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:48:41,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:48:41,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:48:41,209 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:48:41,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:48:41,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:48:41,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:48:41,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:48:41,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:48:41,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:48:41,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:48:41,221 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:48:41,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:48:41,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:48:41,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:48:41,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:48:41,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:48:41,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:48:41,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:48:41,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:48:41,238 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:41,292 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:48:41,293 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:48:41,298 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:48:41,298 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:48:41,299 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:48:41,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:48:41,299 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:48:41,299 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:48:41,300 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:48:41,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:48:41,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:48:41,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:48:41,302 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:48:41,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:48:41,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:48:41,302 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:48:41,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:48:41,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:48:41,303 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:48:41,303 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:48:41,303 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:48:41,304 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:48:41,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:48:41,304 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:48:41,304 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:48:41,304 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:41,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:48:41,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:48:41,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:48:41,764 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:48:41,764 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:48:41,765 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label59.c [2021-01-06 11:48:41,869 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/84c9ecbf2/e16bfb7e642b49d8b6251e3e6d8a9ce5/FLAGd8fe1559f [2021-01-06 11:48:42,690 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:48:42,691 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label59.c [2021-01-06 11:48:42,717 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/84c9ecbf2/e16bfb7e642b49d8b6251e3e6d8a9ce5/FLAGd8fe1559f [2021-01-06 11:48:42,907 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/84c9ecbf2/e16bfb7e642b49d8b6251e3e6d8a9ce5 [2021-01-06 11:48:42,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:48:42,917 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:48:42,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:48:42,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:48:42,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:48:42,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:48:42" (1/1) ... [2021-01-06 11:48:42,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ad61345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:42, skipping insertion in model container [2021-01-06 11:48:42,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:48:42" (1/1) ... [2021-01-06 11:48:42,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:48:43,013 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:43,401 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_label59.c[14857,14870] 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:43,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:48:43,472 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:43,639 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_label59.c[14857,14870] 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:43,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:48:43,729 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:48:43,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:43 WrapperNode [2021-01-06 11:48:43,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:48:43,733 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:48:43,733 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:48:43,733 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:48:43,742 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:43" (1/1) ... [2021-01-06 11:48:43,779 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:43" (1/1) ... [2021-01-06 11:48:43,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:48:43,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:48:43,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:48:43,874 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:48:43,886 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:43" (1/1) ... [2021-01-06 11:48:43,886 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:43" (1/1) ... [2021-01-06 11:48:43,897 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:43" (1/1) ... [2021-01-06 11:48:43,898 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:43" (1/1) ... [2021-01-06 11:48:43,941 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:43" (1/1) ... [2021-01-06 11:48:43,957 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:43" (1/1) ... [2021-01-06 11:48:43,962 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:43" (1/1) ... [2021-01-06 11:48:43,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:48:43,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:48:43,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:48:43,971 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:48:43,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:43" (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:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:48:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:48:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:48:44,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:48:45,748 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:48:45,748 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:48:45,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:48:45 BoogieIcfgContainer [2021-01-06 11:48:45,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:48:45,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:48:45,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:48:45,757 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:48:45,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:48:42" (1/3) ... [2021-01-06 11:48:45,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d32c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:48:45, skipping insertion in model container [2021-01-06 11:48:45,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:43" (2/3) ... [2021-01-06 11:48:45,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d32c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:48:45, skipping insertion in model container [2021-01-06 11:48:45,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:48:45" (3/3) ... [2021-01-06 11:48:45,761 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem02_label59.c [2021-01-06 11:48:45,768 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:48:45,774 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:48:45,795 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:48:45,826 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:48:45,826 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:48:45,826 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:48:45,826 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:48:45,826 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:48:45,827 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:48:45,827 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:48:45,827 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:48:45,850 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2021-01-06 11:48:45,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-06 11:48:45,866 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:48:45,867 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] [2021-01-06 11:48:45,868 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:48:45,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:48:45,875 INFO L82 PathProgramCache]: Analyzing trace with hash -742425229, now seen corresponding path program 1 times [2021-01-06 11:48:45,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:48:45,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044760749] [2021-01-06 11:48:45,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:48:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:46,382 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:46,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044760749] [2021-01-06 11:48:46,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:48:46,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:48:46,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148820523] [2021-01-06 11:48:46,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:48:46,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:48:46,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:48:46,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:48:46,419 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2021-01-06 11:48:47,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:48:47,491 INFO L93 Difference]: Finished difference Result 617 states and 1059 transitions. [2021-01-06 11:48:47,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:48:47,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2021-01-06 11:48:47,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:48:47,511 INFO L225 Difference]: With dead ends: 617 [2021-01-06 11:48:47,511 INFO L226 Difference]: Without dead ends: 316 [2021-01-06 11:48:47,516 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:47,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-01-06 11:48:47,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 309. [2021-01-06 11:48:47,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2021-01-06 11:48:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 450 transitions. [2021-01-06 11:48:47,590 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 450 transitions. Word has length 83 [2021-01-06 11:48:47,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:48:47,591 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 450 transitions. [2021-01-06 11:48:47,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:48:47,592 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 450 transitions. [2021-01-06 11:48:47,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-01-06 11:48:47,596 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:48:47,597 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:48:47,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:48:47,597 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:48:47,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:48:47,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1514248782, now seen corresponding path program 1 times [2021-01-06 11:48:47,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:48:47,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260761755] [2021-01-06 11:48:47,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:48:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:48:47,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260761755] [2021-01-06 11:48:47,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:48:47,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:48:47,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744817223] [2021-01-06 11:48:47,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:48:47,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:48:47,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:48:47,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:48:47,682 INFO L87 Difference]: Start difference. First operand 309 states and 450 transitions. Second operand 3 states. [2021-01-06 11:48:48,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:48:48,335 INFO L93 Difference]: Finished difference Result 900 states and 1316 transitions. [2021-01-06 11:48:48,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:48:48,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2021-01-06 11:48:48,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:48:48,342 INFO L225 Difference]: With dead ends: 900 [2021-01-06 11:48:48,342 INFO L226 Difference]: Without dead ends: 593 [2021-01-06 11:48:48,345 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:48,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2021-01-06 11:48:48,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2021-01-06 11:48:48,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2021-01-06 11:48:48,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 763 transitions. [2021-01-06 11:48:48,387 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 763 transitions. Word has length 91 [2021-01-06 11:48:48,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:48:48,387 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 763 transitions. [2021-01-06 11:48:48,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:48:48,387 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 763 transitions. [2021-01-06 11:48:48,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 11:48:48,392 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:48:48,393 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 11:48:48,393 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:48:48,393 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:48:48,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:48:48,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1389241170, now seen corresponding path program 1 times [2021-01-06 11:48:48,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:48:48,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782690135] [2021-01-06 11:48:48,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:48:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:48,546 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:48:48,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782690135] [2021-01-06 11:48:48,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:48:48,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:48:48,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599664753] [2021-01-06 11:48:48,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:48:48,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:48:48,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:48:48,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:48:48,558 INFO L87 Difference]: Start difference. First operand 591 states and 763 transitions. Second operand 3 states. [2021-01-06 11:48:49,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:48:49,244 INFO L93 Difference]: Finished difference Result 1465 states and 1942 transitions. [2021-01-06 11:48:49,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:48:49,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2021-01-06 11:48:49,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:48:49,251 INFO L225 Difference]: With dead ends: 1465 [2021-01-06 11:48:49,252 INFO L226 Difference]: Without dead ends: 876 [2021-01-06 11:48:49,253 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:49,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2021-01-06 11:48:49,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 874. [2021-01-06 11:48:49,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2021-01-06 11:48:49,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1071 transitions. [2021-01-06 11:48:49,286 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1071 transitions. Word has length 92 [2021-01-06 11:48:49,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:48:49,287 INFO L481 AbstractCegarLoop]: Abstraction has 874 states and 1071 transitions. [2021-01-06 11:48:49,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:48:49,287 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1071 transitions. [2021-01-06 11:48:49,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 11:48:49,292 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:48:49,293 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] [2021-01-06 11:48:49,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:48:49,293 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:48:49,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:48:49,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1927193993, now seen corresponding path program 1 times [2021-01-06 11:48:49,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:48:49,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308825682] [2021-01-06 11:48:49,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:48:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:49,350 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:49,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308825682] [2021-01-06 11:48:49,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:48:49,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:48:49,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557618723] [2021-01-06 11:48:49,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:48:49,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:48:49,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:48:49,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:48:49,354 INFO L87 Difference]: Start difference. First operand 874 states and 1071 transitions. Second operand 3 states. [2021-01-06 11:48:49,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:48:49,953 INFO L93 Difference]: Finished difference Result 2448 states and 3014 transitions. [2021-01-06 11:48:49,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:48:49,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2021-01-06 11:48:49,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:48:49,964 INFO L225 Difference]: With dead ends: 2448 [2021-01-06 11:48:49,964 INFO L226 Difference]: Without dead ends: 1576 [2021-01-06 11:48:49,967 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:49,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2021-01-06 11:48:50,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2021-01-06 11:48:50,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2021-01-06 11:48:50,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1879 transitions. [2021-01-06 11:48:50,022 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1879 transitions. Word has length 93 [2021-01-06 11:48:50,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:48:50,024 INFO L481 AbstractCegarLoop]: Abstraction has 1576 states and 1879 transitions. [2021-01-06 11:48:50,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:48:50,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1879 transitions. [2021-01-06 11:48:50,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:48:50,029 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:48:50,030 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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:50,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:48:50,030 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:48:50,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:48:50,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1061675065, now seen corresponding path program 1 times [2021-01-06 11:48:50,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:48:50,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593215426] [2021-01-06 11:48:50,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:48:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:50,207 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:48:50,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593215426] [2021-01-06 11:48:50,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649780378] [2021-01-06 11:48:50,208 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:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:50,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 11:48:50,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:48:50,478 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 11:48:50,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:48:50,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-01-06 11:48:50,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291107750] [2021-01-06 11:48:50,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:48:50,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:48:50,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:48:50,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:48:50,482 INFO L87 Difference]: Start difference. First operand 1576 states and 1879 transitions. Second operand 3 states. [2021-01-06 11:48:51,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:48:51,200 INFO L93 Difference]: Finished difference Result 4426 states and 5314 transitions. [2021-01-06 11:48:51,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:48:51,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2021-01-06 11:48:51,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:48:51,216 INFO L225 Difference]: With dead ends: 4426 [2021-01-06 11:48:51,216 INFO L226 Difference]: Without dead ends: 2852 [2021-01-06 11:48:51,219 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:48:51,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2021-01-06 11:48:51,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2846. [2021-01-06 11:48:51,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2846 states. [2021-01-06 11:48:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2846 states and 3391 transitions. [2021-01-06 11:48:51,290 INFO L78 Accepts]: Start accepts. Automaton has 2846 states and 3391 transitions. Word has length 96 [2021-01-06 11:48:51,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:48:51,291 INFO L481 AbstractCegarLoop]: Abstraction has 2846 states and 3391 transitions. [2021-01-06 11:48:51,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:48:51,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 3391 transitions. [2021-01-06 11:48:51,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-01-06 11:48:51,296 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:48:51,296 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:48:51,511 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:48:51,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:48:51,511 INFO L82 PathProgramCache]: Analyzing trace with hash 304876144, now seen corresponding path program 1 times [2021-01-06 11:48:51,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:48:51,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409172395] [2021-01-06 11:48:51,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:48:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:51,687 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:48:51,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409172395] [2021-01-06 11:48:51,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:48:51,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:48:51,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598950900] [2021-01-06 11:48:51,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:48:51,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:48:51,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:48:51,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:48:51,693 INFO L87 Difference]: Start difference. First operand 2846 states and 3391 transitions. Second operand 3 states. [2021-01-06 11:48:52,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:48:52,435 INFO L93 Difference]: Finished difference Result 6672 states and 8135 transitions. [2021-01-06 11:48:52,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:48:52,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2021-01-06 11:48:52,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:48:52,457 INFO L225 Difference]: With dead ends: 6672 [2021-01-06 11:48:52,457 INFO L226 Difference]: Without dead ends: 3828 [2021-01-06 11:48:52,461 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:52,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states. [2021-01-06 11:48:52,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 3827. [2021-01-06 11:48:52,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3827 states. [2021-01-06 11:48:52,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3827 states to 3827 states and 4612 transitions. [2021-01-06 11:48:52,566 INFO L78 Accepts]: Start accepts. Automaton has 3827 states and 4612 transitions. Word has length 113 [2021-01-06 11:48:52,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:48:52,567 INFO L481 AbstractCegarLoop]: Abstraction has 3827 states and 4612 transitions. [2021-01-06 11:48:52,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:48:52,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3827 states and 4612 transitions. [2021-01-06 11:48:52,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 11:48:52,577 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:48:52,577 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:48:52,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:48:52,577 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:48:52,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:48:52,585 INFO L82 PathProgramCache]: Analyzing trace with hash 645350763, now seen corresponding path program 1 times [2021-01-06 11:48:52,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:48:52,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157550296] [2021-01-06 11:48:52,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:48:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-01-06 11:48:52,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157550296] [2021-01-06 11:48:52,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109490300] [2021-01-06 11:48:52,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:48:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:52,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 11:48:52,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:48:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:48:52,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:48:52,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-01-06 11:48:52,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409573081] [2021-01-06 11:48:52,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:48:52,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:48:52,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:48:52,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:48:52,982 INFO L87 Difference]: Start difference. First operand 3827 states and 4612 transitions. Second operand 3 states. [2021-01-06 11:48:53,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:48:53,655 INFO L93 Difference]: Finished difference Result 7509 states and 9039 transitions. [2021-01-06 11:48:53,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:48:53,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2021-01-06 11:48:53,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:48:53,674 INFO L225 Difference]: With dead ends: 7509 [2021-01-06 11:48:53,675 INFO L226 Difference]: Without dead ends: 3684 [2021-01-06 11:48:53,681 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:48:53,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3684 states. [2021-01-06 11:48:53,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3684 to 2701. [2021-01-06 11:48:53,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2701 states. [2021-01-06 11:48:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3052 transitions. [2021-01-06 11:48:53,748 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3052 transitions. Word has length 116 [2021-01-06 11:48:53,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:48:53,749 INFO L481 AbstractCegarLoop]: Abstraction has 2701 states and 3052 transitions. [2021-01-06 11:48:53,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:48:53,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3052 transitions. [2021-01-06 11:48:53,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 11:48:53,753 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:48:53,754 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:48:53,968 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:48:53,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:48:53,969 INFO L82 PathProgramCache]: Analyzing trace with hash -466961099, now seen corresponding path program 1 times [2021-01-06 11:48:53,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:48:53,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035569610] [2021-01-06 11:48:53,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:48:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:54,084 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:54,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035569610] [2021-01-06 11:48:54,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:48:54,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:48:54,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477959563] [2021-01-06 11:48:54,088 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:48:54,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:48:54,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:48:54,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:48:54,094 INFO L87 Difference]: Start difference. First operand 2701 states and 3052 transitions. Second operand 3 states. [2021-01-06 11:48:54,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:48:54,935 INFO L93 Difference]: Finished difference Result 6818 states and 7717 transitions. [2021-01-06 11:48:54,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:48:54,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2021-01-06 11:48:54,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:48:54,958 INFO L225 Difference]: With dead ends: 6818 [2021-01-06 11:48:54,958 INFO L226 Difference]: Without dead ends: 4119 [2021-01-06 11:48:54,965 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:54,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4119 states. [2021-01-06 11:48:55,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4119 to 4117. [2021-01-06 11:48:55,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4117 states. [2021-01-06 11:48:55,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4117 states to 4117 states and 4628 transitions. [2021-01-06 11:48:55,076 INFO L78 Accepts]: Start accepts. Automaton has 4117 states and 4628 transitions. Word has length 116 [2021-01-06 11:48:55,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:48:55,077 INFO L481 AbstractCegarLoop]: Abstraction has 4117 states and 4628 transitions. [2021-01-06 11:48:55,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:48:55,077 INFO L276 IsEmpty]: Start isEmpty. Operand 4117 states and 4628 transitions. [2021-01-06 11:48:55,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-06 11:48:55,083 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:48:55,083 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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] [2021-01-06 11:48:55,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:48:55,084 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:48:55,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:48:55,085 INFO L82 PathProgramCache]: Analyzing trace with hash 771655281, now seen corresponding path program 1 times [2021-01-06 11:48:55,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:48:55,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649412918] [2021-01-06 11:48:55,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:48:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-01-06 11:48:55,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649412918] [2021-01-06 11:48:55,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969289015] [2021-01-06 11:48:55,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:48:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:55,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 11:48:55,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:48:55,403 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-01-06 11:48:55,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:48:55,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2021-01-06 11:48:55,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163850783] [2021-01-06 11:48:55,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:48:55,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:48:55,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:48:55,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:48:55,407 INFO L87 Difference]: Start difference. First operand 4117 states and 4628 transitions. Second operand 3 states. [2021-01-06 11:48:55,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:48:55,793 INFO L93 Difference]: Finished difference Result 7941 states and 8920 transitions. [2021-01-06 11:48:55,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:48:55,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2021-01-06 11:48:55,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:48:55,814 INFO L225 Difference]: With dead ends: 7941 [2021-01-06 11:48:55,814 INFO L226 Difference]: Without dead ends: 3826 [2021-01-06 11:48:55,821 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:48:55,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3826 states. [2021-01-06 11:48:55,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3826 to 3826. [2021-01-06 11:48:55,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2021-01-06 11:48:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 4254 transitions. [2021-01-06 11:48:55,911 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 4254 transitions. Word has length 131 [2021-01-06 11:48:55,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:48:55,911 INFO L481 AbstractCegarLoop]: Abstraction has 3826 states and 4254 transitions. [2021-01-06 11:48:55,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:48:55,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 4254 transitions. [2021-01-06 11:48:55,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-01-06 11:48:55,917 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:48:55,918 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:48:56,130 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:48:56,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:48:56,131 INFO L82 PathProgramCache]: Analyzing trace with hash 2031704263, now seen corresponding path program 1 times [2021-01-06 11:48:56,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:48:56,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369506810] [2021-01-06 11:48:56,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:48:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:56,247 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:48:56,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369506810] [2021-01-06 11:48:56,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:48:56,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:48:56,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665264474] [2021-01-06 11:48:56,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:48:56,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:48:56,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:48:56,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:48:56,250 INFO L87 Difference]: Start difference. First operand 3826 states and 4254 transitions. Second operand 3 states. [2021-01-06 11:48:56,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:48:56,872 INFO L93 Difference]: Finished difference Result 7510 states and 8361 transitions. [2021-01-06 11:48:56,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:48:56,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2021-01-06 11:48:56,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:48:56,890 INFO L225 Difference]: With dead ends: 7510 [2021-01-06 11:48:56,890 INFO L226 Difference]: Without dead ends: 3826 [2021-01-06 11:48:56,896 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:56,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3826 states. [2021-01-06 11:48:56,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3826 to 3826. [2021-01-06 11:48:56,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2021-01-06 11:48:56,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 4242 transitions. [2021-01-06 11:48:56,980 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 4242 transitions. Word has length 136 [2021-01-06 11:48:56,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:48:56,981 INFO L481 AbstractCegarLoop]: Abstraction has 3826 states and 4242 transitions. [2021-01-06 11:48:56,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:48:56,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 4242 transitions. [2021-01-06 11:48:56,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-06 11:48:56,987 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:48:56,988 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-01-06 11:48:56,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:48:56,988 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:48:56,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:48:56,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1279749614, now seen corresponding path program 1 times [2021-01-06 11:48:56,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:48:56,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823529029] [2021-01-06 11:48:56,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:48:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:57,049 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-01-06 11:48:57,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823529029] [2021-01-06 11:48:57,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:48:57,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:48:57,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654014481] [2021-01-06 11:48:57,050 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:48:57,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:48:57,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:48:57,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:48:57,052 INFO L87 Difference]: Start difference. First operand 3826 states and 4242 transitions. Second operand 3 states. [2021-01-06 11:48:57,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:48:57,628 INFO L93 Difference]: Finished difference Result 6942 states and 7732 transitions. [2021-01-06 11:48:57,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:48:57,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2021-01-06 11:48:57,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:48:57,643 INFO L225 Difference]: With dead ends: 6942 [2021-01-06 11:48:57,643 INFO L226 Difference]: Without dead ends: 3258 [2021-01-06 11:48:57,648 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:57,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. [2021-01-06 11:48:57,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 2838. [2021-01-06 11:48:57,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2838 states. [2021-01-06 11:48:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2838 states and 3117 transitions. [2021-01-06 11:48:57,706 INFO L78 Accepts]: Start accepts. Automaton has 2838 states and 3117 transitions. Word has length 140 [2021-01-06 11:48:57,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:48:57,707 INFO L481 AbstractCegarLoop]: Abstraction has 2838 states and 3117 transitions. [2021-01-06 11:48:57,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:48:57,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2838 states and 3117 transitions. [2021-01-06 11:48:57,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-01-06 11:48:57,711 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:48:57,712 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-01-06 11:48:57,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:48:57,712 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:48:57,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:48:57,713 INFO L82 PathProgramCache]: Analyzing trace with hash 350454712, now seen corresponding path program 1 times [2021-01-06 11:48:57,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:48:57,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58809768] [2021-01-06 11:48:57,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:48:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:57,770 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-01-06 11:48:57,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58809768] [2021-01-06 11:48:57,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:48:57,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:48:57,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940135907] [2021-01-06 11:48:57,772 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:48:57,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:48:57,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:48:57,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:48:57,773 INFO L87 Difference]: Start difference. First operand 2838 states and 3117 transitions. Second operand 3 states. [2021-01-06 11:48:58,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:48:58,353 INFO L93 Difference]: Finished difference Result 5673 states and 6203 transitions. [2021-01-06 11:48:58,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:48:58,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2021-01-06 11:48:58,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:48:58,360 INFO L225 Difference]: With dead ends: 5673 [2021-01-06 11:48:58,360 INFO L226 Difference]: Without dead ends: 2834 [2021-01-06 11:48:58,364 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:58,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2021-01-06 11:48:58,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2408. [2021-01-06 11:48:58,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2408 states. [2021-01-06 11:48:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 2580 transitions. [2021-01-06 11:48:58,408 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 2580 transitions. Word has length 144 [2021-01-06 11:48:58,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:48:58,409 INFO L481 AbstractCegarLoop]: Abstraction has 2408 states and 2580 transitions. [2021-01-06 11:48:58,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:48:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 2580 transitions. [2021-01-06 11:48:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-01-06 11:48:58,414 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:48:58,415 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2021-01-06 11:48:58,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:48:58,415 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:48:58,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:48:58,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1308449814, now seen corresponding path program 1 times [2021-01-06 11:48:58,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:48:58,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419817843] [2021-01-06 11:48:58,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:48:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:58,484 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-01-06 11:48:58,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419817843] [2021-01-06 11:48:58,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:48:58,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:48:58,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470637392] [2021-01-06 11:48:58,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:48:58,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:48:58,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:48:58,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:48:58,487 INFO L87 Difference]: Start difference. First operand 2408 states and 2580 transitions. Second operand 3 states. [2021-01-06 11:48:58,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:48:59,000 INFO L93 Difference]: Finished difference Result 4812 states and 5165 transitions. [2021-01-06 11:48:59,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:48:59,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2021-01-06 11:48:59,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:48:59,007 INFO L225 Difference]: With dead ends: 4812 [2021-01-06 11:48:59,007 INFO L226 Difference]: Without dead ends: 2263 [2021-01-06 11:48:59,011 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:59,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2021-01-06 11:48:59,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 2263. [2021-01-06 11:48:59,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2021-01-06 11:48:59,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 2410 transitions. [2021-01-06 11:48:59,053 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 2410 transitions. Word has length 151 [2021-01-06 11:48:59,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:48:59,053 INFO L481 AbstractCegarLoop]: Abstraction has 2263 states and 2410 transitions. [2021-01-06 11:48:59,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:48:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 2410 transitions. [2021-01-06 11:48:59,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-01-06 11:48:59,062 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:48:59,077 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:48:59,078 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:48:59,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:48:59,079 INFO L82 PathProgramCache]: Analyzing trace with hash 608583856, now seen corresponding path program 1 times [2021-01-06 11:48:59,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:48:59,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911257604] [2021-01-06 11:48:59,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:48:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:59,183 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-01-06 11:48:59,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911257604] [2021-01-06 11:48:59,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553361012] [2021-01-06 11:48:59,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:48:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:48:59,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:48:59,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:48:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-01-06 11:48:59,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:48:59,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-01-06 11:48:59,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069031146] [2021-01-06 11:48:59,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:48:59,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:48:59,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:48:59,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:48:59,435 INFO L87 Difference]: Start difference. First operand 2263 states and 2410 transitions. Second operand 3 states. [2021-01-06 11:48:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:48:59,820 INFO L93 Difference]: Finished difference Result 2825 states and 2999 transitions. [2021-01-06 11:48:59,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:48:59,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2021-01-06 11:48:59,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:48:59,823 INFO L225 Difference]: With dead ends: 2825 [2021-01-06 11:48:59,824 INFO L226 Difference]: Without dead ends: 1414 [2021-01-06 11:48:59,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:48:59,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2021-01-06 11:48:59,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1414. [2021-01-06 11:48:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2021-01-06 11:48:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 1486 transitions. [2021-01-06 11:48:59,851 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 1486 transitions. Word has length 175 [2021-01-06 11:48:59,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:48:59,853 INFO L481 AbstractCegarLoop]: Abstraction has 1414 states and 1486 transitions. [2021-01-06 11:48:59,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:48:59,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 1486 transitions. [2021-01-06 11:48:59,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-01-06 11:48:59,858 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:48:59,859 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:49:00,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:49:00,074 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:49:00,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:49:00,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1078897944, now seen corresponding path program 1 times [2021-01-06 11:49:00,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:49:00,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977259306] [2021-01-06 11:49:00,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:49:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:49:00,269 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-01-06 11:49:00,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977259306] [2021-01-06 11:49:00,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:49:00,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:49:00,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733363965] [2021-01-06 11:49:00,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:49:00,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:49:00,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:49:00,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:49:00,272 INFO L87 Difference]: Start difference. First operand 1414 states and 1486 transitions. Second operand 5 states. [2021-01-06 11:49:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:49:01,091 INFO L93 Difference]: Finished difference Result 2854 states and 3005 transitions. [2021-01-06 11:49:01,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 11:49:01,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2021-01-06 11:49:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:49:01,095 INFO L225 Difference]: With dead ends: 2854 [2021-01-06 11:49:01,095 INFO L226 Difference]: Without dead ends: 1293 [2021-01-06 11:49:01,098 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:49:01,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2021-01-06 11:49:01,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1132. [2021-01-06 11:49:01,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2021-01-06 11:49:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1163 transitions. [2021-01-06 11:49:01,118 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1163 transitions. Word has length 189 [2021-01-06 11:49:01,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:49:01,118 INFO L481 AbstractCegarLoop]: Abstraction has 1132 states and 1163 transitions. [2021-01-06 11:49:01,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:49:01,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1163 transitions. [2021-01-06 11:49:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2021-01-06 11:49:01,122 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:49:01,123 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-01-06 11:49:01,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:49:01,123 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:49:01,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:49:01,124 INFO L82 PathProgramCache]: Analyzing trace with hash -947241145, now seen corresponding path program 1 times [2021-01-06 11:49:01,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:49:01,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819069136] [2021-01-06 11:49:01,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:49:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:49:01,523 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 165 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:49:01,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819069136] [2021-01-06 11:49:01,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871093051] [2021-01-06 11:49:01,524 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:49:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:49:01,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 13 conjunts are in the unsatisfiable core [2021-01-06 11:49:01,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:49:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 234 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:49:02,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:49:02,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-01-06 11:49:02,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349740485] [2021-01-06 11:49:02,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 11:49:02,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:49:02,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 11:49:02,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-01-06 11:49:02,143 INFO L87 Difference]: Start difference. First operand 1132 states and 1163 transitions. Second operand 9 states. [2021-01-06 11:49:03,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:49:03,326 INFO L93 Difference]: Finished difference Result 2591 states and 2664 transitions. [2021-01-06 11:49:03,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 11:49:03,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 217 [2021-01-06 11:49:03,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:49:03,331 INFO L225 Difference]: With dead ends: 2591 [2021-01-06 11:49:03,331 INFO L226 Difference]: Without dead ends: 1595 [2021-01-06 11:49:03,333 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-01-06 11:49:03,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2021-01-06 11:49:03,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 850. [2021-01-06 11:49:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2021-01-06 11:49:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 871 transitions. [2021-01-06 11:49:03,369 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 871 transitions. Word has length 217 [2021-01-06 11:49:03,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:49:03,369 INFO L481 AbstractCegarLoop]: Abstraction has 850 states and 871 transitions. [2021-01-06 11:49:03,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 11:49:03,370 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 871 transitions. [2021-01-06 11:49:03,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-01-06 11:49:03,374 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:49:03,374 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:49:03,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-01-06 11:49:03,590 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:49:03,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:49:03,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1600594216, now seen corresponding path program 1 times [2021-01-06 11:49:03,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:49:03,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112608863] [2021-01-06 11:49:03,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:49:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:49:03,697 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:49:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:49:03,758 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:49:03,861 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 11:49:03,861 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 11:49:03,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 11:49:04,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:49:04 BoogieIcfgContainer [2021-01-06 11:49:04,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:49:04,141 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:49:04,141 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:49:04,141 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:49:04,142 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:45" (3/4) ... [2021-01-06 11:49:04,145 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 11:49:04,450 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/eca-rers2012/Problem02_label59.c-witness.graphml [2021-01-06 11:49:04,450 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:49:04,452 INFO L168 Benchmark]: Toolchain (without parser) took 21534.38 ms. Allocated memory was 151.0 MB in the beginning and 398.5 MB in the end (delta: 247.5 MB). Free memory was 123.6 MB in the beginning and 221.3 MB in the end (delta: -97.7 MB). Peak memory consumption was 150.5 MB. Max. memory is 8.0 GB. [2021-01-06 11:49:04,453 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 151.0 MB. Free memory is still 123.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:49:04,454 INFO L168 Benchmark]: CACSL2BoogieTranslator took 811.23 ms. Allocated memory is still 151.0 MB. Free memory was 123.4 MB in the beginning and 129.3 MB in the end (delta: -5.9 MB). Peak memory consumption was 27.5 MB. Max. memory is 8.0 GB. [2021-01-06 11:49:04,454 INFO L168 Benchmark]: Boogie Procedure Inliner took 139.75 ms. Allocated memory is still 151.0 MB. Free memory was 129.3 MB in the beginning and 123.5 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:49:04,456 INFO L168 Benchmark]: Boogie Preprocessor took 96.59 ms. Allocated memory is still 151.0 MB. Free memory was 123.5 MB in the beginning and 119.3 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:49:04,457 INFO L168 Benchmark]: RCFGBuilder took 1780.25 ms. Allocated memory is still 151.0 MB. Free memory was 119.3 MB in the beginning and 96.3 MB in the end (delta: 23.1 MB). Peak memory consumption was 77.6 MB. Max. memory is 8.0 GB. [2021-01-06 11:49:04,457 INFO L168 Benchmark]: TraceAbstraction took 18387.82 ms. Allocated memory was 151.0 MB in the beginning and 398.5 MB in the end (delta: 247.5 MB). Free memory was 95.7 MB in the beginning and 256.4 MB in the end (delta: -160.7 MB). Peak memory consumption was 86.3 MB. Max. memory is 8.0 GB. [2021-01-06 11:49:04,458 INFO L168 Benchmark]: Witness Printer took 309.07 ms. Allocated memory is still 398.5 MB. Free memory was 256.4 MB in the beginning and 221.3 MB in the end (delta: 35.1 MB). Peak memory consumption was 35.7 MB. Max. memory is 8.0 GB. [2021-01-06 11:49:04,461 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.18 ms. Allocated memory is still 151.0 MB. Free memory is still 123.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 811.23 ms. Allocated memory is still 151.0 MB. Free memory was 123.4 MB in the beginning and 129.3 MB in the end (delta: -5.9 MB). Peak memory consumption was 27.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 139.75 ms. Allocated memory is still 151.0 MB. Free memory was 129.3 MB in the beginning and 123.5 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 96.59 ms. Allocated memory is still 151.0 MB. Free memory was 123.5 MB in the beginning and 119.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1780.25 ms. Allocated memory is still 151.0 MB. Free memory was 119.3 MB in the beginning and 96.3 MB in the end (delta: 23.1 MB). Peak memory consumption was 77.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 18387.82 ms. Allocated memory was 151.0 MB in the beginning and 398.5 MB in the end (delta: 247.5 MB). Free memory was 95.7 MB in the beginning and 256.4 MB in the end (delta: -160.7 MB). Peak memory consumption was 86.3 MB. Max. memory is 8.0 GB. * Witness Printer took 309.07 ms. Allocated memory is still 398.5 MB. Free memory was 256.4 MB in the beginning and 221.3 MB in the end (delta: 35.1 MB). Peak memory consumption was 35.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 431]: 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 FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(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] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(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] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(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] [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=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] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==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] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(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] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==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] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(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] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(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] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(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] [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=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] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(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] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(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] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==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] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(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] [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=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] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==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] [L244] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L245] a28 = 9 [L246] return 23; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L405] a19 = 0 [L406] a28 = 7 [L407] return 25; VAL [a=1, a11=0, a17=8, a19=0, 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] [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=0, a17=8, a19=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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 TRUE ((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8)))) [L165] a25 = 1 [L166] a19 = 1 [L167] a28 = 7 [L168] return -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L430] COND TRUE ((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L431] reach_error() VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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: 18.0s, OverallIterations: 17, TraceHistogramMax: 6, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2001 SDtfs, 3078 SDslu, 300 SDs, 0 SdLazy, 7242 SolverSat, 966 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 787 GetRequests, 746 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4117occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 2755 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 3049 NumberOfCodeBlocks, 3049 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2797 ConstructedInterpolants, 0 QuantifiedInterpolants, 1505284 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1596 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 1585/1691 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...