./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 6c24879c 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-?-6c24879 [2022-07-12 10:46:52,334 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:46:52,336 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:46:52,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:46:52,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:46:52,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:46:52,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:46:52,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:46:52,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:46:52,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:46:52,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:46:52,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:46:52,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:46:52,396 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:46:52,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:46:52,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:46:52,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:46:52,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:46:52,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:46:52,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:46:52,412 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:46:52,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:46:52,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:46:52,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:46:52,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:46:52,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:46:52,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:46:52,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:46:52,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:46:52,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:46:52,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:46:52,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:46:52,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:46:52,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:46:52,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:46:52,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:46:52,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:46:52,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:46:52,433 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:46:52,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:46:52,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:46:52,436 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:46:52,438 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 10:46:52,480 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:46:52,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:46:52,481 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:46:52,481 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:46:52,482 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:46:52,482 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:46:52,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:46:52,483 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:46:52,483 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:46:52,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:46:52,484 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:46:52,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:46:52,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:46:52,485 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:46:52,485 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:46:52,485 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:46:52,485 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:46:52,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:46:52,486 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:46:52,486 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:46:52,486 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:46:52,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:46:52,487 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:46:52,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:46:52,492 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:46:52,492 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:46:52,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:46:52,492 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:46:52,493 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:46:52,493 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:46:52,493 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-12 10:46:52,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:46:52,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:46:52,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:46:52,794 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:46:52,795 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:46:52,796 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-12 10:46:52,847 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964b18077/d50d0ada9d5141448f4cc42ccf2b8678/FLAGaf0fd1c94 [2022-07-12 10:46:53,646 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:46:53,648 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_eq_harness.i [2022-07-12 10:46:53,686 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964b18077/d50d0ada9d5141448f4cc42ccf2b8678/FLAGaf0fd1c94 [2022-07-12 10:46:53,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964b18077/d50d0ada9d5141448f4cc42ccf2b8678 [2022-07-12 10:46:53,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:46:53,874 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:46:53,877 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:46:53,877 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:46:53,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:46:53,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:46:53" (1/1) ... [2022-07-12 10:46:53,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e9a6eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:46:53, skipping insertion in model container [2022-07-12 10:46:53,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:46:53" (1/1) ... [2022-07-12 10:46:53,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:46:53,980 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:46:54,208 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-12 10:46:54,216 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-12 10:46:55,019 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:46:55,019 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:46:55,026 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:46:55,027 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:46:55,028 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:46:55,040 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:46:55,047 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:46:55,049 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:46:55,049 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:46:55,302 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 10:46:55,303 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 10:46:55,304 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 10:46:55,304 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 10:46:55,305 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 10:46:55,306 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 10:46:55,307 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 10:46:55,307 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 10:46:55,308 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 10:46:55,308 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 10:46:55,414 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 10:46:55,529 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:46:55,530 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:46:55,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:46:55,650 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:46:55,661 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-12 10:46:55,662 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-12 10:46:55,691 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:46:55,692 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:46:55,692 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:46:55,693 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:46:55,693 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:46:55,697 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:46:55,698 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:46:55,699 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:46:55,699 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:46:55,748 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 10:46:55,750 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 10:46:55,750 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 10:46:55,751 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 10:46:55,754 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 10:46:55,754 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 10:46:55,755 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 10:46:55,756 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 10:46:55,756 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 10:46:55,756 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 10:46:55,779 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 10:46:55,820 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:46:55,821 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:46:55,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:46:56,052 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:46:56,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:46:56 WrapperNode [2022-07-12 10:46:56,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:46:56,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:46:56,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:46:56,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:46:56,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:46:56" (1/1) ... [2022-07-12 10:46:56,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:46:56" (1/1) ... [2022-07-12 10:46:56,263 INFO L137 Inliner]: procedures = 691, calls = 2616, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 790 [2022-07-12 10:46:56,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:46:56,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:46:56,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:46:56,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:46:56,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:46:56" (1/1) ... [2022-07-12 10:46:56,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:46:56" (1/1) ... [2022-07-12 10:46:56,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:46:56" (1/1) ... [2022-07-12 10:46:56,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:46:56" (1/1) ... [2022-07-12 10:46:56,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:46:56" (1/1) ... [2022-07-12 10:46:56,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:46:56" (1/1) ... [2022-07-12 10:46:56,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:46:56" (1/1) ... [2022-07-12 10:46:56,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:46:56,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:46:56,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:46:56,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:46:56,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:46:56" (1/1) ... [2022-07-12 10:46:56,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:46:56,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:46:56,405 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-12 10:46:56,428 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-12 10:46:56,450 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-12 10:46:56,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:46:56,450 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-12 10:46:56,451 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-12 10:46:56,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 10:46:56,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 10:46:56,453 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 10:46:56,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 10:46:56,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:46:56,454 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2022-07-12 10:46:56,454 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2022-07-12 10:46:56,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:46:56,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:46:56,455 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-12 10:46:56,456 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-12 10:46:56,456 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-12 10:46:56,456 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-12 10:46:56,456 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-07-12 10:46:56,457 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-07-12 10:46:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 10:46:56,457 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 10:46:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:46:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2022-07-12 10:46:56,457 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2022-07-12 10:46:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 10:46:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-12 10:46:56,458 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-12 10:46:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:46:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:46:56,691 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:46:56,692 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:46:57,621 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:46:57,631 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:46:57,631 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 10:46:57,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:46:57 BoogieIcfgContainer [2022-07-12 10:46:57,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:46:57,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:46:57,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:46:57,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:46:57,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:46:53" (1/3) ... [2022-07-12 10:46:57,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25cfc063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:46:57, skipping insertion in model container [2022-07-12 10:46:57,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:46:56" (2/3) ... [2022-07-12 10:46:57,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25cfc063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:46:57, skipping insertion in model container [2022-07-12 10:46:57,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:46:57" (3/3) ... [2022-07-12 10:46:57,642 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_array_eq_harness.i [2022-07-12 10:46:57,656 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:46:57,656 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 10:46:57,718 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:46:57,728 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@26e7b0e8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@35d5ca25 [2022-07-12 10:46:57,729 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 10:46:57,734 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-12 10:46:57,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 10:46:57,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:46:57,745 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-12 10:46:57,745 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:46:57,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:46:57,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1074851773, now seen corresponding path program 1 times [2022-07-12 10:46:57,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:46:57,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005547609] [2022-07-12 10:46:57,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:46:57,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:46:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:58,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:46:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:58,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:46:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:58,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:46:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:58,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 10:46:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:58,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:46:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:58,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:46:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:58,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:46:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:58,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:46:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:58,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:46:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:58,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:46:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:58,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:46:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:58,520 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-12 10:46:58,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:46:58,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005547609] [2022-07-12 10:46:58,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005547609] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:46:58,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:46:58,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 10:46:58,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581079746] [2022-07-12 10:46:58,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:46:58,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:46:58,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:46:58,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:46:58,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 10:46:58,560 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-12 10:46:58,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:46:58,876 INFO L93 Difference]: Finished difference Result 176 states and 252 transitions. [2022-07-12 10:46:58,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:46:58,878 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-12 10:46:58,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:46:58,888 INFO L225 Difference]: With dead ends: 176 [2022-07-12 10:46:58,889 INFO L226 Difference]: Without dead ends: 87 [2022-07-12 10:46:58,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:46:58,901 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 72 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-12 10:46:58,902 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-12 10:46:58,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-12 10:46:58,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2022-07-12 10:46:58,948 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-12 10:46:58,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2022-07-12 10:46:58,950 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 65 [2022-07-12 10:46:58,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:46:58,951 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2022-07-12 10:46:58,951 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-12 10:46:58,951 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-07-12 10:46:58,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 10:46:58,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:46:58,954 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-12 10:46:58,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:46:58,955 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:46:58,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:46:58,955 INFO L85 PathProgramCache]: Analyzing trace with hash 401511231, now seen corresponding path program 1 times [2022-07-12 10:46:58,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:46:58,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298643629] [2022-07-12 10:46:58,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:46:58,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:46:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:59,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:46:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:59,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:46:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:59,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:46:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:59,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 10:46:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:59,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:46:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:59,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:46:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:59,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:46:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:59,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:46:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:59,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:46:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:59,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:46:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:59,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:46:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:46:59,303 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-12 10:46:59,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:46:59,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298643629] [2022-07-12 10:46:59,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298643629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:46:59,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:46:59,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:46:59,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347137227] [2022-07-12 10:46:59,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:46:59,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:46:59,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:46:59,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:46:59,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:46:59,307 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-12 10:46:59,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:46:59,630 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2022-07-12 10:46:59,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:46:59,631 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-12 10:46:59,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:46:59,633 INFO L225 Difference]: With dead ends: 124 [2022-07-12 10:46:59,633 INFO L226 Difference]: Without dead ends: 90 [2022-07-12 10:46:59,634 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-12 10:46:59,635 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:46:59,635 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.3s Time] [2022-07-12 10:46:59,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-12 10:46:59,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2022-07-12 10:46:59,646 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-12 10:46:59,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 109 transitions. [2022-07-12 10:46:59,647 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 109 transitions. Word has length 65 [2022-07-12 10:46:59,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:46:59,648 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 109 transitions. [2022-07-12 10:46:59,648 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-12 10:46:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2022-07-12 10:46:59,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-12 10:46:59,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:46:59,650 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-12 10:46:59,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:46:59,650 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:46:59,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:46:59,651 INFO L85 PathProgramCache]: Analyzing trace with hash 560902053, now seen corresponding path program 1 times [2022-07-12 10:46:59,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:46:59,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936495271] [2022-07-12 10:46:59,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:46:59,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:46:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:00,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:47:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:00,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:47:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:00,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:00,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 10:47:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:00,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:47:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:00,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:47:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:00,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:47:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:00,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:47:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:00,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:47:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:00,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:00,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:47:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:00,361 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-12 10:47:00,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:47:00,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936495271] [2022-07-12 10:47:00,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936495271] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:47:00,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145047606] [2022-07-12 10:47:00,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:47:00,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:47:00,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:47:00,367 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-12 10:47:00,373 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-12 10:47:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:00,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 2451 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 10:47:00,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:47:00,953 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-12 10:47:00,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:47:00,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145047606] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:47:00,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:47:00,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 18 [2022-07-12 10:47:00,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449079587] [2022-07-12 10:47:00,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:47:00,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:47:00,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:47:00,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:47:00,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-07-12 10:47:00,956 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-12 10:47:01,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:47:01,111 INFO L93 Difference]: Finished difference Result 132 states and 176 transitions. [2022-07-12 10:47:01,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:47:01,111 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-12 10:47:01,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:47:01,113 INFO L225 Difference]: With dead ends: 132 [2022-07-12 10:47:01,114 INFO L226 Difference]: Without dead ends: 116 [2022-07-12 10:47:01,114 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-12 10:47:01,115 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-12 10:47:01,115 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-12 10:47:01,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-12 10:47:01,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2022-07-12 10:47:01,126 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-12 10:47:01,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 133 transitions. [2022-07-12 10:47:01,127 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 133 transitions. Word has length 66 [2022-07-12 10:47:01,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:47:01,128 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 133 transitions. [2022-07-12 10:47:01,128 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-12 10:47:01,128 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 133 transitions. [2022-07-12 10:47:01,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-12 10:47:01,130 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:47:01,130 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-12 10:47:01,163 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-12 10:47:01,355 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-12 10:47:01,355 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:47:01,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:47:01,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1220340855, now seen corresponding path program 1 times [2022-07-12 10:47:01,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:47:01,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132444567] [2022-07-12 10:47:01,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:47:01,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:47:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:01,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:47:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:01,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:47:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:01,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:01,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 10:47:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:01,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:47:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:01,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:47:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:01,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:47:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:01,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:47:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:01,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:47:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:01,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:01,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:47:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:01,744 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-12 10:47:01,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:47:01,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132444567] [2022-07-12 10:47:01,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132444567] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:47:01,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:47:01,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:47:01,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829997340] [2022-07-12 10:47:01,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:47:01,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:47:01,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:47:01,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:47:01,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:47:01,748 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-12 10:47:02,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:47:02,274 INFO L93 Difference]: Finished difference Result 168 states and 238 transitions. [2022-07-12 10:47:02,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:47:02,275 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-12 10:47:02,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:47:02,277 INFO L225 Difference]: With dead ends: 168 [2022-07-12 10:47:02,277 INFO L226 Difference]: Without dead ends: 136 [2022-07-12 10:47:02,278 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-12 10:47:02,278 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 76 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-07-12 10:47:02,279 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.4s Time] [2022-07-12 10:47:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-12 10:47:02,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2022-07-12 10:47:02,292 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-12 10:47:02,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 188 transitions. [2022-07-12 10:47:02,293 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 188 transitions. Word has length 69 [2022-07-12 10:47:02,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:47:02,294 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 188 transitions. [2022-07-12 10:47:02,294 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-12 10:47:02,294 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 188 transitions. [2022-07-12 10:47:02,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-12 10:47:02,297 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:47:02,297 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-12 10:47:02,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:47:02,298 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:47:02,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:47:02,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1527144091, now seen corresponding path program 1 times [2022-07-12 10:47:02,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:47:02,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145791220] [2022-07-12 10:47:02,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:47:02,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:47:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:02,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:47:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:02,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:47:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:02,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:02,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 10:47:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:02,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:47:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:02,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:47:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:02,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:47:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:02,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:47:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:02,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:47:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:02,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:02,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:47:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:02,600 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-12 10:47:02,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:47:02,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145791220] [2022-07-12 10:47:02,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145791220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:47:02,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:47:02,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:47:02,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711326446] [2022-07-12 10:47:02,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:47:02,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:47:02,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:47:02,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:47:02,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:47:02,603 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-12 10:47:03,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:47:03,196 INFO L93 Difference]: Finished difference Result 153 states and 216 transitions. [2022-07-12 10:47:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:47:03,197 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-12 10:47:03,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:47:03,198 INFO L225 Difference]: With dead ends: 153 [2022-07-12 10:47:03,198 INFO L226 Difference]: Without dead ends: 126 [2022-07-12 10:47:03,199 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-12 10:47:03,199 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.5s IncrementalHoareTripleChecker+Time [2022-07-12 10:47:03,199 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.5s Time] [2022-07-12 10:47:03,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-12 10:47:03,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2022-07-12 10:47:03,211 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-12 10:47:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 168 transitions. [2022-07-12 10:47:03,213 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 168 transitions. Word has length 70 [2022-07-12 10:47:03,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:47:03,214 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 168 transitions. [2022-07-12 10:47:03,214 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-12 10:47:03,214 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 168 transitions. [2022-07-12 10:47:03,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-12 10:47:03,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:47:03,218 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-12 10:47:03,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:47:03,218 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:47:03,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:47:03,219 INFO L85 PathProgramCache]: Analyzing trace with hash -343504052, now seen corresponding path program 1 times [2022-07-12 10:47:03,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:47:03,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816660994] [2022-07-12 10:47:03,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:47:03,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:47:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:03,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:47:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:03,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:47:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:03,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:03,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 10:47:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:03,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:47:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:03,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 10:47:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:03,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:03,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:47:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:03,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 10:47:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:03,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:47:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:03,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 10:47:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:03,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 10:47:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:03,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:03,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:47:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:03,985 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-12 10:47:03,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:47:03,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816660994] [2022-07-12 10:47:03,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816660994] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:47:03,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729889956] [2022-07-12 10:47:03,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:47:03,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:47:03,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:47:03,988 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-12 10:47:04,014 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-12 10:47:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:04,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 2489 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 10:47:04,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:47:04,619 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-12 10:47:04,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:47:04,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729889956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:47:04,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:47:04,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 21 [2022-07-12 10:47:04,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927841765] [2022-07-12 10:47:04,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:47:04,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:47:04,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:47:04,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:47:04,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-07-12 10:47:04,623 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-12 10:47:04,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:47:04,812 INFO L93 Difference]: Finished difference Result 173 states and 230 transitions. [2022-07-12 10:47:04,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:47:04,813 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-12 10:47:04,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:47:04,814 INFO L225 Difference]: With dead ends: 173 [2022-07-12 10:47:04,814 INFO L226 Difference]: Without dead ends: 119 [2022-07-12 10:47:04,815 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-12 10:47:04,816 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-12 10:47:04,816 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-12 10:47:04,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-12 10:47:04,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-07-12 10:47:04,825 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-12 10:47:04,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 162 transitions. [2022-07-12 10:47:04,826 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 162 transitions. Word has length 82 [2022-07-12 10:47:04,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:47:04,827 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 162 transitions. [2022-07-12 10:47:04,827 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-12 10:47:04,827 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 162 transitions. [2022-07-12 10:47:04,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-12 10:47:04,828 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:47:04,829 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-12 10:47:04,860 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-12 10:47:05,051 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-12 10:47:05,052 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:47:05,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:47:05,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1399306283, now seen corresponding path program 1 times [2022-07-12 10:47:05,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:47:05,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204386948] [2022-07-12 10:47:05,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:47:05,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:47:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:05,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:47:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:05,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:47:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:05,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:05,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 10:47:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:05,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:47:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:05,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 10:47:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:05,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:05,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:47:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:05,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 10:47:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:05,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:47:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:05,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 10:47:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:05,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 10:47:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:05,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:05,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:47:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:05,474 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-12 10:47:05,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:47:05,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204386948] [2022-07-12 10:47:05,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204386948] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:47:05,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939013391] [2022-07-12 10:47:05,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:47:05,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:47:05,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:47:05,476 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-12 10:47:05,503 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-12 10:47:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:05,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 2490 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-12 10:47:05,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:47:06,279 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-12 10:47:06,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:47:06,965 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-12 10:47:06,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939013391] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:47:06,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:47:06,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 26 [2022-07-12 10:47:06,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897091166] [2022-07-12 10:47:06,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:47:06,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 10:47:06,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:47:06,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 10:47:06,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2022-07-12 10:47:06,968 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-12 10:47:08,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:47:08,730 INFO L93 Difference]: Finished difference Result 189 states and 261 transitions. [2022-07-12 10:47:08,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 10:47:08,731 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-12 10:47:08,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:47:08,733 INFO L225 Difference]: With dead ends: 189 [2022-07-12 10:47:08,733 INFO L226 Difference]: Without dead ends: 144 [2022-07-12 10:47:08,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 177 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=257, Invalid=1905, Unknown=0, NotChecked=0, Total=2162 [2022-07-12 10:47:08,735 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 167 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 10:47:08,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 681 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-12 10:47:08,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-12 10:47:08,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 125. [2022-07-12 10:47:08,753 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-12 10:47:08,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 171 transitions. [2022-07-12 10:47:08,756 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 171 transitions. Word has length 82 [2022-07-12 10:47:08,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:47:08,756 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 171 transitions. [2022-07-12 10:47:08,757 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-12 10:47:08,757 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 171 transitions. [2022-07-12 10:47:08,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-12 10:47:08,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:47:08,759 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-12 10:47:08,791 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-12 10:47:08,978 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-12 10:47:08,978 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:47:08,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:47:08,979 INFO L85 PathProgramCache]: Analyzing trace with hash 207953017, now seen corresponding path program 1 times [2022-07-12 10:47:08,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:47:08,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239402209] [2022-07-12 10:47:08,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:47:08,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:47:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:09,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:47:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:09,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:47:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:09,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:09,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:47:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:09,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:09,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 10:47:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:09,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:47:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:09,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:47:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:09,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 10:47:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:09,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 10:47:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:09,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 10:47:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:09,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 10:47:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:09,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:09,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:47:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:09,504 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-12 10:47:09,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:47:09,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239402209] [2022-07-12 10:47:09,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239402209] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:47:09,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:47:09,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 10:47:09,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237789973] [2022-07-12 10:47:09,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:47:09,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 10:47:09,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:47:09,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 10:47:09,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-07-12 10:47:09,507 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-12 10:47:10,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:47:10,645 INFO L93 Difference]: Finished difference Result 206 states and 286 transitions. [2022-07-12 10:47:10,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 10:47:10,646 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-12 10:47:10,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:47:10,647 INFO L225 Difference]: With dead ends: 206 [2022-07-12 10:47:10,648 INFO L226 Difference]: Without dead ends: 174 [2022-07-12 10:47:10,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2022-07-12 10:47:10,649 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 138 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2022-07-12 10:47:10,649 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.9s Time] [2022-07-12 10:47:10,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-12 10:47:10,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 131. [2022-07-12 10:47:10,664 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-12 10:47:10,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 183 transitions. [2022-07-12 10:47:10,665 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 183 transitions. Word has length 87 [2022-07-12 10:47:10,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:47:10,666 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 183 transitions. [2022-07-12 10:47:10,666 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-12 10:47:10,666 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 183 transitions. [2022-07-12 10:47:10,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-12 10:47:10,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:47:10,668 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-12 10:47:10,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 10:47:10,668 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:47:10,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:47:10,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1448571299, now seen corresponding path program 1 times [2022-07-12 10:47:10,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:47:10,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465194473] [2022-07-12 10:47:10,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:47:10,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:47:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:10,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:47:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:10,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:47:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:10,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:10,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:47:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:10,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:10,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 10:47:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:10,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:47:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:11,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:47:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:11,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 10:47:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:11,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 10:47:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:11,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 10:47:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:11,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 10:47:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:11,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:11,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:47:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:11,069 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-12 10:47:11,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:47:11,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465194473] [2022-07-12 10:47:11,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465194473] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:47:11,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529298193] [2022-07-12 10:47:11,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:47:11,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:47:11,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:47:11,076 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-12 10:47:11,078 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-12 10:47:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:11,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 2558 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 10:47:11,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:47:11,565 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-12 10:47:11,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:47:11,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529298193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:47:11,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:47:11,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 16 [2022-07-12 10:47:11,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863461803] [2022-07-12 10:47:11,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:47:11,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:47:11,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:47:11,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:47:11,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-07-12 10:47:11,568 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-12 10:47:11,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:47:11,744 INFO L93 Difference]: Finished difference Result 177 states and 247 transitions. [2022-07-12 10:47:11,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:47:11,745 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-12 10:47:11,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:47:11,746 INFO L225 Difference]: With dead ends: 177 [2022-07-12 10:47:11,746 INFO L226 Difference]: Without dead ends: 149 [2022-07-12 10:47:11,747 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-12 10:47:11,748 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-12 10:47:11,748 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-12 10:47:11,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-12 10:47:11,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 137. [2022-07-12 10:47:11,760 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-12 10:47:11,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 186 transitions. [2022-07-12 10:47:11,761 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 186 transitions. Word has length 88 [2022-07-12 10:47:11,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:47:11,762 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 186 transitions. [2022-07-12 10:47:11,762 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-12 10:47:11,762 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 186 transitions. [2022-07-12 10:47:11,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-12 10:47:11,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:47:11,768 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-12 10:47:11,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-12 10:47:11,979 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-12 10:47:11,980 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:47:11,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:47:11,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1562553972, now seen corresponding path program 1 times [2022-07-12 10:47:11,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:47:11,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125554140] [2022-07-12 10:47:11,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:47:11,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:47:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:12,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:47:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:12,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:47:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:12,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:12,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 10:47:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:12,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:47:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:12,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 10:47:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:12,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:12,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:47:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:12,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 10:47:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:12,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:47:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:12,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 10:47:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:12,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 10:47:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:12,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:12,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:47:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:12,251 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-12 10:47:12,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:47:12,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125554140] [2022-07-12 10:47:12,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125554140] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:47:12,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:47:12,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:47:12,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47342858] [2022-07-12 10:47:12,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:47:12,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:47:12,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:47:12,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:47:12,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:47:12,254 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-12 10:47:12,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:47:12,685 INFO L93 Difference]: Finished difference Result 184 states and 258 transitions. [2022-07-12 10:47:12,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:47:12,686 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-12 10:47:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:47:12,687 INFO L225 Difference]: With dead ends: 184 [2022-07-12 10:47:12,687 INFO L226 Difference]: Without dead ends: 160 [2022-07-12 10:47:12,688 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-12 10:47:12,688 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 78 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-07-12 10:47:12,689 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.4s Time] [2022-07-12 10:47:12,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-12 10:47:12,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-07-12 10:47:12,700 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-12 10:47:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 222 transitions. [2022-07-12 10:47:12,702 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 222 transitions. Word has length 86 [2022-07-12 10:47:12,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:47:12,702 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 222 transitions. [2022-07-12 10:47:12,703 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-12 10:47:12,703 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 222 transitions. [2022-07-12 10:47:12,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 10:47:12,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:47:12,704 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-12 10:47:12,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 10:47:12,705 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:47:12,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:47:12,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1066644358, now seen corresponding path program 1 times [2022-07-12 10:47:12,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:47:12,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895041116] [2022-07-12 10:47:12,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:47:12,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:47:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:47:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:47:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:47:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 10:47:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:47:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:47:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 10:47:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:47:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 10:47:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:47:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 10:47:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:47:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:47:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:13,241 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-12 10:47:13,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:47:13,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895041116] [2022-07-12 10:47:13,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895041116] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:47:13,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:47:13,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:47:13,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468531536] [2022-07-12 10:47:13,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:47:13,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:47:13,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:47:13,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:47:13,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:47:13,244 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-12 10:47:13,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:47:13,659 INFO L93 Difference]: Finished difference Result 179 states and 243 transitions. [2022-07-12 10:47:13,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:47:13,660 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-12 10:47:13,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:47:13,661 INFO L225 Difference]: With dead ends: 179 [2022-07-12 10:47:13,661 INFO L226 Difference]: Without dead ends: 162 [2022-07-12 10:47:13,662 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-12 10:47:13,662 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 88 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-12 10:47:13,662 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-12 10:47:13,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-12 10:47:13,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2022-07-12 10:47:13,678 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-12 10:47:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 220 transitions. [2022-07-12 10:47:13,680 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 220 transitions. Word has length 94 [2022-07-12 10:47:13,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:47:13,680 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 220 transitions. [2022-07-12 10:47:13,681 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-12 10:47:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 220 transitions. [2022-07-12 10:47:13,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-12 10:47:13,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:47:13,682 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-12 10:47:13,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 10:47:13,683 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:47:13,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:47:13,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1470452839, now seen corresponding path program 1 times [2022-07-12 10:47:13,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:47:13,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530544975] [2022-07-12 10:47:13,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:47:13,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:47:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:47:36,365 WARN L233 SmtUtils]: Spent 7.20s on a formula simplification that was a NOOP. DAG size: 154 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 10:47:53,142 WARN L233 SmtUtils]: Spent 6.77s 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-12 10:48:12,115 WARN L233 SmtUtils]: Spent 6.84s on a formula simplification that was a NOOP. DAG size: 146 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 10:48:48,166 WARN L233 SmtUtils]: Spent 7.55s 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-12 10:49:05,637 WARN L233 SmtUtils]: Spent 8.67s 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-12 10:49:05,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:49:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:49:05,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:49:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:49:05,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:49:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:49:05,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:49:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:49:05,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:49:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:49:05,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 10:49:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:49:06,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:49:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:49:06,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:49:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:49:06,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 10:49:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:49:07,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:49:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:49:07,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 10:49:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:49:07,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:49:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:49:07,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 10:49:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:49:07,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:49:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:49:07,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:49:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:49:07,448 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-12 10:49:07,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:49:07,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530544975] [2022-07-12 10:49:07,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530544975] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:49:07,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055845009] [2022-07-12 10:49:07,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:49:07,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:49:07,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:49:07,451 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-12 10:49:07,452 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-12 10:49:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:49:07,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 2606 conjuncts, 103 conjunts are in the unsatisfiable core [2022-07-12 10:49:07,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:49:08,184 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-12 10:49:08,394 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-12 10:49:08,485 INFO L356 Elim1Store]: treesize reduction 88, result has 32.3 percent of original size [2022-07-12 10:49:08,485 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-12 10:49:09,102 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 10:49:09,102 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-12 10:49:09,852 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-12 10:49:09,861 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-12 10:49:09,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:49:09,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:49:09,880 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-12 10:49:12,279 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_15| Int)) (and (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_5|))) (let ((.cse0 (mod (select .cse1 0) 18446744073709551616))) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_15|) .cse0) (select .cse1 8)) (<= .cse0 9223372036854775807) (< (+ |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|))))) (not (= |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_15| 0)))) (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_15| Int)) (and (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_5|))) (let ((.cse2 (mod (select .cse3 0) 18446744073709551616))) (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|) (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_15|) (+ (- 18446744073709551616) .cse2)) (select .cse3 8)) (not (<= .cse2 9223372036854775807)))))) (not (= |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_15| 0))))) is different from true [2022-07-12 10:49:22,418 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 10:49:30,613 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 10:49:32,932 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_16| Int)) (and (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_6|))) (let ((.cse0 (mod (select .cse1 0) 18446744073709551616))) (and (<= .cse0 9223372036854775807) (< (+ |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|) (= (select .cse1 8) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_16|) .cse0)))))) (not (= |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_16| 0)))) (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_16| Int)) (and (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_6| Int)) (let ((.cse2 (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 .cse2 0) 18446744073709551616))) (and (= (select .cse2 8) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_16|) (+ .cse3 (- 18446744073709551616)))) (not (<= .cse3 9223372036854775807)) (< (+ |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-12 10:49:36,107 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_17| Int)) (and (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_7|))) (let ((.cse0 (mod (select .cse1 0) 18446744073709551616))) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_17|) (+ (- 18446744073709551616) .cse0)) (select .cse1 8)) (< (+ |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 (<= .cse0 9223372036854775807)))))) (not (= |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_17| 0)))) (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_17| Int)) (and (exists ((|v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_7| Int)) (let ((.cse2 (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base_BEFORE_CALL_7|))) (let ((.cse3 (mod (select .cse2 0) 18446744073709551616))) (and (= (select .cse2 8) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_17|) .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|) (<= .cse3 9223372036854775807))))) (not (= |v_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base_BEFORE_CALL_17| 0))))) is different from true [2022-07-12 10:49:37,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:49:37,278 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 10:49:37,279 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-12 10:49:37,365 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-12 10:49:37,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:49:42,431 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 ((.cse0 (select .cse2 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base|))) (let ((.cse3 (mod (select .cse0 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.offset|) 18446744073709551616))) (or (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base|) (+ |c_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.offset| .cse3)))) (<= (div (+ (mod (select .cse0 (+ 8 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.offset|)) 256) (* (- 1) .cse1)) (- 256)) (+ (div (+ (- 256) .cse1) 256) 1))) (not (<= .cse3 9223372036854775807))))))) (forall ((v_ArrVal_347 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_rhs~0#1.base| v_ArrVal_347))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base|))) (let ((.cse4 (mod (select .cse6 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.offset|) 18446744073709551616))) (or (<= .cse4 9223372036854775807) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base|) (+ (- 18446744073709551616) |c_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.offset| .cse4)))) (<= (div (+ (- 1) (* (- 1) .cse5)) (- 256)) (+ (div (+ .cse5 (* (- 1) (mod (select .cse6 (+ 8 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.offset|)) 256))) 256) 1)))))))) (forall ((v_ArrVal_347 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_rhs~0#1.base| v_ArrVal_347))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base|))) (let ((.cse8 (mod (select .cse10 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.offset|) 18446744073709551616))) (or (<= .cse8 9223372036854775807) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base|) (+ (- 18446744073709551616) |c_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.offset| .cse8)))) (<= (div (+ (- 1) .cse9 (* (- 1) (mod (select .cse10 (+ 8 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.offset|)) 256))) 256) (div (+ .cse9 (- 256)) 256)))))))) (forall ((v_ArrVal_347 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_rhs~0#1.base| v_ArrVal_347))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.base|))) (let ((.cse15 (mod (select .cse13 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.offset|) 18446744073709551616))) (or (let ((.cse12 (* (- 1) (select (select .cse14 |c_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.base|) (+ |c_ULTIMATE.start_aws_array_eq_harness_~lhs~0#1.offset| .cse15))))) (<= (div (+ (- 1) .cse12) (- 256)) (div (+ (- 1) (mod (select .cse13 (+ 8 |c_ULTIMATE.start_aws_array_eq_harness_~#old_byte_from_lhs~0#1.offset|)) 256) .cse12) (- 256)))) (not (<= .cse15 9223372036854775807)))))))) is different from false [2022-07-12 10:49:42,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055845009] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:49:42,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:49:42,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 56 [2022-07-12 10:49:42,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487034435] [2022-07-12 10:49:42,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 10:49:42,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-07-12 10:49:42,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:49:42,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-07-12 10:49:42,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=3136, Unknown=14, NotChecked=580, Total=3906 [2022-07-12 10:49:42,438 INFO L87 Difference]: Start difference. First operand 159 states and 220 transitions. Second operand has 56 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 41 states have internal predecessors, (86), 16 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-12 10:50:11,336 WARN L233 SmtUtils]: Spent 19.83s 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-12 10:50:13,343 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-12 10:50:20,245 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-12 10:51:02,423 WARN L233 SmtUtils]: Spent 40.02s on a formula simplification. DAG size of input: 182 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 10:51:12,565 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)