./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_string_new_from_c_str_harness.i --full-output --preprocessor.use.memory.slicer true --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 ../../../trunk/examples/svcomp/aws-c-common/aws_string_new_from_c_str_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 --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 d8feb785efb60d35f9204dc33a12e80ea59efcec5de2b7c2ff320ef29197b0bd --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 07:49:01,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 07:49:02,022 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 07:49:02,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 07:49:02,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 07:49:02,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 07:49:02,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 07:49:02,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 07:49:02,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 07:49:02,069 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 07:49:02,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 07:49:02,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 07:49:02,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 07:49:02,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 07:49:02,072 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 07:49:02,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 07:49:02,072 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 07:49:02,072 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 07:49:02,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 07:49:02,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 07:49:02,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 07:49:02,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 07:49:02,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 07:49:02,074 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 07:49:02,074 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 07:49:02,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 07:49:02,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 07:49:02,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 07:49:02,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:49:02,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 07:49:02,076 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 07:49:02,076 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 07:49:02,076 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 07:49:02,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 07:49:02,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 07:49:02,077 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 07:49:02,077 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 07:49:02,077 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 07:49:02,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 07:49:02,077 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 -> d8feb785efb60d35f9204dc33a12e80ea59efcec5de2b7c2ff320ef29197b0bd Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 07:49:02,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 07:49:02,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 07:49:02,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 07:49:02,327 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 07:49:02,327 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 07:49:02,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_string_new_from_c_str_harness.i [2023-11-23 07:49:03,440 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 07:49:03,905 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 07:49:03,906 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_new_from_c_str_harness.i [2023-11-23 07:49:03,936 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe8cfb25e/8c440cae891145cfa8081ed1e2e36699/FLAG02d4e61d5 [2023-11-23 07:49:03,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe8cfb25e/8c440cae891145cfa8081ed1e2e36699 [2023-11-23 07:49:03,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 07:49:03,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 07:49:03,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 07:49:03,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 07:49:03,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 07:49:03,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:49:03" (1/1) ... [2023-11-23 07:49:03,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c88c15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:03, skipping insertion in model container [2023-11-23 07:49:03,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:49:03" (1/1) ... [2023-11-23 07:49:04,046 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:49:04,227 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_new_from_c_str_harness.i[4499,4512] [2023-11-23 07:49:04,237 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_new_from_c_str_harness.i[4559,4572] [2023-11-23 07:49:04,828 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:49:04,829 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:49:04,830 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:49:04,831 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:49:04,832 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:49:04,840 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:49:04,841 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:49:04,842 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:49:04,842 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:49:05,151 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:49:05,152 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:49:05,153 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:49:05,153 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:49:05,158 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:49:05,159 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:49:05,159 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:49:05,160 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:49:05,162 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:49:05,163 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:49:05,388 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:49:05,393 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:49:05,483 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:49:05,528 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 07:49:05,545 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_new_from_c_str_harness.i[4499,4512] [2023-11-23 07:49:05,545 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_new_from_c_str_harness.i[4559,4572] [2023-11-23 07:49:05,582 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:49:05,583 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:49:05,583 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:49:05,583 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:49:05,584 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:49:05,589 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:49:05,590 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:49:05,590 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:49:05,591 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:49:05,626 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:49:05,627 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:49:05,628 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:49:05,628 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:49:05,629 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:49:05,629 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:49:05,630 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:49:05,630 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:49:05,630 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:49:05,630 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:49:05,684 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8269] [2023-11-23 07:49:05,685 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:49:05,686 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:49:05,693 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8755-8766] [2023-11-23 07:49:05,755 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:49:05,939 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:49:05,940 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:49:05,940 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:49:05,940 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:49:05,940 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:49:05,940 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:49:05,941 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:49:05,941 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:49:05,941 WARN L675 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:49:05,941 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:49:05,941 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:49:05,941 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:49:05,941 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:49:05,942 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:49:05,942 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:49:05,942 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:49:05,942 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:49:05,942 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:49:05,948 INFO L206 MainTranslator]: Completed translation [2023-11-23 07:49:05,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:05 WrapperNode [2023-11-23 07:49:05,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 07:49:05,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 07:49:05,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 07:49:05,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 07:49:05,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:05" (1/1) ... [2023-11-23 07:49:06,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:05" (1/1) ... [2023-11-23 07:49:06,081 INFO L138 Inliner]: procedures = 689, calls = 2738, calls flagged for inlining = 62, calls inlined = 9, statements flattened = 811 [2023-11-23 07:49:06,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 07:49:06,082 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 07:49:06,082 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 07:49:06,082 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 07:49:06,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:05" (1/1) ... [2023-11-23 07:49:06,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:05" (1/1) ... [2023-11-23 07:49:06,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:05" (1/1) ... [2023-11-23 07:49:06,174 INFO L188 MemorySlicer]: Split 518 memory accesses to 9 slices as follows [2, 0, 0, 256, 2, 236, 14, 5, 3]. 49 percent of accesses are in the largest equivalence class. The 502 initializations are split as follows [2, 0, 0, 256, 0, 236, 0, 5, 3]. The 5 writes are split as follows [0, 0, 0, 0, 1, 0, 4, 0, 0]. [2023-11-23 07:49:06,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:05" (1/1) ... [2023-11-23 07:49:06,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:05" (1/1) ... [2023-11-23 07:49:06,210 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:05" (1/1) ... [2023-11-23 07:49:06,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:05" (1/1) ... [2023-11-23 07:49:06,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:05" (1/1) ... [2023-11-23 07:49:06,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:05" (1/1) ... [2023-11-23 07:49:06,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 07:49:06,269 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 07:49:06,269 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 07:49:06,269 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 07:49:06,269 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:05" (1/1) ... [2023-11-23 07:49:06,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:49:06,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:49:06,316 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) [2023-11-23 07:49:06,334 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 [2023-11-23 07:49:06,354 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2023-11-23 07:49:06,355 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2023-11-23 07:49:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 07:49:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2023-11-23 07:49:06,355 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2023-11-23 07:49:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#0 [2023-11-23 07:49:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#1 [2023-11-23 07:49:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#2 [2023-11-23 07:49:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#3 [2023-11-23 07:49:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#4 [2023-11-23 07:49:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#5 [2023-11-23 07:49:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#6 [2023-11-23 07:49:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#7 [2023-11-23 07:49:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#8 [2023-11-23 07:49:06,357 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2023-11-23 07:49:06,357 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2023-11-23 07:49:06,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2023-11-23 07:49:06,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2023-11-23 07:49:06,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2023-11-23 07:49:06,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2023-11-23 07:49:06,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2023-11-23 07:49:06,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2023-11-23 07:49:06,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2023-11-23 07:49:06,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2023-11-23 07:49:06,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2023-11-23 07:49:06,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2023-11-23 07:49:06,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2023-11-23 07:49:06,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2023-11-23 07:49:06,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2023-11-23 07:49:06,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2023-11-23 07:49:06,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2023-11-23 07:49:06,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2023-11-23 07:49:06,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2023-11-23 07:49:06,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2023-11-23 07:49:06,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 07:49:06,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 07:49:06,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-23 07:49:06,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-23 07:49:06,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-23 07:49:06,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-23 07:49:06,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-23 07:49:06,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-11-23 07:49:06,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-11-23 07:49:06,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2023-11-23 07:49:06,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2023-11-23 07:49:06,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2023-11-23 07:49:06,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2023-11-23 07:49:06,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2023-11-23 07:49:06,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2023-11-23 07:49:06,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2023-11-23 07:49:06,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2023-11-23 07:49:06,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2023-11-23 07:49:06,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2023-11-23 07:49:06,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2023-11-23 07:49:06,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2023-11-23 07:49:06,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2023-11-23 07:49:06,363 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2023-11-23 07:49:06,363 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2023-11-23 07:49:06,363 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2023-11-23 07:49:06,363 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2023-11-23 07:49:06,363 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2023-11-23 07:49:06,363 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2023-11-23 07:49:06,363 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2023-11-23 07:49:06,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 07:49:06,363 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 07:49:06,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 07:49:06,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 07:49:06,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 07:49:06,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 07:49:06,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 07:49:06,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-23 07:49:06,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-23 07:49:06,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-23 07:49:06,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-23 07:49:06,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-11-23 07:49:06,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-11-23 07:49:06,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 07:49:06,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 07:49:06,366 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-23 07:49:06,366 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-23 07:49:06,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2023-11-23 07:49:06,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2023-11-23 07:49:06,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2023-11-23 07:49:06,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2023-11-23 07:49:06,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2023-11-23 07:49:06,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2023-11-23 07:49:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2023-11-23 07:49:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2023-11-23 07:49:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2023-11-23 07:49:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2023-11-23 07:49:06,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2023-11-23 07:49:06,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2023-11-23 07:49:06,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2023-11-23 07:49:06,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2023-11-23 07:49:06,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2023-11-23 07:49:06,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2023-11-23 07:49:06,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2023-11-23 07:49:06,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2023-11-23 07:49:06,376 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2023-11-23 07:49:06,376 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2023-11-23 07:49:06,376 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 07:49:06,376 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 07:49:06,377 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2023-11-23 07:49:06,377 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2023-11-23 07:49:06,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 07:49:06,377 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2023-11-23 07:49:06,377 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2023-11-23 07:49:06,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 07:49:06,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 07:49:06,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 07:49:06,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-23 07:49:06,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-23 07:49:06,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-23 07:49:06,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-11-23 07:49:06,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-11-23 07:49:06,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-11-23 07:49:06,378 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_new_from_array [2023-11-23 07:49:06,378 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_new_from_array [2023-11-23 07:49:06,378 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2023-11-23 07:49:06,378 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2023-11-23 07:49:06,378 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2023-11-23 07:49:06,378 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2023-11-23 07:49:06,378 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 07:49:06,379 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 07:49:06,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 07:49:06,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 07:49:06,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-23 07:49:06,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-23 07:49:06,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-23 07:49:06,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-23 07:49:06,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-23 07:49:06,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-11-23 07:49:06,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-11-23 07:49:06,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#0 [2023-11-23 07:49:06,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#1 [2023-11-23 07:49:06,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#2 [2023-11-23 07:49:06,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#3 [2023-11-23 07:49:06,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#4 [2023-11-23 07:49:06,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#5 [2023-11-23 07:49:06,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#6 [2023-11-23 07:49:06,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#7 [2023-11-23 07:49:06,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#8 [2023-11-23 07:49:06,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 07:49:06,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 07:49:06,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 07:49:06,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-23 07:49:06,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-23 07:49:06,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-23 07:49:06,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-23 07:49:06,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-11-23 07:49:06,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-11-23 07:49:06,680 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 07:49:06,682 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 07:49:07,399 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !true; [2023-11-23 07:49:07,816 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 07:49:07,884 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 07:49:07,884 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 07:49:07,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:49:07 BoogieIcfgContainer [2023-11-23 07:49:07,885 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 07:49:07,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 07:49:07,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 07:49:07,889 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 07:49:07,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:49:03" (1/3) ... [2023-11-23 07:49:07,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236d6b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:49:07, skipping insertion in model container [2023-11-23 07:49:07,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:05" (2/3) ... [2023-11-23 07:49:07,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236d6b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:49:07, skipping insertion in model container [2023-11-23 07:49:07,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:49:07" (3/3) ... [2023-11-23 07:49:07,891 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_new_from_c_str_harness.i [2023-11-23 07:49:07,903 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 07:49:07,903 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 07:49:07,934 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 07:49:07,939 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=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@647216f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 07:49:07,939 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 07:49:07,942 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 65 states have internal predecessors, (79), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-23 07:49:07,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-23 07:49:07,948 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:49:07,949 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:49:07,949 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:49:07,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:49:07,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1411969478, now seen corresponding path program 1 times [2023-11-23 07:49:07,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:49:07,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431621974] [2023-11-23 07:49:07,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:49:07,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:49:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:08,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:08,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:49:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:08,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:49:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:08,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:08,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 07:49:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:08,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 07:49:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:08,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:49:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:08,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:49:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:08,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:08,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 07:49:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:08,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:49:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:08,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:08,843 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-23 07:49:08,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:49:08,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431621974] [2023-11-23 07:49:08,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431621974] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:49:08,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:49:08,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 07:49:08,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495379547] [2023-11-23 07:49:08,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:49:08,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 07:49:08,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:49:08,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 07:49:08,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:49:08,880 INFO L87 Difference]: Start difference. First operand has 115 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 65 states have internal predecessors, (79), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-23 07:49:09,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:49:09,448 INFO L93 Difference]: Finished difference Result 239 states and 326 transitions. [2023-11-23 07:49:09,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 07:49:09,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 66 [2023-11-23 07:49:09,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:49:09,459 INFO L225 Difference]: With dead ends: 239 [2023-11-23 07:49:09,459 INFO L226 Difference]: Without dead ends: 126 [2023-11-23 07:49:09,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:49:09,470 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 82 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 07:49:09,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 110 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 07:49:09,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-23 07:49:09,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 113. [2023-11-23 07:49:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 64 states have internal predecessors, (75), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-23 07:49:09,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 142 transitions. [2023-11-23 07:49:09,523 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 142 transitions. Word has length 66 [2023-11-23 07:49:09,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:49:09,524 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 142 transitions. [2023-11-23 07:49:09,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-23 07:49:09,524 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 142 transitions. [2023-11-23 07:49:09,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-23 07:49:09,526 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:49:09,526 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:49:09,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 07:49:09,527 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:49:09,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:49:09,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1464218058, now seen corresponding path program 1 times [2023-11-23 07:49:09,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:49:09,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061893799] [2023-11-23 07:49:09,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:49:09,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:49:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:09,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:09,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:49:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:09,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:49:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:09,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:09,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 07:49:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:09,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 07:49:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:09,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:49:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:10,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:49:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:10,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:10,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 07:49:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:10,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:49:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:10,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:10,246 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-23 07:49:10,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:49:10,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061893799] [2023-11-23 07:49:10,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061893799] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:49:10,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:49:10,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 07:49:10,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662900126] [2023-11-23 07:49:10,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:49:10,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:49:10,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:49:10,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:49:10,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 07:49:10,249 INFO L87 Difference]: Start difference. First operand 113 states and 142 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 07:49:10,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:49:10,959 INFO L93 Difference]: Finished difference Result 170 states and 212 transitions. [2023-11-23 07:49:10,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:49:10,959 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 66 [2023-11-23 07:49:10,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:49:10,961 INFO L225 Difference]: With dead ends: 170 [2023-11-23 07:49:10,961 INFO L226 Difference]: Without dead ends: 130 [2023-11-23 07:49:10,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:49:10,962 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 47 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 07:49:10,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 288 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 07:49:10,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-23 07:49:10,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 117. [2023-11-23 07:49:10,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 67 states have internal predecessors, (78), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (34), 34 states have call predecessors, (34), 33 states have call successors, (34) [2023-11-23 07:49:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 146 transitions. [2023-11-23 07:49:11,001 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 146 transitions. Word has length 66 [2023-11-23 07:49:11,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:49:11,002 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 146 transitions. [2023-11-23 07:49:11,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 07:49:11,003 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 146 transitions. [2023-11-23 07:49:11,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 07:49:11,007 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:49:11,007 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:49:11,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 07:49:11,007 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:49:11,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:49:11,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1717532120, now seen corresponding path program 1 times [2023-11-23 07:49:11,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:49:11,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701712149] [2023-11-23 07:49:11,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:49:11,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:49:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:11,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:11,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:49:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:11,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:49:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:11,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:11,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 07:49:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:11,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 07:49:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:11,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:49:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:11,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:49:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:11,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:11,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 07:49:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:11,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:49:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:11,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:11,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:49:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-23 07:49:11,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:49:11,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701712149] [2023-11-23 07:49:11,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701712149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:49:11,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:49:11,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 07:49:11,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413713603] [2023-11-23 07:49:11,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:49:11,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 07:49:11,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:49:11,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 07:49:11,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:49:11,645 INFO L87 Difference]: Start difference. First operand 117 states and 146 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-23 07:49:12,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:49:12,298 INFO L93 Difference]: Finished difference Result 186 states and 236 transitions. [2023-11-23 07:49:12,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:49:12,298 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 70 [2023-11-23 07:49:12,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:49:12,300 INFO L225 Difference]: With dead ends: 186 [2023-11-23 07:49:12,300 INFO L226 Difference]: Without dead ends: 150 [2023-11-23 07:49:12,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:49:12,301 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 111 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 07:49:12,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 290 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 07:49:12,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-23 07:49:12,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2023-11-23 07:49:12,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 69 states have (on average 1.173913043478261) internal successors, (81), 70 states have internal predecessors, (81), 34 states have call successors, (34), 15 states have call predecessors, (34), 17 states have return successors, (35), 35 states have call predecessors, (35), 33 states have call successors, (35) [2023-11-23 07:49:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 150 transitions. [2023-11-23 07:49:12,315 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 150 transitions. Word has length 70 [2023-11-23 07:49:12,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:49:12,315 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 150 transitions. [2023-11-23 07:49:12,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-23 07:49:12,316 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 150 transitions. [2023-11-23 07:49:12,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-23 07:49:12,316 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:49:12,317 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:49:12,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 07:49:12,317 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:49:12,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:49:12,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1881966827, now seen corresponding path program 1 times [2023-11-23 07:49:12,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:49:12,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678206773] [2023-11-23 07:49:12,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:49:12,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:49:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:12,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:12,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:49:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:12,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:49:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:12,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:12,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 07:49:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:12,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 07:49:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:12,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:49:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:13,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:49:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:13,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:13,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 07:49:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:13,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:49:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:13,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:13,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:49:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:13,215 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-23 07:49:13,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:49:13,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678206773] [2023-11-23 07:49:13,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678206773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:49:13,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:49:13,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-23 07:49:13,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294132230] [2023-11-23 07:49:13,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:49:13,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 07:49:13,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:49:13,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 07:49:13,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-23 07:49:13,220 INFO L87 Difference]: Start difference. First operand 121 states and 150 transitions. Second operand has 12 states, 10 states have (on average 2.9) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-23 07:49:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:49:14,444 INFO L93 Difference]: Finished difference Result 154 states and 195 transitions. [2023-11-23 07:49:14,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 07:49:14,444 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 71 [2023-11-23 07:49:14,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:49:14,446 INFO L225 Difference]: With dead ends: 154 [2023-11-23 07:49:14,446 INFO L226 Difference]: Without dead ends: 139 [2023-11-23 07:49:14,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:49:14,446 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 130 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-23 07:49:14,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 478 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-23 07:49:14,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-23 07:49:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 110. [2023-11-23 07:49:14,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 62 states have internal predecessors, (70), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-23 07:49:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 135 transitions. [2023-11-23 07:49:14,459 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 135 transitions. Word has length 71 [2023-11-23 07:49:14,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:49:14,460 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 135 transitions. [2023-11-23 07:49:14,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-23 07:49:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2023-11-23 07:49:14,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-23 07:49:14,461 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:49:14,461 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:49:14,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 07:49:14,461 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:49:14,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:49:14,462 INFO L85 PathProgramCache]: Analyzing trace with hash 287573686, now seen corresponding path program 1 times [2023-11-23 07:49:14,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:49:14,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198698379] [2023-11-23 07:49:14,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:49:14,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:49:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:14,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:14,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:49:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:14,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:49:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:14,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:14,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 07:49:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:14,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 07:49:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:14,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:49:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:14,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:49:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:14,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:49:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:14,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:49:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:14,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:14,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:49:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:15,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:15,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:15,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:49:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:15,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:49:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:15,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:49:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:15,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:15,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-23 07:49:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:15,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-23 07:49:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:15,145 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-11-23 07:49:15,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:49:15,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198698379] [2023-11-23 07:49:15,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198698379] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:49:15,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:49:15,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 07:49:15,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373658904] [2023-11-23 07:49:15,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:49:15,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:49:15,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:49:15,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:49:15,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:49:15,148 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-23 07:49:16,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:49:16,460 INFO L93 Difference]: Finished difference Result 173 states and 212 transitions. [2023-11-23 07:49:16,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 07:49:16,470 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 109 [2023-11-23 07:49:16,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:49:16,471 INFO L225 Difference]: With dead ends: 173 [2023-11-23 07:49:16,471 INFO L226 Difference]: Without dead ends: 123 [2023-11-23 07:49:16,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:49:16,472 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 109 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 07:49:16,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 287 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 07:49:16,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-23 07:49:16,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 114. [2023-11-23 07:49:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 64 states have (on average 1.140625) internal successors, (73), 65 states have internal predecessors, (73), 33 states have call successors, (33), 15 states have call predecessors, (33), 16 states have return successors, (33), 33 states have call predecessors, (33), 32 states have call successors, (33) [2023-11-23 07:49:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 139 transitions. [2023-11-23 07:49:16,503 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 139 transitions. Word has length 109 [2023-11-23 07:49:16,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:49:16,504 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 139 transitions. [2023-11-23 07:49:16,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-23 07:49:16,504 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2023-11-23 07:49:16,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 07:49:16,509 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:49:16,509 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:49:16,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 07:49:16,509 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:49:16,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:49:16,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1962340437, now seen corresponding path program 1 times [2023-11-23 07:49:16,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:49:16,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176836288] [2023-11-23 07:49:16,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:49:16,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:49:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:16,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:16,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:49:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:16,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:49:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:16,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:17,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 07:49:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:17,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 07:49:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:17,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:49:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:17,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:49:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:17,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:49:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:17,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:49:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:17,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:17,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:49:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:17,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:17,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:17,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:49:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:17,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:49:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:17,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:49:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:17,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:17,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:49:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:17,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-23 07:49:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:17,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 07:49:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-11-23 07:49:17,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:49:17,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176836288] [2023-11-23 07:49:17,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176836288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:49:17,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:49:17,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 07:49:17,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569938654] [2023-11-23 07:49:17,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:49:17,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 07:49:17,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:49:17,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 07:49:17,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-23 07:49:17,299 INFO L87 Difference]: Start difference. First operand 114 states and 139 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-23 07:49:18,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:49:18,256 INFO L93 Difference]: Finished difference Result 185 states and 230 transitions. [2023-11-23 07:49:18,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 07:49:18,257 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) Word has length 113 [2023-11-23 07:49:18,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:49:18,258 INFO L225 Difference]: With dead ends: 185 [2023-11-23 07:49:18,259 INFO L226 Difference]: Without dead ends: 125 [2023-11-23 07:49:18,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2023-11-23 07:49:18,260 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 198 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 07:49:18,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 348 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 07:49:18,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-23 07:49:18,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2023-11-23 07:49:18,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 61 states have internal predecessors, (67), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-23 07:49:18,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 130 transitions. [2023-11-23 07:49:18,280 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 130 transitions. Word has length 113 [2023-11-23 07:49:18,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:49:18,280 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 130 transitions. [2023-11-23 07:49:18,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-23 07:49:18,281 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 130 transitions. [2023-11-23 07:49:18,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-23 07:49:18,281 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:49:18,282 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:49:18,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 07:49:18,282 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:49:18,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:49:18,282 INFO L85 PathProgramCache]: Analyzing trace with hash -273160794, now seen corresponding path program 1 times [2023-11-23 07:49:18,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:49:18,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763148175] [2023-11-23 07:49:18,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:49:18,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:49:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:18,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:18,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:49:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:18,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:49:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:18,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:18,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 07:49:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:18,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 07:49:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:18,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:49:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:18,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:49:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:18,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:49:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:18,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:49:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:18,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:18,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:49:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:19,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:19,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:19,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:49:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:19,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:49:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:19,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:49:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:19,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:19,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:49:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:19,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:19,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 07:49:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:19,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 07:49:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:19,310 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2023-11-23 07:49:19,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:49:19,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763148175] [2023-11-23 07:49:19,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763148175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:49:19,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:49:19,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-23 07:49:19,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799133730] [2023-11-23 07:49:19,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:49:19,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-23 07:49:19,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:49:19,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-23 07:49:19,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2023-11-23 07:49:19,312 INFO L87 Difference]: Start difference. First operand 108 states and 130 transitions. Second operand has 19 states, 16 states have (on average 2.9375) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (23), 6 states have call predecessors, (23), 5 states have return successors, (21), 6 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-23 07:49:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:49:21,478 INFO L93 Difference]: Finished difference Result 154 states and 187 transitions. [2023-11-23 07:49:21,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-23 07:49:21,479 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.9375) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (23), 6 states have call predecessors, (23), 5 states have return successors, (21), 6 states have call predecessors, (21), 2 states have call successors, (21) Word has length 119 [2023-11-23 07:49:21,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:49:21,480 INFO L225 Difference]: With dead ends: 154 [2023-11-23 07:49:21,480 INFO L226 Difference]: Without dead ends: 115 [2023-11-23 07:49:21,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=130, Invalid=926, Unknown=0, NotChecked=0, Total=1056 [2023-11-23 07:49:21,481 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 138 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-23 07:49:21,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 663 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-23 07:49:21,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-23 07:49:21,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2023-11-23 07:49:21,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 63 states have (on average 1.126984126984127) internal successors, (71), 65 states have internal predecessors, (71), 32 states have call successors, (32), 15 states have call predecessors, (32), 16 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2023-11-23 07:49:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2023-11-23 07:49:21,491 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 119 [2023-11-23 07:49:21,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:49:21,492 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2023-11-23 07:49:21,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.9375) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (23), 6 states have call predecessors, (23), 5 states have return successors, (21), 6 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-23 07:49:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2023-11-23 07:49:21,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-23 07:49:21,493 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:49:21,493 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:49:21,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 07:49:21,494 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:49:21,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:49:21,494 INFO L85 PathProgramCache]: Analyzing trace with hash -2048168156, now seen corresponding path program 1 times [2023-11-23 07:49:21,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:49:21,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640908700] [2023-11-23 07:49:21,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:49:21,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:49:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:24,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:24,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:49:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:24,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:49:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:24,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:24,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 07:49:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:24,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 07:49:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:24,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:49:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:24,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:49:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:24,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:49:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:24,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:49:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:24,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:24,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:49:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:24,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:24,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:24,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:49:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:24,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:49:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:24,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:49:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:24,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:24,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:49:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:24,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:24,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 07:49:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:24,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 07:49:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:25,130 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2023-11-23 07:49:25,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:49:25,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640908700] [2023-11-23 07:49:25,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640908700] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:49:25,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:49:25,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2023-11-23 07:49:25,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297834954] [2023-11-23 07:49:25,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:49:25,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-23 07:49:25,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:49:25,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-23 07:49:25,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=593, Unknown=0, NotChecked=0, Total=650 [2023-11-23 07:49:25,132 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand has 26 states, 19 states have (on average 2.473684210526316) internal successors, (47), 16 states have internal predecessors, (47), 4 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (21), 6 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-23 07:49:28,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:49:28,364 INFO L93 Difference]: Finished difference Result 174 states and 211 transitions. [2023-11-23 07:49:28,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-23 07:49:28,365 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 19 states have (on average 2.473684210526316) internal successors, (47), 16 states have internal predecessors, (47), 4 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (21), 6 states have call predecessors, (21), 3 states have call successors, (21) Word has length 119 [2023-11-23 07:49:28,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:49:28,366 INFO L225 Difference]: With dead ends: 174 [2023-11-23 07:49:28,366 INFO L226 Difference]: Without dead ends: 127 [2023-11-23 07:49:28,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=180, Invalid=1800, Unknown=0, NotChecked=0, Total=1980 [2023-11-23 07:49:28,367 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 144 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 1757 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-23 07:49:28,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 770 Invalid, 1883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1757 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-23 07:49:28,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-23 07:49:28,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2023-11-23 07:49:28,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 72 states have internal predecessors, (78), 34 states have call successors, (34), 16 states have call predecessors, (34), 18 states have return successors, (35), 33 states have call predecessors, (35), 33 states have call successors, (35) [2023-11-23 07:49:28,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2023-11-23 07:49:28,383 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 147 transitions. Word has length 119 [2023-11-23 07:49:28,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:49:28,385 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 147 transitions. [2023-11-23 07:49:28,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 19 states have (on average 2.473684210526316) internal successors, (47), 16 states have internal predecessors, (47), 4 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (21), 6 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-23 07:49:28,385 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 147 transitions. [2023-11-23 07:49:28,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-23 07:49:28,386 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:49:28,386 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:49:28,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 07:49:28,386 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:49:28,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:49:28,386 INFO L85 PathProgramCache]: Analyzing trace with hash 970549159, now seen corresponding path program 1 times [2023-11-23 07:49:28,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:49:28,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635655229] [2023-11-23 07:49:28,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:49:28,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:49:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:28,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:28,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:49:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:28,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:49:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:28,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:28,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 07:49:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:28,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 07:49:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:28,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:49:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:28,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:49:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:28,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:49:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:28,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:49:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:28,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:28,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:49:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:28,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:28,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:28,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:49:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:28,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:49:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:28,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:49:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:28,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:28,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:49:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:28,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:28,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 07:49:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:28,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-23 07:49:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:28,996 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-11-23 07:49:28,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:49:28,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635655229] [2023-11-23 07:49:28,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635655229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:49:28,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:49:28,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 07:49:28,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27036291] [2023-11-23 07:49:28,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:49:28,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 07:49:28,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:49:28,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 07:49:28,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:49:28,999 INFO L87 Difference]: Start difference. First operand 122 states and 147 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-23 07:49:29,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:49:29,633 INFO L93 Difference]: Finished difference Result 169 states and 204 transitions. [2023-11-23 07:49:29,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:49:29,633 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 120 [2023-11-23 07:49:29,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:49:29,634 INFO L225 Difference]: With dead ends: 169 [2023-11-23 07:49:29,634 INFO L226 Difference]: Without dead ends: 123 [2023-11-23 07:49:29,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-23 07:49:29,635 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 117 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 07:49:29,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 163 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 07:49:29,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-23 07:49:29,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-11-23 07:49:29,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 73 states have internal predecessors, (79), 34 states have call successors, (34), 16 states have call predecessors, (34), 18 states have return successors, (35), 33 states have call predecessors, (35), 33 states have call successors, (35) [2023-11-23 07:49:29,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 148 transitions. [2023-11-23 07:49:29,647 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 148 transitions. Word has length 120 [2023-11-23 07:49:29,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:49:29,648 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 148 transitions. [2023-11-23 07:49:29,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-23 07:49:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 148 transitions. [2023-11-23 07:49:29,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-23 07:49:29,649 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:49:29,649 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:49:29,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 07:49:29,649 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:49:29,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:49:29,649 INFO L85 PathProgramCache]: Analyzing trace with hash 775676998, now seen corresponding path program 1 times [2023-11-23 07:49:29,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:49:29,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135515511] [2023-11-23 07:49:29,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:49:29,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:49:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:34,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:34,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:49:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:34,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:49:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:34,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:35,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 07:49:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:35,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 07:49:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:35,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:49:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:35,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:49:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:35,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:49:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:35,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:49:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:35,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:35,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:49:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:35,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:35,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:35,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:49:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:35,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:49:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:35,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:49:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:35,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:35,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:49:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:35,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:49:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:36,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 07:49:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:36,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-23 07:49:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:36,984 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-11-23 07:49:36,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:49:36,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135515511] [2023-11-23 07:49:36,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135515511] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:49:36,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829646922] [2023-11-23 07:49:36,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:49:36,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:49:36,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:49:36,986 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) [2023-11-23 07:49:36,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 07:49:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:49:37,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 3037 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-23 07:49:37,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:49:38,325 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-11-23 07:49:38,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:49:38,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-23 07:49:38,739 INFO L349 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-11-23 07:49:38,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2023-11-23 07:49:39,452 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-11-23 07:49:39,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:49:40,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829646922] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:49:40,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:49:40,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 31] total 64 [2023-11-23 07:49:40,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531689467] [2023-11-23 07:49:40,837 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 07:49:40,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-11-23 07:49:40,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:49:40,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-11-23 07:49:40,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=5064, Unknown=0, NotChecked=0, Total=5256 [2023-11-23 07:49:40,840 INFO L87 Difference]: Start difference. First operand 123 states and 148 transitions. Second operand has 64 states, 44 states have (on average 2.090909090909091) internal successors, (92), 46 states have internal predecessors, (92), 17 states have call successors, (41), 9 states have call predecessors, (41), 14 states have return successors, (38), 18 states have call predecessors, (38), 16 states have call successors, (38) [2023-11-23 07:49:56,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:49:56,914 INFO L93 Difference]: Finished difference Result 255 states and 312 transitions. [2023-11-23 07:49:56,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2023-11-23 07:49:56,914 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 44 states have (on average 2.090909090909091) internal successors, (92), 46 states have internal predecessors, (92), 17 states have call successors, (41), 9 states have call predecessors, (41), 14 states have return successors, (38), 18 states have call predecessors, (38), 16 states have call successors, (38) Word has length 121 [2023-11-23 07:49:56,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:49:56,916 INFO L225 Difference]: With dead ends: 255 [2023-11-23 07:49:56,916 INFO L226 Difference]: Without dead ends: 208 [2023-11-23 07:49:56,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3367 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=938, Invalid=17422, Unknown=0, NotChecked=0, Total=18360 [2023-11-23 07:49:56,921 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 338 mSDsluCounter, 2065 mSDsCounter, 0 mSdLazyCounter, 7352 mSolverCounterSat, 316 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 2124 SdHoareTripleChecker+Invalid, 7670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 7352 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:49:56,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 2124 Invalid, 7670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 7352 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2023-11-23 07:49:56,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-11-23 07:49:56,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 174. [2023-11-23 07:49:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 103 states have (on average 1.145631067961165) internal successors, (118), 108 states have internal predecessors, (118), 44 states have call successors, (44), 21 states have call predecessors, (44), 26 states have return successors, (47), 44 states have call predecessors, (47), 42 states have call successors, (47) [2023-11-23 07:49:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 209 transitions. [2023-11-23 07:49:56,943 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 209 transitions. Word has length 121 [2023-11-23 07:49:56,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:49:56,943 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 209 transitions. [2023-11-23 07:49:56,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 44 states have (on average 2.090909090909091) internal successors, (92), 46 states have internal predecessors, (92), 17 states have call successors, (41), 9 states have call predecessors, (41), 14 states have return successors, (38), 18 states have call predecessors, (38), 16 states have call successors, (38) [2023-11-23 07:49:56,943 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 209 transitions. [2023-11-23 07:49:56,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-23 07:49:56,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:49:56,944 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:49:56,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-23 07:49:57,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 07:49:57,148 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:49:57,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:49:57,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1634875383, now seen corresponding path program 2 times [2023-11-23 07:49:57,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:49:57,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280953411] [2023-11-23 07:49:57,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:49:57,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:49:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:02,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:50:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:02,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:50:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:02,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:50:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:02,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:50:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:02,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 07:50:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:02,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 07:50:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:02,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:50:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:02,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:50:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:02,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:50:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:02,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:50:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:02,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:50:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:02,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:50:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:02,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:50:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:02,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:50:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:02,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:50:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:02,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:50:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:02,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:50:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:02,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:50:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:02,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:50:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:02,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:50:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:02,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 07:50:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:03,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 07:50:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:03,626 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2023-11-23 07:50:03,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:50:03,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280953411] [2023-11-23 07:50:03,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280953411] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:50:03,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448924395] [2023-11-23 07:50:03,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 07:50:03,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:50:03,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:50:03,627 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) [2023-11-23 07:50:03,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 07:50:04,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 07:50:04,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 07:50:04,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 3165 conjuncts, 82 conjunts are in the unsatisfiable core [2023-11-23 07:50:04,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:50:04,285 INFO L378 Elim1Store]: Elim1 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 [2023-11-23 07:50:04,414 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#6_#t~loopctr1331_10| Int)) (and (= |c_#memory_int#6| (store |c_old(#memory_int#6)| |c_#Ultimate.C_memcpy#6_dest.base| (let ((.cse0 (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_10| |c_#Ultimate.C_memcpy#6_dest.offset|))) (store (select |c_old(#memory_int#6)| |c_#Ultimate.C_memcpy#6_dest.base|) .cse0 (select (select |c_#memory_int#6| |c_#Ultimate.C_memcpy#6_dest.base|) .cse0))))) (<= (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_10| 1) |c_#Ultimate.C_memcpy#6_#t~loopctr1331|) (<= 0 |v_#Ultimate.C_memcpy#6_#t~loopctr1331_10|))) is different from true [2023-11-23 07:50:04,426 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#6_#t~loopctr1331_10| Int) (|v_#Ultimate.C_memcpy#6_#t~loopctr1331_11| Int)) (and (= |c_#memory_int#6| (store |c_old(#memory_int#6)| |c_#Ultimate.C_memcpy#6_dest.base| (let ((.cse1 (select |c_#memory_int#6| |c_#Ultimate.C_memcpy#6_dest.base|)) (.cse2 (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_11| |c_#Ultimate.C_memcpy#6_dest.offset|))) (store (let ((.cse0 (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_10| |c_#Ultimate.C_memcpy#6_dest.offset|))) (store (select |c_old(#memory_int#6)| |c_#Ultimate.C_memcpy#6_dest.base|) .cse0 (select .cse1 .cse0))) .cse2 (select .cse1 .cse2))))) (<= (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_10| 1) |v_#Ultimate.C_memcpy#6_#t~loopctr1331_11|) (<= 0 |v_#Ultimate.C_memcpy#6_#t~loopctr1331_10|))) is different from true [2023-11-23 07:50:04,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:50:04,767 INFO L349 Elim1Store]: treesize reduction 174, result has 25.6 percent of original size [2023-11-23 07:50:04,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 117 [2023-11-23 07:50:04,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 45 [2023-11-23 07:50:04,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:50:04,821 INFO L349 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2023-11-23 07:50:04,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 33 [2023-11-23 07:50:04,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:50:04,851 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-23 07:50:04,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 27 [2023-11-23 07:50:04,909 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-23 07:50:04,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2023-11-23 07:50:05,442 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 3 not checked. [2023-11-23 07:50:05,443 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:50:07,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448924395] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:50:07,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:50:07,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 28] total 49 [2023-11-23 07:50:07,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894471576] [2023-11-23 07:50:07,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 07:50:07,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-23 07:50:07,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:50:07,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-23 07:50:07,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2922, Unknown=3, NotChecked=218, Total=3306 [2023-11-23 07:50:07,183 INFO L87 Difference]: Start difference. First operand 174 states and 209 transitions. Second operand has 49 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 36 states have internal predecessors, (74), 8 states have call successors, (31), 8 states have call predecessors, (31), 9 states have return successors, (26), 9 states have call predecessors, (26), 7 states have call successors, (26) [2023-11-23 07:50:15,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:50:17,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:50:21,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:50:25,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:50:25,494 INFO L93 Difference]: Finished difference Result 307 states and 377 transitions. [2023-11-23 07:50:25,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-23 07:50:25,495 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 36 states have internal predecessors, (74), 8 states have call successors, (31), 8 states have call predecessors, (31), 9 states have return successors, (26), 9 states have call predecessors, (26), 7 states have call successors, (26) Word has length 122 [2023-11-23 07:50:25,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:50:25,496 INFO L225 Difference]: With dead ends: 307 [2023-11-23 07:50:25,496 INFO L226 Difference]: Without dead ends: 260 [2023-11-23 07:50:25,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2215 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=648, Invalid=10069, Unknown=3, NotChecked=410, Total=11130 [2023-11-23 07:50:25,499 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 251 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 4385 mSolverCounterSat, 205 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 5071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 4385 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 476 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2023-11-23 07:50:25,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 1076 Invalid, 5071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 4385 Invalid, 5 Unknown, 476 Unchecked, 13.6s Time] [2023-11-23 07:50:25,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-23 07:50:25,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 166. [2023-11-23 07:50:25,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 99 states have (on average 1.1616161616161615) internal successors, (115), 103 states have internal predecessors, (115), 42 states have call successors, (42), 20 states have call predecessors, (42), 24 states have return successors, (44), 42 states have call predecessors, (44), 40 states have call successors, (44) [2023-11-23 07:50:25,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 201 transitions. [2023-11-23 07:50:25,527 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 201 transitions. Word has length 122 [2023-11-23 07:50:25,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:50:25,527 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 201 transitions. [2023-11-23 07:50:25,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 36 states have internal predecessors, (74), 8 states have call successors, (31), 8 states have call predecessors, (31), 9 states have return successors, (26), 9 states have call predecessors, (26), 7 states have call successors, (26) [2023-11-23 07:50:25,527 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 201 transitions. [2023-11-23 07:50:25,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-23 07:50:25,529 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:50:25,529 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:50:25,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 07:50:25,731 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,SelfDestructingSolverStorable10 [2023-11-23 07:50:25,731 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:50:25,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:50:25,732 INFO L85 PathProgramCache]: Analyzing trace with hash 947412134, now seen corresponding path program 3 times [2023-11-23 07:50:25,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:50:25,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861160030] [2023-11-23 07:50:25,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:50:25,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:50:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:33,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:50:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:33,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:50:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:33,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:50:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:33,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:50:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:33,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 07:50:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:33,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 07:50:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:33,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:50:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:33,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:50:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:33,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:50:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:33,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:50:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:33,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:50:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:34,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:50:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:34,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:50:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:34,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:50:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:34,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:50:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:34,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:50:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:34,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:50:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:34,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:50:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:34,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:50:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:34,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:50:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:34,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 07:50:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:35,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-23 07:50:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:50:36,183 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-11-23 07:50:36,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:50:36,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861160030] [2023-11-23 07:50:36,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861160030] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:50:36,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471904635] [2023-11-23 07:50:36,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 07:50:36,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:50:36,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:50:36,185 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) [2023-11-23 07:50:36,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 07:50:38,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-23 07:50:38,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 07:50:38,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 2843 conjuncts, 93 conjunts are in the unsatisfiable core [2023-11-23 07:50:38,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:50:38,826 INFO L378 Elim1Store]: Elim1 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 [2023-11-23 07:50:39,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2023-11-23 07:50:39,420 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-23 07:50:39,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 32 [2023-11-23 07:50:40,077 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2023-11-23 07:50:40,077 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:50:41,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471904635] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:50:41,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:50:41,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 30] total 73 [2023-11-23 07:50:41,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240851062] [2023-11-23 07:50:41,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 07:50:41,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-11-23 07:50:41,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:50:41,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-11-23 07:50:41,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=6414, Unknown=0, NotChecked=0, Total=6642 [2023-11-23 07:50:41,537 INFO L87 Difference]: Start difference. First operand 166 states and 201 transitions. Second operand has 73 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 53 states have internal predecessors, (97), 15 states have call successors, (42), 9 states have call predecessors, (42), 16 states have return successors, (40), 20 states have call predecessors, (40), 14 states have call successors, (40) [2023-11-23 07:51:02,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:51:02,717 INFO L93 Difference]: Finished difference Result 313 states and 381 transitions. [2023-11-23 07:51:02,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-11-23 07:51:02,717 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 53 states have internal predecessors, (97), 15 states have call successors, (42), 9 states have call predecessors, (42), 16 states have return successors, (40), 20 states have call predecessors, (40), 14 states have call successors, (40) Word has length 123 [2023-11-23 07:51:02,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:51:02,726 INFO L225 Difference]: With dead ends: 313 [2023-11-23 07:51:02,726 INFO L226 Difference]: Without dead ends: 311 [2023-11-23 07:51:02,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3783 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=905, Invalid=19401, Unknown=0, NotChecked=0, Total=20306 [2023-11-23 07:51:02,729 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 309 mSDsluCounter, 2233 mSDsCounter, 0 mSdLazyCounter, 8884 mSolverCounterSat, 235 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 2307 SdHoareTripleChecker+Invalid, 9122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 8884 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:51:02,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 2307 Invalid, 9122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 8884 Invalid, 3 Unknown, 0 Unchecked, 14.3s Time] [2023-11-23 07:51:02,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-11-23 07:51:02,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 169. [2023-11-23 07:51:02,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 102 states have (on average 1.1764705882352942) internal successors, (120), 106 states have internal predecessors, (120), 42 states have call successors, (42), 20 states have call predecessors, (42), 24 states have return successors, (44), 42 states have call predecessors, (44), 40 states have call successors, (44) [2023-11-23 07:51:02,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 206 transitions. [2023-11-23 07:51:02,769 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 206 transitions. Word has length 123 [2023-11-23 07:51:02,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:51:02,770 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 206 transitions. [2023-11-23 07:51:02,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 53 states have internal predecessors, (97), 15 states have call successors, (42), 9 states have call predecessors, (42), 16 states have return successors, (40), 20 states have call predecessors, (40), 14 states have call successors, (40) [2023-11-23 07:51:02,770 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 206 transitions. [2023-11-23 07:51:02,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-23 07:51:02,771 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:51:02,771 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:51:02,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-23 07:51:02,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:51:02,988 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:51:02,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:51:02,989 INFO L85 PathProgramCache]: Analyzing trace with hash 58429223, now seen corresponding path program 4 times [2023-11-23 07:51:02,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:51:02,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755962773] [2023-11-23 07:51:02,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:51:02,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:51:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:03,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:51:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:03,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:51:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:03,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:51:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:03,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:51:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:03,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 07:51:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:03,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 07:51:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:03,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:51:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:03,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:51:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:03,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:51:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:03,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:51:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:03,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:51:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:03,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:51:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:03,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:51:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:03,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:51:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:03,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:51:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:03,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:51:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:03,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:51:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:03,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:51:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:03,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:51:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:03,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:51:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:03,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 07:51:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:03,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 07:51:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:03,939 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-11-23 07:51:03,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:51:03,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755962773] [2023-11-23 07:51:03,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755962773] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:51:03,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131548754] [2023-11-23 07:51:03,940 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-23 07:51:03,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:51:03,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:51:03,941 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) [2023-11-23 07:51:03,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 07:51:04,695 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-23 07:51:04,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 07:51:04,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 3316 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-23 07:51:04,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:51:04,755 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-11-23 07:51:04,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:51:04,929 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-11-23 07:51:04,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131548754] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:51:04,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:51:04,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 21 [2023-11-23 07:51:04,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130172623] [2023-11-23 07:51:04,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:51:04,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-23 07:51:04,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:51:04,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-23 07:51:04,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2023-11-23 07:51:04,935 INFO L87 Difference]: Start difference. First operand 169 states and 206 transitions. Second operand has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 17 states have internal predecessors, (73), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-23 07:51:07,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:51:07,848 INFO L93 Difference]: Finished difference Result 238 states and 293 transitions. [2023-11-23 07:51:07,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-23 07:51:07,849 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 17 states have internal predecessors, (73), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 124 [2023-11-23 07:51:07,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:51:07,850 INFO L225 Difference]: With dead ends: 238 [2023-11-23 07:51:07,850 INFO L226 Difference]: Without dead ends: 191 [2023-11-23 07:51:07,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=452, Invalid=1618, Unknown=0, NotChecked=0, Total=2070 [2023-11-23 07:51:07,851 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 240 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:51:07,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 570 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-23 07:51:07,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-11-23 07:51:07,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 173. [2023-11-23 07:51:07,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 106 states have (on average 1.1981132075471699) internal successors, (127), 110 states have internal predecessors, (127), 42 states have call successors, (42), 20 states have call predecessors, (42), 24 states have return successors, (44), 42 states have call predecessors, (44), 40 states have call successors, (44) [2023-11-23 07:51:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 213 transitions. [2023-11-23 07:51:07,882 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 213 transitions. Word has length 124 [2023-11-23 07:51:07,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:51:07,882 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 213 transitions. [2023-11-23 07:51:07,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 17 states have internal predecessors, (73), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-23 07:51:07,882 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 213 transitions. [2023-11-23 07:51:07,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-23 07:51:07,883 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:51:07,883 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:51:07,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 07:51:08,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:51:08,096 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:51:08,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:51:08,097 INFO L85 PathProgramCache]: Analyzing trace with hash -606053463, now seen corresponding path program 5 times [2023-11-23 07:51:08,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:51:08,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442638670] [2023-11-23 07:51:08,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:51:08,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:51:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:17,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:51:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:17,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:51:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:17,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:51:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:17,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:51:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:17,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 07:51:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:17,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 07:51:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:17,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:51:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:17,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:51:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:17,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:51:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:17,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:51:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:18,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:51:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:18,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:51:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:18,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:51:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:18,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:51:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:18,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:51:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:18,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:51:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:18,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:51:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:18,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:51:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:18,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:51:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:18,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:51:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:19,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 07:51:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:20,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 07:51:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:51:21,269 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-11-23 07:51:21,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:51:21,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442638670] [2023-11-23 07:51:21,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442638670] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:51:21,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531580957] [2023-11-23 07:51:21,269 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-23 07:51:21,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:51:21,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:51:21,271 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) [2023-11-23 07:51:21,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 07:51:27,608 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-11-23 07:51:27,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 07:51:27,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 3421 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-23 07:51:27,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:51:28,140 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-11-23 07:51:29,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:51:29,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:51:29,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:51:29,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:51:29,146 INFO L349 Elim1Store]: treesize reduction 126, result has 34.4 percent of original size [2023-11-23 07:51:29,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 122 treesize of output 168 [2023-11-23 07:51:29,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 69 [2023-11-23 07:51:29,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:51:29,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:51:29,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:51:29,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:51:29,194 INFO L349 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2023-11-23 07:51:29,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 69 treesize of output 47 [2023-11-23 07:51:29,281 INFO L349 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-11-23 07:51:29,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2023-11-23 07:51:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 3 proven. 101 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-23 07:51:30,098 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:51:33,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531580957] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:51:33,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:51:33,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 29] total 74 [2023-11-23 07:51:33,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818098662] [2023-11-23 07:51:33,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 07:51:33,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-11-23 07:51:33,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:51:33,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-11-23 07:51:33,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=6590, Unknown=0, NotChecked=0, Total=6806 [2023-11-23 07:51:33,276 INFO L87 Difference]: Start difference. First operand 173 states and 213 transitions. Second operand has 74 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 55 states have internal predecessors, (107), 19 states have call successors, (45), 11 states have call predecessors, (45), 15 states have return successors, (42), 21 states have call predecessors, (42), 18 states have call successors, (42) [2023-11-23 07:52:06,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:52:08,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:52:08,677 INFO L93 Difference]: Finished difference Result 324 states and 396 transitions. [2023-11-23 07:52:08,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2023-11-23 07:52:08,678 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 55 states have internal predecessors, (107), 19 states have call successors, (45), 11 states have call predecessors, (45), 15 states have return successors, (42), 21 states have call predecessors, (42), 18 states have call successors, (42) Word has length 124 [2023-11-23 07:52:08,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:52:08,680 INFO L225 Difference]: With dead ends: 324 [2023-11-23 07:52:08,680 INFO L226 Difference]: Without dead ends: 322 [2023-11-23 07:52:08,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4970 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=1215, Invalid=24545, Unknown=0, NotChecked=0, Total=25760 [2023-11-23 07:52:08,681 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 390 mSDsluCounter, 2276 mSDsCounter, 0 mSdLazyCounter, 11248 mSolverCounterSat, 307 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 2348 SdHoareTripleChecker+Invalid, 11560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 11248 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.6s IncrementalHoareTripleChecker+Time [2023-11-23 07:52:08,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 2348 Invalid, 11560 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [307 Valid, 11248 Invalid, 5 Unknown, 0 Unchecked, 24.6s Time] [2023-11-23 07:52:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-11-23 07:52:08,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 173. [2023-11-23 07:52:08,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 106 states have (on average 1.1981132075471699) internal successors, (127), 110 states have internal predecessors, (127), 42 states have call successors, (42), 20 states have call predecessors, (42), 24 states have return successors, (44), 42 states have call predecessors, (44), 40 states have call successors, (44) [2023-11-23 07:52:08,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 213 transitions. [2023-11-23 07:52:08,722 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 213 transitions. Word has length 124 [2023-11-23 07:52:08,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:52:08,723 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 213 transitions. [2023-11-23 07:52:08,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 55 states have internal predecessors, (107), 19 states have call successors, (45), 11 states have call predecessors, (45), 15 states have return successors, (42), 21 states have call predecessors, (42), 18 states have call successors, (42) [2023-11-23 07:52:08,723 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 213 transitions. [2023-11-23 07:52:08,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-23 07:52:08,724 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:52:08,724 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:52:08,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-23 07:52:08,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-23 07:52:08,939 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:52:08,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:52:08,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1518846714, now seen corresponding path program 6 times [2023-11-23 07:52:08,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:52:08,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025930536] [2023-11-23 07:52:08,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:52:08,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:52:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:52:20,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:52:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:52:20,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:52:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:52:20,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:52:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:52:20,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:52:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:52:20,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 07:52:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:52:20,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 07:52:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:52:20,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:52:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:52:20,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:52:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:52:20,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:52:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:52:20,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:52:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:52:20,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:52:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:52:21,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:52:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:52:21,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:52:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:52:21,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:52:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:52:21,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:52:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:52:21,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:52:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:52:21,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:52:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:52:21,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:52:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:52:21,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:52:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:52:21,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:52:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:52:21,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 07:52:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:52:24,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-23 07:52:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:52:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 26 proven. 17 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-11-23 07:52:24,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:52:24,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025930536] [2023-11-23 07:52:24,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025930536] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:52:24,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331663067] [2023-11-23 07:52:24,714 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-23 07:52:24,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:52:24,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:52:24,718 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:52:24,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 07:52:56,850 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-11-23 07:52:56,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 07:52:56,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 3523 conjuncts, 102 conjunts are in the unsatisfiable core [2023-11-23 07:52:56,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:52:57,392 INFO L378 Elim1Store]: Elim1 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 [2023-11-23 07:52:57,559 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#6_#t~loopctr1331_54| Int)) (and (<= (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_54| 1) |c_#Ultimate.C_memcpy#6_#t~loopctr1331|) (= |c_#memory_int#6| (store |c_old(#memory_int#6)| |c_#Ultimate.C_memcpy#6_dest.base| (let ((.cse0 (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_54| |c_#Ultimate.C_memcpy#6_dest.offset|))) (store (select |c_old(#memory_int#6)| |c_#Ultimate.C_memcpy#6_dest.base|) .cse0 (select (select |c_#memory_int#6| |c_#Ultimate.C_memcpy#6_dest.base|) .cse0))))) (<= 0 |v_#Ultimate.C_memcpy#6_#t~loopctr1331_54|))) is different from true [2023-11-23 07:52:57,572 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#6_#t~loopctr1331_54| Int) (|v_#Ultimate.C_memcpy#6_#t~loopctr1331_55| Int)) (and (<= (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_55| 1) |c_#Ultimate.C_memcpy#6_#t~loopctr1331|) (= |c_#memory_int#6| (store |c_old(#memory_int#6)| |c_#Ultimate.C_memcpy#6_dest.base| (let ((.cse1 (select |c_#memory_int#6| |c_#Ultimate.C_memcpy#6_dest.base|)) (.cse2 (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_55| |c_#Ultimate.C_memcpy#6_dest.offset|))) (store (let ((.cse0 (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_54| |c_#Ultimate.C_memcpy#6_dest.offset|))) (store (select |c_old(#memory_int#6)| |c_#Ultimate.C_memcpy#6_dest.base|) .cse0 (select .cse1 .cse0))) .cse2 (select .cse1 .cse2))))) (<= (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_54| 1) |v_#Ultimate.C_memcpy#6_#t~loopctr1331_55|) (<= 0 |v_#Ultimate.C_memcpy#6_#t~loopctr1331_54|))) is different from true [2023-11-23 07:52:57,595 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#6_#t~loopctr1331_54| Int) (|v_#Ultimate.C_memcpy#6_#t~loopctr1331_55| Int) (|v_#Ultimate.C_memcpy#6_#t~loopctr1331_56| Int)) (and (= |c_#memory_int#6| (store |c_old(#memory_int#6)| |c_#Ultimate.C_memcpy#6_dest.base| (let ((.cse1 (select |c_#memory_int#6| |c_#Ultimate.C_memcpy#6_dest.base|)) (.cse3 (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_56| |c_#Ultimate.C_memcpy#6_dest.offset|))) (store (let ((.cse2 (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_55| |c_#Ultimate.C_memcpy#6_dest.offset|))) (store (let ((.cse0 (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_54| |c_#Ultimate.C_memcpy#6_dest.offset|))) (store (select |c_old(#memory_int#6)| |c_#Ultimate.C_memcpy#6_dest.base|) .cse0 (select .cse1 .cse0))) .cse2 (select .cse1 .cse2))) .cse3 (select .cse1 .cse3))))) (<= (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_54| 1) |v_#Ultimate.C_memcpy#6_#t~loopctr1331_55|) (<= 0 |v_#Ultimate.C_memcpy#6_#t~loopctr1331_54|) (<= (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_56| 1) |c_#Ultimate.C_memcpy#6_#t~loopctr1331|) (<= (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_55| 1) |v_#Ultimate.C_memcpy#6_#t~loopctr1331_56|))) is different from true [2023-11-23 07:52:57,700 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#6_#t~loopctr1331_54| Int) (|v_#Ultimate.C_memcpy#6_#t~loopctr1331_55| Int) (|v_#Ultimate.C_memcpy#6_#t~loopctr1331_56| Int) (|v_#Ultimate.C_memcpy#6_#t~loopctr1331_57| Int)) (and (<= (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_56| 1) |v_#Ultimate.C_memcpy#6_#t~loopctr1331_57|) (<= (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_57| 1) |c_#Ultimate.C_memcpy#6_#t~loopctr1331|) (= |c_#memory_int#6| (store |c_old(#memory_int#6)| |c_#Ultimate.C_memcpy#6_dest.base| (let ((.cse1 (select |c_#memory_int#6| |c_#Ultimate.C_memcpy#6_dest.base|)) (.cse4 (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_57| |c_#Ultimate.C_memcpy#6_dest.offset|))) (store (let ((.cse3 (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_56| |c_#Ultimate.C_memcpy#6_dest.offset|))) (store (let ((.cse2 (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_55| |c_#Ultimate.C_memcpy#6_dest.offset|))) (store (let ((.cse0 (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_54| |c_#Ultimate.C_memcpy#6_dest.offset|))) (store (select |c_old(#memory_int#6)| |c_#Ultimate.C_memcpy#6_dest.base|) .cse0 (select .cse1 .cse0))) .cse2 (select .cse1 .cse2))) .cse3 (select .cse1 .cse3))) .cse4 (select .cse1 .cse4))))) (<= (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_54| 1) |v_#Ultimate.C_memcpy#6_#t~loopctr1331_55|) (<= 0 |v_#Ultimate.C_memcpy#6_#t~loopctr1331_54|) (<= (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_55| 1) |v_#Ultimate.C_memcpy#6_#t~loopctr1331_56|))) is different from true [2023-11-23 07:52:57,966 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#6_#t~loopctr1331_54| Int) (|v_#Ultimate.C_memcpy#6_#t~loopctr1331_55| Int) (|v_#Ultimate.C_memcpy#6_#t~loopctr1331_56| Int) (|v_#Ultimate.C_memcpy#6_#t~loopctr1331_57| Int) (|v_#Ultimate.C_memcpy#6_#t~loopctr1331_58| Int)) (and (<= (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_57| 1) |v_#Ultimate.C_memcpy#6_#t~loopctr1331_58|) (<= (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_56| 1) |v_#Ultimate.C_memcpy#6_#t~loopctr1331_57|) (<= (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_54| 1) |v_#Ultimate.C_memcpy#6_#t~loopctr1331_55|) (= |c_#memory_int#6| (store |c_old(#memory_int#6)| |c_#Ultimate.C_memcpy#6_dest.base| (let ((.cse1 (select |c_#memory_int#6| |c_#Ultimate.C_memcpy#6_dest.base|)) (.cse5 (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_58| |c_#Ultimate.C_memcpy#6_dest.offset|))) (store (let ((.cse4 (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_57| |c_#Ultimate.C_memcpy#6_dest.offset|))) (store (let ((.cse3 (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_56| |c_#Ultimate.C_memcpy#6_dest.offset|))) (store (let ((.cse2 (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_55| |c_#Ultimate.C_memcpy#6_dest.offset|))) (store (let ((.cse0 (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_54| |c_#Ultimate.C_memcpy#6_dest.offset|))) (store (select |c_old(#memory_int#6)| |c_#Ultimate.C_memcpy#6_dest.base|) .cse0 (select .cse1 .cse0))) .cse2 (select .cse1 .cse2))) .cse3 (select .cse1 .cse3))) .cse4 (select .cse1 .cse4))) .cse5 (select .cse1 .cse5))))) (<= 0 |v_#Ultimate.C_memcpy#6_#t~loopctr1331_54|) (<= (+ |v_#Ultimate.C_memcpy#6_#t~loopctr1331_55| 1) |v_#Ultimate.C_memcpy#6_#t~loopctr1331_56|))) is different from true [2023-11-23 07:52:59,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:52:59,665 INFO L349 Elim1Store]: treesize reduction 963, result has 13.5 percent of original size [2023-11-23 07:52:59,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 185 treesize of output 237 [2023-11-23 07:52:59,864 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-23 07:52:59,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 67 [2023-11-23 07:52:59,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:52:59,875 INFO L349 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2023-11-23 07:52:59,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 67 treesize of output 47 [2023-11-23 07:52:59,965 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-23 07:52:59,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2023-11-23 07:53:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 125 trivial. 15 not checked. [2023-11-23 07:53:00,809 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:53:06,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331663067] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:53:06,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:53:06,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 33] total 80 [2023-11-23 07:53:06,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534297046] [2023-11-23 07:53:06,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 07:53:06,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2023-11-23 07:53:06,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:53:06,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2023-11-23 07:53:06,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=6746, Unknown=6, NotChecked=840, Total=7832 [2023-11-23 07:53:06,413 INFO L87 Difference]: Start difference. First operand 173 states and 213 transitions. Second operand has 80 states, 59 states have (on average 1.7118644067796611) internal successors, (101), 60 states have internal predecessors, (101), 15 states have call successors, (42), 9 states have call predecessors, (42), 16 states have return successors, (40), 20 states have call predecessors, (40), 14 states have call successors, (40) Killed by 15