./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_byte_cursor_advance_harness.i --full-output --preprocessor.use.memory.slicer false --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_advance_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 f26a5d85d152e590b5f8a93f229efbb28bdd5e77c34d7106bb5825fc4b732cf6 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:23:39,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:23:39,735 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 08:23:39,746 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:23:39,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:23:39,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:23:39,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:23:39,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:23:39,777 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:23:39,780 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:23:39,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:23:39,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:23:39,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:23:39,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:23:39,782 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:23:39,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:23:39,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:23:39,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 08:23:39,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:23:39,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:23:39,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:23:39,784 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:23:39,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:23:39,785 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:23:39,785 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:23:39,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:23:39,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:23:39,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:23:39,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:23:39,786 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:23:39,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:23:39,787 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:23:39,787 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 08:23:39,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 08:23:39,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:23:39,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:23:39,788 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:23:39,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:23:39,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:23:39,789 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 -> f26a5d85d152e590b5f8a93f229efbb28bdd5e77c34d7106bb5825fc4b732cf6 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:23:39,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:23:40,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:23:40,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:23:40,022 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:23:40,022 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:23:40,023 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_advance_harness.i [2023-11-23 08:23:40,972 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:23:41,502 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:23:41,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_cursor_advance_harness.i [2023-11-23 08:23:41,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e08d564/b33a756349d9477d9e1dcd4657666f49/FLAGd7c3a895e [2023-11-23 08:23:41,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e08d564/b33a756349d9477d9e1dcd4657666f49 [2023-11-23 08:23:41,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:23:41,560 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:23:41,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:23:41,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:23:41,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:23:41,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:23:41" (1/1) ... [2023-11-23 08:23:41,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e13aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:23:41, skipping insertion in model container [2023-11-23 08:23:41,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:23:41" (1/1) ... [2023-11-23 08:23:41,642 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:23:41,915 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_advance_harness.i[4497,4510] [2023-11-23 08:23:41,922 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_advance_harness.i[4557,4570] [2023-11-23 08:23:42,422 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:23:42,426 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:23:42,427 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:23:42,433 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:23:42,434 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:23:42,446 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:23:42,447 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:23:42,448 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:23:42,448 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:23:42,681 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:23:42,682 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:23:42,683 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:23:42,684 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:23:42,684 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:23:42,685 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:23:42,685 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:23:42,686 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:23:42,687 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:23:42,687 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:23:42,889 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:23:42,889 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:23:42,945 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:23:42,994 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:23:43,010 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_advance_harness.i[4497,4510] [2023-11-23 08:23:43,011 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_advance_harness.i[4557,4570] [2023-11-23 08:23:43,039 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:23:43,039 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:23:43,039 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:23:43,040 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:23:43,040 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:23:43,048 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:23:43,049 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:23:43,054 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:23:43,055 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:23:43,079 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:23:43,080 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:23:43,080 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:23:43,080 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:23:43,081 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:23:43,081 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:23:43,082 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:23:43,083 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:23:43,084 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:23:43,084 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:23:43,136 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8269] [2023-11-23 08:23:43,138 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:23:43,138 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:23:43,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8755-8766] [2023-11-23 08:23:43,166 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:23:43,390 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:23:43,391 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:23:43,391 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:23:43,391 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:23:43,391 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:23:43,391 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:23:43,392 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:23:43,392 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:23:43,392 WARN L675 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:23:43,392 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:23:43,392 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:23:43,392 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:23:43,392 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:23:43,393 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:23:43,393 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:23:43,393 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:23:43,393 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:23:43,393 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:23:43,399 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:23:43,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:23:43 WrapperNode [2023-11-23 08:23:43,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:23:43,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:23:43,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:23:43,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:23:43,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:23:43" (1/1) ... [2023-11-23 08:23:43,483 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:23:43" (1/1) ... [2023-11-23 08:23:43,544 INFO L138 Inliner]: procedures = 689, calls = 2645, calls flagged for inlining = 60, calls inlined = 7, statements flattened = 883 [2023-11-23 08:23:43,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:23:43,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:23:43,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:23:43,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:23:43,552 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:23:43" (1/1) ... [2023-11-23 08:23:43,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:23:43" (1/1) ... [2023-11-23 08:23:43,561 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:23:43" (1/1) ... [2023-11-23 08:23:43,561 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:23:43" (1/1) ... [2023-11-23 08:23:43,619 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:23:43" (1/1) ... [2023-11-23 08:23:43,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:23:43" (1/1) ... [2023-11-23 08:23:43,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:23:43" (1/1) ... [2023-11-23 08:23:43,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:23:43" (1/1) ... [2023-11-23 08:23:43,651 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:23:43,652 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:23:43,652 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:23:43,652 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:23:43,653 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:23:43" (1/1) ... [2023-11-23 08:23:43,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:23:43,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:23:43,686 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 08:23:43,692 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 08:23:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2023-11-23 08:23:43,722 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2023-11-23 08:23:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:23:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2023-11-23 08:23:43,723 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2023-11-23 08:23:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 08:23:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:23:43,724 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:23:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:23:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:23:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:23:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:23:43,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:23:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-23 08:23:43,725 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-23 08:23:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2023-11-23 08:23:43,725 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2023-11-23 08:23:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:23:43,726 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:23:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:23:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:23:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:23:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 08:23:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:23:43,934 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:23:43,936 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:23:44,509 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:23:44,623 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:23:44,623 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 08:23:44,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:23:44 BoogieIcfgContainer [2023-11-23 08:23:44,624 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:23:44,626 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:23:44,626 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:23:44,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:23:44,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:23:41" (1/3) ... [2023-11-23 08:23:44,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408f519e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:23:44, skipping insertion in model container [2023-11-23 08:23:44,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:23:43" (2/3) ... [2023-11-23 08:23:44,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408f519e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:23:44, skipping insertion in model container [2023-11-23 08:23:44,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:23:44" (3/3) ... [2023-11-23 08:23:44,632 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_advance_harness.i [2023-11-23 08:23:44,645 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:23:44,646 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:23:44,685 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:23:44,693 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;@4a656c47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:23:44,693 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:23:44,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 50 states have (on average 1.32) internal successors, (66), 51 states have internal predecessors, (66), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 08:23:44,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-23 08:23:44,704 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:23:44,704 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:23:44,705 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:23:44,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:23:44,710 INFO L85 PathProgramCache]: Analyzing trace with hash -450223570, now seen corresponding path program 1 times [2023-11-23 08:23:44,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:23:44,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514866620] [2023-11-23 08:23:44,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:23:44,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:23:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:45,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:23:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:45,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:23:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:45,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:23:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:45,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 08:23:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:45,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 08:23:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:45,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:23:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:45,477 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 08:23:45,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:23:45,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514866620] [2023-11-23 08:23:45,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514866620] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:23:45,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532283493] [2023-11-23 08:23:45,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:23:45,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:23:45,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:23:45,481 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 08:23:45,494 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 08:23:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:45,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 2474 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-23 08:23:45,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:23:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 08:23:45,922 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:23:45,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532283493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:23:45,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:23:45,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2023-11-23 08:23:45,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877640406] [2023-11-23 08:23:45,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:23:45,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 08:23:45,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:23:45,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 08:23:45,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:23:45,952 INFO L87 Difference]: Start difference. First operand has 80 states, 50 states have (on average 1.32) internal successors, (66), 51 states have internal predecessors, (66), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 08:23:46,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:23:46,038 INFO L93 Difference]: Finished difference Result 152 states and 225 transitions. [2023-11-23 08:23:46,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 08:23:46,041 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2023-11-23 08:23:46,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:23:46,054 INFO L225 Difference]: With dead ends: 152 [2023-11-23 08:23:46,064 INFO L226 Difference]: Without dead ends: 73 [2023-11-23 08:23:46,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:23:46,069 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:23:46,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:23:46,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-23 08:23:46,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-11-23 08:23:46,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 47 states have internal predecessors, (57), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-23 08:23:46,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 98 transitions. [2023-11-23 08:23:46,098 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 98 transitions. Word has length 41 [2023-11-23 08:23:46,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:23:46,098 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 98 transitions. [2023-11-23 08:23:46,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 08:23:46,099 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2023-11-23 08:23:46,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-23 08:23:46,101 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:23:46,101 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:23:46,119 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 08:23:46,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-23 08:23:46,315 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:23:46,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:23:46,316 INFO L85 PathProgramCache]: Analyzing trace with hash 2055406958, now seen corresponding path program 1 times [2023-11-23 08:23:46,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:23:46,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358526513] [2023-11-23 08:23:46,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:23:46,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:23:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:46,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:23:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:46,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:23:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:46,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:23:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:46,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 08:23:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:46,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 08:23:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:46,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:23:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:46,673 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 08:23:46,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:23:46,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358526513] [2023-11-23 08:23:46,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358526513] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:23:46,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65993051] [2023-11-23 08:23:46,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:23:46,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:23:46,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:23:46,675 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 08:23:46,700 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 08:23:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:47,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 2474 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 08:23:47,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:23:47,147 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-23 08:23:47,147 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:23:47,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65993051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:23:47,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:23:47,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-11-23 08:23:47,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467303451] [2023-11-23 08:23:47,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:23:47,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:23:47,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:23:47,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:23:47,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:23:47,150 INFO L87 Difference]: Start difference. First operand 73 states and 98 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 08:23:47,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:23:47,257 INFO L93 Difference]: Finished difference Result 135 states and 186 transitions. [2023-11-23 08:23:47,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:23:47,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2023-11-23 08:23:47,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:23:47,259 INFO L225 Difference]: With dead ends: 135 [2023-11-23 08:23:47,260 INFO L226 Difference]: Without dead ends: 75 [2023-11-23 08:23:47,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:23:47,261 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 37 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:23:47,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 200 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:23:47,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-23 08:23:47,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-11-23 08:23:47,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 49 states have internal predecessors, (58), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2023-11-23 08:23:47,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2023-11-23 08:23:47,279 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 103 transitions. Word has length 41 [2023-11-23 08:23:47,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:23:47,279 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 103 transitions. [2023-11-23 08:23:47,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 08:23:47,281 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 103 transitions. [2023-11-23 08:23:47,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-23 08:23:47,283 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:23:47,283 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:23:47,303 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 08:23:47,496 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,SelfDestructingSolverStorable1 [2023-11-23 08:23:47,496 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:23:47,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:23:47,497 INFO L85 PathProgramCache]: Analyzing trace with hash 556167593, now seen corresponding path program 1 times [2023-11-23 08:23:47,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:23:47,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550036415] [2023-11-23 08:23:47,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:23:47,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:23:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:47,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:23:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:47,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:23:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:47,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:23:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:47,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:23:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:48,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:23:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:48,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:23:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:48,047 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 08:23:48,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:23:48,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550036415] [2023-11-23 08:23:48,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550036415] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:23:48,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48822059] [2023-11-23 08:23:48,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:23:48,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:23:48,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:23:48,064 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 08:23:48,128 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 08:23:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:48,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 2479 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 08:23:48,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:23:48,530 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 08:23:48,530 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:23:48,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48822059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:23:48,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:23:48,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-11-23 08:23:48,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293640953] [2023-11-23 08:23:48,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:23:48,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:23:48,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:23:48,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:23:48,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:23:48,532 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 08:23:48,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:23:48,741 INFO L93 Difference]: Finished difference Result 130 states and 178 transitions. [2023-11-23 08:23:48,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:23:48,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2023-11-23 08:23:48,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:23:48,742 INFO L225 Difference]: With dead ends: 130 [2023-11-23 08:23:48,742 INFO L226 Difference]: Without dead ends: 75 [2023-11-23 08:23:48,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-23 08:23:48,743 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 41 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:23:48,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 269 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:23:48,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-23 08:23:48,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-11-23 08:23:48,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 49 states have internal predecessors, (58), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2023-11-23 08:23:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 101 transitions. [2023-11-23 08:23:48,750 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 101 transitions. Word has length 43 [2023-11-23 08:23:48,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:23:48,750 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 101 transitions. [2023-11-23 08:23:48,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 08:23:48,750 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 101 transitions. [2023-11-23 08:23:48,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-23 08:23:48,751 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:23:48,751 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:23:48,767 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 08:23:48,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:23:48,965 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:23:48,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:23:48,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1353011831, now seen corresponding path program 1 times [2023-11-23 08:23:48,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:23:48,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429751633] [2023-11-23 08:23:48,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:23:48,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:23:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:49,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:23:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:49,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:23:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:49,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:23:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:49,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:23:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:49,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:23:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:49,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:23:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 08:23:49,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:23:49,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429751633] [2023-11-23 08:23:49,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429751633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:23:49,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:23:49,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 08:23:49,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833368115] [2023-11-23 08:23:49,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:23:49,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 08:23:49,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:23:49,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 08:23:49,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:23:49,508 INFO L87 Difference]: Start difference. First operand 75 states and 101 transitions. Second operand has 8 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-23 08:23:49,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:23:49,879 INFO L93 Difference]: Finished difference Result 86 states and 116 transitions. [2023-11-23 08:23:49,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:23:49,880 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 47 [2023-11-23 08:23:49,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:23:49,881 INFO L225 Difference]: With dead ends: 86 [2023-11-23 08:23:49,881 INFO L226 Difference]: Without dead ends: 84 [2023-11-23 08:23:49,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:23:49,882 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 17 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:23:49,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 594 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:23:49,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-23 08:23:49,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2023-11-23 08:23:49,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 55 states have internal predecessors, (63), 23 states have call successors, (23), 7 states have call predecessors, (23), 8 states have return successors, (27), 20 states have call predecessors, (27), 20 states have call successors, (27) [2023-11-23 08:23:49,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 113 transitions. [2023-11-23 08:23:49,893 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 113 transitions. Word has length 47 [2023-11-23 08:23:49,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:23:49,893 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 113 transitions. [2023-11-23 08:23:49,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-23 08:23:49,893 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 113 transitions. [2023-11-23 08:23:49,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-23 08:23:49,896 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:23:49,896 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-23 08:23:49,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 08:23:49,897 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:23:49,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:23:49,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1948743999, now seen corresponding path program 1 times [2023-11-23 08:23:49,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:23:49,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024864064] [2023-11-23 08:23:49,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:23:49,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:23:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:51,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:23:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:51,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:23:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:51,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:23:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:51,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:23:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:51,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:23:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:51,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:23:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-23 08:23:51,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:23:51,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024864064] [2023-11-23 08:23:51,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024864064] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:23:51,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775635174] [2023-11-23 08:23:51,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:23:51,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:23:51,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:23:51,999 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 08:23:52,022 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 08:23:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:52,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 2501 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-23 08:23:52,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:23:52,457 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 6 treesize of output 5 [2023-11-23 08:23:52,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:23:52,900 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2023-11-23 08:23:52,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 28 [2023-11-23 08:23:52,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:23:52,953 INFO L349 Elim1Store]: treesize reduction 92, result has 22.7 percent of original size [2023-11-23 08:23:52,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 34 treesize of output 39 [2023-11-23 08:23:52,997 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2023-11-23 08:23:52,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 28 [2023-11-23 08:23:53,272 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-23 08:23:53,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-11-23 08:23:53,314 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 18 treesize of output 13 [2023-11-23 08:23:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:23:53,541 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:23:53,693 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_295 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_ArrVal_295) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|))) (< .cse0 (+ (* 18446744073709551616 (div .cse0 18446744073709551616)) 1)))) is different from false [2023-11-23 08:23:53,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775635174] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:23:53,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:23:53,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 31 [2023-11-23 08:23:53,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646266053] [2023-11-23 08:23:53,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:23:53,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-23 08:23:53,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:23:53,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-23 08:23:53,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=983, Unknown=1, NotChecked=64, Total=1190 [2023-11-23 08:23:53,754 INFO L87 Difference]: Start difference. First operand 83 states and 113 transitions. Second operand has 31 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 30 states have internal predecessors, (66), 11 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (12), 7 states have call predecessors, (12), 10 states have call successors, (12) [2023-11-23 08:23:56,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:23:56,209 INFO L93 Difference]: Finished difference Result 301 states and 428 transitions. [2023-11-23 08:23:56,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-23 08:23:56,210 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 30 states have internal predecessors, (66), 11 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (12), 7 states have call predecessors, (12), 10 states have call successors, (12) Word has length 51 [2023-11-23 08:23:56,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:23:56,212 INFO L225 Difference]: With dead ends: 301 [2023-11-23 08:23:56,212 INFO L226 Difference]: Without dead ends: 230 [2023-11-23 08:23:56,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 59 SyntacticMatches, 9 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=544, Invalid=3619, Unknown=1, NotChecked=126, Total=4290 [2023-11-23 08:23:56,214 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 323 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-23 08:23:56,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 540 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-23 08:23:56,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-11-23 08:23:56,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 180. [2023-11-23 08:23:56,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 119 states have (on average 1.2521008403361344) internal successors, (149), 124 states have internal predecessors, (149), 45 states have call successors, (45), 16 states have call predecessors, (45), 15 states have return successors, (47), 39 states have call predecessors, (47), 39 states have call successors, (47) [2023-11-23 08:23:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 241 transitions. [2023-11-23 08:23:56,233 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 241 transitions. Word has length 51 [2023-11-23 08:23:56,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:23:56,233 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 241 transitions. [2023-11-23 08:23:56,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 30 states have internal predecessors, (66), 11 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (12), 7 states have call predecessors, (12), 10 states have call successors, (12) [2023-11-23 08:23:56,234 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 241 transitions. [2023-11-23 08:23:56,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-23 08:23:56,235 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:23:56,235 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-23 08:23:56,258 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 08:23:56,451 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 08:23:56,451 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:23:56,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:23:56,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1325154943, now seen corresponding path program 1 times [2023-11-23 08:23:56,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:23:56,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958228360] [2023-11-23 08:23:56,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:23:56,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:23:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:59,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:23:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:59,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:23:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:59,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:23:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:59,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:23:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:59,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:23:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:59,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:23:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:23:59,415 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-23 08:23:59,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:23:59,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958228360] [2023-11-23 08:23:59,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958228360] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:23:59,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155959365] [2023-11-23 08:23:59,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:23:59,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:23:59,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:23:59,417 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 08:23:59,436 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 08:24:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:00,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 2528 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-23 08:24:00,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:24:00,040 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 6 treesize of output 5 [2023-11-23 08:24:00,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 08:24:00,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:24:00,570 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2023-11-23 08:24:00,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 28 [2023-11-23 08:24:00,579 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 08:24:00,580 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 15 treesize of output 7 [2023-11-23 08:24:00,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:24:00,626 INFO L349 Elim1Store]: treesize reduction 92, result has 22.7 percent of original size [2023-11-23 08:24:00,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 34 treesize of output 39 [2023-11-23 08:24:00,643 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 08:24:00,643 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 15 treesize of output 7 [2023-11-23 08:24:00,719 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2023-11-23 08:24:00,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 28 [2023-11-23 08:24:01,014 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-23 08:24:01,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-11-23 08:24:01,119 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 22 treesize of output 7 [2023-11-23 08:24:01,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:24:01,127 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 40 treesize of output 30 [2023-11-23 08:24:01,136 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 0 case distinctions, treesize of input 29 treesize of output 17 [2023-11-23 08:24:01,532 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 08:24:01,532 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:24:01,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2023-11-23 08:24:01,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:24:01,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 82 [2023-11-23 08:24:01,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-23 08:24:01,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-23 08:24:02,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155959365] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:24:02,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:24:02,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 24] total 39 [2023-11-23 08:24:02,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448816939] [2023-11-23 08:24:02,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:24:02,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-23 08:24:02,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:24:02,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-23 08:24:02,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=2122, Unknown=3, NotChecked=0, Total=2352 [2023-11-23 08:24:02,186 INFO L87 Difference]: Start difference. First operand 180 states and 241 transitions. Second operand has 39 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 11 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (12), 7 states have call predecessors, (12), 10 states have call successors, (12) [2023-11-23 08:24:05,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:24:12,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:24:12,101 INFO L93 Difference]: Finished difference Result 470 states and 612 transitions. [2023-11-23 08:24:12,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-11-23 08:24:12,101 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 11 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (12), 7 states have call predecessors, (12), 10 states have call successors, (12) Word has length 51 [2023-11-23 08:24:12,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:24:12,104 INFO L225 Difference]: With dead ends: 470 [2023-11-23 08:24:12,104 INFO L226 Difference]: Without dead ends: 399 [2023-11-23 08:24:12,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4358 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1482, Invalid=11397, Unknown=3, NotChecked=0, Total=12882 [2023-11-23 08:24:12,107 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 607 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 2201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-11-23 08:24:12,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 788 Invalid, 2201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 1908 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-11-23 08:24:12,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2023-11-23 08:24:12,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 223. [2023-11-23 08:24:12,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 157 states have (on average 1.2420382165605095) internal successors, (195), 163 states have internal predecessors, (195), 41 states have call successors, (41), 23 states have call predecessors, (41), 24 states have return successors, (47), 36 states have call predecessors, (47), 38 states have call successors, (47) [2023-11-23 08:24:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 283 transitions. [2023-11-23 08:24:12,136 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 283 transitions. Word has length 51 [2023-11-23 08:24:12,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:24:12,136 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 283 transitions. [2023-11-23 08:24:12,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 11 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (12), 7 states have call predecessors, (12), 10 states have call successors, (12) [2023-11-23 08:24:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 283 transitions. [2023-11-23 08:24:12,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-23 08:24:12,139 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:24:12,139 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:24:12,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 08:24:12,355 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 08:24:12,355 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:24:12,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:24:12,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1573814535, now seen corresponding path program 2 times [2023-11-23 08:24:12,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:24:12,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498409973] [2023-11-23 08:24:12,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:24:12,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:24:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:12,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:24:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:12,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:24:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:12,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:24:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:12,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:24:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:12,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:24:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:12,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:24:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:12,841 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 08:24:12,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:24:12,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498409973] [2023-11-23 08:24:12,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498409973] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:24:12,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320556031] [2023-11-23 08:24:12,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 08:24:12,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:24:12,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:24:12,843 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 08:24:12,844 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 08:24:13,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 08:24:13,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 08:24:13,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 2513 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-23 08:24:13,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:24:13,242 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 08:24:13,243 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:24:13,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320556031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:24:13,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:24:13,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 10 [2023-11-23 08:24:13,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784583764] [2023-11-23 08:24:13,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:24:13,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 08:24:13,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:24:13,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 08:24:13,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:24:13,245 INFO L87 Difference]: Start difference. First operand 223 states and 283 transitions. Second operand has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 08:24:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:24:13,677 INFO L93 Difference]: Finished difference Result 357 states and 455 transitions. [2023-11-23 08:24:13,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:24:13,677 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 55 [2023-11-23 08:24:13,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:24:13,679 INFO L225 Difference]: With dead ends: 357 [2023-11-23 08:24:13,679 INFO L226 Difference]: Without dead ends: 246 [2023-11-23 08:24:13,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:24:13,680 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 13 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:24:13,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 676 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 08:24:13,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-11-23 08:24:13,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 231. [2023-11-23 08:24:13,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 163 states have (on average 1.2331288343558282) internal successors, (201), 171 states have internal predecessors, (201), 41 states have call successors, (41), 23 states have call predecessors, (41), 26 states have return successors, (51), 36 states have call predecessors, (51), 38 states have call successors, (51) [2023-11-23 08:24:13,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 293 transitions. [2023-11-23 08:24:13,697 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 293 transitions. Word has length 55 [2023-11-23 08:24:13,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:24:13,697 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 293 transitions. [2023-11-23 08:24:13,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 08:24:13,697 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 293 transitions. [2023-11-23 08:24:13,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-23 08:24:13,698 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:24:13,698 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:24:13,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-23 08:24:13,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:24:13,921 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:24:13,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:24:13,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2100743321, now seen corresponding path program 1 times [2023-11-23 08:24:13,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:24:13,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493273781] [2023-11-23 08:24:13,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:24:13,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:24:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:14,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:24:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:14,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:24:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:14,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:24:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:14,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:24:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:14,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:24:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:14,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:24:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:14,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:24:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:14,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:24:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:14,139 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:24:14,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:24:14,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493273781] [2023-11-23 08:24:14,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493273781] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:24:14,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:24:14,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 08:24:14,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086066842] [2023-11-23 08:24:14,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:24:14,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:24:14,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:24:14,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:24:14,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:24:14,141 INFO L87 Difference]: Start difference. First operand 231 states and 293 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:24:14,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:24:14,341 INFO L93 Difference]: Finished difference Result 287 states and 363 transitions. [2023-11-23 08:24:14,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:24:14,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2023-11-23 08:24:14,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:24:14,345 INFO L225 Difference]: With dead ends: 287 [2023-11-23 08:24:14,345 INFO L226 Difference]: Without dead ends: 231 [2023-11-23 08:24:14,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:24:14,346 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 14 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:24:14,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 242 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:24:14,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-11-23 08:24:14,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2023-11-23 08:24:14,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 162 states have (on average 1.2160493827160495) internal successors, (197), 169 states have internal predecessors, (197), 41 states have call successors, (41), 23 states have call predecessors, (41), 25 states have return successors, (50), 36 states have call predecessors, (50), 38 states have call successors, (50) [2023-11-23 08:24:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 288 transitions. [2023-11-23 08:24:14,367 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 288 transitions. Word has length 58 [2023-11-23 08:24:14,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:24:14,368 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 288 transitions. [2023-11-23 08:24:14,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:24:14,369 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 288 transitions. [2023-11-23 08:24:14,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-23 08:24:14,369 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:24:14,369 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:24:14,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 08:24:14,370 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:24:14,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:24:14,370 INFO L85 PathProgramCache]: Analyzing trace with hash -737806892, now seen corresponding path program 1 times [2023-11-23 08:24:14,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:24:14,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657864019] [2023-11-23 08:24:14,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:24:14,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:24:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:14,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:24:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:14,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:24:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:14,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 08:24:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:14,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:24:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:14,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:24:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:14,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 08:24:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:14,908 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-23 08:24:14,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:24:14,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657864019] [2023-11-23 08:24:14,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657864019] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:24:14,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112650979] [2023-11-23 08:24:14,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:24:14,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:24:14,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:24:14,910 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:24:14,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 08:24:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:15,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 2518 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-23 08:24:15,297 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:24:15,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 08:24:15,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 08:24:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 08:24:15,568 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:24:15,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112650979] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:24:15,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:24:15,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2023-11-23 08:24:15,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16733035] [2023-11-23 08:24:15,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:24:15,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:24:15,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:24:15,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:24:15,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:24:15,571 INFO L87 Difference]: Start difference. First operand 229 states and 288 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 08:24:18,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:24:18,149 INFO L93 Difference]: Finished difference Result 478 states and 604 transitions. [2023-11-23 08:24:18,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 08:24:18,150 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 57 [2023-11-23 08:24:18,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:24:18,151 INFO L225 Difference]: With dead ends: 478 [2023-11-23 08:24:18,151 INFO L226 Difference]: Without dead ends: 364 [2023-11-23 08:24:18,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2023-11-23 08:24:18,152 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 111 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:24:18,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 391 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-23 08:24:18,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2023-11-23 08:24:18,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 246. [2023-11-23 08:24:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 174 states have (on average 1.2183908045977012) internal successors, (212), 182 states have internal predecessors, (212), 44 states have call successors, (44), 25 states have call predecessors, (44), 27 states have return successors, (54), 38 states have call predecessors, (54), 41 states have call successors, (54) [2023-11-23 08:24:18,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 310 transitions. [2023-11-23 08:24:18,175 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 310 transitions. Word has length 57 [2023-11-23 08:24:18,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:24:18,175 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 310 transitions. [2023-11-23 08:24:18,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 08:24:18,175 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 310 transitions. [2023-11-23 08:24:18,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-23 08:24:18,176 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:24:18,176 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-11-23 08:24:18,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-23 08:24:18,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:24:18,400 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:24:18,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:24:18,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1090895274, now seen corresponding path program 1 times [2023-11-23 08:24:18,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:24:18,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159180717] [2023-11-23 08:24:18,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:24:18,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:24:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:18,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:24:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:18,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:24:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:18,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 08:24:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:18,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:24:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:18,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:24:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:18,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 08:24:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:18,562 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 08:24:18,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:24:18,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159180717] [2023-11-23 08:24:18,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159180717] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:24:18,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067113447] [2023-11-23 08:24:18,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:24:18,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:24:18,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:24:18,564 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:24:18,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-23 08:24:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:18,906 INFO L262 TraceCheckSpWp]: Trace formula consists of 2513 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 08:24:18,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:24:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 08:24:18,912 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:24:18,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067113447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:24:18,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:24:18,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-23 08:24:18,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397198733] [2023-11-23 08:24:18,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:24:18,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:24:18,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:24:18,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:24:18,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:24:18,913 INFO L87 Difference]: Start difference. First operand 246 states and 310 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 08:24:19,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:24:19,041 INFO L93 Difference]: Finished difference Result 426 states and 543 transitions. [2023-11-23 08:24:19,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:24:19,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 57 [2023-11-23 08:24:19,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:24:19,042 INFO L225 Difference]: With dead ends: 426 [2023-11-23 08:24:19,042 INFO L226 Difference]: Without dead ends: 248 [2023-11-23 08:24:19,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:24:19,043 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 6 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:24:19,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 265 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:24:19,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-11-23 08:24:19,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 227. [2023-11-23 08:24:19,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 161 states have (on average 1.1925465838509317) internal successors, (192), 167 states have internal predecessors, (192), 41 states have call successors, (41), 24 states have call predecessors, (41), 24 states have return successors, (48), 35 states have call predecessors, (48), 38 states have call successors, (48) [2023-11-23 08:24:19,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 281 transitions. [2023-11-23 08:24:19,060 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 281 transitions. Word has length 57 [2023-11-23 08:24:19,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:24:19,061 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 281 transitions. [2023-11-23 08:24:19,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 08:24:19,061 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 281 transitions. [2023-11-23 08:24:19,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-23 08:24:19,062 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:24:19,062 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-23 08:24:19,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-23 08:24:19,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 08:24:19,274 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:24:19,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:24:19,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1805949602, now seen corresponding path program 1 times [2023-11-23 08:24:19,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:24:19,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762119159] [2023-11-23 08:24:19,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:24:19,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:24:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:19,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:24:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:19,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:24:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:19,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:24:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:19,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:24:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:19,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:24:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:19,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:24:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:19,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:24:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:19,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:24:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:19,680 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-23 08:24:19,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:24:19,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762119159] [2023-11-23 08:24:19,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762119159] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:24:19,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:24:19,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 08:24:19,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718182934] [2023-11-23 08:24:19,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:24:19,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 08:24:19,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:24:19,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 08:24:19,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:24:19,682 INFO L87 Difference]: Start difference. First operand 227 states and 281 transitions. Second operand has 8 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 08:24:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:24:20,147 INFO L93 Difference]: Finished difference Result 248 states and 304 transitions. [2023-11-23 08:24:20,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:24:20,148 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 60 [2023-11-23 08:24:20,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:24:20,149 INFO L225 Difference]: With dead ends: 248 [2023-11-23 08:24:20,149 INFO L226 Difference]: Without dead ends: 246 [2023-11-23 08:24:20,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:24:20,149 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 17 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:24:20,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 621 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 08:24:20,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-11-23 08:24:20,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 232. [2023-11-23 08:24:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 164 states have (on average 1.1890243902439024) internal successors, (195), 170 states have internal predecessors, (195), 42 states have call successors, (42), 25 states have call predecessors, (42), 25 states have return successors, (49), 36 states have call predecessors, (49), 39 states have call successors, (49) [2023-11-23 08:24:20,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 286 transitions. [2023-11-23 08:24:20,167 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 286 transitions. Word has length 60 [2023-11-23 08:24:20,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:24:20,168 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 286 transitions. [2023-11-23 08:24:20,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 08:24:20,168 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 286 transitions. [2023-11-23 08:24:20,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-23 08:24:20,168 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:24:20,169 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:24:20,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 08:24:20,169 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:24:20,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:24:20,169 INFO L85 PathProgramCache]: Analyzing trace with hash 409468762, now seen corresponding path program 1 times [2023-11-23 08:24:20,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:24:20,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071188552] [2023-11-23 08:24:20,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:24:20,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:24:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:20,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:24:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:20,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:24:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:20,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:24:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:20,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:24:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:20,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:24:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:20,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:24:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:20,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:24:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:20,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:24:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:20,680 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:24:20,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:24:20,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071188552] [2023-11-23 08:24:20,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071188552] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:24:20,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:24:20,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 08:24:20,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694668804] [2023-11-23 08:24:20,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:24:20,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:24:20,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:24:20,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:24:20,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:24:20,682 INFO L87 Difference]: Start difference. First operand 232 states and 286 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:24:20,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:24:20,965 INFO L93 Difference]: Finished difference Result 293 states and 365 transitions. [2023-11-23 08:24:20,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:24:20,966 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 64 [2023-11-23 08:24:20,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:24:20,967 INFO L225 Difference]: With dead ends: 293 [2023-11-23 08:24:20,967 INFO L226 Difference]: Without dead ends: 241 [2023-11-23 08:24:20,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:24:20,968 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 43 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:24:20,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 305 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:24:20,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-11-23 08:24:20,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 235. [2023-11-23 08:24:20,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 165 states have (on average 1.187878787878788) internal successors, (196), 172 states have internal predecessors, (196), 44 states have call successors, (44), 25 states have call predecessors, (44), 25 states have return successors, (50), 37 states have call predecessors, (50), 41 states have call successors, (50) [2023-11-23 08:24:20,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 290 transitions. [2023-11-23 08:24:20,986 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 290 transitions. Word has length 64 [2023-11-23 08:24:20,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:24:20,986 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 290 transitions. [2023-11-23 08:24:20,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:24:20,987 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 290 transitions. [2023-11-23 08:24:20,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-23 08:24:20,987 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:24:20,988 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:24:20,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 08:24:20,988 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:24:20,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:24:20,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1795672156, now seen corresponding path program 1 times [2023-11-23 08:24:20,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:24:20,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798438837] [2023-11-23 08:24:20,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:24:20,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:24:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:22,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:24:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:22,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:24:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:22,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:24:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:22,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:24:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:22,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:24:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:22,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:24:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:22,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:24:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:22,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:24:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:23,053 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 08:24:23,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:24:23,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798438837] [2023-11-23 08:24:23,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798438837] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:24:23,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520911654] [2023-11-23 08:24:23,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:24:23,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:24:23,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:24:23,072 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:24:23,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-23 08:24:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:23,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 2559 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-23 08:24:23,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:24:23,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:24:24,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 34 [2023-11-23 08:24:24,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2023-11-23 08:24:24,154 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2023-11-23 08:24:24,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 36 [2023-11-23 08:24:25,137 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 08:24:25,137 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:24:25,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:24:25,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 65 [2023-11-23 08:24:25,444 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-23 08:24:25,445 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 304 treesize of output 248 [2023-11-23 08:24:25,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-11-23 08:24:25,923 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 08:24:25,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520911654] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:24:25,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:24:25,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 19] total 46 [2023-11-23 08:24:25,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717949830] [2023-11-23 08:24:25,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:24:25,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-11-23 08:24:25,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:24:25,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-23 08:24:25,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1874, Unknown=0, NotChecked=0, Total=2070 [2023-11-23 08:24:25,925 INFO L87 Difference]: Start difference. First operand 235 states and 290 transitions. Second operand has 46 states, 41 states have (on average 2.317073170731707) internal successors, (95), 46 states have internal predecessors, (95), 17 states have call successors, (23), 4 states have call predecessors, (23), 8 states have return successors, (22), 12 states have call predecessors, (22), 16 states have call successors, (22) [2023-11-23 08:24:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:24:31,420 INFO L93 Difference]: Finished difference Result 428 states and 535 transitions. [2023-11-23 08:24:31,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-23 08:24:31,421 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 2.317073170731707) internal successors, (95), 46 states have internal predecessors, (95), 17 states have call successors, (23), 4 states have call predecessors, (23), 8 states have return successors, (22), 12 states have call predecessors, (22), 16 states have call successors, (22) Word has length 64 [2023-11-23 08:24:31,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:24:31,422 INFO L225 Difference]: With dead ends: 428 [2023-11-23 08:24:31,422 INFO L226 Difference]: Without dead ends: 339 [2023-11-23 08:24:31,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 102 SyntacticMatches, 12 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1700 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=726, Invalid=5436, Unknown=0, NotChecked=0, Total=6162 [2023-11-23 08:24:31,424 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 358 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 2281 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 2606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 2281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-23 08:24:31,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 942 Invalid, 2606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 2281 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-23 08:24:31,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-11-23 08:24:31,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 201. [2023-11-23 08:24:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 139 states have (on average 1.1798561151079137) internal successors, (164), 145 states have internal predecessors, (164), 39 states have call successors, (39), 22 states have call predecessors, (39), 22 states have return successors, (46), 33 states have call predecessors, (46), 36 states have call successors, (46) [2023-11-23 08:24:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 249 transitions. [2023-11-23 08:24:31,449 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 249 transitions. Word has length 64 [2023-11-23 08:24:31,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:24:31,450 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 249 transitions. [2023-11-23 08:24:31,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 2.317073170731707) internal successors, (95), 46 states have internal predecessors, (95), 17 states have call successors, (23), 4 states have call predecessors, (23), 8 states have return successors, (22), 12 states have call predecessors, (22), 16 states have call successors, (22) [2023-11-23 08:24:31,450 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 249 transitions. [2023-11-23 08:24:31,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-23 08:24:31,451 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:24:31,451 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2023-11-23 08:24:31,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-23 08:24:31,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-23 08:24:31,665 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:24:31,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:24:31,665 INFO L85 PathProgramCache]: Analyzing trace with hash -529760073, now seen corresponding path program 1 times [2023-11-23 08:24:31,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:24:31,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911345414] [2023-11-23 08:24:31,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:24:31,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:24:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:32,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:24:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:32,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:24:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:32,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:24:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:32,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:24:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:32,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:24:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:32,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:24:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:32,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:24:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:32,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 08:24:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:32,453 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-23 08:24:32,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:24:32,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911345414] [2023-11-23 08:24:32,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911345414] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:24:32,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560445819] [2023-11-23 08:24:32,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:24:32,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:24:32,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:24:32,455 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:24:32,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-23 08:24:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:24:32,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 2554 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-23 08:24:32,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:24:32,850 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 6 treesize of output 5 [2023-11-23 08:24:32,915 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 5 treesize of output 3 [2023-11-23 08:24:32,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:24:32,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-11-23 08:24:33,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-23 08:24:38,660 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-23 08:24:38,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-23 08:24:38,679 INFO L349 Elim1Store]: treesize reduction 36, result has 21.7 percent of original size [2023-11-23 08:24:38,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 21 [2023-11-23 08:24:38,725 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-23 08:24:38,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-23 08:24:44,598 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 08:24:44,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-23 08:24:44,625 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 30 treesize of output 23 [2023-11-23 08:24:46,648 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base_BEFORE_CALL_18| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base_BEFORE_CALL_18|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset_BEFORE_CALL_17|)))) (and (not (= .cse0 0)) (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base_BEFORE_CALL_18|)))) is different from true [2023-11-23 08:24:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2023-11-23 08:24:46,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:24:47,010 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_868 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_ArrVal_868) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset| 8)) 0))) is different from false [2023-11-23 08:24:47,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560445819] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:24:47,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:24:47,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18] total 24 [2023-11-23 08:24:47,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54631238] [2023-11-23 08:24:47,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:24:47,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-23 08:24:47,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:24:47,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-23 08:24:47,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=732, Unknown=2, NotChecked=110, Total=930 [2023-11-23 08:24:47,067 INFO L87 Difference]: Start difference. First operand 201 states and 249 transitions. Second operand has 24 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 9 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) [2023-11-23 08:24:50,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:24:53,711 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 08:24:55,856 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 08:24:58,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:25:00,144 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 08:25:02,225 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 08:25:03,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:25:03,470 INFO L93 Difference]: Finished difference Result 531 states and 674 transitions. [2023-11-23 08:25:03,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-23 08:25:03,470 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 9 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) Word has length 67 [2023-11-23 08:25:03,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:25:03,472 INFO L225 Difference]: With dead ends: 531 [2023-11-23 08:25:03,472 INFO L226 Difference]: Without dead ends: 386 [2023-11-23 08:25:03,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 84 SyntacticMatches, 10 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=528, Invalid=3138, Unknown=2, NotChecked=238, Total=3906 [2023-11-23 08:25:03,474 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 328 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 104 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 2353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 245 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:25:03,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 671 Invalid, 2353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1998 Invalid, 6 Unknown, 245 Unchecked, 15.1s Time] [2023-11-23 08:25:03,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2023-11-23 08:25:03,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 282. [2023-11-23 08:25:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 196 states have (on average 1.1581632653061225) internal successors, (227), 205 states have internal predecessors, (227), 54 states have call successors, (54), 31 states have call predecessors, (54), 31 states have return successors, (63), 45 states have call predecessors, (63), 51 states have call successors, (63) [2023-11-23 08:25:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 344 transitions. [2023-11-23 08:25:03,515 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 344 transitions. Word has length 67 [2023-11-23 08:25:03,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:25:03,515 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 344 transitions. [2023-11-23 08:25:03,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 9 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) [2023-11-23 08:25:03,520 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 344 transitions. [2023-11-23 08:25:03,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-23 08:25:03,521 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:25:03,521 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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] [2023-11-23 08:25:03,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-23 08:25:03,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-23 08:25:03,736 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:25:03,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:25:03,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1299590505, now seen corresponding path program 1 times [2023-11-23 08:25:03,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:25:03,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533366438] [2023-11-23 08:25:03,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:25:03,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:25:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:04,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:25:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:04,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:25:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:04,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:25:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:04,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:25:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:04,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:25:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:04,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:25:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:04,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:25:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:04,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:25:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:04,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:25:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:04,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:25:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-23 08:25:04,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:25:04,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533366438] [2023-11-23 08:25:04,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533366438] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:25:04,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:25:04,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 08:25:04,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922331855] [2023-11-23 08:25:04,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:25:04,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:25:04,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:25:04,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:25:04,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:25:04,073 INFO L87 Difference]: Start difference. First operand 282 states and 344 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 08:25:04,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:25:04,309 INFO L93 Difference]: Finished difference Result 310 states and 379 transitions. [2023-11-23 08:25:04,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:25:04,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2023-11-23 08:25:04,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:25:04,310 INFO L225 Difference]: With dead ends: 310 [2023-11-23 08:25:04,311 INFO L226 Difference]: Without dead ends: 282 [2023-11-23 08:25:04,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:25:04,311 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 24 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:25:04,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 286 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:25:04,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-11-23 08:25:04,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2023-11-23 08:25:04,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 196 states have (on average 1.153061224489796) internal successors, (226), 205 states have internal predecessors, (226), 54 states have call successors, (54), 31 states have call predecessors, (54), 31 states have return successors, (63), 45 states have call predecessors, (63), 51 states have call successors, (63) [2023-11-23 08:25:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 343 transitions. [2023-11-23 08:25:04,347 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 343 transitions. Word has length 71 [2023-11-23 08:25:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:25:04,347 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 343 transitions. [2023-11-23 08:25:04,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 08:25:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 343 transitions. [2023-11-23 08:25:04,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-23 08:25:04,348 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:25:04,348 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:25:04,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 08:25:04,349 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:25:04,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:25:04,349 INFO L85 PathProgramCache]: Analyzing trace with hash -2136109106, now seen corresponding path program 1 times [2023-11-23 08:25:04,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:25:04,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864005426] [2023-11-23 08:25:04,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:25:04,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:25:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:04,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:25:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:05,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:25:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:05,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:25:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:05,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:25:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:05,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:25:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:05,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:25:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:05,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:25:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:05,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 08:25:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:05,169 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:25:05,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:25:05,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864005426] [2023-11-23 08:25:05,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864005426] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:25:05,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:25:05,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-23 08:25:05,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530723813] [2023-11-23 08:25:05,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:25:05,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 08:25:05,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:25:05,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 08:25:05,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:25:05,172 INFO L87 Difference]: Start difference. First operand 282 states and 343 transitions. Second operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 08:25:06,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:25:06,131 INFO L93 Difference]: Finished difference Result 317 states and 383 transitions. [2023-11-23 08:25:06,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 08:25:06,132 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 69 [2023-11-23 08:25:06,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:25:06,133 INFO L225 Difference]: With dead ends: 317 [2023-11-23 08:25:06,133 INFO L226 Difference]: Without dead ends: 315 [2023-11-23 08:25:06,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2023-11-23 08:25:06,134 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 68 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 08:25:06,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 533 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-23 08:25:06,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-11-23 08:25:06,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 283. [2023-11-23 08:25:06,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 199 states have (on average 1.1457286432160805) internal successors, (228), 210 states have internal predecessors, (228), 51 states have call successors, (51), 30 states have call predecessors, (51), 32 states have return successors, (65), 42 states have call predecessors, (65), 48 states have call successors, (65) [2023-11-23 08:25:06,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 344 transitions. [2023-11-23 08:25:06,169 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 344 transitions. Word has length 69 [2023-11-23 08:25:06,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:25:06,169 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 344 transitions. [2023-11-23 08:25:06,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 08:25:06,170 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 344 transitions. [2023-11-23 08:25:06,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-23 08:25:06,170 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:25:06,171 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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] [2023-11-23 08:25:06,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 08:25:06,171 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:25:06,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:25:06,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1690893348, now seen corresponding path program 1 times [2023-11-23 08:25:06,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:25:06,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703551494] [2023-11-23 08:25:06,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:25:06,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:25:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:06,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:25:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:06,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:25:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:06,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:25:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:06,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:25:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:06,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:25:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:06,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:25:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:06,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:25:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:06,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:25:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:06,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:25:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:06,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:25:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-23 08:25:06,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:25:06,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703551494] [2023-11-23 08:25:06,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703551494] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:25:06,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:25:06,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 08:25:06,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547628236] [2023-11-23 08:25:06,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:25:06,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 08:25:06,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:25:06,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 08:25:06,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:25:06,566 INFO L87 Difference]: Start difference. First operand 283 states and 344 transitions. Second operand has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-23 08:25:06,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:25:06,963 INFO L93 Difference]: Finished difference Result 294 states and 355 transitions. [2023-11-23 08:25:06,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:25:06,963 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 73 [2023-11-23 08:25:06,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:25:06,964 INFO L225 Difference]: With dead ends: 294 [2023-11-23 08:25:06,965 INFO L226 Difference]: Without dead ends: 292 [2023-11-23 08:25:06,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:25:06,965 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 16 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:25:06,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 584 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:25:06,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-11-23 08:25:06,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2023-11-23 08:25:07,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 204 states have (on average 1.142156862745098) internal successors, (233), 216 states have internal predecessors, (233), 52 states have call successors, (52), 31 states have call predecessors, (52), 34 states have return successors, (67), 43 states have call predecessors, (67), 49 states have call successors, (67) [2023-11-23 08:25:07,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 352 transitions. [2023-11-23 08:25:07,001 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 352 transitions. Word has length 73 [2023-11-23 08:25:07,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:25:07,001 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 352 transitions. [2023-11-23 08:25:07,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-23 08:25:07,001 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 352 transitions. [2023-11-23 08:25:07,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-23 08:25:07,002 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:25:07,002 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2023-11-23 08:25:07,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-23 08:25:07,002 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:25:07,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:25:07,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1060728393, now seen corresponding path program 1 times [2023-11-23 08:25:07,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:25:07,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551441013] [2023-11-23 08:25:07,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:25:07,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:25:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:08,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:25:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:08,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:25:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:08,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:25:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:08,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 08:25:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:08,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:25:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:08,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:25:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:08,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:25:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:08,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-23 08:25:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:08,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:25:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-23 08:25:08,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:25:08,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551441013] [2023-11-23 08:25:08,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551441013] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:25:08,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70688962] [2023-11-23 08:25:08,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:25:08,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:25:08,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:25:08,651 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:25:08,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-23 08:25:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:09,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 2604 conjuncts, 80 conjunts are in the unsatisfiable core [2023-11-23 08:25:09,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:25:09,059 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 6 treesize of output 5 [2023-11-23 08:25:09,168 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 5 treesize of output 3 [2023-11-23 08:25:09,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:25:09,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-11-23 08:25:09,450 INFO L349 Elim1Store]: treesize reduction 37, result has 31.5 percent of original size [2023-11-23 08:25:09,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 24 [2023-11-23 08:25:09,795 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-23 08:25:09,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-23 08:25:09,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:25:09,825 INFO L349 Elim1Store]: treesize reduction 40, result has 25.9 percent of original size [2023-11-23 08:25:09,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 28 [2023-11-23 08:25:09,935 INFO L349 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-11-23 08:25:09,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 99 treesize of output 101 [2023-11-23 08:25:10,004 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 13 treesize of output 9 [2023-11-23 08:25:10,025 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 13 treesize of output 9 [2023-11-23 08:25:10,247 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 30 treesize of output 23 [2023-11-23 08:25:10,320 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-23 08:25:10,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2023-11-23 08:25:10,776 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-23 08:25:10,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-23 08:25:10,845 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 41 treesize of output 32 [2023-11-23 08:25:12,898 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base_BEFORE_CALL_22| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset_BEFORE_CALL_21| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base_BEFORE_CALL_22|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset_BEFORE_CALL_21|)))) (and (not (= .cse0 0)) (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base_BEFORE_CALL_22|)))) is different from true [2023-11-23 08:25:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2023-11-23 08:25:17,157 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:25:17,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70688962] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:25:17,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:25:17,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 39 [2023-11-23 08:25:17,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880123292] [2023-11-23 08:25:17,468 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:25:17,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-23 08:25:17,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:25:17,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-23 08:25:17,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1815, Unknown=9, NotChecked=86, Total=2070 [2023-11-23 08:25:17,470 INFO L87 Difference]: Start difference. First operand 291 states and 352 transitions. Second operand has 39 states, 33 states have (on average 2.787878787878788) internal successors, (92), 35 states have internal predecessors, (92), 14 states have call successors, (19), 9 states have call predecessors, (19), 10 states have return successors, (18), 11 states have call predecessors, (18), 14 states have call successors, (18) [2023-11-23 08:25:21,908 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 08:25:24,747 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 08:25:36,872 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 08:25:38,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:25:42,925 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 08:25:44,935 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 08:25:46,942 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 08:25:48,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:25:50,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:25:52,967 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 08:25:57,010 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 08:25:59,020 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 08:26:01,025 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 08:26:01,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:26:01,459 INFO L93 Difference]: Finished difference Result 649 states and 782 transitions. [2023-11-23 08:26:01,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-11-23 08:26:01,459 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 33 states have (on average 2.787878787878788) internal successors, (92), 35 states have internal predecessors, (92), 14 states have call successors, (19), 9 states have call predecessors, (19), 10 states have return successors, (18), 11 states have call predecessors, (18), 14 states have call successors, (18) Word has length 73 [2023-11-23 08:26:01,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:26:01,461 INFO L225 Difference]: With dead ends: 649 [2023-11-23 08:26:01,461 INFO L226 Difference]: Without dead ends: 417 [2023-11-23 08:26:01,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 86 SyntacticMatches, 11 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2240 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=880, Invalid=6943, Unknown=13, NotChecked=174, Total=8010 [2023-11-23 08:26:01,464 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 204 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 3370 mSolverCounterSat, 129 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 3763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 3370 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 251 IncrementalHoareTripleChecker+Unchecked, 33.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:26:01,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 555 Invalid, 3763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 3370 Invalid, 13 Unknown, 251 Unchecked, 33.1s Time] [2023-11-23 08:26:01,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2023-11-23 08:26:01,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 272. [2023-11-23 08:26:01,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 195 states have (on average 1.123076923076923) internal successors, (219), 204 states have internal predecessors, (219), 45 states have call successors, (45), 30 states have call predecessors, (45), 31 states have return successors, (52), 37 states have call predecessors, (52), 42 states have call successors, (52) [2023-11-23 08:26:01,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 316 transitions. [2023-11-23 08:26:01,507 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 316 transitions. Word has length 73 [2023-11-23 08:26:01,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:26:01,507 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 316 transitions. [2023-11-23 08:26:01,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 33 states have (on average 2.787878787878788) internal successors, (92), 35 states have internal predecessors, (92), 14 states have call successors, (19), 9 states have call predecessors, (19), 10 states have return successors, (18), 11 states have call predecessors, (18), 14 states have call successors, (18) [2023-11-23 08:26:01,508 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 316 transitions. [2023-11-23 08:26:01,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 08:26:01,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:26:01,508 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 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] [2023-11-23 08:26:01,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-23 08:26:01,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-23 08:26:01,723 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:26:01,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:26:01,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1296011228, now seen corresponding path program 1 times [2023-11-23 08:26:01,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:26:01,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94734180] [2023-11-23 08:26:01,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:26:01,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:26:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:02,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:26:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:02,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:26:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:02,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:26:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:02,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:26:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:02,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:26:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:02,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:26:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:02,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:26:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:02,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:26:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:02,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:26:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:02,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:26:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:02,236 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-23 08:26:02,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:26:02,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94734180] [2023-11-23 08:26:02,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94734180] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:26:02,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:26:02,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 08:26:02,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371199344] [2023-11-23 08:26:02,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:26:02,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 08:26:02,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:26:02,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 08:26:02,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:26:02,237 INFO L87 Difference]: Start difference. First operand 272 states and 316 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-23 08:26:02,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:26:02,690 INFO L93 Difference]: Finished difference Result 322 states and 387 transitions. [2023-11-23 08:26:02,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:26:02,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 77 [2023-11-23 08:26:02,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:26:02,691 INFO L225 Difference]: With dead ends: 322 [2023-11-23 08:26:02,691 INFO L226 Difference]: Without dead ends: 296 [2023-11-23 08:26:02,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:26:02,692 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 35 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:26:02,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 280 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 08:26:02,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-11-23 08:26:02,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 279. [2023-11-23 08:26:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 197 states have (on average 1.1218274111675126) internal successors, (221), 207 states have internal predecessors, (221), 50 states have call successors, (50), 30 states have call predecessors, (50), 31 states have return successors, (57), 41 states have call predecessors, (57), 47 states have call successors, (57) [2023-11-23 08:26:02,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 328 transitions. [2023-11-23 08:26:02,736 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 328 transitions. Word has length 77 [2023-11-23 08:26:02,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:26:02,737 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 328 transitions. [2023-11-23 08:26:02,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-23 08:26:02,737 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 328 transitions. [2023-11-23 08:26:02,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 08:26:02,738 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:26:02,738 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 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] [2023-11-23 08:26:02,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-23 08:26:02,738 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:26:02,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:26:02,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1544157722, now seen corresponding path program 1 times [2023-11-23 08:26:02,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:26:02,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557513391] [2023-11-23 08:26:02,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:26:02,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:26:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:03,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:26:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:03,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:26:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:03,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:26:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:03,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:26:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:03,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:26:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:03,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:26:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:03,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:26:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:03,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:26:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:03,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:26:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:03,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:26:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:03,456 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-23 08:26:03,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:26:03,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557513391] [2023-11-23 08:26:03,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557513391] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:26:03,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265984566] [2023-11-23 08:26:03,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:26:03,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:26:03,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:26:03,457 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:26:03,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-23 08:26:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:04,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 2604 conjuncts, 125 conjunts are in the unsatisfiable core [2023-11-23 08:26:04,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:26:04,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:26:04,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 08:26:04,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 08:26:05,325 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 08:26:05,325 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 15 treesize of output 7 [2023-11-23 08:26:05,328 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 08:26:05,328 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 15 treesize of output 7 [2023-11-23 08:26:05,336 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 39 [2023-11-23 08:26:05,340 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:26:05,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2023-11-23 08:26:05,346 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 0 case distinctions, treesize of input 29 treesize of output 17 [2023-11-23 08:26:05,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:26:05,353 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 48 treesize of output 38 [2023-11-23 08:26:05,358 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 0 case distinctions, treesize of input 37 treesize of output 25 [2023-11-23 08:26:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 11 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 08:26:06,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:26:07,091 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-23 08:26:07,091 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 21 treesize of output 9 [2023-11-23 08:26:07,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265984566] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:26:07,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:26:07,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 26] total 34 [2023-11-23 08:26:07,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698707932] [2023-11-23 08:26:07,148 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:26:07,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-23 08:26:07,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:26:07,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-23 08:26:07,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1546, Unknown=0, NotChecked=0, Total=1722 [2023-11-23 08:26:07,150 INFO L87 Difference]: Start difference. First operand 279 states and 328 transitions. Second operand has 34 states, 30 states have (on average 2.8) internal successors, (84), 32 states have internal predecessors, (84), 11 states have call successors, (21), 5 states have call predecessors, (21), 8 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) [2023-11-23 08:26:11,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:26:11,677 INFO L93 Difference]: Finished difference Result 449 states and 537 transitions. [2023-11-23 08:26:11,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-23 08:26:11,678 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 2.8) internal successors, (84), 32 states have internal predecessors, (84), 11 states have call successors, (21), 5 states have call predecessors, (21), 8 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) Word has length 77 [2023-11-23 08:26:11,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:26:11,679 INFO L225 Difference]: With dead ends: 449 [2023-11-23 08:26:11,679 INFO L226 Difference]: Without dead ends: 406 [2023-11-23 08:26:11,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 81 SyntacticMatches, 9 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1674 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=608, Invalid=4504, Unknown=0, NotChecked=0, Total=5112 [2023-11-23 08:26:11,681 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 278 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:26:11,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 752 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-23 08:26:11,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2023-11-23 08:26:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 365. [2023-11-23 08:26:11,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 260 states have (on average 1.1153846153846154) internal successors, (290), 270 states have internal predecessors, (290), 63 states have call successors, (63), 41 states have call predecessors, (63), 41 states have return successors, (67), 53 states have call predecessors, (67), 57 states have call successors, (67) [2023-11-23 08:26:11,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 420 transitions. [2023-11-23 08:26:11,746 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 420 transitions. Word has length 77 [2023-11-23 08:26:11,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:26:11,747 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 420 transitions. [2023-11-23 08:26:11,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 2.8) internal successors, (84), 32 states have internal predecessors, (84), 11 states have call successors, (21), 5 states have call predecessors, (21), 8 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) [2023-11-23 08:26:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 420 transitions. [2023-11-23 08:26:11,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-23 08:26:11,748 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:26:11,748 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:26:11,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-23 08:26:11,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:26:11,960 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:26:11,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:26:11,961 INFO L85 PathProgramCache]: Analyzing trace with hash -274088258, now seen corresponding path program 1 times [2023-11-23 08:26:11,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:26:11,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299208021] [2023-11-23 08:26:11,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:26:11,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:26:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:26:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:26:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:26:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:26:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:26:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:26:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:26:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:26:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:26:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:26:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 08:26:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-11-23 08:26:12,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:26:12,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299208021] [2023-11-23 08:26:12,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299208021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:26:12,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:26:12,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 08:26:12,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079667865] [2023-11-23 08:26:12,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:26:12,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 08:26:12,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:26:12,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 08:26:12,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 08:26:12,080 INFO L87 Difference]: Start difference. First operand 365 states and 420 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-23 08:26:12,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:26:12,236 INFO L93 Difference]: Finished difference Result 391 states and 453 transitions. [2023-11-23 08:26:12,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 08:26:12,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 81 [2023-11-23 08:26:12,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:26:12,238 INFO L225 Difference]: With dead ends: 391 [2023-11-23 08:26:12,238 INFO L226 Difference]: Without dead ends: 367 [2023-11-23 08:26:12,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 08:26:12,239 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:26:12,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:26:12,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2023-11-23 08:26:12,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2023-11-23 08:26:12,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 262 states have (on average 1.1145038167938932) internal successors, (292), 272 states have internal predecessors, (292), 63 states have call successors, (63), 41 states have call predecessors, (63), 41 states have return successors, (67), 53 states have call predecessors, (67), 57 states have call successors, (67) [2023-11-23 08:26:12,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 422 transitions. [2023-11-23 08:26:12,303 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 422 transitions. Word has length 81 [2023-11-23 08:26:12,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:26:12,303 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 422 transitions. [2023-11-23 08:26:12,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-23 08:26:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 422 transitions. [2023-11-23 08:26:12,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-23 08:26:12,304 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:26:12,304 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:26:12,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-23 08:26:12,304 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:26:12,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:26:12,305 INFO L85 PathProgramCache]: Analyzing trace with hash -287196298, now seen corresponding path program 1 times [2023-11-23 08:26:12,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:26:12,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803684363] [2023-11-23 08:26:12,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:26:12,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:26:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:26:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:26:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:26:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:26:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:26:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:26:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:26:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:26:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:26:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:26:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 08:26:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:12,859 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-11-23 08:26:12,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:26:12,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803684363] [2023-11-23 08:26:12,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803684363] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:26:12,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:26:12,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 08:26:12,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227522226] [2023-11-23 08:26:12,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:26:12,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:26:12,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:26:12,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:26:12,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:26:12,861 INFO L87 Difference]: Start difference. First operand 367 states and 422 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-23 08:26:13,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:26:13,614 INFO L93 Difference]: Finished difference Result 427 states and 507 transitions. [2023-11-23 08:26:13,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:26:13,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 81 [2023-11-23 08:26:13,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:26:13,616 INFO L225 Difference]: With dead ends: 427 [2023-11-23 08:26:13,616 INFO L226 Difference]: Without dead ends: 425 [2023-11-23 08:26:13,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:26:13,617 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 14 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 08:26:13,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 433 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 08:26:13,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2023-11-23 08:26:13,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 401. [2023-11-23 08:26:13,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 280 states have (on average 1.1214285714285714) internal successors, (314), 292 states have internal predecessors, (314), 77 states have call successors, (77), 43 states have call predecessors, (77), 43 states have return successors, (81), 65 states have call predecessors, (81), 71 states have call successors, (81) [2023-11-23 08:26:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 472 transitions. [2023-11-23 08:26:13,698 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 472 transitions. Word has length 81 [2023-11-23 08:26:13,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:26:13,698 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 472 transitions. [2023-11-23 08:26:13,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-23 08:26:13,699 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 472 transitions. [2023-11-23 08:26:13,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-23 08:26:13,704 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:26:13,704 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:26:13,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-23 08:26:13,705 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:26:13,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:26:13,705 INFO L85 PathProgramCache]: Analyzing trace with hash -216829956, now seen corresponding path program 1 times [2023-11-23 08:26:13,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:26:13,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672947695] [2023-11-23 08:26:13,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:26:13,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:26:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:15,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:26:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:15,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:26:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:15,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:26:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:15,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:26:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:15,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:26:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:15,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:26:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:15,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:26:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:15,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:26:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:15,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:26:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:15,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:26:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:15,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 08:26:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-11-23 08:26:15,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:26:15,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672947695] [2023-11-23 08:26:15,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672947695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:26:15,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:26:15,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-23 08:26:15,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692718898] [2023-11-23 08:26:15,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:26:15,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 08:26:15,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:26:15,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 08:26:15,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:26:15,116 INFO L87 Difference]: Start difference. First operand 401 states and 472 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-23 08:26:16,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:26:16,187 INFO L93 Difference]: Finished difference Result 419 states and 493 transitions. [2023-11-23 08:26:16,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 08:26:16,187 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 81 [2023-11-23 08:26:16,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:26:16,189 INFO L225 Difference]: With dead ends: 419 [2023-11-23 08:26:16,189 INFO L226 Difference]: Without dead ends: 417 [2023-11-23 08:26:16,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2023-11-23 08:26:16,190 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 43 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-23 08:26:16,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 851 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-23 08:26:16,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2023-11-23 08:26:16,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 406. [2023-11-23 08:26:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 283 states have (on average 1.1201413427561837) internal successors, (317), 296 states have internal predecessors, (317), 78 states have call successors, (78), 44 states have call predecessors, (78), 44 states have return successors, (82), 65 states have call predecessors, (82), 72 states have call successors, (82) [2023-11-23 08:26:16,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 477 transitions. [2023-11-23 08:26:16,273 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 477 transitions. Word has length 81 [2023-11-23 08:26:16,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:26:16,273 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 477 transitions. [2023-11-23 08:26:16,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-23 08:26:16,273 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 477 transitions. [2023-11-23 08:26:16,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-23 08:26:16,274 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:26:16,275 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:26:16,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-23 08:26:16,275 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:26:16,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:26:16,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1641076404, now seen corresponding path program 1 times [2023-11-23 08:26:16,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:26:16,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759345446] [2023-11-23 08:26:16,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:26:16,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:26:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:17,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:26:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:17,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:26:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:17,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:26:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:17,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:26:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:17,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:26:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:17,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:26:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:17,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:26:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:17,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:26:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:17,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:26:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:17,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:26:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:17,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 08:26:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-23 08:26:17,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:26:17,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759345446] [2023-11-23 08:26:17,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759345446] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:26:17,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916556625] [2023-11-23 08:26:17,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:26:17,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:26:17,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:26:17,796 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:26:17,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-23 08:26:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:18,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 2610 conjuncts, 100 conjunts are in the unsatisfiable core [2023-11-23 08:26:18,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:26:18,202 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 6 treesize of output 5 [2023-11-23 08:26:18,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 08:26:18,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 08:26:18,685 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-23 08:26:18,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-23 08:26:18,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:26:18,700 INFO L349 Elim1Store]: treesize reduction 55, result has 1.8 percent of original size [2023-11-23 08:26:18,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 1 [2023-11-23 08:26:18,722 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-23 08:26:18,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-23 08:26:18,949 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-23 08:26:18,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-11-23 08:26:19,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2023-11-23 08:26:19,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:26:19,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2023-11-23 08:26:19,009 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 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 08:26:19,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-23 08:26:19,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-23 08:26:20,290 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 20 proven. 48 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-23 08:26:20,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:26:20,579 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset| 8)) (.cse6 (+ |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset| 8))) (let ((.cse9 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base|) .cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) .cse6))) (.cse3 (+ |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.offset| 8)) (.cse4 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base|) .cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) .cse6)))) (and (or (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1426 Int)) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| (store .cse4 |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset| v_ArrVal_1426)) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| v_ArrVal_1428))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base|) .cse3))) (or (= .cse0 0) (not (= (select (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base|) .cse2) .cse0)))))) (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1429 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_ArrVal_1429))) (or (not (= v_ArrVal_1427 (store (let ((.cse5 (select .cse7 |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|))) (store .cse5 .cse6 (select .cse5 .cse6))) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset| (select v_ArrVal_1427 |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|)))) (not (let ((.cse8 (store .cse7 |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| v_ArrVal_1427))) (= (select (select .cse8 |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base|) .cse2) (select (select .cse8 |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base|) .cse3)))) (not (= (store .cse9 |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset| (select v_ArrVal_1429 |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset|)) v_ArrVal_1429)))))) (or (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1429 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_ArrVal_1429))) (let ((.cse12 (store .cse11 |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| v_ArrVal_1427))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base|) .cse3))) (or (not (= v_ArrVal_1427 (store (let ((.cse10 (select .cse11 |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|))) (store .cse10 .cse6 (select .cse10 .cse6))) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset| (select v_ArrVal_1427 |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|)))) (not (= (select (select .cse12 |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base|) .cse2) .cse13)) (not (= (store .cse9 |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset| (select v_ArrVal_1429 |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset|)) v_ArrVal_1429)) (= .cse13 0)))))) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1426 Int)) (not (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| (store .cse4 |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset| v_ArrVal_1426)) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| v_ArrVal_1428))) (= (select (select .cse14 |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base|) .cse2) (select (select .cse14 |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base|) .cse3))))))))) is different from false [2023-11-23 08:26:20,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916556625] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:26:20,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:26:20,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22] total 36 [2023-11-23 08:26:20,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659137599] [2023-11-23 08:26:20,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:26:20,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-23 08:26:20,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:26:20,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-23 08:26:20,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1512, Unknown=1, NotChecked=78, Total=1722 [2023-11-23 08:26:20,840 INFO L87 Difference]: Start difference. First operand 406 states and 477 transitions. Second operand has 36 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 33 states have internal predecessors, (81), 13 states have call successors, (24), 7 states have call predecessors, (24), 8 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2023-11-23 08:26:26,672 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 08:26:31,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:26:31,149 INFO L93 Difference]: Finished difference Result 576 states and 666 transitions. [2023-11-23 08:26:31,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-11-23 08:26:31,150 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 33 states have internal predecessors, (81), 13 states have call successors, (24), 7 states have call predecessors, (24), 8 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) Word has length 81 [2023-11-23 08:26:31,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:26:31,152 INFO L225 Difference]: With dead ends: 576 [2023-11-23 08:26:31,152 INFO L226 Difference]: Without dead ends: 540 [2023-11-23 08:26:31,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 112 SyntacticMatches, 17 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=779, Invalid=7056, Unknown=1, NotChecked=174, Total=8010 [2023-11-23 08:26:31,155 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 294 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 290 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2023-11-23 08:26:31,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1498 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 2348 Invalid, 1 Unknown, 0 Unchecked, 7.7s Time] [2023-11-23 08:26:31,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2023-11-23 08:26:31,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 461. [2023-11-23 08:26:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 319 states have (on average 1.1065830721003134) internal successors, (353), 332 states have internal predecessors, (353), 90 states have call successors, (90), 52 states have call predecessors, (90), 51 states have return successors, (91), 76 states have call predecessors, (91), 81 states have call successors, (91) [2023-11-23 08:26:31,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 534 transitions. [2023-11-23 08:26:31,263 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 534 transitions. Word has length 81 [2023-11-23 08:26:31,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:26:31,263 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 534 transitions. [2023-11-23 08:26:31,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 33 states have internal predecessors, (81), 13 states have call successors, (24), 7 states have call predecessors, (24), 8 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2023-11-23 08:26:31,263 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 534 transitions. [2023-11-23 08:26:31,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-23 08:26:31,264 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:26:31,264 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:26:31,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-23 08:26:31,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-23 08:26:31,465 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:26:31,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:26:31,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1711442746, now seen corresponding path program 1 times [2023-11-23 08:26:31,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:26:31,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571375611] [2023-11-23 08:26:31,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:26:31,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:26:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:34,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:26:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:34,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:26:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:34,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:26:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:34,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:26:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:34,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:26:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:34,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:26:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:34,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:26:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:34,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:26:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:34,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:26:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:34,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:26:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:34,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 08:26:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:34,951 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-11-23 08:26:34,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:26:34,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571375611] [2023-11-23 08:26:34,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571375611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:26:34,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:26:34,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-23 08:26:34,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615556217] [2023-11-23 08:26:34,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:26:34,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 08:26:34,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:26:34,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 08:26:34,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:26:34,963 INFO L87 Difference]: Start difference. First operand 461 states and 534 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 7 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2023-11-23 08:26:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:26:36,469 INFO L93 Difference]: Finished difference Result 467 states and 539 transitions. [2023-11-23 08:26:36,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 08:26:36,470 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 7 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) Word has length 81 [2023-11-23 08:26:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:26:36,471 INFO L225 Difference]: With dead ends: 467 [2023-11-23 08:26:36,471 INFO L226 Difference]: Without dead ends: 465 [2023-11-23 08:26:36,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2023-11-23 08:26:36,472 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 26 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:26:36,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 758 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-23 08:26:36,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2023-11-23 08:26:36,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 434. [2023-11-23 08:26:36,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 302 states have (on average 1.1059602649006623) internal successors, (334), 314 states have internal predecessors, (334), 82 states have call successors, (82), 49 states have call predecessors, (82), 49 states have return successors, (86), 70 states have call predecessors, (86), 76 states have call successors, (86) [2023-11-23 08:26:36,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 502 transitions. [2023-11-23 08:26:36,584 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 502 transitions. Word has length 81 [2023-11-23 08:26:36,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:26:36,584 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 502 transitions. [2023-11-23 08:26:36,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 7 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2023-11-23 08:26:36,584 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 502 transitions. [2023-11-23 08:26:36,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-23 08:26:36,586 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:26:36,586 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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] [2023-11-23 08:26:36,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-23 08:26:36,586 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:26:36,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:26:36,586 INFO L85 PathProgramCache]: Analyzing trace with hash 104560337, now seen corresponding path program 1 times [2023-11-23 08:26:36,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:26:36,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635933000] [2023-11-23 08:26:36,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:26:36,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:26:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:37,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:26:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:37,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:26:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:37,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:26:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:37,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:26:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:38,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:26:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:38,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:26:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:38,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:26:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:38,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:26:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:38,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:26:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:38,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:26:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:38,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 08:26:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:38,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 08:26:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-11-23 08:26:38,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:26:38,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635933000] [2023-11-23 08:26:38,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635933000] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:26:38,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361460636] [2023-11-23 08:26:38,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:26:38,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:26:38,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:26:38,109 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:26:38,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-23 08:26:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:38,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 2601 conjuncts, 84 conjunts are in the unsatisfiable core [2023-11-23 08:26:38,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:26:38,557 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 6 treesize of output 5 [2023-11-23 08:26:38,883 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2023-11-23 08:26:38,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 25 [2023-11-23 08:26:38,950 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2023-11-23 08:26:38,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 28 [2023-11-23 08:26:39,147 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-23 08:26:39,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-11-23 08:26:39,193 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-23 08:26:39,201 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 08:26:39,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-11-23 08:26:42,348 INFO L349 Elim1Store]: treesize reduction 60, result has 66.1 percent of original size [2023-11-23 08:26:42,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 64 treesize of output 144 [2023-11-23 08:26:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 2 proven. 60 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-23 08:26:42,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:26:42,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361460636] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:26:42,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:26:42,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 25] total 39 [2023-11-23 08:26:42,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174593572] [2023-11-23 08:26:42,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:26:42,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-23 08:26:42,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:26:42,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-23 08:26:42,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1931, Unknown=0, NotChecked=0, Total=2070 [2023-11-23 08:26:42,823 INFO L87 Difference]: Start difference. First operand 434 states and 502 transitions. Second operand has 39 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 35 states have internal predecessors, (80), 14 states have call successors, (26), 6 states have call predecessors, (26), 7 states have return successors, (24), 12 states have call predecessors, (24), 13 states have call successors, (24) [2023-11-23 08:26:46,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:26:49,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:26:59,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:26:59,085 INFO L93 Difference]: Finished difference Result 594 states and 681 transitions. [2023-11-23 08:26:59,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-11-23 08:26:59,085 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 35 states have internal predecessors, (80), 14 states have call successors, (26), 6 states have call predecessors, (26), 7 states have return successors, (24), 12 states have call predecessors, (24), 13 states have call successors, (24) Word has length 87 [2023-11-23 08:26:59,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:26:59,087 INFO L225 Difference]: With dead ends: 594 [2023-11-23 08:26:59,087 INFO L226 Difference]: Without dead ends: 566 [2023-11-23 08:26:59,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 94 SyntacticMatches, 19 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2550 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=686, Invalid=7870, Unknown=0, NotChecked=0, Total=8556 [2023-11-23 08:26:59,089 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 274 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 3639 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 3804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 3639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2023-11-23 08:26:59,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1363 Invalid, 3804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 3639 Invalid, 0 Unknown, 0 Unchecked, 13.8s Time] [2023-11-23 08:26:59,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2023-11-23 08:26:59,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 521. [2023-11-23 08:26:59,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 359 states have (on average 1.1002785515320335) internal successors, (395), 372 states have internal predecessors, (395), 102 states have call successors, (102), 61 states have call predecessors, (102), 59 states have return successors, (101), 87 states have call predecessors, (101), 91 states have call successors, (101) [2023-11-23 08:26:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 598 transitions. [2023-11-23 08:26:59,345 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 598 transitions. Word has length 87 [2023-11-23 08:26:59,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:26:59,345 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 598 transitions. [2023-11-23 08:26:59,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 35 states have internal predecessors, (80), 14 states have call successors, (26), 6 states have call predecessors, (26), 7 states have return successors, (24), 12 states have call predecessors, (24), 13 states have call successors, (24) [2023-11-23 08:26:59,345 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 598 transitions. [2023-11-23 08:26:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-23 08:26:59,347 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:26:59,347 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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] [2023-11-23 08:26:59,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-23 08:26:59,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:26:59,563 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:26:59,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:26:59,563 INFO L85 PathProgramCache]: Analyzing trace with hash 486273671, now seen corresponding path program 1 times [2023-11-23 08:26:59,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:26:59,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017887197] [2023-11-23 08:26:59,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:26:59,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:26:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:00,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:27:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:00,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:27:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:00,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:27:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:00,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:27:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:00,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:27:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:00,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:27:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:00,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:27:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:00,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:27:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:00,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:27:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:00,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:27:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:00,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 08:27:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:00,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 08:27:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:00,247 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-11-23 08:27:00,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:27:00,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017887197] [2023-11-23 08:27:00,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017887197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:27:00,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:27:00,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 08:27:00,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131700345] [2023-11-23 08:27:00,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:27:00,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:27:00,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:27:00,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:27:00,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:27:00,254 INFO L87 Difference]: Start difference. First operand 521 states and 598 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-23 08:27:00,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:27:00,834 INFO L93 Difference]: Finished difference Result 531 states and 607 transitions. [2023-11-23 08:27:00,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:27:00,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 87 [2023-11-23 08:27:00,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:27:00,836 INFO L225 Difference]: With dead ends: 531 [2023-11-23 08:27:00,836 INFO L226 Difference]: Without dead ends: 527 [2023-11-23 08:27:00,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:27:00,838 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 13 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:27:00,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 412 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 08:27:00,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2023-11-23 08:27:01,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2023-11-23 08:27:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 364 states have (on average 1.0961538461538463) internal successors, (399), 376 states have internal predecessors, (399), 102 states have call successors, (102), 63 states have call predecessors, (102), 60 states have return successors, (101), 87 states have call predecessors, (101), 91 states have call successors, (101) [2023-11-23 08:27:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 602 transitions. [2023-11-23 08:27:01,090 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 602 transitions. Word has length 87 [2023-11-23 08:27:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:27:01,090 INFO L495 AbstractCegarLoop]: Abstraction has 527 states and 602 transitions. [2023-11-23 08:27:01,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-23 08:27:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 602 transitions. [2023-11-23 08:27:01,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-23 08:27:01,092 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:27:01,092 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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] [2023-11-23 08:27:01,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-23 08:27:01,092 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:27:01,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:27:01,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1642900367, now seen corresponding path program 1 times [2023-11-23 08:27:01,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:27:01,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107845511] [2023-11-23 08:27:01,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:27:01,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:27:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:03,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:27:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:03,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:27:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:03,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:27:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:03,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:27:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:03,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:27:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:03,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:27:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:03,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:27:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:03,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:27:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:03,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:27:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:03,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:27:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:03,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 08:27:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:03,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 08:27:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-11-23 08:27:03,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:27:03,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107845511] [2023-11-23 08:27:03,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107845511] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:27:03,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532860028] [2023-11-23 08:27:03,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:27:03,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:27:03,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:27:03,470 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:27:03,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-23 08:27:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:27:03,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 2628 conjuncts, 93 conjunts are in the unsatisfiable core [2023-11-23 08:27:03,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:27:03,899 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 6 treesize of output 5 [2023-11-23 08:27:03,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:27:04,259 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 08:27:04,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-23 08:27:06,353 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base_BEFORE_CALL_33| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_12| Int)) (and (<= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_12|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset_BEFORE_CALL_12|)) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base_BEFORE_CALL_33|) 8)) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_12| |v_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base_BEFORE_CALL_33|)))) is different from true [2023-11-23 08:27:06,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-23 08:27:06,546 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 08:27:06,546 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-23 08:27:06,553 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 5 treesize of output 3 [2023-11-23 08:27:06,648 INFO L349 Elim1Store]: treesize reduction 77, result has 36.4 percent of original size [2023-11-23 08:27:06,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 134 treesize of output 176 [2023-11-23 08:27:06,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-23 08:27:06,753 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2023-11-23 08:27:06,753 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 1 case distinctions, treesize of input 23 treesize of output 15 [2023-11-23 08:27:06,819 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:27:06,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2023-11-23 08:27:06,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 193 [2023-11-23 08:27:07,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2023-11-23 08:27:09,518 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_14| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|)) (<= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_14|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset_BEFORE_CALL_14|)) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|) 8)))) (exists ((v_y_23 Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24| Int) (|ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| Int) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse1 (* 18446744073709551616 v_y_23)) (.cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|) 0))) (and (<= .cse0 (+ .cse1 9223372036854775807)) (<= .cse1 .cse0) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|))) (= (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24| v_DerPreprocessor_8) |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| (let ((.cse3 (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|))) (store (store .cse2 8 (select .cse3 8)) 0 (select .cse3 0)))) |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|) .cse2)) (not (= |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|))))) (exists ((v_y_23 Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24| Int) (|ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_14| Int)) (let ((.cse9 (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|))) (let ((.cse4 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|) 0)) (.cse5 (* 18446744073709551616 v_y_23)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_14|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset_BEFORE_CALL_14|))) (.cse7 (select .cse9 8)) (.cse8 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|))) (and (<= .cse4 (+ .cse5 9223372036854775807)) (<= .cse5 .cse4) (<= (+ .cse6 .cse4) (+ .cse5 .cse7)) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_14| |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|)) (<= .cse6 (select .cse8 8)) (= (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24| v_DerPreprocessor_8) |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| (store (store .cse8 8 .cse7) 0 (select .cse9 0))) |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|) .cse8)))))) is different from true [2023-11-23 08:27:12,113 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_14| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|)) (<= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_14|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset_BEFORE_CALL_14|)) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|) 8)))) (exists ((v_y_23 Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24| Int) (|ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| Int) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse1 (* 18446744073709551616 v_y_23)) (.cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|) 0))) (and (<= .cse0 (+ .cse1 9223372036854775807)) (<= .cse1 .cse0) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|))) (= (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24| v_DerPreprocessor_8) |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| (let ((.cse3 (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|))) (store (store .cse2 8 (select .cse3 8)) 0 (select .cse3 0)))) |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|) .cse2)) (not (= |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|))))) (exists ((v_y_23 Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24| Int) (|ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_14| Int)) (let ((.cse9 (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|))) (let ((.cse4 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|) 0)) (.cse5 (* 18446744073709551616 v_y_23)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_14|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset_BEFORE_CALL_14|))) (.cse7 (select .cse9 8)) (.cse8 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|))) (and (<= .cse4 (+ .cse5 9223372036854775807)) (<= .cse5 .cse4) (<= (+ .cse6 .cse4) (+ .cse5 .cse7)) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_14| |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|)) (<= .cse6 (select .cse8 8)) (= (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24| v_DerPreprocessor_8) |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| (store (store .cse8 8 .cse7) 0 (select .cse9 0))) |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|) .cse8)))))) (or (exists ((v_y_24 Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25| Int) (|ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| Int) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse13 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|) 0)) (.cse12 (* 18446744073709551616 v_y_24))) (and (not (= |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|)) (let ((.cse10 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|))) (= (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25| v_DerPreprocessor_8) |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| (let ((.cse11 (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|))) (store (store .cse10 8 (select .cse11 8)) 0 (select .cse11 0)))) |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|) .cse10)) (<= .cse12 .cse13) (<= .cse13 (+ .cse12 9223372036854775807))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_15| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_15| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|)) (<= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_15|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset_BEFORE_CALL_15|)) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|) 8)))) (exists ((v_y_24 Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25| Int) (|ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse16 (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|))) (let ((.cse14 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|)) (.cse19 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|) 0)) (.cse17 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_15|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset_BEFORE_CALL_15|))) (.cse18 (* 18446744073709551616 v_y_24)) (.cse15 (select .cse16 8))) (and (= (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25| v_DerPreprocessor_8) |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| (store (store .cse14 8 .cse15) 0 (select .cse16 0))) |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|) .cse14) (<= .cse17 (select .cse14 8)) (<= .cse18 .cse19) (<= .cse19 (+ .cse18 9223372036854775807)) (<= (+ .cse19 .cse17) (+ .cse18 .cse15)) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_15| |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|)))))))) is different from true [2023-11-23 08:27:18,512 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_14| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|)) (<= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_14|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset_BEFORE_CALL_14|)) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|) 8)))) (exists ((v_y_23 Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24| Int) (|ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| Int) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse1 (* 18446744073709551616 v_y_23)) (.cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|) 0))) (and (<= .cse0 (+ .cse1 9223372036854775807)) (<= .cse1 .cse0) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|))) (= (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24| v_DerPreprocessor_8) |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| (let ((.cse3 (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|))) (store (store .cse2 8 (select .cse3 8)) 0 (select .cse3 0)))) |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|) .cse2)) (not (= |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|))))) (exists ((v_y_23 Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24| Int) (|ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_14| Int)) (let ((.cse9 (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|))) (let ((.cse4 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|) 0)) (.cse5 (* 18446744073709551616 v_y_23)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_14|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset_BEFORE_CALL_14|))) (.cse7 (select .cse9 8)) (.cse8 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|))) (and (<= .cse4 (+ .cse5 9223372036854775807)) (<= .cse5 .cse4) (<= (+ .cse6 .cse4) (+ .cse5 .cse7)) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_14| |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|)) (<= .cse6 (select .cse8 8)) (= (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24| v_DerPreprocessor_8) |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| (store (store .cse8 8 .cse7) 0 (select .cse9 0))) |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|) .cse8)))))) (or (exists ((v_y_24 Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25| Int) (|ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| Int) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse13 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|) 0)) (.cse12 (* 18446744073709551616 v_y_24))) (and (not (= |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|)) (let ((.cse10 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|))) (= (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25| v_DerPreprocessor_8) |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| (let ((.cse11 (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|))) (store (store .cse10 8 (select .cse11 8)) 0 (select .cse11 0)))) |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|) .cse10)) (<= .cse12 .cse13) (<= .cse13 (+ .cse12 9223372036854775807))))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_15| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_15| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|)) (<= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_15|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset_BEFORE_CALL_15|)) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|) 8)))) (exists ((v_y_24 Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25| Int) (|ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_15| Int)) (let ((.cse16 (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|))) (let ((.cse14 (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|)) (.cse19 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|) 0)) (.cse17 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_15|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset_BEFORE_CALL_15|))) (.cse18 (* 18446744073709551616 v_y_24)) (.cse15 (select .cse16 8))) (and (= (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25| v_DerPreprocessor_8) |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| (store (store .cse14 8 .cse15) 0 (select .cse16 0))) |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|) .cse14) (<= .cse17 (select .cse14 8)) (<= .cse18 .cse19) (<= .cse19 (+ .cse18 9223372036854775807)) (<= (+ .cse19 .cse17) (+ .cse18 .cse15)) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_15| |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|))))))) (let ((.cse20 (= 0 (mod (select (select |c_#memory_int| |c_aws_byte_cursor_is_valid_#in~cursor.base|) |c_aws_byte_cursor_is_valid_#in~cursor.offset|) 18446744073709551616)))) (or (and (not |c_aws_byte_cursor_is_valid_#t~short699|) (not .cse20)) (and .cse20 |c_aws_byte_cursor_is_valid_#t~short699|)))) is different from true Killed by 15