./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_byte_buf_eq_c_str_harness_negated.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_buf_eq_c_str_harness_negated.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 885bac69872c2b34c2b244d1618f4ab60115ba2f5fec2456cdf32ad6a7277fb1 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:10:54,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:10:54,790 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 08:10:54,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:10:54,806 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:10:54,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:10:54,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:10:54,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:10:54,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:10:54,860 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:10:54,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:10:54,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:10:54,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:10:54,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:10:54,867 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:10:54,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:10:54,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:10:54,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 08:10:54,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:10:54,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:10:54,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:10:54,869 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:10:54,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:10:54,870 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:10:54,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:10:54,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:10:54,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:10:54,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:10:54,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:10:54,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:10:54,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:10:54,889 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:10:54,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 08:10:54,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 08:10:54,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:10:54,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:10:54,890 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:10:54,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:10:54,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:10:54,891 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 -> 885bac69872c2b34c2b244d1618f4ab60115ba2f5fec2456cdf32ad6a7277fb1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:10:55,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:10:55,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:10:55,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:10:55,439 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:10:55,439 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:10:55,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_byte_buf_eq_c_str_harness_negated.i [2023-11-23 08:10:56,666 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:10:57,123 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:10:57,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_eq_c_str_harness_negated.i [2023-11-23 08:10:57,165 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62245d8de/15c645e026aa4c78b110605b53cc556d/FLAGcf1c3ec3e [2023-11-23 08:10:57,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62245d8de/15c645e026aa4c78b110605b53cc556d [2023-11-23 08:10:57,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:10:57,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:10:57,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:10:57,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:10:57,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:10:57,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:10:57" (1/1) ... [2023-11-23 08:10:57,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e129111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:57, skipping insertion in model container [2023-11-23 08:10:57,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:10:57" (1/1) ... [2023-11-23 08:10:57,306 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:10:57,608 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_buf_eq_c_str_harness_negated.i[4495,4508] [2023-11-23 08:10:57,616 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_buf_eq_c_str_harness_negated.i[4555,4568] [2023-11-23 08:10:58,386 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:58,389 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:58,390 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:58,391 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:58,392 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:58,419 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:58,420 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:58,421 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:58,422 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:58,794 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:10:58,795 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:10:58,796 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:10:58,798 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:10:58,799 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:10:58,799 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:10:58,800 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:10:58,817 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:10:58,819 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:10:58,821 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:10:59,003 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:59,020 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:59,097 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:10:59,183 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:10:59,203 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_buf_eq_c_str_harness_negated.i[4495,4508] [2023-11-23 08:10:59,203 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_buf_eq_c_str_harness_negated.i[4555,4568] [2023-11-23 08:10:59,250 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:59,251 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:59,251 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:59,252 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:59,252 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:59,263 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:59,264 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:59,265 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:59,266 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:59,306 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:10:59,307 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:10:59,307 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:10:59,308 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:10:59,309 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:10:59,309 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:10:59,310 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:10:59,310 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:10:59,311 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:10:59,311 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:10:59,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8245] [2023-11-23 08:10:59,390 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:59,390 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:59,399 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8731-8742] [2023-11-23 08:10:59,421 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:10:59,641 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:59,641 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:59,641 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:59,642 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:59,642 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:59,642 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:59,642 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:59,643 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:59,643 WARN L675 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:59,643 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:59,643 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:59,643 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:59,643 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:59,644 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:59,644 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:59,644 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:59,644 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:59,645 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:59,652 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:10:59,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:59 WrapperNode [2023-11-23 08:10:59,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:10:59,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:10:59,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:10:59,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:10:59,660 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:10:59" (1/1) ... [2023-11-23 08:10:59,772 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:10:59" (1/1) ... [2023-11-23 08:10:59,831 INFO L138 Inliner]: procedures = 690, calls = 2642, calls flagged for inlining = 64, calls inlined = 10, statements flattened = 902 [2023-11-23 08:10:59,832 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:10:59,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:10:59,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:10:59,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:10:59,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:59" (1/1) ... [2023-11-23 08:10:59,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:59" (1/1) ... [2023-11-23 08:10:59,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:59" (1/1) ... [2023-11-23 08:10:59,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:59" (1/1) ... [2023-11-23 08:10:59,921 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:59" (1/1) ... [2023-11-23 08:10:59,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:59" (1/1) ... [2023-11-23 08:10:59,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:59" (1/1) ... [2023-11-23 08:10:59,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:59" (1/1) ... [2023-11-23 08:10:59,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:10:59,959 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:10:59,959 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:10:59,959 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:10:59,960 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:59" (1/1) ... [2023-11-23 08:10:59,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:10:59,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:10:59,993 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:11:00,015 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:11:00,056 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq_c_str [2023-11-23 08:11:00,056 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq_c_str [2023-11-23 08:11:00,057 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2023-11-23 08:11:00,057 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2023-11-23 08:11:00,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:11:00,058 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2023-11-23 08:11:00,058 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2023-11-23 08:11:00,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 08:11:00,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:11:00,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:11:00,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:11:00,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:11:00,059 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2023-11-23 08:11:00,059 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2023-11-23 08:11:00,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:11:00,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:11:00,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:11:00,060 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-23 08:11:00,060 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-23 08:11:00,060 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2023-11-23 08:11:00,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2023-11-23 08:11:00,061 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:11:00,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:11:00,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:11:00,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:11:00,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:11:00,061 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2023-11-23 08:11:00,062 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2023-11-23 08:11:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 08:11:00,062 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 08:11:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 08:11:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:11:00,361 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:11:00,363 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:11:01,283 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:11:01,427 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:11:01,427 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-23 08:11:01,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:11:01 BoogieIcfgContainer [2023-11-23 08:11:01,428 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:11:01,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:11:01,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:11:01,434 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:11:01,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:10:57" (1/3) ... [2023-11-23 08:11:01,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b8ba91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:11:01, skipping insertion in model container [2023-11-23 08:11:01,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:59" (2/3) ... [2023-11-23 08:11:01,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b8ba91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:11:01, skipping insertion in model container [2023-11-23 08:11:01,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:11:01" (3/3) ... [2023-11-23 08:11:01,438 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_eq_c_str_harness_negated.i [2023-11-23 08:11:01,455 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:11:01,455 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:11:01,502 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:11:01,511 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;@6694797e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:11:01,512 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:11:01,515 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 79 states have internal predecessors, (100), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-23 08:11:01,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-23 08:11:01,526 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:11:01,528 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 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:11:01,528 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:11:01,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:11:01,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1645641614, now seen corresponding path program 1 times [2023-11-23 08:11:01,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:11:01,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63688734] [2023-11-23 08:11:01,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:01,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:11:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:02,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:02,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:11:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:02,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:11:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:02,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:02,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:11:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:02,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:11:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:02,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:11:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:02,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:11:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:02,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:02,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:11:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:02,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 08:11:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:02,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:11:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:02,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:11:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:02,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:11:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:02,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 08:11:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:02,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 08:11:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:02,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 08:11:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:02,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:02,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:11:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:02,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:11:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2023-11-23 08:11:02,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:11:02,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63688734] [2023-11-23 08:11:02,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63688734] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:11:02,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:11:02,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 08:11:02,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241636242] [2023-11-23 08:11:02,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:11:02,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:11:02,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:11:02,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:11:02,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:11:02,588 INFO L87 Difference]: Start difference. First operand has 125 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 79 states have internal predecessors, (100), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-23 08:11:02,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:11:02,999 INFO L93 Difference]: Finished difference Result 248 states and 369 transitions. [2023-11-23 08:11:03,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:11:03,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 114 [2023-11-23 08:11:03,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:11:03,012 INFO L225 Difference]: With dead ends: 248 [2023-11-23 08:11:03,013 INFO L226 Difference]: Without dead ends: 125 [2023-11-23 08:11:03,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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:11:03,027 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 109 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:11:03,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 159 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:11:03,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-23 08:11:03,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2023-11-23 08:11:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 76 states have (on average 1.25) internal successors, (95), 77 states have internal predecessors, (95), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-11-23 08:11:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 166 transitions. [2023-11-23 08:11:03,085 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 166 transitions. Word has length 114 [2023-11-23 08:11:03,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:11:03,085 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 166 transitions. [2023-11-23 08:11:03,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-23 08:11:03,086 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 166 transitions. [2023-11-23 08:11:03,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-23 08:11:03,088 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:11:03,089 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 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:11:03,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 08:11:03,089 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:11:03,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:11:03,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1950613988, now seen corresponding path program 1 times [2023-11-23 08:11:03,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:11:03,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015651034] [2023-11-23 08:11:03,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:03,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:11:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:11:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:11:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:11:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:11:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:11:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:11:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:11:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 08:11:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:11:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:11:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:11:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 08:11:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 08:11:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 08:11:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:11:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:04,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:11:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2023-11-23 08:11:04,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:11:04,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015651034] [2023-11-23 08:11:04,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015651034] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:11:04,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629168994] [2023-11-23 08:11:04,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:04,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:11:04,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:11:04,015 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:11:04,017 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:11:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:04,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 2692 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 08:11:04,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:11:04,842 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-11-23 08:11:04,842 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:11:04,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629168994] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:11:04,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:11:04,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2023-11-23 08:11:04,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227886447] [2023-11-23 08:11:04,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:11:04,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:11:04,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:11:04,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:11:04,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:11:04,870 INFO L87 Difference]: Start difference. First operand 123 states and 166 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-23 08:11:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:11:05,040 INFO L93 Difference]: Finished difference Result 222 states and 303 transitions. [2023-11-23 08:11:05,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:11:05,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 114 [2023-11-23 08:11:05,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:11:05,064 INFO L225 Difference]: With dead ends: 222 [2023-11-23 08:11:05,064 INFO L226 Difference]: Without dead ends: 125 [2023-11-23 08:11:05,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:11:05,068 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 50 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:11:05,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 491 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:11:05,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-23 08:11:05,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-11-23 08:11:05,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 79 states have internal predecessors, (96), 36 states have call successors, (36), 10 states have call predecessors, (36), 11 states have return successors, (37), 35 states have call predecessors, (37), 35 states have call successors, (37) [2023-11-23 08:11:05,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 169 transitions. [2023-11-23 08:11:05,097 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 169 transitions. Word has length 114 [2023-11-23 08:11:05,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:11:05,099 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 169 transitions. [2023-11-23 08:11:05,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-23 08:11:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 169 transitions. [2023-11-23 08:11:05,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-23 08:11:05,110 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:11:05,110 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:05,153 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:11:05,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:11:05,328 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:11:05,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:11:05,329 INFO L85 PathProgramCache]: Analyzing trace with hash -369946383, now seen corresponding path program 1 times [2023-11-23 08:11:05,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:11:05,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574016261] [2023-11-23 08:11:05,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:05,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:11:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:06,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:06,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:11:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:06,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:11:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:06,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:06,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:11:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:06,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:11:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:06,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:11:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:06,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:11:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:06,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:06,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:11:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:06,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:11:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:06,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:11:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:06,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:11:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:06,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:11:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:06,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 08:11:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:06,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 08:11:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:06,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-23 08:11:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:06,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:06,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:11:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:06,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:11:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2023-11-23 08:11:06,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:11:06,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574016261] [2023-11-23 08:11:06,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574016261] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:11:06,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086380360] [2023-11-23 08:11:06,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:06,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:11:06,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:11:06,904 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:11:06,968 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:11:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:07,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 2709 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 08:11:07,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:11:08,020 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2023-11-23 08:11:08,020 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:11:08,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086380360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:11:08,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:11:08,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-11-23 08:11:08,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716528942] [2023-11-23 08:11:08,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:11:08,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:11:08,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:11:08,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:11:08,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:11:08,024 INFO L87 Difference]: Start difference. First operand 125 states and 169 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-23 08:11:08,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:11:08,227 INFO L93 Difference]: Finished difference Result 211 states and 285 transitions. [2023-11-23 08:11:08,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:11:08,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 120 [2023-11-23 08:11:08,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:11:08,231 INFO L225 Difference]: With dead ends: 211 [2023-11-23 08:11:08,231 INFO L226 Difference]: Without dead ends: 123 [2023-11-23 08:11:08,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:11:08,234 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 51 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:11:08,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 508 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:11:08,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-23 08:11:08,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-11-23 08:11:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 76 states have (on average 1.236842105263158) internal successors, (94), 77 states have internal predecessors, (94), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-11-23 08:11:08,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 165 transitions. [2023-11-23 08:11:08,272 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 165 transitions. Word has length 120 [2023-11-23 08:11:08,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:11:08,273 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 165 transitions. [2023-11-23 08:11:08,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-23 08:11:08,274 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 165 transitions. [2023-11-23 08:11:08,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-23 08:11:08,276 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:11:08,276 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 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, 1, 1, 1, 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:11:08,304 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:11:08,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,SelfDestructingSolverStorable2 [2023-11-23 08:11:08,496 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:11:08,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:11:08,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2033303599, now seen corresponding path program 1 times [2023-11-23 08:11:08,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:11:08,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388985758] [2023-11-23 08:11:08,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:08,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:11:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:10,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:10,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:11:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:10,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:11:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:10,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:10,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:11:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:11,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:11:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:11,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:11:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:11,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:11:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:11,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:11,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:11:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:11,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:11:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:11,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:11:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:11,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:11:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:11,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:11:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:11,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 08:11:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:11,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-23 08:11:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:11,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:11:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:11,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:11,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:11:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:11,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-23 08:11:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:11,388 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2023-11-23 08:11:11,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:11:11,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388985758] [2023-11-23 08:11:11,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388985758] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:11:11,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:11:11,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-23 08:11:11,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972580518] [2023-11-23 08:11:11,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:11:11,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-23 08:11:11,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:11:11,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-23 08:11:11,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-11-23 08:11:11,392 INFO L87 Difference]: Start difference. First operand 123 states and 165 transitions. Second operand has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 12 states have internal predecessors, (51), 6 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) [2023-11-23 08:11:12,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:11:12,776 INFO L93 Difference]: Finished difference Result 269 states and 377 transitions. [2023-11-23 08:11:12,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 08:11:12,777 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 12 states have internal predecessors, (51), 6 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) Word has length 132 [2023-11-23 08:11:12,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:11:12,785 INFO L225 Difference]: With dead ends: 269 [2023-11-23 08:11:12,785 INFO L226 Difference]: Without dead ends: 172 [2023-11-23 08:11:12,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2023-11-23 08:11:12,792 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 212 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:11:12,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 872 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1452 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-23 08:11:12,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-11-23 08:11:12,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2023-11-23 08:11:12,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 93 states have (on average 1.2258064516129032) internal successors, (114), 96 states have internal predecessors, (114), 49 states have call successors, (49), 10 states have call predecessors, (49), 12 states have return successors, (54), 48 states have call predecessors, (54), 48 states have call successors, (54) [2023-11-23 08:11:12,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 217 transitions. [2023-11-23 08:11:12,857 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 217 transitions. Word has length 132 [2023-11-23 08:11:12,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:11:12,858 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 217 transitions. [2023-11-23 08:11:12,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 12 states have internal predecessors, (51), 6 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) [2023-11-23 08:11:12,858 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 217 transitions. [2023-11-23 08:11:12,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-23 08:11:12,861 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:11:12,861 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:12,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 08:11:12,862 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:11:12,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:11:12,879 INFO L85 PathProgramCache]: Analyzing trace with hash -250188781, now seen corresponding path program 1 times [2023-11-23 08:11:12,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:11:12,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840788701] [2023-11-23 08:11:12,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:12,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:11:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:14,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:14,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:11:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:14,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:11:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:14,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:14,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:11:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:14,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:11:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:14,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:11:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:14,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:11:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:14,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:14,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:11:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:14,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:11:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:14,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 08:11:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:14,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 08:11:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:14,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 08:11:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:14,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 08:11:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:14,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 08:11:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:14,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-23 08:11:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:14,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-23 08:11:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:14,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:14,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:11:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:14,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-23 08:11:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:14,626 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 15 proven. 31 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2023-11-23 08:11:14,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:11:14,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840788701] [2023-11-23 08:11:14,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840788701] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:11:14,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850407762] [2023-11-23 08:11:14,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:14,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:11:14,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:11:14,628 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:11:14,660 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:11:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:15,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 2800 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-23 08:11:15,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:11:15,191 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:11:15,340 WARN L876 $PredicateComparison]: unable to prove that (exists ((|bounded_malloc_#res.base| Int)) (= |c_#valid| (store |c_old(#valid)| |bounded_malloc_#res.base| 1))) is different from true [2023-11-23 08:11:15,360 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-23 08:11:15,361 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:11:15,606 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-23 08:11:15,606 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 12 treesize of output 14 [2023-11-23 08:11:15,649 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:11:16,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:11:16,053 INFO L349 Elim1Store]: treesize reduction 140, result has 24.3 percent of original size [2023-11-23 08:11:16,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 57 [2023-11-23 08:11:16,069 INFO L349 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2023-11-23 08:11:16,069 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 5 case distinctions, treesize of input 30 treesize of output 1 [2023-11-23 08:11:16,076 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 22 treesize of output 10 [2023-11-23 08:11:16,205 INFO L349 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2023-11-23 08:11:16,206 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 3 case distinctions, treesize of input 22 treesize of output 24 [2023-11-23 08:11:16,305 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:11:16,345 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 29 treesize of output 22 [2023-11-23 08:11:18,735 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 160 proven. 46 refuted. 0 times theorem prover too weak. 51 trivial. 1 not checked. [2023-11-23 08:11:18,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:11:19,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850407762] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:11:19,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:11:19,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 24] total 32 [2023-11-23 08:11:19,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932144686] [2023-11-23 08:11:19,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:11:19,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-23 08:11:19,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:11:19,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-23 08:11:19,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1131, Unknown=15, NotChecked=68, Total=1332 [2023-11-23 08:11:19,155 INFO L87 Difference]: Start difference. First operand 155 states and 217 transitions. Second operand has 32 states, 27 states have (on average 4.592592592592593) internal successors, (124), 25 states have internal predecessors, (124), 10 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2023-11-23 08:11:23,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:25,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:11:29,744 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:11:33,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:37,936 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:11:40,040 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:11:42,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:44,080 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:11:46,112 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:11:48,163 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:11:50,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:54,389 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:11:54,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:11:54,824 INFO L93 Difference]: Finished difference Result 427 states and 611 transitions. [2023-11-23 08:11:54,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-23 08:11:54,825 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 4.592592592592593) internal successors, (124), 25 states have internal predecessors, (124), 10 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) Word has length 142 [2023-11-23 08:11:54,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:11:54,827 INFO L225 Difference]: With dead ends: 427 [2023-11-23 08:11:54,827 INFO L226 Difference]: Without dead ends: 292 [2023-11-23 08:11:54,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 213 SyntacticMatches, 14 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=691, Invalid=3988, Unknown=17, NotChecked=134, Total=4830 [2023-11-23 08:11:54,830 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 892 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 3629 mSolverCounterSat, 378 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 4376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 3629 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 357 IncrementalHoareTripleChecker+Unchecked, 28.9s IncrementalHoareTripleChecker+Time [2023-11-23 08:11:54,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 1198 Invalid, 4376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 3629 Invalid, 12 Unknown, 357 Unchecked, 28.9s Time] [2023-11-23 08:11:54,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-11-23 08:11:54,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 229. [2023-11-23 08:11:54,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 149 states have (on average 1.2483221476510067) internal successors, (186), 151 states have internal predecessors, (186), 60 states have call successors, (60), 18 states have call predecessors, (60), 19 states have return successors, (61), 59 states have call predecessors, (61), 58 states have call successors, (61) [2023-11-23 08:11:54,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 307 transitions. [2023-11-23 08:11:54,854 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 307 transitions. Word has length 142 [2023-11-23 08:11:54,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:11:54,854 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 307 transitions. [2023-11-23 08:11:54,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 4.592592592592593) internal successors, (124), 25 states have internal predecessors, (124), 10 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2023-11-23 08:11:54,855 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 307 transitions. [2023-11-23 08:11:54,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-23 08:11:54,856 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:11:54,857 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:54,876 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:11:55,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:11:55,072 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:11:55,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:11:55,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1087794645, now seen corresponding path program 1 times [2023-11-23 08:11:55,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:11:55,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537642618] [2023-11-23 08:11:55,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:55,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:11:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:11:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:11:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:11:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:11:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:11:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:11:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:11:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:11:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 08:11:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 08:11:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 08:11:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 08:11:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 08:11:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-23 08:11:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-23 08:11:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:11:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-23 08:11:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2023-11-23 08:11:56,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:11:56,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537642618] [2023-11-23 08:11:56,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537642618] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:11:56,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411957055] [2023-11-23 08:11:56,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:56,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:11:56,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:11:56,468 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:11:56,472 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:11:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 2795 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-23 08:11:56,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:11:57,010 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:11:57,177 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:11:57,217 WARN L876 $PredicateComparison]: unable to prove that (exists ((|bounded_malloc_#res.base| Int)) (and (<= (+ |bounded_malloc_#res.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |bounded_malloc_#res.base| (select |c_#valid| |bounded_malloc_#res.base|))))) is different from true [2023-11-23 08:11:57,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:11:57,227 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 14 treesize of output 9 [2023-11-23 08:11:57,601 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:11:57,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:11:57,675 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:11:57,714 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:11:58,072 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-23 08:11:58,072 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 29 treesize of output 34 [2023-11-23 08:11:58,174 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:11:58,228 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:12:00,348 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_4|) (+ 8 |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.offset_BEFORE_CALL_3|)))) (and (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_4|) (not (= .cse0 0))))) is different from true [2023-11-23 08:12:02,860 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 150 proven. 54 refuted. 0 times theorem prover too weak. 52 trivial. 2 not checked. [2023-11-23 08:12:02,861 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:12:07,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411957055] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:12:07,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:12:07,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 23] total 32 [2023-11-23 08:12:07,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193516973] [2023-11-23 08:12:07,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:12:07,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-23 08:12:07,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:12:07,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-23 08:12:07,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1285, Unknown=17, NotChecked=146, Total=1560 [2023-11-23 08:12:07,380 INFO L87 Difference]: Start difference. First operand 229 states and 307 transitions. Second operand has 32 states, 26 states have (on average 4.653846153846154) internal successors, (121), 27 states have internal predecessors, (121), 11 states have call successors, (41), 9 states have call predecessors, (41), 11 states have return successors, (40), 10 states have call predecessors, (40), 11 states have call successors, (40) [2023-11-23 08:12:11,895 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:12:13,962 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:12:16,082 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:12:20,180 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:12:22,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:12:24,217 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:12:26,233 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:12:28,248 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:12:32,305 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:12:34,330 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:12:36,340 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:12:38,350 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:12:42,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:12:42,841 INFO L93 Difference]: Finished difference Result 627 states and 849 transitions. [2023-11-23 08:12:42,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-23 08:12:42,845 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 26 states have (on average 4.653846153846154) internal successors, (121), 27 states have internal predecessors, (121), 11 states have call successors, (41), 9 states have call predecessors, (41), 11 states have return successors, (40), 10 states have call predecessors, (40), 11 states have call successors, (40) Word has length 142 [2023-11-23 08:12:42,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:12:42,848 INFO L225 Difference]: With dead ends: 627 [2023-11-23 08:12:42,848 INFO L226 Difference]: Without dead ends: 425 [2023-11-23 08:12:42,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 213 SyntacticMatches, 13 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=514, Invalid=3896, Unknown=20, NotChecked=262, Total=4692 [2023-11-23 08:12:42,850 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 484 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 3755 mSolverCounterSat, 269 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 4641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 3755 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 605 IncrementalHoareTripleChecker+Unchecked, 27.9s IncrementalHoareTripleChecker+Time [2023-11-23 08:12:42,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1442 Invalid, 4641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 3755 Invalid, 12 Unknown, 605 Unchecked, 27.9s Time] [2023-11-23 08:12:42,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2023-11-23 08:12:42,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 322. [2023-11-23 08:12:42,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 213 states have (on average 1.2488262910798122) internal successors, (266), 216 states have internal predecessors, (266), 82 states have call successors, (82), 24 states have call predecessors, (82), 26 states have return successors, (85), 81 states have call predecessors, (85), 79 states have call successors, (85) [2023-11-23 08:12:42,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 433 transitions. [2023-11-23 08:12:42,890 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 433 transitions. Word has length 142 [2023-11-23 08:12:42,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:12:42,890 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 433 transitions. [2023-11-23 08:12:42,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 26 states have (on average 4.653846153846154) internal successors, (121), 27 states have internal predecessors, (121), 11 states have call successors, (41), 9 states have call predecessors, (41), 11 states have return successors, (40), 10 states have call predecessors, (40), 11 states have call successors, (40) [2023-11-23 08:12:42,891 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 433 transitions. [2023-11-23 08:12:42,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-23 08:12:42,892 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:12:42,893 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:12:42,919 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:12:43,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:12:43,108 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:12:43,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:12:43,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1192040966, now seen corresponding path program 1 times [2023-11-23 08:12:43,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:12:43,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032191745] [2023-11-23 08:12:43,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:12:43,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:12:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:43,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:12:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:43,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:12:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:43,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:12:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:43,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:12:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:43,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:12:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:43,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:12:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:43,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:12:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:43,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:12:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:43,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:12:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:43,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:12:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:43,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:12:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:43,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:12:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:43,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 08:12:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:43,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 08:12:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:43,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 08:12:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:43,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 08:12:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:43,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:12:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:43,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:12:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:43,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-23 08:12:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:43,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:12:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:43,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:12:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:43,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-23 08:12:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2023-11-23 08:12:43,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:12:43,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032191745] [2023-11-23 08:12:43,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032191745] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:12:43,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843867115] [2023-11-23 08:12:43,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:12:43,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:12:43,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:12:43,587 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:12:43,589 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:12:44,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:44,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 2845 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 08:12:44,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:12:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-11-23 08:12:44,180 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:12:44,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843867115] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:12:44,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:12:44,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-23 08:12:44,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083209323] [2023-11-23 08:12:44,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:12:44,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:12:44,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:12:44,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:12:44,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:12:44,183 INFO L87 Difference]: Start difference. First operand 322 states and 433 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-23 08:12:44,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:12:44,291 INFO L93 Difference]: Finished difference Result 635 states and 862 transitions. [2023-11-23 08:12:44,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:12:44,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2023-11-23 08:12:44,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:12:44,297 INFO L225 Difference]: With dead ends: 635 [2023-11-23 08:12:44,297 INFO L226 Difference]: Without dead ends: 343 [2023-11-23 08:12:44,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:12:44,300 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 9 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:12:44,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 449 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:12:44,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2023-11-23 08:12:44,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 328. [2023-11-23 08:12:44,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 219 states have (on average 1.2420091324200913) internal successors, (272), 222 states have internal predecessors, (272), 82 states have call successors, (82), 24 states have call predecessors, (82), 26 states have return successors, (85), 81 states have call predecessors, (85), 79 states have call successors, (85) [2023-11-23 08:12:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 439 transitions. [2023-11-23 08:12:44,384 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 439 transitions. Word has length 150 [2023-11-23 08:12:44,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:12:44,396 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 439 transitions. [2023-11-23 08:12:44,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-23 08:12:44,397 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 439 transitions. [2023-11-23 08:12:44,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-23 08:12:44,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:12:44,401 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:12:44,436 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:12:44,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:12:44,616 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:12:44,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:12:44,617 INFO L85 PathProgramCache]: Analyzing trace with hash -645929418, now seen corresponding path program 1 times [2023-11-23 08:12:44,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:12:44,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755446560] [2023-11-23 08:12:44,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:12:44,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:12:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:44,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:12:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:44,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:12:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:44,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:12:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:44,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:12:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:44,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:12:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:44,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:12:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:44,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:12:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:44,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:12:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:44,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:12:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:44,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:12:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:44,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:12:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:44,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:12:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:44,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 08:12:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:44,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 08:12:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:45,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 08:12:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:45,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 08:12:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:45,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:12:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:45,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:12:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:45,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-23 08:12:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:45,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:12:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:45,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:12:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:45,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-23 08:12:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:45,061 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2023-11-23 08:12:45,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:12:45,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755446560] [2023-11-23 08:12:45,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755446560] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:12:45,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557034557] [2023-11-23 08:12:45,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:12:45,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:12:45,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:12:45,063 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:12:45,078 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:12:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:45,520 INFO L262 TraceCheckSpWp]: Trace formula consists of 2847 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 08:12:45,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:12:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-11-23 08:12:45,533 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:12:45,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557034557] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:12:45,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:12:45,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-23 08:12:45,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139731915] [2023-11-23 08:12:45,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:12:45,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:12:45,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:12:45,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:12:45,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:12:45,535 INFO L87 Difference]: Start difference. First operand 328 states and 439 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-23 08:12:45,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:12:45,653 INFO L93 Difference]: Finished difference Result 665 states and 893 transitions. [2023-11-23 08:12:45,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:12:45,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2023-11-23 08:12:45,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:12:45,656 INFO L225 Difference]: With dead ends: 665 [2023-11-23 08:12:45,656 INFO L226 Difference]: Without dead ends: 367 [2023-11-23 08:12:45,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:12:45,658 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 28 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:12:45,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 465 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:12:45,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2023-11-23 08:12:45,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 328. [2023-11-23 08:12:45,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 219 states have (on average 1.2283105022831051) internal successors, (269), 222 states have internal predecessors, (269), 82 states have call successors, (82), 24 states have call predecessors, (82), 26 states have return successors, (85), 81 states have call predecessors, (85), 79 states have call successors, (85) [2023-11-23 08:12:45,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 436 transitions. [2023-11-23 08:12:45,694 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 436 transitions. Word has length 150 [2023-11-23 08:12:45,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:12:45,694 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 436 transitions. [2023-11-23 08:12:45,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-23 08:12:45,695 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 436 transitions. [2023-11-23 08:12:45,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-23 08:12:45,696 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:12:45,697 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:12:45,723 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:12:45,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:12:45,918 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:12:45,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:12:45,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1742634612, now seen corresponding path program 1 times [2023-11-23 08:12:45,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:12:45,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836377267] [2023-11-23 08:12:45,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:12:45,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:12:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:48,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:12:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:48,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:12:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:48,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:12:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:48,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:12:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:48,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:12:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:48,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:12:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:48,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:12:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:48,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:12:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:48,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:12:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:48,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:12:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:48,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:12:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:48,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:12:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:49,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 08:12:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:49,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 08:12:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:49,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 08:12:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:49,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 08:12:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:49,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:12:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:49,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:12:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:49,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-23 08:12:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:49,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:12:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:49,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:12:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:49,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-23 08:12:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:49,884 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2023-11-23 08:12:49,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:12:49,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836377267] [2023-11-23 08:12:49,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836377267] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:12:49,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320133725] [2023-11-23 08:12:49,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:12:49,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:12:49,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:12:49,886 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:12:49,889 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:12:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:50,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 2842 conjuncts, 97 conjunts are in the unsatisfiable core [2023-11-23 08:12:50,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:12:50,450 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:12:50,718 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:12:50,912 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-23 08:12:50,913 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:12:51,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:12:52,003 INFO L349 Elim1Store]: treesize reduction 39, result has 32.8 percent of original size [2023-11-23 08:12:52,003 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 35 [2023-11-23 08:12:52,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:12:52,029 INFO L349 Elim1Store]: treesize reduction 39, result has 32.8 percent of original size [2023-11-23 08:12:52,030 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 35 [2023-11-23 08:12:52,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 08:12:52,335 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2023-11-23 08:12:52,337 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 19 treesize of output 25 [2023-11-23 08:12:52,482 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2023-11-23 08:12:52,483 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 32 treesize of output 25 [2023-11-23 08:12:52,507 INFO L349 Elim1Store]: treesize reduction 37, result has 31.5 percent of original size [2023-11-23 08:12:52,507 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 38 treesize of output 24 [2023-11-23 08:12:53,145 INFO L349 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2023-11-23 08:12:53,145 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 31 treesize of output 43 [2023-11-23 08:12:53,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:12:53,234 INFO L349 Elim1Store]: treesize reduction 84, result has 29.4 percent of original size [2023-11-23 08:12:53,234 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 41 treesize of output 54 [2023-11-23 08:12:53,285 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 9 treesize of output 3 [2023-11-23 08:12:53,640 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:12:53,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:12:53,835 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 19 treesize of output 14 [2023-11-23 08:12:54,009 INFO L349 Elim1Store]: treesize reduction 4, result has 95.1 percent of original size [2023-11-23 08:12:54,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 34 treesize of output 100 [2023-11-23 08:12:54,449 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:12:54,503 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 19 treesize of output 14 [2023-11-23 08:14:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 41 proven. 227 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-23 08:14:15,891 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:14:16,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320133725] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:14:16,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:14:16,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 33] total 58 [2023-11-23 08:14:16,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928825614] [2023-11-23 08:14:16,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:14:16,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-11-23 08:14:16,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:14:16,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-11-23 08:14:16,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=3643, Unknown=20, NotChecked=0, Total=3906 [2023-11-23 08:14:16,338 INFO L87 Difference]: Start difference. First operand 328 states and 436 transitions. Second operand has 58 states, 49 states have (on average 2.816326530612245) internal successors, (138), 47 states have internal predecessors, (138), 23 states have call successors, (43), 13 states have call predecessors, (43), 16 states have return successors, (42), 24 states have call predecessors, (42), 23 states have call successors, (42) [2023-11-23 08:14:19,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:14:23,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:14:26,066 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:14:32,338 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:14:34,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:14:37,291 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:14:39,352 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:14:41,389 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:14:43,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:14:47,789 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:14:49,957 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:14:52,023 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:14:54,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:14:56,128 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:14:58,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:15:02,028 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:15:05,132 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:15:07,180 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:15:09,247 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:15:11,347 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:15:14,674 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:15:16,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Killed by 15