/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/Problem10_label46.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 03:37:46,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 03:37:46,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 03:37:47,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 03:37:47,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 03:37:47,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 03:37:47,029 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 03:37:47,034 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 03:37:47,038 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 03:37:47,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 03:37:47,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 03:37:47,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 03:37:47,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 03:37:47,054 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 03:37:47,056 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 03:37:47,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 03:37:47,060 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 03:37:47,064 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 03:37:47,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 03:37:47,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 03:37:47,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 03:37:47,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 03:37:47,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 03:37:47,089 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 03:37:47,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 03:37:47,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 03:37:47,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 03:37:47,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 03:37:47,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 03:37:47,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 03:37:47,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 03:37:47,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 03:37:47,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 03:37:47,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 03:37:47,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 03:37:47,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 03:37:47,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 03:37:47,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 03:37:47,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 03:37:47,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 03:37:47,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 03:37:47,147 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 03:37:47,194 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 03:37:47,195 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 03:37:47,200 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 03:37:47,200 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 03:37:47,201 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 03:37:47,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 03:37:47,201 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 03:37:47,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 03:37:47,201 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 03:37:47,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 03:37:47,203 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 03:37:47,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 03:37:47,204 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 03:37:47,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 03:37:47,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 03:37:47,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 03:37:47,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 03:37:47,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 03:37:47,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 03:37:47,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 03:37:47,206 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 03:37:47,206 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 03:37:47,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 03:37:47,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 03:37:47,206 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 03:37:47,207 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 [2020-12-23 03:37:47,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 03:37:47,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 03:37:47,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 03:37:47,637 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 03:37:47,638 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 03:37:47,639 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label46.c [2020-12-23 03:37:47,733 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6f0cc7540/16b74969df8347aa9f1d955d92817d11/FLAG91c312c0b [2020-12-23 03:37:48,468 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 03:37:48,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label46.c [2020-12-23 03:37:48,498 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6f0cc7540/16b74969df8347aa9f1d955d92817d11/FLAG91c312c0b [2020-12-23 03:37:48,693 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6f0cc7540/16b74969df8347aa9f1d955d92817d11 [2020-12-23 03:37:48,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 03:37:48,700 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 03:37:48,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 03:37:48,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 03:37:48,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 03:37:48,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:37:48" (1/1) ... [2020-12-23 03:37:48,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21741559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:48, skipping insertion in model container [2020-12-23 03:37:48,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:37:48" (1/1) ... [2020-12-23 03:37:48,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 03:37:48,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 03:37:49,096 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/Problem10_label46.c[2596,2609] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2020-12-23 03:37:49,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 03:37:49,372 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 03:37:49,397 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/Problem10_label46.c[2596,2609] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2020-12-23 03:37:49,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 03:37:49,594 INFO L208 MainTranslator]: Completed translation [2020-12-23 03:37:49,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:49 WrapperNode [2020-12-23 03:37:49,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 03:37:49,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 03:37:49,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 03:37:49,596 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 03:37:49,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:49" (1/1) ... [2020-12-23 03:37:49,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:49" (1/1) ... [2020-12-23 03:37:49,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 03:37:49,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 03:37:49,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 03:37:49,768 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 03:37:49,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:49" (1/1) ... [2020-12-23 03:37:49,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:49" (1/1) ... [2020-12-23 03:37:49,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:49" (1/1) ... [2020-12-23 03:37:49,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:49" (1/1) ... [2020-12-23 03:37:49,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:49" (1/1) ... [2020-12-23 03:37:49,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:49" (1/1) ... [2020-12-23 03:37:49,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:49" (1/1) ... [2020-12-23 03:37:49,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 03:37:49,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 03:37:49,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 03:37:49,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 03:37:49,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:49" (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 [2020-12-23 03:37:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 03:37:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 03:37:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 03:37:50,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 03:37:51,614 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 03:37:51,614 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-23 03:37:51,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:37:51 BoogieIcfgContainer [2020-12-23 03:37:51,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 03:37:51,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 03:37:51,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 03:37:51,623 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 03:37:51,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 03:37:48" (1/3) ... [2020-12-23 03:37:51,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bde806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:37:51, skipping insertion in model container [2020-12-23 03:37:51,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:37:49" (2/3) ... [2020-12-23 03:37:51,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bde806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:37:51, skipping insertion in model container [2020-12-23 03:37:51,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:37:51" (3/3) ... [2020-12-23 03:37:51,626 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label46.c [2020-12-23 03:37:51,633 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 03:37:51,639 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 03:37:51,656 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 03:37:51,687 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 03:37:51,687 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 03:37:51,688 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 03:37:51,688 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 03:37:51,688 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 03:37:51,688 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 03:37:51,688 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 03:37:51,688 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 03:37:51,712 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2020-12-23 03:37:51,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-23 03:37:51,719 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:37:51,720 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] [2020-12-23 03:37:51,720 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:37:51,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:37:51,727 INFO L82 PathProgramCache]: Analyzing trace with hash -85512855, now seen corresponding path program 1 times [2020-12-23 03:37:51,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:37:51,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043520170] [2020-12-23 03:37:51,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:37:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:37:52,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:37:52,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043520170] [2020-12-23 03:37:52,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:37:52,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 03:37:52,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575087694] [2020-12-23 03:37:52,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:37:52,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:37:52,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:37:52,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:37:52,048 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 3 states. [2020-12-23 03:37:53,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:37:53,276 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2020-12-23 03:37:53,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:37:53,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-12-23 03:37:53,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:37:53,294 INFO L225 Difference]: With dead ends: 552 [2020-12-23 03:37:53,295 INFO L226 Difference]: Without dead ends: 282 [2020-12-23 03:37:53,299 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 [2020-12-23 03:37:53,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-12-23 03:37:53,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2020-12-23 03:37:53,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-23 03:37:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 377 transitions. [2020-12-23 03:37:53,374 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 377 transitions. Word has length 21 [2020-12-23 03:37:53,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:37:53,375 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 377 transitions. [2020-12-23 03:37:53,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:37:53,375 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2020-12-23 03:37:53,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-23 03:37:53,381 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:37:53,381 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 03:37:53,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 03:37:53,383 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:37:53,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:37:53,384 INFO L82 PathProgramCache]: Analyzing trace with hash -86180708, now seen corresponding path program 1 times [2020-12-23 03:37:53,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:37:53,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625411107] [2020-12-23 03:37:53,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:37:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:37:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:37:53,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625411107] [2020-12-23 03:37:53,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:37:53,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:37:53,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122041431] [2020-12-23 03:37:53,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:37:53,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:37:53,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:37:53,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:37:53,623 INFO L87 Difference]: Start difference. First operand 282 states and 377 transitions. Second operand 3 states. [2020-12-23 03:37:54,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:37:54,401 INFO L93 Difference]: Finished difference Result 701 states and 967 transitions. [2020-12-23 03:37:54,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:37:54,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-12-23 03:37:54,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:37:54,406 INFO L225 Difference]: With dead ends: 701 [2020-12-23 03:37:54,406 INFO L226 Difference]: Without dead ends: 421 [2020-12-23 03:37:54,409 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 [2020-12-23 03:37:54,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-12-23 03:37:54,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2020-12-23 03:37:54,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-12-23 03:37:54,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 526 transitions. [2020-12-23 03:37:54,434 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 526 transitions. Word has length 87 [2020-12-23 03:37:54,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:37:54,434 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 526 transitions. [2020-12-23 03:37:54,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:37:54,435 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 526 transitions. [2020-12-23 03:37:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-23 03:37:54,438 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:37:54,439 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 03:37:54,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 03:37:54,439 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:37:54,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:37:54,440 INFO L82 PathProgramCache]: Analyzing trace with hash -236744949, now seen corresponding path program 1 times [2020-12-23 03:37:54,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:37:54,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726513205] [2020-12-23 03:37:54,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:37:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:37:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:37:54,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726513205] [2020-12-23 03:37:54,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:37:54,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 03:37:54,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779021767] [2020-12-23 03:37:54,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:37:54,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:37:54,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:37:54,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:37:54,741 INFO L87 Difference]: Start difference. First operand 421 states and 526 transitions. Second operand 3 states. [2020-12-23 03:37:55,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:37:55,424 INFO L93 Difference]: Finished difference Result 979 states and 1209 transitions. [2020-12-23 03:37:55,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:37:55,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-12-23 03:37:55,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:37:55,428 INFO L225 Difference]: With dead ends: 979 [2020-12-23 03:37:55,428 INFO L226 Difference]: Without dead ends: 560 [2020-12-23 03:37:55,430 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 [2020-12-23 03:37:55,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-12-23 03:37:55,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2020-12-23 03:37:55,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2020-12-23 03:37:55,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 675 transitions. [2020-12-23 03:37:55,452 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 675 transitions. Word has length 94 [2020-12-23 03:37:55,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:37:55,453 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 675 transitions. [2020-12-23 03:37:55,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:37:55,453 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 675 transitions. [2020-12-23 03:37:55,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-12-23 03:37:55,455 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:37:55,455 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 03:37:55,456 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 03:37:55,456 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:37:55,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:37:55,457 INFO L82 PathProgramCache]: Analyzing trace with hash 404934448, now seen corresponding path program 1 times [2020-12-23 03:37:55,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:37:55,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269519729] [2020-12-23 03:37:55,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:37:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 03:37:55,542 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 03:37:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 03:37:55,614 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 03:37:55,675 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 03:37:55,675 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 03:37:55,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 03:37:55,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 03:37:55 BoogieIcfgContainer [2020-12-23 03:37:55,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 03:37:55,860 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 03:37:55,860 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 03:37:55,861 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 03:37:55,861 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:37:51" (3/4) ... [2020-12-23 03:37:55,864 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-23 03:37:56,002 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/eca-rers2012/Problem10_label46.c-witness.graphml [2020-12-23 03:37:56,002 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 03:37:56,004 INFO L168 Benchmark]: Toolchain (without parser) took 7303.66 ms. Allocated memory was 161.5 MB in the beginning and 212.9 MB in the end (delta: 51.4 MB). Free memory was 135.6 MB in the beginning and 75.1 MB in the end (delta: 60.5 MB). Peak memory consumption was 112.9 MB. Max. memory is 8.0 GB. [2020-12-23 03:37:56,004 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 161.5 MB. Free memory is still 135.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 03:37:56,005 INFO L168 Benchmark]: CACSL2BoogieTranslator took 890.37 ms. Allocated memory is still 161.5 MB. Free memory was 135.4 MB in the beginning and 139.2 MB in the end (delta: -3.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 8.0 GB. [2020-12-23 03:37:56,005 INFO L168 Benchmark]: Boogie Procedure Inliner took 169.22 ms. Allocated memory is still 161.5 MB. Free memory was 139.2 MB in the beginning and 131.3 MB in the end (delta: 7.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2020-12-23 03:37:56,006 INFO L168 Benchmark]: Boogie Preprocessor took 153.28 ms. Allocated memory is still 161.5 MB. Free memory was 131.3 MB in the beginning and 126.1 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2020-12-23 03:37:56,006 INFO L168 Benchmark]: RCFGBuilder took 1693.28 ms. Allocated memory is still 161.5 MB. Free memory was 126.1 MB in the beginning and 109.5 MB in the end (delta: 16.6 MB). Peak memory consumption was 80.6 MB. Max. memory is 8.0 GB. [2020-12-23 03:37:56,007 INFO L168 Benchmark]: TraceAbstraction took 4239.85 ms. Allocated memory was 161.5 MB in the beginning and 212.9 MB in the end (delta: 51.4 MB). Free memory was 108.9 MB in the beginning and 87.2 MB in the end (delta: 21.7 MB). Peak memory consumption was 73.1 MB. Max. memory is 8.0 GB. [2020-12-23 03:37:56,007 INFO L168 Benchmark]: Witness Printer took 142.47 ms. Allocated memory is still 212.9 MB. Free memory was 87.2 MB in the beginning and 75.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-12-23 03:37:56,009 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.23 ms. Allocated memory is still 161.5 MB. Free memory is still 135.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 890.37 ms. Allocated memory is still 161.5 MB. Free memory was 135.4 MB in the beginning and 139.2 MB in the end (delta: -3.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 169.22 ms. Allocated memory is still 161.5 MB. Free memory was 139.2 MB in the beginning and 131.3 MB in the end (delta: 7.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 153.28 ms. Allocated memory is still 161.5 MB. Free memory was 131.3 MB in the beginning and 126.1 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1693.28 ms. Allocated memory is still 161.5 MB. Free memory was 126.1 MB in the beginning and 109.5 MB in the end (delta: 16.6 MB). Peak memory consumption was 80.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4239.85 ms. Allocated memory was 161.5 MB in the beginning and 212.9 MB in the end (delta: 51.4 MB). Free memory was 108.9 MB in the beginning and 87.2 MB in the end (delta: 21.7 MB). Peak memory consumption was 73.1 MB. Max. memory is 8.0 GB. * Witness Printer took 142.47 ms. Allocated memory is still 212.9 MB. Free memory was 87.2 MB in the beginning and 75.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 77]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputC = 3; [L18] int inputD = 4; [L19] int inputE = 5; [L20] int inputF = 6; [L21] int inputB = 2; [L24] int a1 = 23; [L25] int a19 = 9; [L26] int a10 = 0; [L27] int a12 = 0; [L28] int a4 = 14; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] int output = -1; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND TRUE (((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)) [L265] a1 = (((a1 / 5) + 110755) + 220746) [L266] a10 = 1 [L267] a19 = 8 [L269] return -1; VAL [a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND TRUE (((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) VAL [a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] reach_error() VAL [a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.9s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 396 SDtfs, 335 SDslu, 16 SDs, 0 SdLazy, 1112 SolverSat, 224 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=560occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 61207 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 36/36 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...