./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_array_eq_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_array_eq_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c9f60659fbb0886b2c3c86084c4cc81dbedd027936fc1dda43226ecbc4710056 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:27:39,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:27:39,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:27:40,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:27:40,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:27:40,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:27:40,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:27:40,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:27:40,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:27:40,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:27:40,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:27:40,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:27:40,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:27:40,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:27:40,030 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:27:40,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:27:40,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:27:40,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:27:40,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:27:40,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:27:40,041 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:27:40,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:27:40,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:27:40,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:27:40,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:27:40,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:27:40,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:27:40,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:27:40,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:27:40,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:27:40,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:27:40,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:27:40,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:27:40,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:27:40,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:27:40,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:27:40,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:27:40,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:27:40,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:27:40,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:27:40,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:27:40,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:27:40,061 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 22:27:40,086 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:27:40,086 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:27:40,086 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:27:40,087 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:27:40,087 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:27:40,087 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:27:40,088 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:27:40,088 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:27:40,088 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:27:40,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:27:40,089 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:27:40,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:27:40,089 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:27:40,089 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:27:40,089 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:27:40,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:27:40,090 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:27:40,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:27:40,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:27:40,090 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:27:40,090 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:27:40,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:27:40,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:27:40,091 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:27:40,091 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:27:40,091 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:27:40,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:27:40,091 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:27:40,091 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:27:40,092 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:27:40,092 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/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9f60659fbb0886b2c3c86084c4cc81dbedd027936fc1dda43226ecbc4710056 [2022-07-13 22:27:40,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:27:40,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:27:40,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:27:40,312 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:27:40,312 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:27:40,313 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_array_eq_harness.i [2022-07-13 22:27:40,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64ddd2e5f/6937052a5cae4c748acc09476172e10a/FLAGbe211c583 [2022-07-13 22:27:40,939 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:27:40,940 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_eq_harness.i [2022-07-13 22:27:40,993 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64ddd2e5f/6937052a5cae4c748acc09476172e10a/FLAGbe211c583 [2022-07-13 22:27:41,385 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64ddd2e5f/6937052a5cae4c748acc09476172e10a [2022-07-13 22:27:41,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:27:41,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:27:41,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:27:41,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:27:41,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:27:41,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:27:41" (1/1) ... [2022-07-13 22:27:41,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34968c7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:27:41, skipping insertion in model container [2022-07-13 22:27:41,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:27:41" (1/1) ... [2022-07-13 22:27:41,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:27:41,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:27:41,599 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_eq_harness.i[4486,4499] [2022-07-13 22:27:41,604 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_eq_harness.i[4546,4559] [2022-07-13 22:27:42,076 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:27:42,079 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:27:42,080 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:27:42,080 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:27:42,081 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:27:42,088 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:27:42,089 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:27:42,090 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:27:42,090 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:27:42,303 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:27:42,304 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:27:42,305 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:27:42,306 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:27:42,309 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:27:42,311 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:27:42,311 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:27:42,312 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:27:42,314 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:27:42,315 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:27:42,404 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:27:42,461 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:27:42,470 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:27:42,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:27:42,578 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:27:42,596 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_eq_harness.i[4486,4499] [2022-07-13 22:27:42,597 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_eq_harness.i[4546,4559] [2022-07-13 22:27:42,642 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:27:42,642 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:27:42,643 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:27:42,644 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:27:42,644 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:27:42,656 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:27:42,657 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:27:42,658 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:27:42,658 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:27:42,690 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:27:42,691 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:27:42,691 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:27:42,692 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:27:42,692 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:27:42,692 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:27:42,693 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:27:42,693 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:27:42,693 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:27:42,694 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:27:42,711 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:27:42,752 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:27:42,752 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:27:42,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:27:42,895 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:27:42,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:27:42 WrapperNode [2022-07-13 22:27:42,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:27:42,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:27:42,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:27:42,897 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:27:42,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:27:42" (1/1) ... [2022-07-13 22:27:42,976 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:27:42" (1/1) ... [2022-07-13 22:27:43,041 INFO L137 Inliner]: procedures = 691, calls = 2616, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 790 [2022-07-13 22:27:43,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:27:43,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:27:43,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:27:43,043 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:27:43,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:27:42" (1/1) ... [2022-07-13 22:27:43,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:27:42" (1/1) ... [2022-07-13 22:27:43,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:27:42" (1/1) ... [2022-07-13 22:27:43,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:27:42" (1/1) ... [2022-07-13 22:27:43,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:27:42" (1/1) ... [2022-07-13 22:27:43,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:27:42" (1/1) ... [2022-07-13 22:27:43,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:27:42" (1/1) ... [2022-07-13 22:27:43,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:27:43,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:27:43,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:27:43,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:27:43,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:27:42" (1/1) ... [2022-07-13 22:27:43,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:27:43,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:27:43,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 22:27:43,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 22:27:43,180 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-13 22:27:43,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:27:43,180 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-13 22:27:43,180 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-13 22:27:43,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:27:43,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 22:27:43,181 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 22:27:43,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:27:43,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:27:43,181 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2022-07-13 22:27:43,181 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2022-07-13 22:27:43,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:27:43,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:27:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-13 22:27:43,182 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-13 22:27:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-13 22:27:43,182 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-13 22:27:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-07-13 22:27:43,182 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-07-13 22:27:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 22:27:43,182 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 22:27:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:27:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2022-07-13 22:27:43,183 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2022-07-13 22:27:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 22:27:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-13 22:27:43,183 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-13 22:27:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:27:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:27:43,367 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:27:43,369 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:27:43,959 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:27:43,964 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:27:43,965 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 22:27:43,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:27:43 BoogieIcfgContainer [2022-07-13 22:27:43,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:27:43,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:27:43,969 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:27:43,971 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:27:43,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:27:41" (1/3) ... [2022-07-13 22:27:43,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5424c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:27:43, skipping insertion in model container [2022-07-13 22:27:43,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:27:42" (2/3) ... [2022-07-13 22:27:43,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5424c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:27:43, skipping insertion in model container [2022-07-13 22:27:43,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:27:43" (3/3) ... [2022-07-13 22:27:43,973 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_array_eq_harness.i [2022-07-13 22:27:43,982 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:27:43,982 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:27:44,028 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:27:44,035 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@79e30b1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6a14e06a [2022-07-13 22:27:44,035 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 22:27:44,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-13 22:27:44,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 22:27:44,046 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:27:44,047 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:27:44,047 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:27:44,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:27:44,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1074851773, now seen corresponding path program 1 times [2022-07-13 22:27:44,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:27:44,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706157782] [2022-07-13 22:27:44,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:27:44,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:27:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:44,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:27:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:44,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:27:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:44,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:44,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:27:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:44,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:27:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:44,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:27:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:44,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:27:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:44,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:27:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:44,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:27:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:44,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:44,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:27:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-13 22:27:44,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:27:44,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706157782] [2022-07-13 22:27:44,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706157782] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:27:44,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:27:44,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 22:27:44,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395389623] [2022-07-13 22:27:44,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:27:44,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:27:44,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:27:44,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:27:44,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:27:44,675 INFO L87 Difference]: Start difference. First operand has 87 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:27:44,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:27:44,893 INFO L93 Difference]: Finished difference Result 176 states and 252 transitions. [2022-07-13 22:27:44,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:27:44,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 65 [2022-07-13 22:27:44,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:27:44,907 INFO L225 Difference]: With dead ends: 176 [2022-07-13 22:27:44,907 INFO L226 Difference]: Without dead ends: 87 [2022-07-13 22:27:44,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:27:44,913 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 72 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:27:44,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 149 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:27:44,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-13 22:27:44,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2022-07-13 22:27:44,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 50 states have internal predecessors, (59), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-13 22:27:44,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2022-07-13 22:27:44,941 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 65 [2022-07-13 22:27:44,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:27:44,942 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2022-07-13 22:27:44,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:27:44,942 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-07-13 22:27:44,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 22:27:44,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:27:44,944 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:27:44,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 22:27:44,944 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:27:44,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:27:44,944 INFO L85 PathProgramCache]: Analyzing trace with hash 401511231, now seen corresponding path program 1 times [2022-07-13 22:27:44,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:27:44,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298460282] [2022-07-13 22:27:44,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:27:44,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:27:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:45,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:27:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:45,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:27:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:45,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:45,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:27:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:45,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:27:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:45,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:27:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:45,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:27:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:45,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:27:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:45,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:27:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:45,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:45,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:27:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:45,196 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-13 22:27:45,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:27:45,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298460282] [2022-07-13 22:27:45,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298460282] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:27:45,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:27:45,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 22:27:45,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340910425] [2022-07-13 22:27:45,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:27:45,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:27:45,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:27:45,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:27:45,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:27:45,198 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-13 22:27:45,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:27:45,446 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2022-07-13 22:27:45,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:27:45,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 65 [2022-07-13 22:27:45,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:27:45,450 INFO L225 Difference]: With dead ends: 124 [2022-07-13 22:27:45,450 INFO L226 Difference]: Without dead ends: 90 [2022-07-13 22:27:45,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:27:45,455 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 74 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:27:45,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 203 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:27:45,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-13 22:27:45,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2022-07-13 22:27:45,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (24), 24 states have call predecessors, (24), 23 states have call successors, (24) [2022-07-13 22:27:45,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 109 transitions. [2022-07-13 22:27:45,474 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 109 transitions. Word has length 65 [2022-07-13 22:27:45,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:27:45,475 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 109 transitions. [2022-07-13 22:27:45,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-13 22:27:45,475 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2022-07-13 22:27:45,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-13 22:27:45,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:27:45,479 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:27:45,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 22:27:45,480 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:27:45,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:27:45,480 INFO L85 PathProgramCache]: Analyzing trace with hash 560902053, now seen corresponding path program 1 times [2022-07-13 22:27:45,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:27:45,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958101272] [2022-07-13 22:27:45,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:27:45,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:27:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:45,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:27:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:45,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:27:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:45,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:45,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:27:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:45,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:27:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:45,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:27:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:45,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:27:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:45,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:27:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:45,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:27:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:45,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:46,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:27:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:46,007 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 22:27:46,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:27:46,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958101272] [2022-07-13 22:27:46,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958101272] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:27:46,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937663628] [2022-07-13 22:27:46,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:27:46,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:27:46,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:27:46,009 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:27:46,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 22:27:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:46,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 2451 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 22:27:46,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:27:46,446 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-13 22:27:46,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:27:46,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937663628] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:27:46,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:27:46,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 18 [2022-07-13 22:27:46,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876119638] [2022-07-13 22:27:46,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:27:46,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:27:46,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:27:46,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:27:46,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:27:46,448 INFO L87 Difference]: Start difference. First operand 85 states and 109 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:27:46,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:27:46,546 INFO L93 Difference]: Finished difference Result 132 states and 176 transitions. [2022-07-13 22:27:46,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:27:46,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 66 [2022-07-13 22:27:46,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:27:46,548 INFO L225 Difference]: With dead ends: 132 [2022-07-13 22:27:46,548 INFO L226 Difference]: Without dead ends: 116 [2022-07-13 22:27:46,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-07-13 22:27:46,549 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 18 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:27:46,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 513 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:27:46,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-13 22:27:46,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2022-07-13 22:27:46,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 58 states have (on average 1.206896551724138) internal successors, (70), 61 states have internal predecessors, (70), 30 states have call successors, (30), 10 states have call predecessors, (30), 12 states have return successors, (33), 30 states have call predecessors, (33), 29 states have call successors, (33) [2022-07-13 22:27:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 133 transitions. [2022-07-13 22:27:46,563 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 133 transitions. Word has length 66 [2022-07-13 22:27:46,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:27:46,563 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 133 transitions. [2022-07-13 22:27:46,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:27:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 133 transitions. [2022-07-13 22:27:46,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-13 22:27:46,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:27:46,566 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:27:46,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 22:27:46,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:27:46,785 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:27:46,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:27:46,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1220340855, now seen corresponding path program 1 times [2022-07-13 22:27:46,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:27:46,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858714391] [2022-07-13 22:27:46,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:27:46,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:27:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:46,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:27:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:46,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:27:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:46,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:46,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:27:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:46,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:27:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:47,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:27:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:47,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:27:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:47,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:27:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:47,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:27:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:47,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:47,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:27:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:47,084 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-13 22:27:47,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:27:47,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858714391] [2022-07-13 22:27:47,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858714391] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:27:47,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:27:47,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:27:47,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032248662] [2022-07-13 22:27:47,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:27:47,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:27:47,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:27:47,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:27:47,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:27:47,086 INFO L87 Difference]: Start difference. First operand 101 states and 133 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:27:47,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:27:47,451 INFO L93 Difference]: Finished difference Result 168 states and 238 transitions. [2022-07-13 22:27:47,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:27:47,452 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 69 [2022-07-13 22:27:47,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:27:47,458 INFO L225 Difference]: With dead ends: 168 [2022-07-13 22:27:47,458 INFO L226 Difference]: Without dead ends: 136 [2022-07-13 22:27:47,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:27:47,460 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 76 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:27:47,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 249 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:27:47,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-13 22:27:47,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2022-07-13 22:27:47,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 75 states have internal predecessors, (88), 45 states have call successors, (45), 10 states have call predecessors, (45), 13 states have return successors, (55), 47 states have call predecessors, (55), 44 states have call successors, (55) [2022-07-13 22:27:47,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 188 transitions. [2022-07-13 22:27:47,488 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 188 transitions. Word has length 69 [2022-07-13 22:27:47,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:27:47,489 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 188 transitions. [2022-07-13 22:27:47,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:27:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 188 transitions. [2022-07-13 22:27:47,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-13 22:27:47,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:27:47,493 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:27:47,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 22:27:47,494 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:27:47,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:27:47,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1527144091, now seen corresponding path program 1 times [2022-07-13 22:27:47,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:27:47,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895655822] [2022-07-13 22:27:47,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:27:47,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:27:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:47,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:27:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:47,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:27:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:47,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:47,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:27:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:47,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 22:27:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:47,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:27:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:47,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:27:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:47,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:27:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:47,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:27:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:47,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:47,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:27:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:47,755 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-13 22:27:47,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:27:47,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895655822] [2022-07-13 22:27:47,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895655822] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:27:47,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:27:47,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:27:47,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198793491] [2022-07-13 22:27:47,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:27:47,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:27:47,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:27:47,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:27:47,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:27:47,757 INFO L87 Difference]: Start difference. First operand 132 states and 188 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 22:27:48,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:27:48,265 INFO L93 Difference]: Finished difference Result 153 states and 216 transitions. [2022-07-13 22:27:48,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:27:48,266 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 70 [2022-07-13 22:27:48,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:27:48,270 INFO L225 Difference]: With dead ends: 153 [2022-07-13 22:27:48,270 INFO L226 Difference]: Without dead ends: 126 [2022-07-13 22:27:48,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:27:48,272 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 88 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:27:48,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 288 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:27:48,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-13 22:27:48,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2022-07-13 22:27:48,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 71 states have internal predecessors, (82), 39 states have call successors, (39), 10 states have call predecessors, (39), 13 states have return successors, (47), 41 states have call predecessors, (47), 38 states have call successors, (47) [2022-07-13 22:27:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 168 transitions. [2022-07-13 22:27:48,294 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 168 transitions. Word has length 70 [2022-07-13 22:27:48,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:27:48,295 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 168 transitions. [2022-07-13 22:27:48,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 22:27:48,295 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 168 transitions. [2022-07-13 22:27:48,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-13 22:27:48,297 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:27:48,297 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 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] [2022-07-13 22:27:48,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 22:27:48,297 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:27:48,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:27:48,298 INFO L85 PathProgramCache]: Analyzing trace with hash -343504052, now seen corresponding path program 1 times [2022-07-13 22:27:48,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:27:48,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122549127] [2022-07-13 22:27:48,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:27:48,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:27:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:48,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:27:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:48,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:27:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:48,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:48,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:27:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:48,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:27:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:48,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:27:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:48,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:48,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:27:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:48,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:27:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:48,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:27:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:48,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:27:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:48,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:27:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:48,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:48,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:27:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-13 22:27:48,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:27:48,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122549127] [2022-07-13 22:27:48,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122549127] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:27:48,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101244191] [2022-07-13 22:27:48,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:27:48,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:27:48,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:27:48,853 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:27:48,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 22:27:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:49,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 2489 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-13 22:27:49,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:27:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-07-13 22:27:49,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:27:49,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101244191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:27:49,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:27:49,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 21 [2022-07-13 22:27:49,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884596157] [2022-07-13 22:27:49,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:27:49,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:27:49,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:27:49,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:27:49,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:27:49,415 INFO L87 Difference]: Start difference. First operand 122 states and 168 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 22:27:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:27:49,564 INFO L93 Difference]: Finished difference Result 173 states and 230 transitions. [2022-07-13 22:27:49,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:27:49,565 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 82 [2022-07-13 22:27:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:27:49,566 INFO L225 Difference]: With dead ends: 173 [2022-07-13 22:27:49,566 INFO L226 Difference]: Without dead ends: 119 [2022-07-13 22:27:49,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2022-07-13 22:27:49,567 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 16 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:27:49,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 713 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:27:49,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-13 22:27:49,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-07-13 22:27:49,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 69 states have internal predecessors, (79), 39 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (44), 40 states have call predecessors, (44), 38 states have call successors, (44) [2022-07-13 22:27:49,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 162 transitions. [2022-07-13 22:27:49,572 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 162 transitions. Word has length 82 [2022-07-13 22:27:49,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:27:49,572 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 162 transitions. [2022-07-13 22:27:49,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 22:27:49,572 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 162 transitions. [2022-07-13 22:27:49,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-13 22:27:49,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:27:49,573 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 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] [2022-07-13 22:27:49,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 22:27:49,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-13 22:27:49,774 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:27:49,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:27:49,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1399306283, now seen corresponding path program 1 times [2022-07-13 22:27:49,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:27:49,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80616747] [2022-07-13 22:27:49,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:27:49,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:27:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:49,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:27:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:49,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:27:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:49,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:49,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:27:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:49,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:27:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:49,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:27:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:49,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:49,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:27:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:49,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:27:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:49,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:27:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:50,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:27:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:50,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:27:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:50,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:50,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:27:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:50,087 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-13 22:27:50,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:27:50,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80616747] [2022-07-13 22:27:50,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80616747] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:27:50,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374285597] [2022-07-13 22:27:50,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:27:50,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:27:50,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:27:50,089 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:27:50,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 22:27:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:50,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 2490 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-13 22:27:50,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:27:50,660 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 22:27:50,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:27:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-13 22:27:51,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374285597] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:27:51,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:27:51,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 26 [2022-07-13 22:27:51,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688377691] [2022-07-13 22:27:51,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:27:51,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 22:27:51,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:27:51,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 22:27:51,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2022-07-13 22:27:51,228 INFO L87 Difference]: Start difference. First operand 119 states and 162 transitions. Second operand has 26 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 21 states have internal predecessors, (71), 11 states have call successors, (32), 6 states have call predecessors, (32), 7 states have return successors, (31), 10 states have call predecessors, (31), 10 states have call successors, (31) [2022-07-13 22:27:52,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:27:52,533 INFO L93 Difference]: Finished difference Result 189 states and 261 transitions. [2022-07-13 22:27:52,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-13 22:27:52,534 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 21 states have internal predecessors, (71), 11 states have call successors, (32), 6 states have call predecessors, (32), 7 states have return successors, (31), 10 states have call predecessors, (31), 10 states have call successors, (31) Word has length 82 [2022-07-13 22:27:52,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:27:52,535 INFO L225 Difference]: With dead ends: 189 [2022-07-13 22:27:52,535 INFO L226 Difference]: Without dead ends: 144 [2022-07-13 22:27:52,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 177 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=1905, Unknown=0, NotChecked=0, Total=2162 [2022-07-13 22:27:52,536 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 167 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 22:27:52,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 681 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 22:27:52,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-13 22:27:52,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 125. [2022-07-13 22:27:52,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 75 states have internal predecessors, (83), 39 states have call successors, (39), 11 states have call predecessors, (39), 14 states have return successors, (49), 39 states have call predecessors, (49), 38 states have call successors, (49) [2022-07-13 22:27:52,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 171 transitions. [2022-07-13 22:27:52,546 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 171 transitions. Word has length 82 [2022-07-13 22:27:52,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:27:52,555 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 171 transitions. [2022-07-13 22:27:52,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 21 states have internal predecessors, (71), 11 states have call successors, (32), 6 states have call predecessors, (32), 7 states have return successors, (31), 10 states have call predecessors, (31), 10 states have call successors, (31) [2022-07-13 22:27:52,556 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 171 transitions. [2022-07-13 22:27:52,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-13 22:27:52,556 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:27:52,557 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 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] [2022-07-13 22:27:52,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 22:27:52,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:27:52,771 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:27:52,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:27:52,772 INFO L85 PathProgramCache]: Analyzing trace with hash 207953017, now seen corresponding path program 1 times [2022-07-13 22:27:52,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:27:52,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341100662] [2022-07-13 22:27:52,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:27:52,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:27:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:52,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:27:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:52,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:27:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:53,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:53,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:27:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:53,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:53,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:27:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:53,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:27:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:53,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:27:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:53,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:27:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:53,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:27:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:53,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 22:27:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:53,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:27:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:53,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:53,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:27:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:53,177 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-13 22:27:53,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:27:53,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341100662] [2022-07-13 22:27:53,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341100662] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:27:53,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:27:53,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-13 22:27:53,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319577976] [2022-07-13 22:27:53,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:27:53,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 22:27:53,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:27:53,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 22:27:53,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:27:53,180 INFO L87 Difference]: Start difference. First operand 125 states and 171 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 11 states have internal predecessors, (37), 6 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-07-13 22:27:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:27:54,097 INFO L93 Difference]: Finished difference Result 206 states and 286 transitions. [2022-07-13 22:27:54,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 22:27:54,100 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 11 states have internal predecessors, (37), 6 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 87 [2022-07-13 22:27:54,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:27:54,101 INFO L225 Difference]: With dead ends: 206 [2022-07-13 22:27:54,101 INFO L226 Difference]: Without dead ends: 174 [2022-07-13 22:27:54,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2022-07-13 22:27:54,102 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 138 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 22:27:54,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 430 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 22:27:54,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-13 22:27:54,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 131. [2022-07-13 22:27:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 73 states have (on average 1.178082191780822) internal successors, (86), 76 states have internal predecessors, (86), 43 states have call successors, (43), 11 states have call predecessors, (43), 14 states have return successors, (54), 44 states have call predecessors, (54), 42 states have call successors, (54) [2022-07-13 22:27:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 183 transitions. [2022-07-13 22:27:54,111 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 183 transitions. Word has length 87 [2022-07-13 22:27:54,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:27:54,112 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 183 transitions. [2022-07-13 22:27:54,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 11 states have internal predecessors, (37), 6 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-07-13 22:27:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 183 transitions. [2022-07-13 22:27:54,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-13 22:27:54,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:27:54,113 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 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] [2022-07-13 22:27:54,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 22:27:54,113 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:27:54,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:27:54,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1448571299, now seen corresponding path program 1 times [2022-07-13 22:27:54,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:27:54,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741519344] [2022-07-13 22:27:54,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:27:54,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:27:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:54,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:27:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:54,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:27:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:54,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:54,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:27:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:54,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:54,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:27:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:54,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:27:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:54,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:27:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:54,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:27:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:54,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:27:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:54,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 22:27:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:54,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:27:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:54,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:54,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:27:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:54,438 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-13 22:27:54,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:27:54,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741519344] [2022-07-13 22:27:54,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741519344] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:27:54,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208950117] [2022-07-13 22:27:54,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:27:54,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:27:54,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:27:54,440 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:27:54,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 22:27:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:54,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 2558 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-13 22:27:54,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:27:54,923 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-13 22:27:54,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:27:54,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208950117] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:27:54,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:27:54,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 16 [2022-07-13 22:27:54,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568999783] [2022-07-13 22:27:54,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:27:54,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:27:54,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:27:54,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:27:54,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:27:54,926 INFO L87 Difference]: Start difference. First operand 131 states and 183 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-13 22:27:55,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:27:55,081 INFO L93 Difference]: Finished difference Result 177 states and 247 transitions. [2022-07-13 22:27:55,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:27:55,081 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 88 [2022-07-13 22:27:55,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:27:55,082 INFO L225 Difference]: With dead ends: 177 [2022-07-13 22:27:55,082 INFO L226 Difference]: Without dead ends: 149 [2022-07-13 22:27:55,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:27:55,083 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 46 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:27:55,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 918 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:27:55,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-13 22:27:55,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 137. [2022-07-13 22:27:55,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 79 states have (on average 1.1645569620253164) internal successors, (92), 81 states have internal predecessors, (92), 43 states have call successors, (43), 11 states have call predecessors, (43), 14 states have return successors, (51), 45 states have call predecessors, (51), 42 states have call successors, (51) [2022-07-13 22:27:55,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 186 transitions. [2022-07-13 22:27:55,094 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 186 transitions. Word has length 88 [2022-07-13 22:27:55,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:27:55,094 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 186 transitions. [2022-07-13 22:27:55,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-13 22:27:55,094 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 186 transitions. [2022-07-13 22:27:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-13 22:27:55,095 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:27:55,095 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 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] [2022-07-13 22:27:55,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 22:27:55,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:27:55,311 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:27:55,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:27:55,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1562553972, now seen corresponding path program 1 times [2022-07-13 22:27:55,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:27:55,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703253300] [2022-07-13 22:27:55,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:27:55,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:27:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:55,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:27:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:55,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:27:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:55,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:55,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:27:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:55,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:27:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:55,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:27:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:55,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:55,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:27:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:55,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:27:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:55,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:27:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:55,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:27:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:55,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:27:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:55,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:55,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:27:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:55,499 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-13 22:27:55,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:27:55,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703253300] [2022-07-13 22:27:55,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703253300] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:27:55,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:27:55,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:27:55,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39042787] [2022-07-13 22:27:55,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:27:55,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:27:55,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:27:55,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:27:55,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:27:55,501 INFO L87 Difference]: Start difference. First operand 137 states and 186 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 22:27:55,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:27:55,838 INFO L93 Difference]: Finished difference Result 184 states and 258 transitions. [2022-07-13 22:27:55,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:27:55,839 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2022-07-13 22:27:55,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:27:55,840 INFO L225 Difference]: With dead ends: 184 [2022-07-13 22:27:55,840 INFO L226 Difference]: Without dead ends: 160 [2022-07-13 22:27:55,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:27:55,840 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 78 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:27:55,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 391 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:27:55,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-13 22:27:55,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-07-13 22:27:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 91 states have (on average 1.164835164835165) internal successors, (106), 92 states have internal predecessors, (106), 54 states have call successors, (54), 11 states have call predecessors, (54), 14 states have return successors, (62), 57 states have call predecessors, (62), 52 states have call successors, (62) [2022-07-13 22:27:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 222 transitions. [2022-07-13 22:27:55,851 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 222 transitions. Word has length 86 [2022-07-13 22:27:55,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:27:55,851 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 222 transitions. [2022-07-13 22:27:55,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 22:27:55,852 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 222 transitions. [2022-07-13 22:27:55,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-13 22:27:55,852 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:27:55,853 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2022-07-13 22:27:55,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 22:27:55,853 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:27:55,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:27:55,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1066644358, now seen corresponding path program 1 times [2022-07-13 22:27:55,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:27:55,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269169119] [2022-07-13 22:27:55,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:27:55,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:27:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:56,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:27:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:56,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:27:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:56,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:56,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:27:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:56,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:56,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:27:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:56,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:27:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:56,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:27:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:56,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:27:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:56,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:27:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:56,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:27:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:56,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:27:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:56,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:27:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:56,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:27:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:56,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:27:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:27:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-07-13 22:27:56,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:27:56,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269169119] [2022-07-13 22:27:56,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269169119] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:27:56,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:27:56,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 22:27:56,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460803105] [2022-07-13 22:27:56,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:27:56,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:27:56,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:27:56,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:27:56,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:27:56,266 INFO L87 Difference]: Start difference. First operand 160 states and 222 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-13 22:27:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:27:56,579 INFO L93 Difference]: Finished difference Result 179 states and 243 transitions. [2022-07-13 22:27:56,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:27:56,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 94 [2022-07-13 22:27:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:27:56,581 INFO L225 Difference]: With dead ends: 179 [2022-07-13 22:27:56,581 INFO L226 Difference]: Without dead ends: 162 [2022-07-13 22:27:56,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:27:56,582 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 88 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:27:56,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 222 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:27:56,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-13 22:27:56,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2022-07-13 22:27:56,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 90 states have (on average 1.1666666666666667) internal successors, (105), 92 states have internal predecessors, (105), 54 states have call successors, (54), 11 states have call predecessors, (54), 14 states have return successors, (61), 56 states have call predecessors, (61), 52 states have call successors, (61) [2022-07-13 22:27:56,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 220 transitions. [2022-07-13 22:27:56,592 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 220 transitions. Word has length 94 [2022-07-13 22:27:56,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:27:56,593 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 220 transitions. [2022-07-13 22:27:56,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-13 22:27:56,593 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 220 transitions. [2022-07-13 22:27:56,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-13 22:27:56,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:27:56,595 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2022-07-13 22:27:56,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 22:27:56,595 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:27:56,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:27:56,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1470452839, now seen corresponding path program 1 times [2022-07-13 22:27:56,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:27:56,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241374349] [2022-07-13 22:27:56,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:27:56,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:27:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:28:37,279 WARN L233 SmtUtils]: Spent 13.73s on a formula simplification. DAG size of input: 153 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 22:28:57,323 WARN L233 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 146 DAG size of output: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 22:29:19,375 WARN L233 SmtUtils]: Spent 7.30s on a formula simplification that was a NOOP. DAG size: 141 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 22:29:32,845 WARN L233 SmtUtils]: Spent 5.56s on a formula simplification. DAG size of input: 141 DAG size of output: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 22:29:54,416 WARN L233 SmtUtils]: Spent 8.84s on a formula simplification. DAG size of input: 125 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 22:29:54,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:29:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:29:54,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:29:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:29:54,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:29:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:29:54,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:29:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:29:54,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:29:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:29:54,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:29:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:29:54,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:29:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:29:55,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:29:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:29:55,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:29:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:29:55,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:29:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:29:55,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:29:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:29:55,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:29:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:29:55,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:29:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:29:55,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:29:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:29:55,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:29:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:29:55,613 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-13 22:29:55,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:29:55,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241374349] [2022-07-13 22:29:55,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241374349] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:29:55,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48174443] [2022-07-13 22:29:55,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:29:55,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:29:55,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:29:55,616 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:29:55,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 22:29:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:29:56,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 2606 conjuncts, 103 conjunts are in the unsatisfiable core [2022-07-13 22:29:56,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:29:56,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 22:29:56,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 22:29:56,620 INFO L356 Elim1Store]: treesize reduction 88, result has 32.3 percent of original size [2022-07-13 22:29:56,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 86 [2022-07-13 22:29:57,306 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 22:29:57,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 22:29:57,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 22:29:57,587 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_343 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_save_byte_from_array_#in~storage#1.base| v_ArrVal_343))) is different from true [2022-07-13 22:29:57,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:29:57,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:29:57,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 65 [2022-07-13 22:29:59,430 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_15| Int)) (and (< (+ |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_15| 1) |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_5|) (let ((.cse4 (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_5|))) (let ((.cse1 (mod (select .cse4 0) 18446744073709551616))) (let ((.cse0 (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_15|)) (.cse2 (select .cse4 8)) (.cse3 (<= .cse1 9223372036854775807))) (or (and (= (select .cse0 (+ (- 18446744073709551616) .cse1)) .cse2) (not .cse3)) (and (= (select .cse0 .cse1) .cse2) .cse3))))) (not (= |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_15| 0)))) is different from true [2022-07-13 22:30:06,148 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_16| Int)) (and (let ((.cse4 (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_6|))) (let ((.cse3 (mod (select .cse4 0) 18446744073709551616))) (let ((.cse1 (select .cse4 8)) (.cse2 (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_16|)) (.cse0 (<= .cse3 9223372036854775807))) (or (and .cse0 (= .cse1 (select .cse2 .cse3))) (and (= .cse1 (select .cse2 (+ .cse3 (- 18446744073709551616)))) (not .cse0)))))) (< (+ |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_16| 1) |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_6|) (not (= |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_16| 0)))) is different from true [2022-07-13 22:30:09,780 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_17| Int)) (and (let ((.cse4 (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_7|))) (let ((.cse2 (mod (select .cse4 0) 18446744073709551616))) (let ((.cse1 (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_17|)) (.cse0 (select .cse4 8)) (.cse3 (<= .cse2 9223372036854775807))) (or (and (= .cse0 (select .cse1 .cse2)) .cse3) (and (= (select .cse1 (+ (- 18446744073709551616) .cse2)) .cse0) (not .cse3)))))) (< (+ |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_17| 1) |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_7|) (not (= |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_17| 0)))) is different from true [2022-07-13 22:30:11,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:30:11,107 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 22:30:11,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 56 [2022-07-13 22:30:11,202 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 56 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 35 not checked. [2022-07-13 22:30:11,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:30:16,095 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_347 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_rhs~0#1.base| v_ArrVal_347))) (let ((.cse4 (select .cse2 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base|))) (let ((.cse3 (mod (select .cse4 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.offset|) 18446744073709551616))) (or (let ((.cse1 (* (- 1) (mod (select .cse4 (+ 8 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.offset|)) 256))) (.cse0 (select (select .cse2 |c_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base|) (+ (- 18446744073709551616) |c_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.offset| .cse3)))) (and (<= (div (+ (- 1) (* (- 1) .cse0)) (- 256)) (+ (div (+ .cse0 .cse1) 256) 1)) (<= (div (+ (- 1) .cse0 .cse1) 256) (div (+ .cse0 (- 256)) 256)))) (<= .cse3 9223372036854775807)))))) (forall ((v_ArrVal_347 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_rhs~0#1.base| v_ArrVal_347))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base|))) (let ((.cse10 (mod (select .cse8 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.offset|) 18446744073709551616))) (or (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base|) (+ |c_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.offset| .cse10)))) (let ((.cse5 (mod (select .cse8 (+ 8 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.offset|)) 256)) (.cse6 (* (- 1) .cse7))) (and (<= (div (+ .cse5 .cse6) (- 256)) (+ (div (+ (- 256) .cse7) 256) 1)) (<= (div (+ (- 1) .cse6) (- 256)) (div (+ (- 1) .cse5 .cse6) (- 256)))))) (not (<= .cse10 9223372036854775807)))))))) is different from false [2022-07-13 22:30:16,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48174443] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:30:16,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:30:16,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 57 [2022-07-13 22:30:16,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927859452] [2022-07-13 22:30:16,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:30:16,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-13 22:30:16,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:30:16,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-13 22:30:16,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=3245, Unknown=16, NotChecked=590, Total=4032 [2022-07-13 22:30:16,100 INFO L87 Difference]: Start difference. First operand 159 states and 220 transitions. Second operand has 57 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 42 states have internal predecessors, (86), 17 states have call successors, (30), 11 states have call predecessors, (30), 14 states have return successors, (28), 17 states have call predecessors, (28), 15 states have call successors, (28) [2022-07-13 22:30:58,067 WARN L233 SmtUtils]: Spent 36.88s on a formula simplification. DAG size of input: 174 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 22:31:00,077 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 22:31:45,048 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 22:31:47,064 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 22:31:49,080 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []