./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_byte_cursor_from_string_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_byte_cursor_from_string_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 c3b06783378816ab028e38f9f4609990f4d1028238bbcb0e88638ebb644bb54d --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 07:08:37,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 07:08:37,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 07:08:37,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 07:08:37,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 07:08:37,378 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 07:08:37,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 07:08:37,379 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 07:08:37,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 07:08:37,382 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 07:08:37,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 07:08:37,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 07:08:37,384 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 07:08:37,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 07:08:37,385 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 07:08:37,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 07:08:37,385 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 07:08:37,385 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 07:08:37,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 07:08:37,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 07:08:37,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 07:08:37,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 07:08:37,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 07:08:37,388 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 07:08:37,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 07:08:37,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 07:08:37,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 07:08:37,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 07:08:37,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:08:37,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 07:08:37,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 07:08:37,390 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 07:08:37,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 07:08:37,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 07:08:37,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 07:08:37,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 07:08:37,391 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 07:08:37,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 07:08:37,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 07:08:37,392 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 -> c3b06783378816ab028e38f9f4609990f4d1028238bbcb0e88638ebb644bb54d Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 07:08:37,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 07:08:37,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 07:08:37,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 07:08:37,645 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 07:08:37,645 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 07:08:37,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_byte_cursor_from_string_harness.i [2023-11-23 07:08:38,793 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 07:08:39,203 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 07:08:39,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_cursor_from_string_harness.i [2023-11-23 07:08:39,235 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce2fcbb65/574a9581b71a49288ee65eb6fb61995e/FLAGd9d7d6217 [2023-11-23 07:08:39,250 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce2fcbb65/574a9581b71a49288ee65eb6fb61995e [2023-11-23 07:08:39,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 07:08:39,254 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 07:08:39,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 07:08:39,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 07:08:39,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 07:08:39,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:08:39" (1/1) ... [2023-11-23 07:08:39,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bec73dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:39, skipping insertion in model container [2023-11-23 07:08:39,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:08:39" (1/1) ... [2023-11-23 07:08:39,335 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:08:39,553 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_byte_cursor_from_string_harness.i[4501,4514] [2023-11-23 07:08:39,564 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_byte_cursor_from_string_harness.i[4561,4574] [2023-11-23 07:08:40,323 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:08:40,324 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:08:40,324 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:08:40,325 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:08:40,325 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:08:40,333 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:08:40,333 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:08:40,334 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:08:40,335 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:08:40,621 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:08:40,622 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:08:40,623 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:08:40,625 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:08:40,629 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:08:40,630 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:08:40,631 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:08:40,632 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:08:40,633 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:08:40,635 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:08:40,828 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:08:40,837 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:08:40,907 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:08:40,938 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 07:08:40,947 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_byte_cursor_from_string_harness.i[4501,4514] [2023-11-23 07:08:40,954 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_byte_cursor_from_string_harness.i[4561,4574] [2023-11-23 07:08:40,978 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:08:40,978 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:08:40,978 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:08:40,979 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:08:40,979 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:08:41,034 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:08:41,034 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:08:41,035 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:08:41,036 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:08:41,077 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:08:41,078 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:08:41,078 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:08:41,079 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:08:41,081 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:08:41,081 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:08:41,082 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:08:41,082 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:08:41,082 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:08:41,083 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:08:41,164 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8253] [2023-11-23 07:08:41,166 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:08:41,166 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:08:41,176 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8739-8750] [2023-11-23 07:08:41,208 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:08:41,356 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:08:41,357 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:08:41,357 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:08:41,357 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:08:41,357 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:08:41,357 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:08:41,358 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:08:41,358 WARN L675 CHandler]: The function s_global_handler is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:08:41,358 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:08:41,358 WARN L675 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:08:41,358 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:08:41,358 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:08:41,358 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:08:41,359 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:08:41,359 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:08:41,359 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:08:41,359 WARN L675 CHandler]: The function tl_thread_handler is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:08:41,359 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:08:41,360 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:08:41,360 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:08:41,366 INFO L206 MainTranslator]: Completed translation [2023-11-23 07:08:41,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:41 WrapperNode [2023-11-23 07:08:41,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 07:08:41,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 07:08:41,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 07:08:41,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 07:08:41,377 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:08:41" (1/1) ... [2023-11-23 07:08:41,463 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:08:41" (1/1) ... [2023-11-23 07:08:41,527 INFO L138 Inliner]: procedures = 692, calls = 2790, calls flagged for inlining = 59, calls inlined = 7, statements flattened = 832 [2023-11-23 07:08:41,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 07:08:41,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 07:08:41,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 07:08:41,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 07:08:41,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:41" (1/1) ... [2023-11-23 07:08:41,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:41" (1/1) ... [2023-11-23 07:08:41,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:41" (1/1) ... [2023-11-23 07:08:41,624 INFO L188 MemorySlicer]: Split 529 memory accesses to 7 slices as follows [2, 256, 247, 2, 14, 5, 3]. 48 percent of accesses are in the largest equivalence class. The 504 initializations are split as follows [2, 256, 236, 0, 2, 5, 3]. The 7 writes are split as follows [0, 0, 3, 2, 2, 0, 0]. [2023-11-23 07:08:41,635 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:41" (1/1) ... [2023-11-23 07:08:41,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:41" (1/1) ... [2023-11-23 07:08:41,668 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:41" (1/1) ... [2023-11-23 07:08:41,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:41" (1/1) ... [2023-11-23 07:08:41,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:41" (1/1) ... [2023-11-23 07:08:41,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:41" (1/1) ... [2023-11-23 07:08:41,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 07:08:41,724 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 07:08:41,724 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 07:08:41,724 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 07:08:41,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:41" (1/1) ... [2023-11-23 07:08:41,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:08:41,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:08:41,763 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:08:41,787 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:08:41,814 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2023-11-23 07:08:41,815 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2023-11-23 07:08:41,815 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2023-11-23 07:08:41,815 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2023-11-23 07:08:41,816 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2023-11-23 07:08:41,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2023-11-23 07:08:41,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 07:08:41,816 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2023-11-23 07:08:41,816 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2023-11-23 07:08:41,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 07:08:41,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 07:08:41,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-23 07:08:41,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-23 07:08:41,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-23 07:08:41,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-23 07:08:41,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-23 07:08:41,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 07:08:41,817 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 07:08:41,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 07:08:41,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 07:08:41,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 07:08:41,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 07:08:41,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 07:08:41,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-23 07:08:41,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-23 07:08:41,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-23 07:08:41,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-23 07:08:41,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 07:08:41,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 07:08:41,819 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-23 07:08:41,820 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-23 07:08:41,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2023-11-23 07:08:41,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2023-11-23 07:08:41,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2023-11-23 07:08:41,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2023-11-23 07:08:41,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2023-11-23 07:08:41,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2023-11-23 07:08:41,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2023-11-23 07:08:41,821 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_bytes [2023-11-23 07:08:41,821 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_bytes [2023-11-23 07:08:41,821 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 07:08:41,821 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 07:08:41,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 07:08:41,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 07:08:41,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 07:08:41,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 07:08:41,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-23 07:08:41,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-23 07:08:41,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-23 07:08:41,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-11-23 07:08:41,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 07:08:41,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 07:08:41,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 07:08:41,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-23 07:08:41,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-23 07:08:41,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-23 07:08:41,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-11-23 07:08:41,824 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2023-11-23 07:08:41,824 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2023-11-23 07:08:41,824 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 07:08:41,824 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 07:08:41,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 07:08:41,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 07:08:41,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-23 07:08:41,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-23 07:08:41,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-23 07:08:41,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-23 07:08:41,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-23 07:08:41,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 07:08:41,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 07:08:41,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 07:08:41,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-23 07:08:41,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-23 07:08:41,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-23 07:08:41,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-23 07:08:42,087 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 07:08:42,089 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 07:08:42,697 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 07:08:42,806 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 07:08:42,806 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 07:08:42,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:08:42 BoogieIcfgContainer [2023-11-23 07:08:42,807 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 07:08:42,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 07:08:42,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 07:08:42,813 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 07:08:42,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:08:39" (1/3) ... [2023-11-23 07:08:42,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26134e73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:08:42, skipping insertion in model container [2023-11-23 07:08:42,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:41" (2/3) ... [2023-11-23 07:08:42,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26134e73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:08:42, skipping insertion in model container [2023-11-23 07:08:42,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:08:42" (3/3) ... [2023-11-23 07:08:42,818 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_string_harness.i [2023-11-23 07:08:42,831 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 07:08:42,831 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 07:08:42,874 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 07:08:42,884 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;@5581bb76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 07:08:42,885 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 07:08:42,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 53 states have internal predecessors, (64), 25 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-23 07:08:42,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-23 07:08:42,897 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:08:42,897 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:08:42,898 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:08:42,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:08:42,903 INFO L85 PathProgramCache]: Analyzing trace with hash 993524609, now seen corresponding path program 1 times [2023-11-23 07:08:42,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:08:42,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415294564] [2023-11-23 07:08:42,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:08:42,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:08:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:43,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:43,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:43,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:08:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:43,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:08:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:43,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:43,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:08:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:43,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:08:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:43,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:08:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:43,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:08:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:43,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:43,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:08:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:43,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 07:08:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:43,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 07:08:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:43,739 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 07:08:43,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:08:43,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415294564] [2023-11-23 07:08:43,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415294564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:08:43,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:08:43,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 07:08:43,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123450314] [2023-11-23 07:08:43,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:08:43,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 07:08:43,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:08:43,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 07:08:43,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:08:43,774 INFO L87 Difference]: Start difference. First operand has 89 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 53 states have internal predecessors, (64), 25 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-23 07:08:44,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:08:44,094 INFO L93 Difference]: Finished difference Result 172 states and 235 transitions. [2023-11-23 07:08:44,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 07:08:44,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 75 [2023-11-23 07:08:44,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:08:44,105 INFO L225 Difference]: With dead ends: 172 [2023-11-23 07:08:44,105 INFO L226 Difference]: Without dead ends: 86 [2023-11-23 07:08:44,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:08:44,115 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 82 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:08:44,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 78 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:08:44,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-23 07:08:44,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-23 07:08:44,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 50 states have (on average 1.18) internal successors, (59), 51 states have internal predecessors, (59), 25 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-23 07:08:44,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2023-11-23 07:08:44,165 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 75 [2023-11-23 07:08:44,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:08:44,166 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2023-11-23 07:08:44,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-23 07:08:44,167 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2023-11-23 07:08:44,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-23 07:08:44,171 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:08:44,171 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:08:44,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 07:08:44,172 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:08:44,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:08:44,172 INFO L85 PathProgramCache]: Analyzing trace with hash 136815295, now seen corresponding path program 1 times [2023-11-23 07:08:44,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:08:44,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927045125] [2023-11-23 07:08:44,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:08:44,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:08:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:45,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:45,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:45,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:08:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:45,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:08:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:45,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:45,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:08:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:45,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:08:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:45,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:08:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:45,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:08:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:45,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:45,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:08:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:45,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 07:08:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:45,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 07:08:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:45,451 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-23 07:08:45,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:08:45,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927045125] [2023-11-23 07:08:45,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927045125] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:08:45,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980775600] [2023-11-23 07:08:45,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:08:45,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:08:45,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:08:45,454 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:08:45,508 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:08:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:45,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 2658 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-23 07:08:45,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:08:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 07:08:46,205 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:08:46,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980775600] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:08:46,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:08:46,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14] total 24 [2023-11-23 07:08:46,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043489222] [2023-11-23 07:08:46,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:08:46,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 07:08:46,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:08:46,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 07:08:46,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2023-11-23 07:08:46,208 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand has 12 states, 9 states have (on average 4.333333333333333) internal successors, (39), 10 states have internal predecessors, (39), 4 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-11-23 07:08:46,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:08:46,414 INFO L93 Difference]: Finished difference Result 152 states and 194 transitions. [2023-11-23 07:08:46,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 07:08:46,414 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 4.333333333333333) internal successors, (39), 10 states have internal predecessors, (39), 4 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 75 [2023-11-23 07:08:46,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:08:46,416 INFO L225 Difference]: With dead ends: 152 [2023-11-23 07:08:46,417 INFO L226 Difference]: Without dead ends: 91 [2023-11-23 07:08:46,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2023-11-23 07:08:46,418 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 18 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:08:46,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 851 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:08:46,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-23 07:08:46,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2023-11-23 07:08:46,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 55 states have internal predecessors, (63), 25 states have call successors, (25), 10 states have call predecessors, (25), 11 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2023-11-23 07:08:46,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions. [2023-11-23 07:08:46,442 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 75 [2023-11-23 07:08:46,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:08:46,442 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions. [2023-11-23 07:08:46,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 4.333333333333333) internal successors, (39), 10 states have internal predecessors, (39), 4 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-11-23 07:08:46,445 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2023-11-23 07:08:46,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-23 07:08:46,449 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:08:46,449 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-11-23 07:08:46,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 07:08:46,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:08:46,661 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:08:46,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:08:46,661 INFO L85 PathProgramCache]: Analyzing trace with hash -286831427, now seen corresponding path program 1 times [2023-11-23 07:08:46,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:08:46,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480146867] [2023-11-23 07:08:46,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:08:46,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:08:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:47,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:47,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:47,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:08:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:47,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:08:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:47,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:47,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:08:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:47,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:08:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:47,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:08:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:47,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:08:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:47,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:47,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:08:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:47,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 07:08:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:47,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 07:08:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-23 07:08:47,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:08:47,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480146867] [2023-11-23 07:08:47,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480146867] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:08:47,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012681414] [2023-11-23 07:08:47,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:08:47,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:08:47,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:08:47,876 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:08:47,903 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:08:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:48,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 2663 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-23 07:08:48,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:08:48,586 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:08:48,586 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:08:48,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012681414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:08:48,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:08:48,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [19] total 31 [2023-11-23 07:08:48,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451539846] [2023-11-23 07:08:48,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:08:48,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 07:08:48,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:08:48,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 07:08:48,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=857, Unknown=0, NotChecked=0, Total=930 [2023-11-23 07:08:48,588 INFO L87 Difference]: Start difference. First operand 90 states and 114 transitions. Second operand has 14 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 6 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2023-11-23 07:08:48,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:08:48,868 INFO L93 Difference]: Finished difference Result 151 states and 191 transitions. [2023-11-23 07:08:48,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 07:08:48,868 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 6 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Word has length 75 [2023-11-23 07:08:48,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:08:48,873 INFO L225 Difference]: With dead ends: 151 [2023-11-23 07:08:48,874 INFO L226 Difference]: Without dead ends: 91 [2023-11-23 07:08:48,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=1093, Unknown=0, NotChecked=0, Total=1190 [2023-11-23 07:08:48,877 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 18 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:08:48,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1020 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:08:48,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-23 07:08:48,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2023-11-23 07:08:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 55 states have internal predecessors, (63), 25 states have call successors, (25), 10 states have call predecessors, (25), 11 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2023-11-23 07:08:48,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2023-11-23 07:08:48,887 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 75 [2023-11-23 07:08:48,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:08:48,887 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2023-11-23 07:08:48,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 6 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2023-11-23 07:08:48,888 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2023-11-23 07:08:48,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-23 07:08:48,890 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:08:48,890 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:08:48,907 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:08:49,092 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,SelfDestructingSolverStorable2 [2023-11-23 07:08:49,093 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:08:49,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:08:49,096 INFO L85 PathProgramCache]: Analyzing trace with hash -348871041, now seen corresponding path program 1 times [2023-11-23 07:08:49,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:08:49,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631924236] [2023-11-23 07:08:49,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:08:49,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:08:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:49,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:49,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:49,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:08:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:49,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:08:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:49,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:49,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:08:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:49,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:08:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:49,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:08:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:49,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:08:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:49,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:49,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:08:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:49,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 07:08:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:49,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 07:08:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:49,527 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 07:08:49,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:08:49,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631924236] [2023-11-23 07:08:49,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631924236] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:08:49,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:08:49,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 07:08:49,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239455330] [2023-11-23 07:08:49,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:08:49,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:08:49,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:08:49,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:08:49,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 07:08:49,530 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-23 07:08:50,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:08:50,065 INFO L93 Difference]: Finished difference Result 145 states and 182 transitions. [2023-11-23 07:08:50,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 07:08:50,066 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 75 [2023-11-23 07:08:50,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:08:50,069 INFO L225 Difference]: With dead ends: 145 [2023-11-23 07:08:50,069 INFO L226 Difference]: Without dead ends: 92 [2023-11-23 07:08:50,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-23 07:08:50,070 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 96 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:08:50,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 192 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:08:50,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-23 07:08:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-11-23 07:08:50,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 57 states have internal predecessors, (64), 25 states have call successors, (25), 10 states have call predecessors, (25), 12 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2023-11-23 07:08:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2023-11-23 07:08:50,077 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 75 [2023-11-23 07:08:50,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:08:50,078 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2023-11-23 07:08:50,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-23 07:08:50,078 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2023-11-23 07:08:50,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 07:08:50,078 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:08:50,079 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:08:50,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 07:08:50,079 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:08:50,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:08:50,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1578262406, now seen corresponding path program 1 times [2023-11-23 07:08:50,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:08:50,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572360193] [2023-11-23 07:08:50,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:08:50,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:08:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:50,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:50,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:50,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:08:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:50,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:08:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:50,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:50,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:08:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:50,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:08:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:50,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:08:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:50,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:08:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:50,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:50,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:08:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:50,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 07:08:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:50,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 07:08:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:50,924 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 07:08:50,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:08:50,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572360193] [2023-11-23 07:08:50,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572360193] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:08:50,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:08:50,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 07:08:50,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743970209] [2023-11-23 07:08:50,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:08:50,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:08:50,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:08:50,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:08:50,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:08:50,926 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 10 states, 8 states have (on average 4.125) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (14), 4 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:08:51,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:08:51,766 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2023-11-23 07:08:51,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 07:08:51,766 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.125) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (14), 4 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 77 [2023-11-23 07:08:51,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:08:51,767 INFO L225 Difference]: With dead ends: 103 [2023-11-23 07:08:51,767 INFO L226 Difference]: Without dead ends: 101 [2023-11-23 07:08:51,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-11-23 07:08:51,768 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 107 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 07:08:51,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 317 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 07:08:51,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-23 07:08:51,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2023-11-23 07:08:51,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 63 states have internal predecessors, (69), 26 states have call successors, (26), 11 states have call predecessors, (26), 14 states have return successors, (29), 25 states have call predecessors, (29), 25 states have call successors, (29) [2023-11-23 07:08:51,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 124 transitions. [2023-11-23 07:08:51,803 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 124 transitions. Word has length 77 [2023-11-23 07:08:51,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:08:51,804 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 124 transitions. [2023-11-23 07:08:51,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.125) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (14), 4 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:08:51,804 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2023-11-23 07:08:51,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-23 07:08:51,806 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:08:51,806 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:08:51,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 07:08:51,807 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:08:51,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:08:51,807 INFO L85 PathProgramCache]: Analyzing trace with hash -959767886, now seen corresponding path program 1 times [2023-11-23 07:08:51,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:08:51,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897354508] [2023-11-23 07:08:51,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:08:51,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:08:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:53,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:53,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:53,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:08:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:53,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:08:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:53,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:53,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:08:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:53,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:08:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:53,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:08:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:53,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:08:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:53,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:08:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:53,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:08:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:53,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 07:08:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:53,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 07:08:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:53,849 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-23 07:08:53,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:08:53,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897354508] [2023-11-23 07:08:53,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897354508] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:08:53,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697565740] [2023-11-23 07:08:53,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:08:53,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:08:53,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:08:53,851 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:08:53,876 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:08:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:08:54,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 2685 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-23 07:08:54,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:08:54,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2023-11-23 07:08:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 07:08:54,879 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:08:54,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697565740] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:08:54,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:08:54,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [22] total 33 [2023-11-23 07:08:54,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735690209] [2023-11-23 07:08:54,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:08:54,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-23 07:08:54,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:08:54,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-23 07:08:54,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=974, Unknown=0, NotChecked=0, Total=1056 [2023-11-23 07:08:54,882 INFO L87 Difference]: Start difference. First operand 100 states and 124 transitions. Second operand has 18 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 7 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) [2023-11-23 07:08:57,776 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:08:59,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:09:01,863 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:09:03,887 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:09:04,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:09:04,411 INFO L93 Difference]: Finished difference Result 185 states and 224 transitions. [2023-11-23 07:09:04,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-23 07:09:04,411 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 7 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) Word has length 81 [2023-11-23 07:09:04,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:09:04,414 INFO L225 Difference]: With dead ends: 185 [2023-11-23 07:09:04,414 INFO L226 Difference]: Without dead ends: 125 [2023-11-23 07:09:04,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=1496, Unknown=0, NotChecked=0, Total=1640 [2023-11-23 07:09:04,416 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 82 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 12 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:09:04,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1362 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 581 Invalid, 4 Unknown, 0 Unchecked, 9.3s Time] [2023-11-23 07:09:04,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-23 07:09:04,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 114. [2023-11-23 07:09:04,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 74 states have internal predecessors, (83), 26 states have call successors, (26), 14 states have call predecessors, (26), 16 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2023-11-23 07:09:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2023-11-23 07:09:04,443 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 81 [2023-11-23 07:09:04,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:09:04,444 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2023-11-23 07:09:04,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 7 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) [2023-11-23 07:09:04,444 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2023-11-23 07:09:04,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-23 07:09:04,445 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:09:04,445 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:09:04,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 07:09:04,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:09:04,656 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:09:04,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:09:04,656 INFO L85 PathProgramCache]: Analyzing trace with hash -258703308, now seen corresponding path program 1 times [2023-11-23 07:09:04,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:09:04,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769587375] [2023-11-23 07:09:04,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:09:04,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:09:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:05,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:09:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:05,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:09:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:05,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:09:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:05,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:09:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:05,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:09:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:05,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:09:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:05,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:09:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:05,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:09:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:05,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:09:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:05,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:09:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:05,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:09:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:05,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 07:09:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:05,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 07:09:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:05,437 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 07:09:05,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:09:05,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769587375] [2023-11-23 07:09:05,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769587375] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:09:05,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:09:05,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 07:09:05,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533748280] [2023-11-23 07:09:05,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:09:05,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:09:05,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:09:05,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:09:05,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 07:09:05,440 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (14), 4 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:09:06,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:09:06,011 INFO L93 Difference]: Finished difference Result 170 states and 207 transitions. [2023-11-23 07:09:06,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:09:06,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (14), 4 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 81 [2023-11-23 07:09:06,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:09:06,013 INFO L225 Difference]: With dead ends: 170 [2023-11-23 07:09:06,013 INFO L226 Difference]: Without dead ends: 112 [2023-11-23 07:09:06,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:09:06,014 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 52 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:09:06,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 160 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:09:06,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-23 07:09:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-11-23 07:09:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 69 states have (on average 1.144927536231884) internal successors, (79), 72 states have internal predecessors, (79), 26 states have call successors, (26), 14 states have call predecessors, (26), 16 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2023-11-23 07:09:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2023-11-23 07:09:06,025 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 81 [2023-11-23 07:09:06,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:09:06,025 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2023-11-23 07:09:06,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (14), 4 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:09:06,026 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2023-11-23 07:09:06,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-23 07:09:06,027 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:09:06,027 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:09:06,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 07:09:06,027 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:09:06,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:09:06,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1325888077, now seen corresponding path program 1 times [2023-11-23 07:09:06,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:09:06,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861894846] [2023-11-23 07:09:06,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:09:06,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:09:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:06,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:09:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:06,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:09:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:06,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:09:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:06,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:09:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:06,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:09:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:06,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:09:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:06,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:09:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:06,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:09:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:06,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:09:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:06,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:09:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:06,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:09:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:06,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 07:09:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:06,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 07:09:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 07:09:06,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:09:06,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861894846] [2023-11-23 07:09:06,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861894846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:09:06,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:09:06,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-23 07:09:06,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322385005] [2023-11-23 07:09:06,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:09:06,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 07:09:06,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:09:06,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 07:09:06,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-23 07:09:06,889 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 12 states, 10 states have (on average 3.9) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (14), 4 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:09:08,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:09:08,137 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2023-11-23 07:09:08,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 07:09:08,137 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (14), 4 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 83 [2023-11-23 07:09:08,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:09:08,138 INFO L225 Difference]: With dead ends: 125 [2023-11-23 07:09:08,138 INFO L226 Difference]: Without dead ends: 123 [2023-11-23 07:09:08,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2023-11-23 07:09:08,139 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 70 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 07:09:08,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 410 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 07:09:08,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-23 07:09:08,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 114. [2023-11-23 07:09:08,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 71 states have (on average 1.1408450704225352) internal successors, (81), 74 states have internal predecessors, (81), 26 states have call successors, (26), 14 states have call predecessors, (26), 16 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2023-11-23 07:09:08,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2023-11-23 07:09:08,147 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 83 [2023-11-23 07:09:08,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:09:08,148 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2023-11-23 07:09:08,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (14), 4 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:09:08,148 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2023-11-23 07:09:08,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-23 07:09:08,149 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:09:08,149 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:09:08,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 07:09:08,149 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:09:08,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:09:08,150 INFO L85 PathProgramCache]: Analyzing trace with hash 932861067, now seen corresponding path program 1 times [2023-11-23 07:09:08,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:09:08,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747106787] [2023-11-23 07:09:08,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:09:08,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:09:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:09,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:09:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:09,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:09:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:09,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:09:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:09,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:09:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:09,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:09:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:09,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:09:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:09,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:09:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:09,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:09:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:09,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:09:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:09,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:09:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:09,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:09:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:09,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 07:09:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:09,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 07:09:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:09,248 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 07:09:09,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:09:09,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747106787] [2023-11-23 07:09:09,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747106787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:09:09,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:09:09,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-23 07:09:09,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779229030] [2023-11-23 07:09:09,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:09:09,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-23 07:09:09,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:09:09,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-23 07:09:09,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2023-11-23 07:09:09,251 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 15 states, 13 states have (on average 3.0) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (14), 4 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:09:11,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:09:11,254 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2023-11-23 07:09:11,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 07:09:11,255 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.0) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (14), 4 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 83 [2023-11-23 07:09:11,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:09:11,257 INFO L225 Difference]: With dead ends: 124 [2023-11-23 07:09:11,257 INFO L226 Difference]: Without dead ends: 122 [2023-11-23 07:09:11,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2023-11-23 07:09:11,260 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 86 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 07:09:11,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 482 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 07:09:11,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-23 07:09:11,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2023-11-23 07:09:11,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 69 states have internal predecessors, (77), 25 states have call successors, (25), 14 states have call predecessors, (25), 15 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2023-11-23 07:09:11,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 127 transitions. [2023-11-23 07:09:11,283 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 127 transitions. Word has length 83 [2023-11-23 07:09:11,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:09:11,285 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 127 transitions. [2023-11-23 07:09:11,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.0) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (14), 4 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:09:11,286 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2023-11-23 07:09:11,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-23 07:09:11,288 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:09:11,288 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 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] [2023-11-23 07:09:11,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 07:09:11,289 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:09:11,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:09:11,289 INFO L85 PathProgramCache]: Analyzing trace with hash -681129941, now seen corresponding path program 1 times [2023-11-23 07:09:11,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:09:11,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034388302] [2023-11-23 07:09:11,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:09:11,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:09:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:12,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:09:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:12,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:09:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:12,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:09:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:12,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:09:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:12,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:09:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:12,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:09:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:12,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:09:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:12,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:09:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:12,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:09:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:12,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:09:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:12,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:09:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:12,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 07:09:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:12,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 07:09:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:12,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 07:09:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:12,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 07:09:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-23 07:09:12,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:09:12,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034388302] [2023-11-23 07:09:12,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034388302] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:09:12,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440316860] [2023-11-23 07:09:12,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:09:12,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:09:12,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:09:12,403 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:09:12,404 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:09:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:12,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 2724 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-23 07:09:12,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:09:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-23 07:09:13,118 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:09:13,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440316860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:09:13,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:09:13,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [17] total 27 [2023-11-23 07:09:13,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282206765] [2023-11-23 07:09:13,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:09:13,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 07:09:13,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:09:13,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 07:09:13,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2023-11-23 07:09:13,121 INFO L87 Difference]: Start difference. First operand 108 states and 127 transitions. Second operand has 12 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-23 07:09:13,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:09:13,310 INFO L93 Difference]: Finished difference Result 158 states and 186 transitions. [2023-11-23 07:09:13,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 07:09:13,310 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 3 states have call successors, (15) Word has length 90 [2023-11-23 07:09:13,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:09:13,311 INFO L225 Difference]: With dead ends: 158 [2023-11-23 07:09:13,311 INFO L226 Difference]: Without dead ends: 112 [2023-11-23 07:09:13,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2023-11-23 07:09:13,312 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 20 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:09:13,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 907 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:09:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-23 07:09:13,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2023-11-23 07:09:13,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 69 states have (on average 1.144927536231884) internal successors, (79), 71 states have internal predecessors, (79), 25 states have call successors, (25), 14 states have call predecessors, (25), 15 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2023-11-23 07:09:13,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2023-11-23 07:09:13,319 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 90 [2023-11-23 07:09:13,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:09:13,320 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2023-11-23 07:09:13,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-23 07:09:13,320 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2023-11-23 07:09:13,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-23 07:09:13,321 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:09:13,321 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 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] [2023-11-23 07:09:13,337 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:09:13,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:09:13,537 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:09:13,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:09:13,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1838829993, now seen corresponding path program 1 times [2023-11-23 07:09:13,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:09:13,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077960292] [2023-11-23 07:09:13,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:09:13,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:09:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:17,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:09:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:18,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:09:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:18,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:09:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:18,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:09:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:18,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:09:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:18,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:09:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:18,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:09:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:18,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:09:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:18,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:09:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:18,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:09:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:18,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:09:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:18,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 07:09:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:18,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 07:09:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:18,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 07:09:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:18,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 07:09:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-23 07:09:18,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:09:18,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077960292] [2023-11-23 07:09:18,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077960292] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:09:18,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829710524] [2023-11-23 07:09:18,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:09:18,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:09:18,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:09:18,796 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:09:18,822 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:09:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:09:19,279 INFO L262 TraceCheckSpWp]: Trace formula consists of 2729 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-23 07:09:19,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:09:19,479 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 66 treesize of output 53 [2023-11-23 07:09:19,528 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2023-11-23 07:09:19,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 96 [2023-11-23 07:09:19,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:09:19,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:09:19,597 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:09:19,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 11 [2023-11-23 07:09:21,510 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 20 treesize of output 9 [2023-11-23 07:09:21,514 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 17 treesize of output 13 [2023-11-23 07:09:23,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:09:23,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 182 treesize of output 152 [2023-11-23 07:09:23,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:09:23,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 74 [2023-11-23 07:09:27,139 INFO L349 Elim1Store]: treesize reduction 289, result has 58.3 percent of original size [2023-11-23 07:09:27,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 16 new quantified variables, introduced 55 case distinctions, treesize of input 281 treesize of output 564 [2023-11-23 07:09:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 27 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-23 07:09:27,273 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:09:32,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 16 treesize of output 14 [2023-11-23 07:09:32,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:09:32,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2023-11-23 07:09:32,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2023-11-23 07:09:33,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 51 treesize of output 47 [2023-11-23 07:09:33,215 INFO L349 Elim1Store]: treesize reduction 26, result has 56.7 percent of original size [2023-11-23 07:09:33,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 98 [2023-11-23 07:09:33,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:09:33,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2023-11-23 07:09:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-23 07:09:33,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829710524] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:09:33,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:09:33,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 35, 28] total 82 [2023-11-23 07:09:33,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083726019] [2023-11-23 07:09:33,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:09:33,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2023-11-23 07:09:33,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:09:33,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2023-11-23 07:09:33,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=6294, Unknown=1, NotChecked=0, Total=6642 [2023-11-23 07:09:33,793 INFO L87 Difference]: Start difference. First operand 110 states and 129 transitions. Second operand has 82 states, 61 states have (on average 1.8524590163934427) internal successors, (113), 61 states have internal predecessors, (113), 26 states have call successors, (42), 9 states have call predecessors, (42), 17 states have return successors, (41), 29 states have call predecessors, (41), 24 states have call successors, (41) [2023-11-23 07:09:42,207 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:09:44,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:09:46,218 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:09:48,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:09:50,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:09:54,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:09:56,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:09:57,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:10:04,469 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:10:18,061 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:10:23,194 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:10:25,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:10:29,107 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, 1] [2023-11-23 07:10:33,502 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, 1] [2023-11-23 07:10:35,506 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, 1] [2023-11-23 07:10:37,704 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, 1] [2023-11-23 07:10:39,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-23 07:10:42,726 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:10:44,878 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:10:46,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:10:51,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:10:52,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:10:54,994 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:10:57,958 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:10:59,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:11:23,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:11:34,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-23 07:11:36,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:11:38,762 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, 1] [2023-11-23 07:11:40,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-23 07:11:45,219 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, 1] [2023-11-23 07:12:00,196 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, 1] [2023-11-23 07:12:14,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-23 07:12:25,602 WARN L854 $PredicateComparison]: unable to prove that (and (or (= (mod |c_aws_byte_cursor_is_valid_#res| 256) 0) (= (mod (select (select |c_#memory_int#4| |c_aws_byte_cursor_is_valid_#in~cursor.base|) |c_aws_byte_cursor_is_valid_#in~cursor.offset|) 18446744073709551616) 0) (and (forall ((|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_10| Int)) (let ((.cse0 (select |c_#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_10|))) (let ((.cse1 (mod (select .cse0 (+ 8 |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset_BEFORE_CALL_17|)) 18446744073709551616))) (or (= (mod (select .cse0 (+ 16 |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset_BEFORE_CALL_17| .cse1)) 256) 0) (< 9223372036854775807 .cse1))))) (forall ((|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_10| Int)) (let ((.cse2 (select |c_#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_10|))) (let ((.cse3 (mod (select .cse2 (+ 8 |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset_BEFORE_CALL_17|)) 18446744073709551616))) (or (= (mod (select .cse2 (+ 16 |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset_BEFORE_CALL_17| .cse3)) 256) 0) (= (mod (select .cse2 (+ (- 18446744073709551600) |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset_BEFORE_CALL_17| .cse3)) 256) 0))))) (forall ((|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_10| Int)) (let ((.cse5 (select |c_#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_10|))) (let ((.cse4 (mod (select .cse5 (+ 8 |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset_BEFORE_CALL_17|)) 18446744073709551616))) (or (< .cse4 9223372036854775808) (= (mod (select .cse5 (+ (- 18446744073709551600) |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset_BEFORE_CALL_17| .cse4)) 256) 0))))))) (= |c_#memory_real#1| |c_old(#memory_real#1)|) (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_old(#memory_$Pointer$#3.base)| |c_#memory_$Pointer$#3.base|) (= |c_old(#memory_$Pointer$#4.offset)| |c_#memory_$Pointer$#4.offset|) (= |c_old(#memory_$Pointer$#6.offset)| |c_#memory_$Pointer$#6.offset|) (= |c_#memory_$Pointer$#0.offset| |c_old(#memory_$Pointer$#0.offset)|) (= |c_#memory_real#4| |c_old(#memory_real#4)|) (= |c_#valid| |c_old(#valid)|) (= c_aws_byte_cursor_is_valid_~cursor.base |c_aws_byte_cursor_is_valid_#in~cursor.base|) (= |c_old(#memory_real#3)| |c_#memory_real#3|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_old(#memory_int#3)| |c_#memory_int#3|) (= |c_#memory_int#5| |c_old(#memory_int#5)|) (= |c_aws_byte_cursor_is_valid_#in~cursor.offset| c_aws_byte_cursor_is_valid_~cursor.offset) (= |c_old(#memory_$Pointer$#5.base)| |c_#memory_$Pointer$#5.base|) (= |c_old(#memory_$Pointer$#4.base)| |c_#memory_$Pointer$#4.base|) (= |c_old(#memory_real#2)| |c_#memory_real#2|) (= |c_#memory_real#5| |c_old(#memory_real#5)|) (= |c_old(#memory_$Pointer$#3.offset)| |c_#memory_$Pointer$#3.offset|) (= |c_#memory_real#0| |c_old(#memory_real#0)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_int#0)| |c_#memory_int#0|) (= |c_#memory_$Pointer$#6.base| |c_old(#memory_$Pointer$#6.base)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#memory_$Pointer$#0.base)| |c_#memory_$Pointer$#0.base|) (= |c_old(#memory_$Pointer$#5.offset)| |c_#memory_$Pointer$#5.offset|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_real#6)| |c_#memory_real#6|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_int#4)| |c_#memory_int#4|) (= |c_#memory_int#6| |c_old(#memory_int#6)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-11-23 07:12:27,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-23 07:12:29,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:12:31,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-23 07:12:33,224 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:12:35,339 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, 1] [2023-11-23 07:12:37,878 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:12:41,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:12:44,406 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, 1] [2023-11-23 07:12:46,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 07:12:48,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-23 07:12:54,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:12:54,463 INFO L93 Difference]: Finished difference Result 303 states and 348 transitions. [2023-11-23 07:12:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-11-23 07:12:54,464 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 61 states have (on average 1.8524590163934427) internal successors, (113), 61 states have internal predecessors, (113), 26 states have call successors, (42), 9 states have call predecessors, (42), 17 states have return successors, (41), 29 states have call predecessors, (41), 24 states have call successors, (41) Word has length 90 [2023-11-23 07:12:54,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:12:54,467 INFO L225 Difference]: With dead ends: 303 [2023-11-23 07:12:54,467 INFO L226 Difference]: Without dead ends: 295 [2023-11-23 07:12:54,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 158 SyntacticMatches, 6 SemanticMatches, 170 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7685 ImplicationChecksByTransitivity, 119.9s TimeCoverageRelationStatistics Valid=1832, Invalid=27177, Unknown=65, NotChecked=338, Total=29412 [2023-11-23 07:12:54,472 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 647 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 6454 mSolverCounterSat, 229 mSolverCounterUnsat, 103 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 90.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 6867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 6454 IncrementalHoareTripleChecker+Invalid, 103 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 91.5s IncrementalHoareTripleChecker+Time [2023-11-23 07:12:54,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 993 Invalid, 6867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 6454 Invalid, 103 Unknown, 81 Unchecked, 91.5s Time] [2023-11-23 07:12:54,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-11-23 07:12:54,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 205. [2023-11-23 07:12:54,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 139 states have (on average 1.1798561151079137) internal successors, (164), 145 states have internal predecessors, (164), 35 states have call successors, (35), 25 states have call predecessors, (35), 30 states have return successors, (39), 34 states have call predecessors, (39), 34 states have call successors, (39) [2023-11-23 07:12:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 238 transitions. [2023-11-23 07:12:54,494 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 238 transitions. Word has length 90 [2023-11-23 07:12:54,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:12:54,495 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 238 transitions. [2023-11-23 07:12:54,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 61 states have (on average 1.8524590163934427) internal successors, (113), 61 states have internal predecessors, (113), 26 states have call successors, (42), 9 states have call predecessors, (42), 17 states have return successors, (41), 29 states have call predecessors, (41), 24 states have call successors, (41) [2023-11-23 07:12:54,495 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 238 transitions. [2023-11-23 07:12:54,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-23 07:12:54,496 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:12:54,496 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 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] [2023-11-23 07:12:54,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 07:12:54,705 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,SelfDestructingSolverStorable10 [2023-11-23 07:12:54,705 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:12:54,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:12:54,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1071571, now seen corresponding path program 1 times [2023-11-23 07:12:54,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:12:54,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833554677] [2023-11-23 07:12:54,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:12:54,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:12:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:12:55,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:12:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:12:55,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:12:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:12:55,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:12:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:12:55,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:12:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:12:55,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:12:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:12:55,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:12:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:12:55,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:12:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:12:55,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:12:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:12:55,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:12:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:12:55,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:12:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:12:55,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:12:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:12:55,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 07:12:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:12:55,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 07:12:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:12:55,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 07:12:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:12:55,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 07:12:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:12:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-23 07:12:55,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:12:55,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833554677] [2023-11-23 07:12:55,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833554677] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:12:55,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475964690] [2023-11-23 07:12:55,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:12:55,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:12:55,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:12:55,596 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:12:55,597 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:12:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:12:56,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 2721 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-23 07:12:56,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:12:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-23 07:12:56,165 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:12:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-23 07:12:56,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475964690] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:12:56,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:12:56,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 17 [2023-11-23 07:12:56,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238056680] [2023-11-23 07:12:56,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:12:56,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-23 07:12:56,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:12:56,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-23 07:12:56,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:12:56,341 INFO L87 Difference]: Start difference. First operand 205 states and 238 transitions. Second operand has 17 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Killed by 15