./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_byte_cursor_compare_lexical_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_compare_lexical_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 60926facf5511174d61dcd6a0b7a731efc9ccdb495bc26b58400da4cd6320ca0 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 07:03:22,171 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 07:03:22,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 07:03:22,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 07:03:22,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 07:03:22,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 07:03:22,256 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 07:03:22,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 07:03:22,257 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 07:03:22,257 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 07:03:22,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 07:03:22,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 07:03:22,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 07:03:22,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 07:03:22,259 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 07:03:22,259 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 07:03:22,259 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 07:03:22,260 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 07:03:22,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 07:03:22,260 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 07:03:22,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 07:03:22,263 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 07:03:22,263 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 07:03:22,264 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 07:03:22,264 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 07:03:22,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 07:03:22,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 07:03:22,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 07:03:22,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:03:22,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 07:03:22,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 07:03:22,266 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 07:03:22,267 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 07:03:22,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 07:03:22,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 07:03:22,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 07:03:22,267 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 07:03:22,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 07:03:22,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 07:03:22,268 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 -> 60926facf5511174d61dcd6a0b7a731efc9ccdb495bc26b58400da4cd6320ca0 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 07:03:22,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 07:03:22,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 07:03:22,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 07:03:22,468 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 07:03:22,469 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 07:03:22,470 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_compare_lexical_harness.i [2023-11-23 07:03:23,512 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 07:03:23,884 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 07:03:23,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_cursor_compare_lexical_harness.i [2023-11-23 07:03:23,919 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13cc91b1b/7fb5b9efb77641f8adfe9a10a674b654/FLAG89c72319f [2023-11-23 07:03:23,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13cc91b1b/7fb5b9efb77641f8adfe9a10a674b654 [2023-11-23 07:03:23,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 07:03:23,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 07:03:23,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 07:03:23,933 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 07:03:23,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 07:03:23,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:03:23" (1/1) ... [2023-11-23 07:03:23,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11962f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:03:23, skipping insertion in model container [2023-11-23 07:03:23,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:03:23" (1/1) ... [2023-11-23 07:03:24,054 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:03:24,240 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_compare_lexical_harness.i[4505,4518] [2023-11-23 07:03:24,247 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_compare_lexical_harness.i[4565,4578] [2023-11-23 07:03:24,763 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:03:24,766 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:03:24,768 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:03:24,770 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:03:24,771 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:03:24,785 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:03:24,787 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:03:24,790 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:03:24,790 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:03:25,007 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:03:25,008 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:03:25,008 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:03:25,010 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:03:25,014 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:03:25,014 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:03:25,015 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:03:25,015 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:03:25,016 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:03:25,018 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:03:25,166 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:03:25,166 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:03:25,207 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:03:25,242 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 07:03:25,259 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_compare_lexical_harness.i[4505,4518] [2023-11-23 07:03:25,260 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_compare_lexical_harness.i[4565,4578] [2023-11-23 07:03:25,297 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:03:25,299 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:03:25,300 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:03:25,300 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:03:25,301 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:03:25,308 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:03:25,312 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:03:25,313 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:03:25,314 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:03:25,331 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:03:25,332 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:03:25,332 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:03:25,333 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:03:25,333 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:03:25,334 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:03:25,334 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:03:25,335 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:03:25,335 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:03:25,335 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:03:25,391 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8277] [2023-11-23 07:03:25,397 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:03:25,398 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:03:25,406 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8763-8774] [2023-11-23 07:03:25,508 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:03:25,659 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:03:25,661 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:03:25,661 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:03:25,661 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:03:25,662 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:03:25,662 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:03:25,662 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:03:25,662 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:03:25,662 WARN L675 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:03:25,663 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:03:25,663 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:03:25,663 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:03:25,663 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:03:25,664 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:03:25,664 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:03:25,664 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:03:25,664 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:03:25,664 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:03:25,672 INFO L206 MainTranslator]: Completed translation [2023-11-23 07:03:25,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:03:25 WrapperNode [2023-11-23 07:03:25,672 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 07:03:25,673 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 07:03:25,673 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 07:03:25,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 07:03:25,679 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:03:25" (1/1) ... [2023-11-23 07:03:25,760 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:03:25" (1/1) ... [2023-11-23 07:03:25,826 INFO L138 Inliner]: procedures = 690, calls = 2659, calls flagged for inlining = 59, calls inlined = 6, statements flattened = 921 [2023-11-23 07:03:25,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 07:03:25,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 07:03:25,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 07:03:25,828 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 07:03:25,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:03:25" (1/1) ... [2023-11-23 07:03:25,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:03:25" (1/1) ... [2023-11-23 07:03:25,847 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:03:25" (1/1) ... [2023-11-23 07:03:25,912 INFO L188 MemorySlicer]: Split 554 memory accesses to 8 slices as follows [2, 5, 256, 236, 42, 4, 6, 3]. 46 percent of accesses are in the largest equivalence class. The 502 initializations are split as follows [2, 5, 256, 236, 0, 0, 0, 3]. The 5 writes are split as follows [0, 0, 0, 0, 3, 0, 2, 0]. [2023-11-23 07:03:25,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:03:25" (1/1) ... [2023-11-23 07:03:25,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:03:25" (1/1) ... [2023-11-23 07:03:25,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:03:25" (1/1) ... [2023-11-23 07:03:25,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:03:25" (1/1) ... [2023-11-23 07:03:25,973 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:03:25" (1/1) ... [2023-11-23 07:03:25,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:03:25" (1/1) ... [2023-11-23 07:03:26,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 07:03:26,006 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 07:03:26,007 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 07:03:26,007 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 07:03:26,007 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:03:25" (1/1) ... [2023-11-23 07:03:26,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:03:26,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:03:26,041 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:03:26,064 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:03:26,081 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2023-11-23 07:03:26,081 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2023-11-23 07:03:26,082 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_compare_lexical [2023-11-23 07:03:26,082 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_compare_lexical [2023-11-23 07:03:26,082 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-23 07:03:26,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 07:03:26,082 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2023-11-23 07:03:26,082 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2023-11-23 07:03:26,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 07:03:26,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 07:03:26,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-23 07:03:26,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-23 07:03:26,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-23 07:03:26,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-23 07:03:26,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-23 07:03:26,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-11-23 07:03:26,084 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_bounded [2023-11-23 07:03:26,084 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_bounded [2023-11-23 07:03:26,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 07:03:26,084 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 07:03:26,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 07:03:26,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 07:03:26,085 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2023-11-23 07:03:26,085 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2023-11-23 07:03:26,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 07:03:26,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 07:03:26,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 07:03:26,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-23 07:03:26,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-23 07:03:26,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-23 07:03:26,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-23 07:03:26,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-11-23 07:03:26,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 07:03:26,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 07:03:26,087 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-23 07:03:26,087 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-23 07:03:26,087 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2023-11-23 07:03:26,087 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2023-11-23 07:03:26,087 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 07:03:26,088 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 07:03:26,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 07:03:26,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 07:03:26,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 07:03:26,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 07:03:26,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-23 07:03:26,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-23 07:03:26,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-23 07:03:26,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-11-23 07:03:26,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-11-23 07:03:26,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 07:03:26,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 07:03:26,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 07:03:26,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-23 07:03:26,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-23 07:03:26,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-23 07:03:26,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-11-23 07:03:26,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-11-23 07:03:26,090 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 07:03:26,090 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 07:03:26,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 07:03:26,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 07:03:26,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-23 07:03:26,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-23 07:03:26,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-23 07:03:26,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-23 07:03:26,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-23 07:03:26,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-11-23 07:03:26,091 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_byte_cursor_has_allocated_buffer_member [2023-11-23 07:03:26,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_byte_cursor_has_allocated_buffer_member [2023-11-23 07:03:26,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 07:03:26,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 07:03:26,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 07:03:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-23 07:03:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-23 07:03:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-23 07:03:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-23 07:03:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-11-23 07:03:26,376 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 07:03:26,377 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 07:03:27,057 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 07:03:27,142 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 07:03:27,143 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 07:03:27,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:03:27 BoogieIcfgContainer [2023-11-23 07:03:27,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 07:03:27,145 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 07:03:27,146 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 07:03:27,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 07:03:27,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:03:23" (1/3) ... [2023-11-23 07:03:27,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594e9211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:03:27, skipping insertion in model container [2023-11-23 07:03:27,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:03:25" (2/3) ... [2023-11-23 07:03:27,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594e9211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:03:27, skipping insertion in model container [2023-11-23 07:03:27,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:03:27" (3/3) ... [2023-11-23 07:03:27,152 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_compare_lexical_harness.i [2023-11-23 07:03:27,164 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 07:03:27,165 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 07:03:27,235 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 07:03:27,248 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;@41d0c8b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 07:03:27,249 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 07:03:27,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 79 states have internal predecessors, (98), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-23 07:03:27,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 07:03:27,261 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:03:27,262 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:03:27,262 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:03:27,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:03:27,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1419046533, now seen corresponding path program 1 times [2023-11-23 07:03:27,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:03:27,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508625354] [2023-11-23 07:03:27,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:03:27,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:03:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:27,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:03:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:27,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 07:03:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:27,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:03:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:27,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:03:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:27,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 07:03:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:27,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:03:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:27,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:03:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:27,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:03:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:28,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:03:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:28,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:03:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:28,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-23 07:03:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:28,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 07:03:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:28,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 07:03:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:28,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 07:03:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:28,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 07:03:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:28,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 07:03:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:28,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-23 07:03:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:28,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-23 07:03:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:28,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-23 07:03:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:28,153 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2023-11-23 07:03:28,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:03:28,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508625354] [2023-11-23 07:03:28,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508625354] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:03:28,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:03:28,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 07:03:28,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668336828] [2023-11-23 07:03:28,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:03:28,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 07:03:28,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:03:28,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 07:03:28,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:03:28,194 INFO L87 Difference]: Start difference. First operand has 137 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 79 states have internal predecessors, (98), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-23 07:03:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:03:29,246 INFO L93 Difference]: Finished difference Result 274 states and 412 transitions. [2023-11-23 07:03:29,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 07:03:29,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 110 [2023-11-23 07:03:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:03:29,257 INFO L225 Difference]: With dead ends: 274 [2023-11-23 07:03:29,257 INFO L226 Difference]: Without dead ends: 137 [2023-11-23 07:03:29,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:03:29,270 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 70 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:03:29,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 151 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-23 07:03:29,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-23 07:03:29,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2023-11-23 07:03:29,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 77 states have internal predecessors, (93), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2023-11-23 07:03:29,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 184 transitions. [2023-11-23 07:03:29,316 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 184 transitions. Word has length 110 [2023-11-23 07:03:29,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:03:29,317 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 184 transitions. [2023-11-23 07:03:29,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-23 07:03:29,317 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 184 transitions. [2023-11-23 07:03:29,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 07:03:29,320 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:03:29,320 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:03:29,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 07:03:29,321 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:03:29,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:03:29,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1636033603, now seen corresponding path program 1 times [2023-11-23 07:03:29,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:03:29,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811432939] [2023-11-23 07:03:29,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:03:29,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:03:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:29,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:03:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:29,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 07:03:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:29,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:03:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:29,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:03:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:29,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 07:03:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:29,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:03:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:29,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:03:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:29,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:03:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:29,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:03:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:29,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:03:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:30,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-23 07:03:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:30,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 07:03:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:30,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 07:03:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:30,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 07:03:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:30,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 07:03:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:30,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 07:03:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:30,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-23 07:03:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:30,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-23 07:03:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:30,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-23 07:03:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:30,053 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2023-11-23 07:03:30,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:03:30,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811432939] [2023-11-23 07:03:30,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811432939] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:03:30,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134196261] [2023-11-23 07:03:30,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:03:30,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:03:30,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:03:30,055 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:03:30,084 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:03:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:30,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 2847 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 07:03:30,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:03:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-11-23 07:03:30,634 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:03:30,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134196261] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:03:30,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:03:30,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2023-11-23 07:03:30,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264532434] [2023-11-23 07:03:30,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:03:30,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 07:03:30,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:03:30,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 07:03:30,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:03:30,636 INFO L87 Difference]: Start difference. First operand 134 states and 184 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-23 07:03:31,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:03:31,044 INFO L93 Difference]: Finished difference Result 264 states and 367 transitions. [2023-11-23 07:03:31,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:03:31,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 110 [2023-11-23 07:03:31,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:03:31,046 INFO L225 Difference]: With dead ends: 264 [2023-11-23 07:03:31,046 INFO L226 Difference]: Without dead ends: 136 [2023-11-23 07:03:31,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:03:31,047 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 43 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 07:03:31,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 556 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 07:03:31,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-23 07:03:31,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-11-23 07:03:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 46 states have call successors, (46), 11 states have call predecessors, (46), 12 states have return successors, (51), 45 states have call predecessors, (51), 45 states have call successors, (51) [2023-11-23 07:03:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 191 transitions. [2023-11-23 07:03:31,064 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 191 transitions. Word has length 110 [2023-11-23 07:03:31,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:03:31,064 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 191 transitions. [2023-11-23 07:03:31,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-23 07:03:31,065 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 191 transitions. [2023-11-23 07:03:31,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-23 07:03:31,066 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:03:31,066 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:03:31,084 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:03:31,281 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:03:31,281 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:03:31,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:03:31,282 INFO L85 PathProgramCache]: Analyzing trace with hash 654718632, now seen corresponding path program 1 times [2023-11-23 07:03:31,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:03:31,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543278399] [2023-11-23 07:03:31,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:03:31,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:03:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:31,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:03:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:31,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 07:03:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:31,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:03:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:31,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:03:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:31,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 07:03:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:31,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:03:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:31,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:03:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:31,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:03:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:31,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:03:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:31,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:03:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:31,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 07:03:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:31,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:03:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:31,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 07:03:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:31,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 07:03:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:31,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-23 07:03:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:31,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 07:03:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:32,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-23 07:03:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:32,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 07:03:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:32,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-23 07:03:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:32,016 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2023-11-23 07:03:32,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:03:32,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543278399] [2023-11-23 07:03:32,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543278399] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:03:32,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158778973] [2023-11-23 07:03:32,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:03:32,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:03:32,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:03:32,018 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:03:32,044 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:03:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:32,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 2852 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 07:03:32,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:03:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2023-11-23 07:03:32,527 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:03:32,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158778973] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:03:32,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:03:32,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2023-11-23 07:03:32,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112791619] [2023-11-23 07:03:32,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:03:32,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:03:32,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:03:32,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:03:32,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:03:32,530 INFO L87 Difference]: Start difference. First operand 136 states and 191 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-23 07:03:33,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:03:33,131 INFO L93 Difference]: Finished difference Result 224 states and 317 transitions. [2023-11-23 07:03:33,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:03:33,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 112 [2023-11-23 07:03:33,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:03:33,132 INFO L225 Difference]: With dead ends: 224 [2023-11-23 07:03:33,133 INFO L226 Difference]: Without dead ends: 136 [2023-11-23 07:03:33,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-11-23 07:03:33,134 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 68 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 07:03:33,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 800 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 07:03:33,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-23 07:03:33,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-11-23 07:03:33,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 46 states have call successors, (46), 11 states have call predecessors, (46), 12 states have return successors, (49), 45 states have call predecessors, (49), 45 states have call successors, (49) [2023-11-23 07:03:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2023-11-23 07:03:33,153 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 112 [2023-11-23 07:03:33,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:03:33,153 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2023-11-23 07:03:33,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-23 07:03:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2023-11-23 07:03:33,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-23 07:03:33,155 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:03:33,155 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:03:33,172 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:03:33,369 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:03:33,370 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:03:33,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:03:33,370 INFO L85 PathProgramCache]: Analyzing trace with hash 92036872, now seen corresponding path program 2 times [2023-11-23 07:03:33,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:03:33,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098946884] [2023-11-23 07:03:33,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:03:33,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:03:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:33,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:03:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:33,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 07:03:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:33,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:03:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:33,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:03:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:33,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 07:03:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:33,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:03:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:33,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:03:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:33,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:03:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:34,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:03:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:34,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:03:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:34,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 07:03:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:34,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 07:03:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:34,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 07:03:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:34,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 07:03:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:34,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 07:03:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:34,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 07:03:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:34,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 07:03:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:34,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 07:03:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:34,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 07:03:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:34,110 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2023-11-23 07:03:34,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:03:34,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098946884] [2023-11-23 07:03:34,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098946884] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:03:34,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825428858] [2023-11-23 07:03:34,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 07:03:34,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:03:34,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:03:34,112 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:03:34,136 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:03:34,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-23 07:03:34,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 07:03:34,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 2300 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-23 07:03:34,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:03:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2023-11-23 07:03:34,554 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:03:34,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825428858] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:03:34,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:03:34,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2023-11-23 07:03:34,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006598861] [2023-11-23 07:03:34,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:03:34,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 07:03:34,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:03:34,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 07:03:34,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2023-11-23 07:03:34,556 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand has 8 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-23 07:03:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:03:35,441 INFO L93 Difference]: Finished difference Result 147 states and 207 transitions. [2023-11-23 07:03:35,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 07:03:35,442 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 116 [2023-11-23 07:03:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:03:35,443 INFO L225 Difference]: With dead ends: 147 [2023-11-23 07:03:35,443 INFO L226 Difference]: Without dead ends: 145 [2023-11-23 07:03:35,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:03:35,444 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 17 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 07:03:35,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1198 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-23 07:03:35,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-23 07:03:35,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2023-11-23 07:03:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 82 states have (on average 1.2073170731707317) internal successors, (99), 85 states have internal predecessors, (99), 47 states have call successors, (47), 12 states have call predecessors, (47), 14 states have return successors, (58), 46 states have call predecessors, (58), 46 states have call successors, (58) [2023-11-23 07:03:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 204 transitions. [2023-11-23 07:03:35,457 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 204 transitions. Word has length 116 [2023-11-23 07:03:35,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:03:35,457 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 204 transitions. [2023-11-23 07:03:35,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-23 07:03:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 204 transitions. [2023-11-23 07:03:35,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-23 07:03:35,458 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:03:35,458 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:03:35,475 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:03:35,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:03:35,665 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:03:35,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:03:35,667 INFO L85 PathProgramCache]: Analyzing trace with hash 812288832, now seen corresponding path program 1 times [2023-11-23 07:03:35,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:03:35,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847218967] [2023-11-23 07:03:35,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:03:35,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:03:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:36,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:03:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:36,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 07:03:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:36,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:03:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:36,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:03:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:36,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 07:03:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:36,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:03:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:36,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:03:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:36,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:03:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:36,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:03:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:36,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:03:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:36,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 07:03:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:36,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 07:03:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:36,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 07:03:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:36,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 07:03:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:36,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 07:03:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:36,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 07:03:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:36,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 07:03:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:36,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 07:03:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:36,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 07:03:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:36,379 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2023-11-23 07:03:36,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:03:36,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847218967] [2023-11-23 07:03:36,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847218967] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:03:36,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992367417] [2023-11-23 07:03:36,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:03:36,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:03:36,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:03:36,392 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:03:36,416 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:03:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:36,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 2874 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 07:03:36,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:03:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-11-23 07:03:36,963 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:03:36,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992367417] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:03:36,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:03:36,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2023-11-23 07:03:36,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703287821] [2023-11-23 07:03:36,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:03:36,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:03:36,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:03:36,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:03:36,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:03:36,966 INFO L87 Difference]: Start difference. First operand 144 states and 204 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-23 07:03:37,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:03:37,627 INFO L93 Difference]: Finished difference Result 283 states and 410 transitions. [2023-11-23 07:03:37,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:03:37,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 120 [2023-11-23 07:03:37,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:03:37,632 INFO L225 Difference]: With dead ends: 283 [2023-11-23 07:03:37,632 INFO L226 Difference]: Without dead ends: 171 [2023-11-23 07:03:37,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-11-23 07:03:37,634 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 67 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 07:03:37,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 732 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 07:03:37,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-11-23 07:03:37,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2023-11-23 07:03:37,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 95 states have (on average 1.2105263157894737) internal successors, (115), 98 states have internal predecessors, (115), 60 states have call successors, (60), 13 states have call predecessors, (60), 15 states have return successors, (73), 59 states have call predecessors, (73), 59 states have call successors, (73) [2023-11-23 07:03:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 248 transitions. [2023-11-23 07:03:37,663 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 248 transitions. Word has length 120 [2023-11-23 07:03:37,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:03:37,663 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 248 transitions. [2023-11-23 07:03:37,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-23 07:03:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 248 transitions. [2023-11-23 07:03:37,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-23 07:03:37,666 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:03:37,667 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:03:37,685 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:03:37,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:03:37,883 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:03:37,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:03:37,884 INFO L85 PathProgramCache]: Analyzing trace with hash -192731525, now seen corresponding path program 1 times [2023-11-23 07:03:37,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:03:37,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608042838] [2023-11-23 07:03:37,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:03:37,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:03:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:40,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:03:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:40,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 07:03:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:40,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:03:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:40,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:03:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:40,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 07:03:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:40,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:03:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:40,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:03:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:40,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:03:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:40,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:03:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:40,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:03:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:40,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 07:03:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:40,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 07:03:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:40,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 07:03:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:40,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 07:03:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:40,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 07:03:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:40,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 07:03:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:40,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-23 07:03:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:40,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-23 07:03:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:40,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-23 07:03:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:40,955 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-11-23 07:03:40,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:03:40,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608042838] [2023-11-23 07:03:40,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608042838] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:03:40,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155832466] [2023-11-23 07:03:40,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:03:40,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:03:40,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:03:40,957 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:03:40,982 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:03:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:03:41,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 2879 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-23 07:03:41,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:03:41,417 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 10 treesize of output 8 [2023-11-23 07:03:41,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2023-11-23 07:03:43,691 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_2| Int) (|v_aws_byte_cursor_compare_lexical_~rhs#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_int#4| |v_aws_byte_cursor_compare_lexical_~rhs#1.base_BEFORE_CALL_4|) 0) (select (select |c_#memory_int#4| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_2|) 0)) (not (= |v_aws_byte_cursor_compare_lexical_~rhs#1.base_BEFORE_CALL_4| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_2|)))) is different from true [2023-11-23 07:03:45,769 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_3| Int) (|v_aws_byte_cursor_compare_lexical_~rhs#1.base_BEFORE_CALL_5| Int)) (and (= (select (select |c_#memory_int#4| |v_aws_byte_cursor_compare_lexical_~rhs#1.base_BEFORE_CALL_5|) 0) (select (select |c_#memory_int#4| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_3|) 0)) (not (= |v_aws_byte_cursor_compare_lexical_~rhs#1.base_BEFORE_CALL_5| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_3|)))) is different from true [2023-11-23 07:03:47,859 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_4| Int) (|v_aws_byte_cursor_compare_lexical_~rhs#1.base_BEFORE_CALL_6| Int)) (and (= (select (select |c_#memory_int#4| |v_aws_byte_cursor_compare_lexical_~rhs#1.base_BEFORE_CALL_6|) 0) (select (select |c_#memory_int#4| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_4|) 0)) (not (= |v_aws_byte_cursor_compare_lexical_~rhs#1.base_BEFORE_CALL_6| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_4|)))) is different from true [2023-11-23 07:03:48,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:03:48,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 47 [2023-11-23 07:03:48,766 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 18 not checked. [2023-11-23 07:03:48,766 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:03:51,672 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 07:03:51,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 58 [2023-11-23 07:03:51,696 INFO L349 Elim1Store]: treesize reduction 43, result has 23.2 percent of original size [2023-11-23 07:03:51,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 25 [2023-11-23 07:03:51,700 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:03:51,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 40 treesize of output 30 [2023-11-23 07:03:51,797 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2023-11-23 07:03:51,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155832466] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:03:51,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:03:51,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 12] total 40 [2023-11-23 07:03:51,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313413903] [2023-11-23 07:03:51,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:03:51,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-23 07:03:51,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:03:51,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-23 07:03:51,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1222, Unknown=4, NotChecked=216, Total=1560 [2023-11-23 07:03:51,800 INFO L87 Difference]: Start difference. First operand 171 states and 248 transitions. Second operand has 40 states, 37 states have (on average 2.918918918918919) internal successors, (108), 34 states have internal predecessors, (108), 16 states have call successors, (53), 13 states have call predecessors, (53), 11 states have return successors, (49), 13 states have call predecessors, (49), 16 states have call successors, (49) [2023-11-23 07:04:35,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-23 07:04:51,112 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:04:53,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:04:53,829 INFO L93 Difference]: Finished difference Result 781 states and 1202 transitions. [2023-11-23 07:04:53,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-11-23 07:04:53,830 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 2.918918918918919) internal successors, (108), 34 states have internal predecessors, (108), 16 states have call successors, (53), 13 states have call predecessors, (53), 11 states have return successors, (49), 13 states have call predecessors, (49), 16 states have call successors, (49) Word has length 122 [2023-11-23 07:04:53,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:04:53,834 INFO L225 Difference]: With dead ends: 781 [2023-11-23 07:04:53,834 INFO L226 Difference]: Without dead ends: 654 [2023-11-23 07:04:53,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 252 SyntacticMatches, 22 SemanticMatches, 100 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3058 ImplicationChecksByTransitivity, 39.6s TimeCoverageRelationStatistics Valid=966, Invalid=8719, Unknown=29, NotChecked=588, Total=10302 [2023-11-23 07:04:53,843 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 1210 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 4671 mSolverCounterSat, 1026 mSolverCounterUnsat, 154 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 8722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1026 IncrementalHoareTripleChecker+Valid, 4671 IncrementalHoareTripleChecker+Invalid, 154 IncrementalHoareTripleChecker+Unknown, 2871 IncrementalHoareTripleChecker+Unchecked, 31.7s IncrementalHoareTripleChecker+Time [2023-11-23 07:04:53,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 1031 Invalid, 8722 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1026 Valid, 4671 Invalid, 154 Unknown, 2871 Unchecked, 31.7s Time] [2023-11-23 07:04:53,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2023-11-23 07:04:53,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 524. [2023-11-23 07:04:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 298 states have (on average 1.2013422818791946) internal successors, (358), 306 states have internal predecessors, (358), 189 states have call successors, (189), 29 states have call predecessors, (189), 36 states have return successors, (233), 188 states have call predecessors, (233), 187 states have call successors, (233) [2023-11-23 07:04:53,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 780 transitions. [2023-11-23 07:04:53,942 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 780 transitions. Word has length 122 [2023-11-23 07:04:53,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:04:53,943 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 780 transitions. [2023-11-23 07:04:53,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 2.918918918918919) internal successors, (108), 34 states have internal predecessors, (108), 16 states have call successors, (53), 13 states have call predecessors, (53), 11 states have return successors, (49), 13 states have call predecessors, (49), 16 states have call successors, (49) [2023-11-23 07:04:53,943 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 780 transitions. [2023-11-23 07:04:53,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-23 07:04:53,947 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:04:53,947 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:04:53,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-23 07:04:54,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:04:54,160 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:04:54,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:04:54,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1302041163, now seen corresponding path program 1 times [2023-11-23 07:04:54,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:04:54,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238491180] [2023-11-23 07:04:54,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:04:54,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:04:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:54,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:04:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:54,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 07:04:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:54,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:04:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:54,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:04:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:54,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 07:04:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:54,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:04:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:54,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:04:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:54,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:04:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:55,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:04:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:55,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:04:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:55,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 07:04:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:55,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 07:04:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:55,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 07:04:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:55,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 07:04:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:55,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 07:04:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:55,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 07:04:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:55,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-23 07:04:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:55,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-23 07:04:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:55,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-23 07:04:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:55,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-23 07:04:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:55,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-23 07:04:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:55,151 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2023-11-23 07:04:55,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:04:55,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238491180] [2023-11-23 07:04:55,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238491180] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:04:55,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:04:55,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 07:04:55,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372619889] [2023-11-23 07:04:55,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:04:55,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:04:55,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:04:55,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:04:55,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:04:55,154 INFO L87 Difference]: Start difference. First operand 524 states and 780 transitions. Second operand has 10 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-23 07:04:57,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:04:57,808 INFO L93 Difference]: Finished difference Result 543 states and 802 transitions. [2023-11-23 07:04:57,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:04:57,809 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 131 [2023-11-23 07:04:57,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:04:57,817 INFO L225 Difference]: With dead ends: 543 [2023-11-23 07:04:57,817 INFO L226 Difference]: Without dead ends: 541 [2023-11-23 07:04:57,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-11-23 07:04:57,819 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 89 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-23 07:04:57,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 555 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-23 07:04:57,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2023-11-23 07:04:57,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 536. [2023-11-23 07:04:57,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 304 states have (on average 1.1973684210526316) internal successors, (364), 312 states have internal predecessors, (364), 193 states have call successors, (193), 31 states have call predecessors, (193), 38 states have return successors, (237), 192 states have call predecessors, (237), 191 states have call successors, (237) [2023-11-23 07:04:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 794 transitions. [2023-11-23 07:04:57,919 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 794 transitions. Word has length 131 [2023-11-23 07:04:57,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:04:57,920 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 794 transitions. [2023-11-23 07:04:57,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-23 07:04:57,920 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 794 transitions. [2023-11-23 07:04:57,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-23 07:04:57,927 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:04:57,928 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:04:57,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 07:04:57,928 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:04:57,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:04:57,928 INFO L85 PathProgramCache]: Analyzing trace with hash 729824234, now seen corresponding path program 1 times [2023-11-23 07:04:57,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:04:57,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040155534] [2023-11-23 07:04:57,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:04:57,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:04:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:04:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 07:04:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:04:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:04:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 07:04:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:04:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:04:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:04:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:04:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:04:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-23 07:04:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:04:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:04:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:04:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:04:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 07:04:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 07:04:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 07:04:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:04:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 07:04:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 07:04:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 07:04:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 07:04:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:04:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2023-11-23 07:04:58,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:04:58,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040155534] [2023-11-23 07:04:58,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040155534] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:04:58,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:04:58,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 07:04:58,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547591967] [2023-11-23 07:04:58,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:04:58,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:04:58,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:04:58,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:04:58,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 07:04:58,763 INFO L87 Difference]: Start difference. First operand 536 states and 794 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-23 07:05:00,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:05:00,256 INFO L93 Difference]: Finished difference Result 867 states and 1273 transitions. [2023-11-23 07:05:00,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 07:05:00,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) Word has length 142 [2023-11-23 07:05:00,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:05:00,260 INFO L225 Difference]: With dead ends: 867 [2023-11-23 07:05:00,260 INFO L226 Difference]: Without dead ends: 559 [2023-11-23 07:05:00,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-23 07:05:00,262 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 71 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:05:00,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 270 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-23 07:05:00,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2023-11-23 07:05:00,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 552. [2023-11-23 07:05:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 316 states have (on average 1.1898734177215189) internal successors, (376), 324 states have internal predecessors, (376), 193 states have call successors, (193), 31 states have call predecessors, (193), 42 states have return successors, (241), 196 states have call predecessors, (241), 191 states have call successors, (241) [2023-11-23 07:05:00,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 810 transitions. [2023-11-23 07:05:00,337 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 810 transitions. Word has length 142 [2023-11-23 07:05:00,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:05:00,337 INFO L495 AbstractCegarLoop]: Abstraction has 552 states and 810 transitions. [2023-11-23 07:05:00,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-23 07:05:00,338 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 810 transitions. [2023-11-23 07:05:00,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-23 07:05:00,339 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:05:00,339 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:05:00,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 07:05:00,340 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:05:00,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:05:00,340 INFO L85 PathProgramCache]: Analyzing trace with hash -539174541, now seen corresponding path program 1 times [2023-11-23 07:05:00,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:05:00,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627442305] [2023-11-23 07:05:00,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:05:00,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:05:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:05:03,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:05:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:05:03,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 07:05:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:05:03,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 07:05:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:05:03,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:05:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:05:03,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 07:05:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:05:03,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:05:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:05:03,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:05:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:05:03,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 07:05:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:05:03,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:05:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:05:03,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 07:05:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:05:03,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:05:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:05:03,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 07:05:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:05:03,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 07:05:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:05:03,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-23 07:05:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:05:04,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 07:05:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:05:04,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-23 07:05:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:05:04,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 07:05:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:05:04,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-23 07:05:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:05:04,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-23 07:05:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:05:04,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-23 07:05:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:05:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2023-11-23 07:05:04,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:05:04,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627442305] [2023-11-23 07:05:04,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627442305] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:05:04,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326594854] [2023-11-23 07:05:04,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:05:04,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:05:04,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:05:04,113 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:05:04,114 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:05:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:05:04,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 2960 conjuncts, 76 conjunts are in the unsatisfiable core [2023-11-23 07:05:04,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:05:04,627 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 10 treesize of output 8 [2023-11-23 07:05:04,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2023-11-23 07:05:04,689 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 0 case distinctions, treesize of input 14 treesize of output 13 [2023-11-23 07:05:04,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2023-11-23 07:05:04,706 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 0 case distinctions, treesize of input 14 treesize of output 13 [2023-11-23 07:05:07,201 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_14| Int) (|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#4.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_14|) 8)) (.cse0 (+ 8 |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse0) .cse1) (not (= |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_14| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|)) (not (= .cse1 0)) (= (select (select |c_#memory_$Pointer$#4.offset| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_14|) 8) (select (select |c_#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse0))))) (exists ((|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_14| Int) (|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#4.offset| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_14|) 8)) (.cse2 (+ 8 |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse2) (select (select |c_#memory_$Pointer$#4.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_14|) 8)) (not (= |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_14| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|)) (not (= .cse3 0)) (= .cse3 (select (select |c_#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse2)))))) is different from true [2023-11-23 07:05:09,529 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_15| Int) (|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| Int)) (let ((.cse0 (+ 8 |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#4.offset| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_15|) 8))) (and (= (select (select |c_#memory_$Pointer$#4.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_15|) 8) (select (select |c_#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse0)) (not (= .cse1 0)) (not (= |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_15| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|)) (= (select (select |c_#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse0) .cse1)))) (exists ((|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_15| Int) (|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#4.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_15|) 8)) (.cse3 (+ 8 |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset|))) (and (= .cse2 (select (select |c_#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse3)) (not (= |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_15| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|)) (not (= .cse2 0)) (= (select (select |c_#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse3) (select (select |c_#memory_$Pointer$#4.offset| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_15|) 8)))))) is different from true [2023-11-23 07:05:11,707 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_16| Int) (|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| Int)) (let ((.cse0 (+ 8 |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#4.offset| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_16|) 8))) (and (= (select (select |c_#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse0) (select (select |c_#memory_$Pointer$#4.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_16|) 8)) (= (select (select |c_#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse0) .cse1) (not (= .cse1 0)) (not (= |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_16| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|))))) (exists ((|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_16| Int) (|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| Int)) (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#4.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_16|) 8))) (and (= (select (select |c_#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse2) .cse3) (= (select (select |c_#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse2) (select (select |c_#memory_$Pointer$#4.offset| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_16|) 8)) (not (= .cse3 0)) (not (= |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_16| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|)))))) is different from true [2023-11-23 07:05:13,988 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_17| Int) (|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| Int)) (let ((.cse1 (+ 8 |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#4.offset| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_17|) 8))) (and (not (= 0 .cse0)) (= (select (select |c_#memory_$Pointer$#4.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_17|) 8) (select (select |c_#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse1)) (= (select (select |c_#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse1) .cse0) (not (= |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_17| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|))))) (exists ((|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_17| Int) (|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| Int)) (let ((.cse3 (+ 8 |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#4.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_17|) 8))) (and (= .cse2 (select (select |c_#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse3)) (= (select (select |c_#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse3) (select (select |c_#memory_$Pointer$#4.offset| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_17|) 8)) (not (= .cse2 0)) (not (= |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_17| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|)))))) is different from true [2023-11-23 07:05:16,177 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| Int) (|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_18| Int)) (let ((.cse0 (+ 8 |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#4.offset| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_18|) 8))) (and (= (select (select |c_#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse0) .cse1) (= (select (select |c_#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse0) (select (select |c_#memory_$Pointer$#4.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_18|) 8)) (not (= |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_18| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|)) (not (= .cse1 0))))) (exists ((|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| Int) (|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_18| Int)) (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#4.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_18|) 8))) (and (= (select (select |c_#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse2) (select (select |c_#memory_$Pointer$#4.offset| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_18|) 8)) (= (select (select |c_#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse2) .cse3) (not (= .cse3 0)) (not (= |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_18| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|)))))) is different from true [2023-11-23 07:05:18,380 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| Int) (|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_19| Int)) (let ((.cse0 (+ 8 |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#4.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_19|) 8))) (and (= (select (select |c_#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse0) (select (select |c_#memory_$Pointer$#4.offset| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_19|) 8)) (not (= |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_19| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|)) (= (select (select |c_#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse0) .cse1) (not (= .cse1 0))))) (exists ((|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| Int) (|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_19| Int)) (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#4.offset| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_19|) 8))) (and (= (select (select |c_#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse2) .cse3) (not (= |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_19| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|)) (= (select (select |c_#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse2) (select (select |c_#memory_$Pointer$#4.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_19|) 8)) (not (= .cse3 0)))))) is different from true [2023-11-23 07:05:20,589 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_20| Int) (|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| Int)) (let ((.cse1 (+ 8 |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#4.offset| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_20|) 8))) (and (not (= |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_20| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|)) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#4.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_20|) 8) (select (select |c_#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse1)) (= (select (select |c_#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse1) .cse0)))) (exists ((|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_20| Int) (|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#4.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_20|) 8)) (.cse3 (+ 8 |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset|))) (and (not (= .cse2 0)) (not (= |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_20| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|)) (= .cse2 (select (select |c_#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse3)) (= (select (select |c_#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse3) (select (select |c_#memory_$Pointer$#4.offset| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_20|) 8)))))) is different from true [2023-11-23 07:05:22,762 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_21| Int) (|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| Int)) (let ((.cse1 (+ 8 |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#4.offset| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_21|) 8))) (and (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#4.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_21|) 8) (select (select |c_#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse1)) (not (= |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_21| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|)) (= (select (select |c_#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse1) .cse0)))) (exists ((|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_21| Int) (|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| Int)) (let ((.cse3 (+ 8 |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#4.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_21|) 8))) (and (= .cse2 (select (select |c_#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse3)) (not (= |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_21| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|)) (= (select (select |c_#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse3) (select (select |c_#memory_$Pointer$#4.offset| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_21|) 8)) (not (= .cse2 0)))))) is different from true [2023-11-23 07:05:24,945 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_22| Int) (|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| Int)) (let ((.cse0 (+ 8 |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#4.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_22|) 8))) (and (= (select (select |c_#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse0) (select (select |c_#memory_$Pointer$#4.offset| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_22|) 8)) (= .cse1 (select (select |c_#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse0)) (not (= .cse1 0)) (not (= |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_22| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|))))) (exists ((|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_22| Int) (|ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset| Int)) (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#4.offset| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_22|) 8))) (and (= (select (select |c_#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse2) .cse3) (= (select (select |c_#memory_$Pointer$#4.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_22|) 8) (select (select |c_#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|) .cse2)) (not (= |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_22| |ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#rhs~0#1.base|)) (not (= .cse3 0)))))) is different from true [2023-11-23 07:05:31,745 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 126 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 90 not checked. [2023-11-23 07:05:31,745 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:05:32,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326594854] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:05:32,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:05:32,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 26] total 43 [2023-11-23 07:05:32,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99123141] [2023-11-23 07:05:32,837 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 07:05:32,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-23 07:05:32,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:05:32,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-23 07:05:32,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1755, Unknown=13, NotChecked=828, Total=2756 [2023-11-23 07:05:32,839 INFO L87 Difference]: Start difference. First operand 552 states and 810 transitions. Second operand has 43 states, 39 states have (on average 3.1025641025641026) internal successors, (121), 36 states have internal predecessors, (121), 14 states have call successors, (42), 16 states have call predecessors, (42), 15 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) [2023-11-23 07:05:48,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:05:50,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:05:52,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:05:53,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:05:55,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:05:56,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:05:57,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:05:58,602 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:05:59,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:06:00,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:06:01,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:06:04,838 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:06:06,846 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:06:09,377 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] Killed by 15